✦ LIBER ✦

A comparison of algorithms for polynomial interpolation

✍ Scribed by Allan J Macleod

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 193 KB
Volume: 8
Category: Article
ISSN: 0377-0427
DOI: 10.1016/0771-050x(82)90051-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast parallel algorithm for polynomial i

Fast parallel algorithm for polynomial interpolation

✍ P.K. Jana; B.P. Sinha 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 339 KB

Interpolation algorithm for computing Dr

Interpolation algorithm for computing Drazin inverse of polynomial matrices

✍ Marko D. Petković; Predrag S. Stanimirović 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 167 KB

A diagonal offset algorithm for the poly

A diagonal offset algorithm for the polynomial point interpolation method

✍ Kanber, B. ;Bozkurt, O. Y. 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB

Data parallel evaluation-interpolation a

Data parallel evaluation-interpolation algorithm for polynomial matrix inversion

✍ E.V Krishnamurthy; Chen Pin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 580 KB

Auxiliary polynomials for the direct det

Auxiliary polynomials for the direct determination of the Chebyshey interpolation polynomial

✍ V.T. Gavrilyuk; T.Yu. Mazanovskaya 📂 Article 📅 1966 🏛 Elsevier Science ⚖ 801 KB

Lagrange polynomials of a complex variab

Lagrange polynomials of a complex variable for two-dimensional interpolation

✍ R. H. T. Bates; M. O. Milner 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 458 KB

## Abstract We recognize that established techniques permit two‐dimensional interpolation to be accomplished efficiently as well as accurately when the grid of points, on which the data is available, is regular. Existing methods suitable for irregular grids are computationally protracted. We show t