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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n15https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://mathworld.wolfram.com/
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Minimax_(disambiguation)
dbo:wikiPageWikiLink
dbr:Minimax_approximation_algorithm
dbo:wikiPageDisambiguates
dbr:Minimax_approximation_algorithm
Subject Item
dbr:Minimax_approximation_algorithm
rdfs:label
Minimax approximation algorithm
rdfs:comment
A minimax approximation algorithm (or L∞ approximation or uniform approximation) is a method to find an approximation of a mathematical function that minimizes maximum error. For example, given a function defined on the interval and a degree bound , a minimax polynomial approximation algorithm will find a polynomial of degree at most to minimize
dcterms:subject
dbc:Numerical_analysis
dbo:wikiPageID
4882595
dbo:wikiPageRevisionID
1046794977
dbo:wikiPageWikiLink
dbr:Chebyshev_series dbr:Weierstrass_approximation_theorem dbr:Remez_algorithm dbc:Numerical_analysis dbr:Taylor_series dbr:Mathematical_function
dbo:wikiPageExternalLink
n6:MinimaxApproximation.html
owl:sameAs
wikidata:Q6865376 freebase:m.0csfcx n15:4rdTn
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:abstract
A minimax approximation algorithm (or L∞ approximation or uniform approximation) is a method to find an approximation of a mathematical function that minimizes maximum error. For example, given a function defined on the interval and a degree bound , a minimax polynomial approximation algorithm will find a polynomial of degree at most to minimize
prov:wasDerivedFrom
wikipedia-en:Minimax_approximation_algorithm?oldid=1046794977&ns=0
dbo:wikiPageLength
3098
foaf:isPrimaryTopicOf
wikipedia-en:Minimax_approximation_algorithm
Subject Item
dbr:Minimisation
dbo:wikiPageWikiLink
dbr:Minimax_approximation_algorithm
Subject Item
dbr:List_of_numerical_analysis_topics
dbo:wikiPageWikiLink
dbr:Minimax_approximation_algorithm
Subject Item
dbr:Trigonometric_tables
dbo:wikiPageWikiLink
dbr:Minimax_approximation_algorithm
Subject Item
dbr:Q-function
dbo:wikiPageWikiLink
dbr:Minimax_approximation_algorithm
Subject Item
dbr:Equioscillation_theorem
dbo:wikiPageWikiLink
dbr:Minimax_approximation_algorithm
Subject Item
dbr:CORDIC
dbo:wikiPageWikiLink
dbr:Minimax_approximation_algorithm
Subject Item
dbr:Error_function
dbo:wikiPageWikiLink
dbr:Minimax_approximation_algorithm
Subject Item
dbr:Remez_algorithm
dbo:wikiPageWikiLink
dbr:Minimax_approximation_algorithm
Subject Item
dbr:Minimax_polynomial
dbo:wikiPageWikiLink
dbr:Minimax_approximation_algorithm
dbo:wikiPageRedirects
dbr:Minimax_approximation_algorithm
Subject Item
dbr:L∞_approximation
dbo:wikiPageWikiLink
dbr:Minimax_approximation_algorithm
dbo:wikiPageRedirects
dbr:Minimax_approximation_algorithm
Subject Item
dbr:Uniform_approximation_algorithm
dbo:wikiPageWikiLink
dbr:Minimax_approximation_algorithm
dbo:wikiPageRedirects
dbr:Minimax_approximation_algorithm
Subject Item
wikipedia-en:Minimax_approximation_algorithm
foaf:primaryTopic
dbr:Minimax_approximation_algorithm