A new approach to fast polynomial interpolation and multipoint evaluation

DOI10.1016/0898-1221(93)90129-JzbMath0772.65005OpenAlexW2094066246MaRDI QIDQ1802447

Elliott Landowne, Olen Tiga, Akimou Sadikou, Pan, Victor Y.

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

zbMATH Keywords

stabilitycondition numberfast polynomial interpolationmultipoint polynomial evaluationToeplitz type linear systems

Mathematics Subject Classification ID

Numerical interpolation (65D05) Computation of special functions and constants, construction of tables (65D20)

Related Items

A Note on Polynomial Interpolation, Structured matrices and Newton's iteration: unified approach, An algebraic approach to approximate evaluation of a polynomial on a set of real points, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Transformations of matrix structures work again, An efficient solution for Cauchy-like systems of linear equations, Semialgebraic sets and real binary forms decompositions, Fast approximate computations with Cauchy matrices and polynomials, New transformations of Cauchy matrices and Trummer's problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rapid solution of integral equations of classical potential theory
• A fast algorithm for the discrete Laplace transformation
• Asymptotically fast solution of Toeplitz and related systems of linear equations
• On Computations with Dense Structured Matrices
• Stability of Methods for Solving Toeplitz Systems of Equations
• Fast Parallel Algorithms for QR and Triangular Factorization
• Superfast Solution of Real Positive Definite Toeplitz Systems
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• Evaluating Polynomials at Fixed Sets of Points