Pages that link to "Item:Q4105165"
From MaRDI portal
The following pages link to Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm (Q4105165):
Displaying 13 items.
- An algorithm for the construction of best approximations based on Kolmogorov's criterion (Q755062) (← links)
- Uniform rational approximation on subsets of [0,\(\infty]\) (Q1103805) (← links)
- Near-circularity of the error curve in complex Chebyshev approximation (Q1153294) (← links)
- A cutting plane method for solving minimax problems in the complex plane (Q1200545) (← links)
- A survey of published programs for best approximation (Q1254822) (← links)
- Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems (Q1372035) (← links)
- Chebycheff approximation in system identification and model reduction (Q2275035) (← links)
- A Fast Algorithm for Linear Complex Chebyshev Approximations (Q3477868) (← links)
- Rate of Convergence of Discretization in Chebyshev Approximation (Q3923061) (← links)
- Linear Chebyshev Approximation of Complex-Valued Functions (Q4162379) (← links)
- Rational Minimax Approximation via Adaptive Barycentric Representations (Q4580291) (← links)
- An Algorithm for Real and Complex Rational Minimax Approximation (Q5132009) (← links)
- The \(L_q\)-weighted dual programming of the linear Chebyshev approximation and an interior-point method (Q6601293) (← links)
