Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
From MaRDI portal
Cited in
(16)- Uniform rational approximation on subsets of [0,\(\infty]\)
- Near-circularity of the error curve in complex Chebyshev approximation
- A cutting plane method for solving minimax problems in the complex plane
- A survey of published programs for best approximation
- Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
- Chebycheff approximation in system identification and model reduction
- A Fast Algorithm for Linear Complex Chebyshev Approximations
- Rate of Convergence of Discretization in Chebyshev Approximation
- Linear Chebyshev Approximation of Complex-Valued Functions
- Rational minimax approximation via adaptive barycentric representations
- An algorithm for real and complex rational minimax approximation
- The \(L_q\)-weighted dual programming of the linear Chebyshev approximation and an interior-point method
- A AAA-type algorithm for the microwave duplexer filtering
- A convergence analysis of Lawson's iteration for computing polynomial and rational minimax approximations
- A convex dual problem for the rational minimax approximation and Lawson's iteration
- An algorithm for the construction of best approximations based on Kolmogorov's criterion
This page was built for publication: Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4105165)
