A new approach to fast polynomial interpolation and multipoint evaluation
DOI10.1016/0898-1221(93)90129-JzbMATH Open0772.65005OpenAlexW2094066246MaRDI QIDQ1802447FDOQ1802447
Authors: Akimou Sadikou, Elliott Landowne, Olen Tiga, Victor Y. Pan 
Publication date: 21 July 1993
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(93)90129-j
Recommendations
stabilitycondition numberfast polynomial interpolationmultipoint polynomial evaluationToeplitz type linear systems
Computation of special functions and constants, construction of tables (65D20) Numerical interpolation (65D05)
Cites Work
- Title not available (Why is that?)
- Superfast Solution of Real Positive Definite Toeplitz Systems
- Title not available (Why is that?)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Evaluating Polynomials at Fixed Sets of Points
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Stability of Methods for Solving Toeplitz Systems of Equations
- Rapid solution of integral equations of classical potential theory
- On Computations with Dense Structured Matrices
- A fast algorithm for the discrete Laplace transformation
- Fast Parallel Algorithms for QR and Triangular Factorization
- Title not available (Why is that?)
Cited In (16)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Title not available (Why is that?)
- A Note on Polynomial Interpolation
- An efficient raster evaluation method for univariate polynomials
- New transformations of Cauchy matrices and Trummer's problem
- An efficient solution for Cauchy-like systems of linear equations
- Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions
- Structured matrices and Newton's iteration: unified approach
- Fast multipoint evaluation and interpolation of polynomials in the LCH-basis over F P r
- Semialgebraic sets and real binary forms decompositions
- Transformations of matrix structures work again
- Fast approximate computations with Cauchy matrices and polynomials
- An algebraic approach to approximate evaluation of a polynomial on a set of real points
- Title not available (Why is that?)
- Fast evaluation of polynomials by rational preparation
- Title not available (Why is that?)
This page was built for publication: A new approach to fast polynomial interpolation and multipoint evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802447)
