|
Minimax Approximation Algorithm
A minimax approximation algorithm (or L∞ approximation or uniform approximation) is a method to find an approximation of a mathematical function In mathematics, a function from a set (mathematics), set to a set assigns to each element of exactly one element of .; the words ''map'', ''mapping'', ''transformation'', ''correspondence'', and ''operator'' are sometimes used synonymously. ... that minimizes maximum error. For example, given a function f defined on the interval ,b/math> and a degree bound n, a minimax polynomial approximation algorithm will find a polynomial p of degree at most n to minimize ::\max_, f(x)-p(x), . Polynomial approximations The Weierstrass approximation theorem states that every continuous function defined on a closed interval ,bcan be uniformly approximated as closely as desired by a polynomial function. For practical work it is often desirable to minimize the maximum absolute or relative error of a polynomial fit for any given number of ter ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Function
In mathematics, a function from a set (mathematics), set to a set assigns to each element of exactly one element of .; the words ''map'', ''mapping'', ''transformation'', ''correspondence'', and ''operator'' are sometimes used synonymously. The set is called the Domain of a function, domain of the function and the set is called the codomain of the function. Functions were originally the idealization of how a varying quantity depends on another quantity. For example, the position of a planet is a ''function'' of time. History of the function concept, Historically, the concept was elaborated with the infinitesimal calculus at the end of the 17th century, and, until the 19th century, the functions that were considered were differentiable function, differentiable (that is, they had a high degree of regularity). The concept of a function was formalized at the end of the 19th century in terms of set theory, and this greatly increased the possible applications of the concept. A f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Birkhäuser
Birkhäuser was a Swiss publisher founded in 1879 by Emil Birkhäuser. It was acquired by Springer Science+Business Media in 1985. Today it is an imprint used by two companies in unrelated fields: * Springer continues to publish science (particularly: history of science, geosciences, computer science) and mathematics books and journals under the Birkhäuser imprint (with a leaf logo) sometimes called Birkhäuser Science. * Birkhäuser Verlag – an architecture and design publishing company was (re)created in 2010 when Springer sold its design and architecture segment to ACTAR. The resulting Spanish-Swiss company was then called ActarBirkhäuser. After a bankruptcy, in 2012 Birkhäuser Verlag was sold again, this time to De Gruyter. Additionally, the Reinach-based printer Birkhäuser+GBC operates independently of the above, being now owned by '' Basler Zeitung''. History The original Swiss publishers program focused on regional literature. In the 1920s the sons of Emil Bi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Weierstrass Approximation Theorem
Karl Theodor Wilhelm Weierstrass (; ; 31 October 1815 – 19 February 1897) was a German mathematician often cited as the " father of modern analysis". Despite leaving university without a degree, he studied mathematics and trained as a school teacher, eventually teaching mathematics, physics, botany and gymnastics. He later received an honorary doctorate and became professor of mathematics in Berlin. Among many other contributions, Weierstrass formalized the definition of the continuity of a function and complex analysis, proved the intermediate value theorem and the Bolzano–Weierstrass theorem, and used the latter to study the properties of continuous functions on closed bounded intervals. Biography Weierstrass was born into a Roman Catholic family in Ostenfelde, a village near Ennigerloh, in the Province of Westphalia. Karl Weierstrass was the son of Wilhelm Weierstrass and Theodora Vonderforst, the former of whom was a government official and both of whom were Cathol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Taylor Series
In mathematics, the Taylor series or Taylor expansion of a function is an infinite sum of terms that are expressed in terms of the function's derivatives at a single point. For most common functions, the function and the sum of its Taylor series are equal near this point. Taylor series are named after Brook Taylor, who introduced them in 1715. A Taylor series is also called a Maclaurin series when 0 is the point where the derivatives are considered, after Colin Maclaurin, who made extensive use of this special case of Taylor series in the 18th century. The partial sum formed by the first terms of a Taylor series is a polynomial of degree that is called the th Taylor polynomial of the function. Taylor polynomials are approximations of a function, which become generally more accurate as increases. Taylor's theorem gives quantitative estimates on the error introduced by the use of such approximations. If the Taylor series of a function is convergent, its sum is the limit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chebyshev Series
The Chebyshev polynomials are two sequences of orthogonal polynomials related to the trigonometric functions, cosine and sine functions, notated as T_n(x) and U_n(x). They can be defined in several equivalent ways, one of which starts with trigonometric functions: The Chebyshev polynomials of the first kind T_n are defined by T_n(\cos \theta) = \cos(n\theta). Similarly, the Chebyshev polynomials of the second kind U_n are defined by U_n(\cos \theta) \sin \theta = \sin\big((n + 1)\theta\big). That these expressions define polynomials in \cos\theta is not obvious at first sight but can be shown using de Moivre's formula (see #Trigonometric definition, below). The Chebyshev polynomials are polynomials with the largest possible leading coefficient whose absolute value on the interval (mathematics), interval is bounded by 1. They are also the "extremal" polynomials for many other properties. In 1952, Cornelius Lanczos showed that the Chebyshev polynomials are important in a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Remez Algorithm
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. It is sometimes referred to as Remes algorithm or Reme algorithm. 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. Procedure The Remez algorithm starts with the function f to be approximated and a set X of n + 2 sample points x_1, x_2, ...,x_ in the approximation interval, usually the extrema of Chebyshev polynomial line ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
