A Fast Algorithm for Linear Complex Chebyshev Approximations
From MaRDI portal
Publication:3477868
DOI10.2307/2008772zbMath0699.65009OpenAlexW4243909963MaRDI QIDQ3477868
Publication date: 1988
Full work available at URL: https://doi.org/10.2307/2008772
algorithmquadratic convergenceRemez algorithmNumerical examplesbest minimax polynomial approximations
Best approximation, Chebyshev systems (41A50) Approximation in the complex plane (30E10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Algorithms for approximation of functions (65D15)
Related Items (14)
Band Toeplitz preconditioners for block Toeplitz systems ⋮ VOIGTL -- a fast subroutine for Voigt function evaluation on vector processors ⋮ Wave polynomials, transmutations and Cauchy's problem for the Klein-Gordon equation ⋮ An Algorithm for Real and Complex Rational Minimax Approximation ⋮ A cutting plane method for solving minimax problems in the complex plane ⋮ Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme ⋮ Chebycheff approximation in system identification and model reduction ⋮ Asymptotic expansion and extrapolation for Bernstein polynomials with applications ⋮ Proxy-GMRES: Preconditioning via GMRES in Polynomial Space ⋮ Optimal, quasi-optimal and superlinear band-Toeplitz preconditioners for asymptotically ill-conditioned positive definite Toeplitz systems ⋮ An algorithm for complex linear approximation based on semi-infinite programming ⋮ On computing best Chebyshev complex rational approximants ⋮ Constrained minimax approximation and optimal preconditioners for Toeplitz matrices ⋮ A globally most violated cutting plane method for complex minimax problems with application to digital filter design
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for the construction of best approximations based on Kolmogorov's criterion
- On the numerical determination of the best approximations in the Chebyshev sense
- On strong uniqueness in linear Chebyshev approximation
- Uniform approximation as a numerical tool for constructing conformal maps
- New extremal properties for constructing conformal mappings
- Non-strong uniqueness in real and complex Chebyshev approximation
- Near-circularity of the error curve in complex Chebyshev approximation
- H<sup>∞</sup>-optimal feedback controllers for linear multivariable systems
- On Polynomial Approximation in the Complex Plane with Application to Conformal Mapping
- Worst case analysis in the frequency domain: The H<sup>∞</sup>approach to control
- A Unified Approach to Certain Problems of Approximation and Minimization
- A New Method for Chebyshev Approximation of Complex-Valued Functions
- Rate of Convergence of Discretization in Chebyshev Approximation
- A general Chebyshev complex function approximation procedure and an application to beamforming
- Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
- Linear Chebyshev Approximation of Complex-Valued Functions
- An algorithm of successive minimization in convex programming
- Efficient Computation of the Complex Error Function
- Numerical Chebyshev Approximation in the Complex Plane
This page was built for publication: A Fast Algorithm for Linear Complex Chebyshev Approximations
