Rate of Convergence of Discretization in Chebyshev Approximation
From MaRDI portal
Publication:3923061
DOI10.2307/2007506zbMath0469.41021OpenAlexW4234538484MaRDI QIDQ3923061
Jack Williams, Charles B. Dunham
Publication date: 1981
Full work available at URL: https://doi.org/10.2307/2007506
Best approximation, Chebyshev systems (41A50) Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15)
Related Items (7)
Uniform approximation by McCallig rationals ⋮ Approximation with one (or few) parameters nonlinear ⋮ Uniform rational approximation on subsets of [0,\(\infty\)] ⋮ A cutting plane method for solving minimax problems in the complex plane ⋮ A highly accurate trivariate spectral collocation method of solution for two-dimensional nonlinear initial-boundary value problems ⋮ A Fast Algorithm for Linear Complex Chebyshev Approximations ⋮ Discretization for uniform polynomial approximation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rational Chebyshev approximation on subsets
- Approximation by alternating families on subsets
- Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
- Nonuniqueness of best approximating complex rational functions
- Dependence of Best Rational Chebyshev Approximations on the Domain
- On the Rate of Convergence of Discretization in Chebyshev Approximation
- Efficiency of Chebyshev Approximation on Finite Subsets
- Alternating Chebyshev Approximation
This page was built for publication: Rate of Convergence of Discretization in Chebyshev Approximation