Skip to main content
SpringerLink
Log in

New algorithms for polynomial and trigonometric interpolation on parallel computers

  • Part II Numerical Mathematics
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

An interpolation polynomial of orderN is constructed fromp independent subpolynomials of ordern ∼ N/p. Each such subpolynomial is found independently and in parallel. Moreover, evaluation of the polynomial at any given point is done independently and in parallel, except for a final step of summation ofp elements. Hence, the algorithm has almost no communication overhead and can be implemented easily on any parallel computer. We give examples of finite-difference interpolation, trigonometric interpolation, and Chebyshev interpolation, and conclude with the general Hermite interpolation problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. L. Dowling,A fast parallel Horner algorithm, SIAM J. Comput., 19 (1990), pp. 133–142.

    Google Scholar 

  2. O. Egecioglu, E. Gallopoulos and Ç. Koç,Fast computation of divided differences and parallel Hermite interpolation, J. Complexity, 30 (1990), pp. 268–288.

    Google Scholar 

  3. O. Egecioglu, E. Gallopoulos and Ç. Koç,A parallel method for fast and practical high-order Newton interpolation, BIT, 30 (1990), pp. 268–288.

    Google Scholar 

  4. P. Henrici,Essentials of Numerical Analysis, John Wiley & Sons, 1982.

  5. F. B. Hildebrand,Introduction to Numerical Analysis, McGraw-Hill Book Company, 1974.

  6. I. Munro and M. Paterson,Optimal algorithms for parallel polynomial evaluation, J. Comput. System Sci., 7 (1973), pp. 189–198.

    Google Scholar 

  7. J. Reif,Logarithmic depth circuits for algebraic functions, SIAM J. Comput., 15 (1986), pp. 231–242.

    Google Scholar 

  8. J. Stoer and R. Bulirsch,Introduction to Numerical Analysis, Springer Verlag, 1980.

  9. W. J. Taylor,Method of Lagrangian curvilinear interpolation, J. Res. of the Nat. Bur. of Standards, 35 (1945), pp. 151–155.

    Google Scholar 

  10. W. Werner,Polynomial interpolation: Lagrange versus Newton, Math. Comp. 43 (1984), pp. 205–217.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of computer Science, Technion, 32000, Haifa, Israel

    Ilan Bar-On & Avram Sidi

Authors
  1. Ilan Bar-On
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Avram Sidi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bar-On, I., Sidi, A. New algorithms for polynomial and trigonometric interpolation on parallel computers. BIT 32, 464–480 (1992). https://doi.org/10.1007/BF02074881

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02074881

Categories and Subject Descriptor (CR)

AMS Subject Classification (1985)

Key words

Search

Navigation