Decomposing polynomial interpolation for systolic arrays

DOI10.1080/00207169108803971zbMath0735.65003OpenAlexW2022215697MaRDI QIDQ4713422

Peter R. Cappello, Çetin Kaya Koç, Efstratios Gallopoulos

Publication date: 25 June 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169108803971

zbMATH Keywords

decompositionsystolic arrayAitken's algorithmalgorithms of Aitken and Nevilleextent problemiterated polynomial interpolationlarge interpolation problemNewton and Hermite polynomial interpolationNewton-Vandermonde matrix

Mathematics Subject Classification ID

Numerical interpolation (65D05) Cellular automata (computational aspects) (68Q80) Interpolation in approximation theory (41A05) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

• Unnamed Item
• Spacetime representations of computational structures
• The block decomposition of a Vandermonde matrix and its applications
• Systolic computation of interpolating polynomials
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
• Iterated interpolation using a systolic array
• Parallel Matrix and Graph Algorithms
• On the Analysis and Synthesis of VLSI Algorithms
• On Multipoint Numerical Interpolation
• Solving Eigenvalue and Singular Value Problems on an Undersized Systolic Array