An algebraic approach to approximate evaluation of a polynomial on a set of real points
From MaRDI portal
Publication:1899278
DOI10.1007/BF02431995zbMath0836.65022OpenAlexW2091124791MaRDI QIDQ1899278
Publication date: 9 October 1995
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02431995
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Transformations of matrix structures work again ⋮ Fast approximate computations with Cauchy matrices and polynomials ⋮ New transformations of Cauchy matrices and Trummer's problem
Cites Work
- Unnamed Item
- Unnamed Item
- Fast evaluation and interpolation at the Chebyshev sets of points
- Polynomial division and its computational complexity
- A fast algorithm for the discrete Laplace transformation
- A new approach to fast polynomial interpolation and multipoint evaluation
- Evaluating polynomials at many points
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
- Polynomial Interpolation: Lagrange versus Newton
- Complexity of Computations with Matrices and Polynomials
- Error Analysis for Polynomial Evaluation
This page was built for publication: An algebraic approach to approximate evaluation of a polynomial on a set of real points
