User:Amatdiou/Books/Approximation theory
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Approximation theory[edit]
- Category
- Approximation theory
- Approximation theory
- Baskakov operator
- Bernstein's inequality (mathematical analysis)
- Bernstein's theorem (approximation theory)
- Bramble–Hilbert lemma
- Chebyshev polynomials
- Elliott Ward Cheney, Jr.
- Constructive Approximation
- Constructive function theory
- Dirichlet kernel
- Discrete Chebyshev polynomials
- Euler–Maclaurin formula
- Favard operator
- Fekete problem
- User:Ljfiedler/sandbox
- Hilbert matrix
- Jackson's inequality
- Journal of Approximation Theory
- Least squares (function approximation)
- Lebesgue's lemma
- Modulus of continuity
- Remez algorithm
- Semi-infinite programming
- Szász–Mirakjan–Kantorovich operator
- Szász–Mirakyan operator
- Trigonometric polynomial
- Unisolvent functions
- Unisolvent point set
- Universal differential equation
- Category
- Theorems in approximation theory
- Carleman's condition
- Erdős–Turán inequality
- Favard's theorem
- Fejér's theorem
- Hartogs–Rosenthal theorem
- Krein's condition
- Lethargy theorem
- Mergelyan's theorem
- Müntz–Szász theorem
- Stone–Weierstrass theorem
- Wirtinger's representation and projection theorem
- Category
- Approximations
- Approximation
- Approximations of π
- Back-of-the-envelope calculation
- Born–Huang approximation
- Born–Oppenheimer approximation
- Relaxation (approximation)
- Stirling's approximation
- Successive approximation ADC
- WKB approximation
- Category
- Approximation algorithms
- Approximation algorithm
- Submodular set function
- Alpha max plus beta min algorithm
- APX
- Baker's technique
- Christofides algorithm
- Domination analysis
- K-approximation of k-hitting set
- Karloff–Zwick algorithm
- L-reduction
- Method of conditional probabilities
- Metric k-center
- Minimum k-cut
- Nearest neighbor search
- Nearest neighbour algorithm
- Polynomial-time algorithm for approximating the volume of convex bodies
- Polynomial-time approximation scheme
- Property testing
- Ε-approximate nearest neighbor search
- Category
- Relaxation (approximation)
- Lagrangian relaxation
- Linear programming relaxation
- Category
- Decomposition methods
- Benders' decomposition
- Dantzig–Wolfe decomposition
- Decomposition (computer science)
- Modular design
- Theory of two-level planning
- Variable splitting
- Category
- Statistical approximations
- 1.96
- 68–95–99.7 rule
- Alpha beta filter
- Approximate Bayesian computation
- Binomial proportion confidence interval
- Cunningham function
- Delta method
- Edgeworth series
- Fieller's theorem
- Function approximation
- Imprecise probability
- Interval propagation
- Kirkwood approximation
- Monte Carlo method
- Morris method
- Pearson's chi-squared test
- Propagation of uncertainty
- Rare disease assumption
- Rule of three (statistics)
- Stochastic approximation
- Taylor expansions for the moments of functions of random variables
- Three-point estimation
- Welch's t test
- Welch–Satterthwaite equation