Category:Approximation theory
 | Computing portal |
Here is a list of articles in the Approximation theory category of the Computing portal that unifies foundations of mathematics and computations using computers.
In mathematics, approximation theory is concerned with how functions can be approximated with other, simpler, functions, and with characterizing in a quantitative way the errors introduced thereby.
Subcategories
This category has only the following subcategory.
Pages in category "Approximation theory"
The following 32 pages are in this category, out of 32 total.
- Approximation theory (computing)
B
- Baskakov operator (computing)
- Bernstein's inequality (mathematical analysis) (computing)
- Bernstein's theorem (polynomials) (computing)
- Bramble–Hilbert lemma (computing)
C
- Chebyshev polynomials (computing)
- Elliott Ward Cheney Jr. (biography)
- Constructive Approximation (computing)
- Constructive function theory (computing)
D
- Dirichlet kernel (computing)
- Discrete Chebyshev polynomials (computing)
E
- Euler–Maclaurin formula (computing)
F
- Favard operator (computing)
- Fekete problem (computing)
H
- Haar space (computing)
- Hilbert matrix (computing)
J
- Jackson's inequality (computing)
- Journal of Approximation Theory (computing)
L
- Least-squares function approximation (computing)
- Lebesgue's lemma (computing)
M
- Modulus of continuity (computing)
- Modulus of smoothness (computing)
R
- Radial basis function interpolation (computing)
- Remez algorithm (computing)
S
- Semi-infinite programming (computing)
- Szász–Mirakjan–Kantorovich operator (computing)
- Szász–Mirakyan operator (computing)
T
- Trigonometric polynomial (computing)
U
- Unisolvent functions (computing)
- Unisolvent point set (computing)
- Universal differential equation (computing)
W
- Whitney inequality (computing)
Mathematics
Organizations
Books
About