HTML Microdata document

This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n6	http://dbpedia.org/resource/File:
n9	https://global.dbpedia.org/id/
yago	http://dbpedia.org/class/yago/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
n14	http://commons.wikimedia.org/wiki/Special:FilePath/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
dbp	http://dbpedia.org/property/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
gold	http://purl.org/linguistics/gold/
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/
n12	http://cnx.org/content/col10494/latest/

Statements

Subject Item: dbr:List_of_polynomial_topics
dbo:wikiPageWikiLink: dbr:Lindsey–Fox_algorithm

Subject Item: dbr:Lindsey–Fox_algorithm
rdf:type: yago:Abstraction100002137 yago:WikicatPolynomials yago:MathematicalRelation113783581 yago:Function113783816 dbo:Software yago:Relation100031921 yago:Polynomial105861855
rdfs:label: Lindsey–Fox algorithm
rdfs:comment: The Lindsey–Fox algorithm, named after Pat Lindsey and Jim Fox, is a numerical algorithm for finding the roots or zeros of a high-degree polynomial with real coefficients over the complex field. It is particularly designed for random coefficients but also works well on polynomials with coefficients from samples of speech, seismic signals, and other measured phenomena. A Matlab implementation of this has factored polynomials of degree over a million on a desktop computer.
foaf:depiction: n14:FFT_Cell.png
dcterms:subject: dbc:Polynomials
dbo:wikiPageID: 36266522
dbo:wikiPageRevisionID: 1063906067
dbo:wikiPageWikiLink: n6:FFT_Cell.png dbr:Algorithm dbr:Complex_field dbr:Laguerre's_method dbr:Polar_coordinate dbr:Analytic_function dbr:Factorization_of_polynomials dbc:Polynomials dbr:Fast_Fourier_transform dbr:Polynomial dbr:Maximum_modulus_principle dbr:Factorization dbr:Matlab dbr:Newton's_method
dbo:wikiPageExternalLink: n12:
owl:sameAs: n9:4qPaJ wikidata:Q6552916 freebase:m.0kg2wy_
dbp:wikiPageUsesTemplate: dbt:Technical dbt:Failed_verification dbt:Reflist
dbo:thumbnail: n14:FFT_Cell.png?width=300
dbo:abstract: The Lindsey–Fox algorithm, named after Pat Lindsey and Jim Fox, is a numerical algorithm for finding the roots or zeros of a high-degree polynomial with real coefficients over the complex field. It is particularly designed for random coefficients but also works well on polynomials with coefficients from samples of speech, seismic signals, and other measured phenomena. A Matlab implementation of this has factored polynomials of degree over a million on a desktop computer.
gold:hypernym: dbr:Algorithm
prov:wasDerivedFrom: wikipedia-en:Lindsey–Fox_algorithm?oldid=1063906067&ns=0
dbo:wikiPageLength: 15613
foaf:isPrimaryTopicOf: wikipedia-en:Lindsey–Fox_algorithm

Subject Item: dbr:Lindsey-Fox_algorithm
dbo:wikiPageWikiLink: dbr:Lindsey–Fox_algorithm
dbo:wikiPageRedirects: dbr:Lindsey–Fox_algorithm

Subject Item: dbr:Lindsey-Fox_Algorithm
dbo:wikiPageWikiLink: dbr:Lindsey–Fox_algorithm
dbo:wikiPageRedirects: dbr:Lindsey–Fox_algorithm

Subject Item: dbr:Lindsey-Fox_allgorithm
dbo:wikiPageWikiLink: dbr:Lindsey–Fox_algorithm
dbo:wikiPageRedirects: dbr:Lindsey–Fox_algorithm

Subject Item: wikipedia-en:Lindsey–Fox_algorithm
foaf:primaryTopic: dbr:Lindsey–Fox_algorithm