The Condition of Polynomials in Power Form
From MaRDI portal
Publication:4183740
DOI10.2307/2006047zbMATH Open0399.41002OpenAlexW4252648814MaRDI QIDQ4183740FDOQ4183740
Authors: Walter Gautschi
Publication date: 1979
Full work available at URL: https://doi.org/10.2307/2006047
Roundoff error (65G50) Approximation by polynomials (41A10) Numerical approximation and computational geometry (primarily algorithms) (65D99)
Cites Work
Cited In (19)
- Direct operatorial tau method for pantograph-type equations
- On condition numbers of a basis
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems
- Perturbation bounds for polynomials
- On the best conditioned bases of quadratic polynomials
- Chebyshev-Vandermonde Systems
- Eight Perspectives on the Exponentially Ill-Conditioned Equation $\varepsilon y - x y' + y = 0$
- Using parity to accelerate Hermite function computations: zeros of truncated Hermite series, Gaussian quadrature and Clenshaw summation
- On the generation of Krylov subspace bases
- On the numerical condition of polynomials in Bernstein form
- A Chebychev-Vandermonde solver
- Fehlerabschaetzungen für Koeffizienten von Exponentialsummen und Polynomen
- A Newton basis for kernel spaces
- Correcting Three Errors in Kantorovich & Krylov′s <em>Approximate Methods of Higher Analysis</em>
- An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
- A comparison of companion matrix methods to find roots of a trigonometric polynomial
- Stability of finite linear combinations of vectors under changes of their coefficients. An application to approximation problems
- Deviations of discrete distributions and a question of Móri
- The numerical solution of fractional integral equations via orthogonal polynomials in fractional powers
This page was built for publication: The Condition of Polynomials in Power Form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4183740)