Systolic computation of interpolating polynomials

From MaRDI portal





Several time-optimal and spacetime-optimal systolic arrays are presented for computing a process dependence graph corresponding to the Aitken algorithm. It is shown that these arrays also can be used to compute the generalized divided differences, i.e., the coefficients of the Hermite interpolating polynomial. Multivariate generalized divided differences are shown to be efficiently computed on a 2-dimensional systolic array. The techniques also are applied to the Neville algorithm, producing similar results.











This page was built for publication: Systolic computation of interpolating polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641062)