- Algorithms
- >
- Numerical analysis
- >
- Approximation theory
- >
- Theorems in approximation theory

- Approximations
- >
- Numerical analysis
- >
- Approximation theory
- >
- Theorems in approximation theory

- Computational mathematics
- >
- Numerical analysis
- >
- Approximation theory
- >
- Theorems in approximation theory

- Equivalence (mathematics)
- >
- Approximations
- >
- Approximation theory
- >
- Theorems in approximation theory

- Fields of mathematical analysis
- >
- Functional analysis
- >
- Approximation theory
- >
- Theorems in approximation theory

- Fields of mathematical analysis
- >
- Numerical analysis
- >
- Approximation theory
- >
- Theorems in approximation theory

- Fields of mathematics
- >
- Mathematical analysis
- >
- Theorems in analysis
- >
- Theorems in approximation theory

- Functions and mappings
- >
- Functional analysis
- >
- Approximation theory
- >
- Theorems in approximation theory

- Mathematical problems
- >
- Mathematical theorems
- >
- Theorems in analysis
- >
- Theorems in approximation theory

- Mathematical relations
- >
- Approximations
- >
- Approximation theory
- >
- Theorems in approximation theory

- Mathematics
- >
- Mathematical theorems
- >
- Theorems in analysis
- >
- Theorems in approximation theory

- Mathematics of computing
- >
- Numerical analysis
- >
- Approximation theory
- >
- Theorems in approximation theory

- Theorems
- >
- Mathematical theorems
- >
- Theorems in analysis
- >
- Theorems in approximation theory

Bernstein's theorem (approximation theory)

In approximation theory, Bernstein's theorem is a converse to Jackson's theorem. The first results of this type were proved by Sergei Bernstein in 1912. For approximation by trigonometric polynomials,

Hartogs–Rosenthal theorem

In mathematics, the Hartogs–Rosenthal theorem is a classical result in complex analysis on the uniform approximation of continuous functions on compact subsets of the complex plane by rational functio

Wirtinger's representation and projection theorem

In mathematics, Wirtinger's representation and projection theorem is a theorem proved by Wilhelm Wirtinger in 1932 in connection with some problems of approximation theory. This theorem gives the repr

Arakelyan's theorem

In mathematics, Arakelyan's theorem is a generalization of Mergelyan's theorem from compact subsets of an open subset of the complex plane to relatively closed subsets of an open subset.

Fejér's theorem

In mathematics, Fejér's theorem, named after Hungarian mathematician Lipót Fejér, states the following: Fejér's Theorem — Let be a continuous function with period , let be the nth partial sum of the F

Erdős–Turán inequality

In mathematics, the Erdős–Turán inequality bounds the distance between a probability measure on the circle and the Lebesgue measure, in terms of Fourier coefficients. It was proved by Paul Erdős and P

Lethargy theorem

In mathematics, a lethargy theorem is a statement about the distance of points in a metric space from members of a sequence of subspaces; one application in numerical analysis is to approximation theo

Jackson's inequality

In approximation theory, Jackson's inequality is an inequality bounding the value of function's best approximation by algebraic or trigonometric polynomials in terms of the modulus of continuity or mo

Krein's condition

In mathematical analysis, Krein's condition provides a necessary and sufficient condition for exponential sums to be dense in a weighted L2 space on the real line. It was discovered by Mark Krein in t

Mergelyan's theorem

Mergelyan's theorem is a result from approximation by polynomials in complex analysis proved by the Armenian mathematician Sergei Mergelyan in 1951.

Walsh–Lebesgue theorem

The Walsh–Lebesgue theorem is a famous result from harmonic analysis proved by the American mathematician Joseph L. Walsh in 1929, using results proved by Lebesgue in 1907. The theorem states the foll

Favard's theorem

In mathematics, Favard's theorem, also called the Shohat–Favard theorem, states that a sequence of polynomials satisfying a suitable 3-term recurrence relation is a sequence of orthogonal polynomials.

Müntz–Szász theorem

The Müntz–Szász theorem is a basic result of approximation theory, proved by Herman Müntz in 1914 and Otto Szász (1884–1952) in 1916. Roughly speaking, the theorem shows to what extent the Weierstrass

Carleman's condition

In mathematics, particularly, in analysis, Carleman's condition gives a sufficient condition for the determinacy of the moment problem. That is, if a measure satisfies Carleman's condition, there is n

Stone–Weierstrass theorem

In mathematical analysis, the Weierstrass approximation theorem states that every continuous function defined on a closed interval [a, b] can be uniformly approximated as closely as desired by a polyn

Kolmogorov–Arnold representation theorem

In real analysis and approximation theory, the Kolmogorov-Arnold representation theorem (or superposition theorem) states that every multivariate continuous function can be represented as a superposit

© 2023 Useful Links.