Pages that link to "Item:Q3477868"
From MaRDI portal
The following pages link to A Fast Algorithm for Linear Complex Chebyshev Approximations (Q3477868):
Displaying 14 items.
- A cutting plane method for solving minimax problems in the complex plane (Q1200545) (← links)
- An algorithm for complex linear approximation based on semi-infinite programming (Q1315207) (← links)
- On computing best Chebyshev complex rational approximants (Q1315208) (← links)
- Constrained minimax approximation and optimal preconditioners for Toeplitz matrices (Q1315215) (← links)
- A globally most violated cutting plane method for complex minimax problems with application to digital filter design (Q1315252) (← links)
- Band Toeplitz preconditioners for block Toeplitz systems (Q1919512) (← links)
- VOIGTL -- a fast subroutine for Voigt function evaluation on vector processors (Q1923728) (← links)
- Wave polynomials, transmutations and Cauchy's problem for the Klein-Gordon equation (Q1931548) (← links)
- Chebycheff approximation in system identification and model reduction (Q2275035) (← links)
- Asymptotic expansion and extrapolation for Bernstein polynomials with applications (Q2565270) (← links)
- Optimal, quasi-optimal and superlinear band-Toeplitz preconditioners for asymptotically ill-conditioned positive definite Toeplitz systems (Q3127325) (← links)
- Proxy-GMRES: Preconditioning via GMRES in Polynomial Space (Q5006454) (← links)
- An Algorithm for Real and Complex Rational Minimax Approximation (Q5132009) (← links)
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme (Q5936072) (← links)