The L_q-weighted dual programming of the linear Chebyshev approximation and an interior-point method
From MaRDI portal
Publication:6601293
Recommendations
Cites work
- scientific article; zbMATH DE number 3849762 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3246460 (Why is no real title available?)
- scientific article; zbMATH DE number 3295416 (Why is no real title available?)
- A Unified Approach to Certain Problems of Approximation and Minimization
- An algorithm for real and complex rational minimax approximation
- Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
- Numerical Chebyshev Approximation in the Complex Plane
- Rate of Convergence of Lawson's Algorithm
- Rational minimax approximation via adaptive barycentric representations
- Sur la méthode de l'approximation minimum.
- The AAA algorithm for rational approximation
- The Lawson Algorithm and Extensions
- Vandermonde with Arnoldi
This page was built for publication: The \(L_q\)-weighted dual programming of the linear Chebyshev approximation and an interior-point method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601293)