Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Remez_algorithm> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Remez_algorithm abstract "The Remez algorithm or Remez exchange algorithm, published by Evgeny Yakovlevich Remez in 1934, is an iterative algorithm used to find simple approximations to functions, specifically, approximations by functions in a Chebyshev space that are the best in the uniform norm L∞ sense.A typical example of a Chebyshev space is the subspace of Chebyshev polynomials of order n in the space of real continuous functions on an interval, C[a, b].The polynomial of best approximation within a given subspace is defined to be the one that minimizes the maximum absolute difference between the polynomial and the function. In this case, the form of the solution is precised by the equioscillation theorem.".
- Remez_algorithm wikiPageExternalLink 4_equi.htm.
- Remez_algorithm wikiPageID "4882514".
- Remez_algorithm wikiPageRevisionID "576325235".
- Remez_algorithm author "Aarts, Ronald M.; Bond, Charles; Mendelsohn, Phil; and Weisstein, Eric W.".
- Remez_algorithm hasPhotoCollection Remez_algorithm.
- Remez_algorithm title "Remez Algorithm".
- Remez_algorithm urlname "RemezAlgorithm".
- Remez_algorithm subject Category:Approximation_theory.
- Remez_algorithm subject Category:Numerical_analysis.
- Remez_algorithm subject Category:Polynomials.
- Remez_algorithm type Abstraction100002137.
- Remez_algorithm type Function113783816.
- Remez_algorithm type MathematicalRelation113783581.
- Remez_algorithm type Polynomial105861855.
- Remez_algorithm type Polynomials.
- Remez_algorithm type Relation100031921.
- Remez_algorithm comment "The Remez algorithm or Remez exchange algorithm, published by Evgeny Yakovlevich Remez in 1934, is an iterative algorithm used to find simple approximations to functions, specifically, approximations by functions in a Chebyshev space that are the best in the uniform norm L∞ sense.A typical example of a Chebyshev space is the subspace of Chebyshev polynomials of order n in the space of real continuous functions on an interval, C[a, b].The polynomial of best approximation within a given subspace is defined to be the one that minimizes the maximum absolute difference between the polynomial and the function. ".
- Remez_algorithm label "Algorithme de Remez".
- Remez_algorithm label "Remez algorithm".
- Remez_algorithm label "Алгоритм Ремеза".
- Remez_algorithm sameAs Algorithme_de_Remez.
- Remez_algorithm sameAs m.0csf6b.
- Remez_algorithm sameAs Q2835816.
- Remez_algorithm sameAs Q2835816.
- Remez_algorithm sameAs Remez_algorithm.
- Remez_algorithm wasDerivedFrom Remez_algorithm?oldid=576325235.
- Remez_algorithm isPrimaryTopicOf Remez_algorithm.