Skip to main content
SpringerLink
Log in

Some algorithms for interval interpolating polynomial

Einige Algorithmen zur Intervallpolynominterpolation

  • Published:
Computing Aims and scope Submit manuscript

Abstract

Some algorithms for the computation of an Interval Interpolating Polynomial have been proposed. The algorithms have been compared with the existing algorithms. One of the algorithms has been shown to be superior to all others.

Zusammenfassung

Einige Algorithmen zur Berechnung eines interpolierenden Intervallpolynoms werden vorgeschlagen und mit bestehenden Algorithmen verglichen. Es wird gezeigt, daß einer der Algorithmen allen anderen überlegen ist.

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. Hansen, E. R., Smith, R.: Interval Arithmetic in Matrix Computation. Part II. SIAM J. Numerical Analysis4 (1967).

  2. Hansen, E. R. (ed.): Topics in Interval Analysis. Oxford University Press 1969.

  3. Hitchins, G. D.: An Interval Arithmetic Package and Some Applications. Tech. Rept. No. 10, Center for Computer Studies, University of Leeds. 1972.

  4. Majumder, K. L., Bhattacharjee, G. P.: Interval Arithmetric Package for IBM-1620 (manuscript). 1973.

  5. Miller, W., Chuba, W.: Quadratic Convergence in Interval Arithmetic Part I and II. BIT12, 284–298 (1972).

    Article  Google Scholar 

  6. Miller, W.: More on Quadratic Convergence in Interval Arithmetic. BIT13, 76–83 (1973).

    Article  Google Scholar 

  7. Moore, R. E.: Interval Analysis. Englewood Cliffs, N. J.: Prentice-Hall 1966.

    Google Scholar 

  8. Moore, R. E.: Practical Aspects of Interval Computation. Applikace Mathematiky 53–92 (1968).

  9. Nickel, K.: On the Newton Method in Interval Analysis, MRC Tech. Rept. No. 1136, University of Wisconsin. 1971.

  10. Rokne, J.: Explicit Calculation of Lagrangian Interval Interpolating Polynomial. Computing9, 149–157 (1972).

    Google Scholar 

  11. Rokne, J.: Automatic Error Bounds for the Simple Zeros of Analytic Functions. Comm. ACM16 (1973).

  12. Talbot, T. D.: Guaranteed Error Bounds for the Non-linear Two-point Boundary Value Problems. MRC. Tech. Rept. 875, University of Wisconsin. 1968.

  13. Yohe, J. M.: Best Possible Floating Point Arithmetic. MRC. Tech. Rept. 1054, University of Wisconsin. 1970.

Download references

Author information

Authors and Affiliations

  1. Space Applications Centre, 380009, Ahmedabad, India

    K. L. Majumder

  2. Department of Mathematics, Indian Institute of Technology, 721302, Kharagpur, India

    G. P. Bhattacharjee

Authors
  1. K. L. Majumder
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. P. Bhattacharjee
    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

Majumder, K.L., Bhattacharjee, G.P. Some algorithms for interval interpolating polynomial. Computing 16, 305–317 (1976). https://doi.org/10.1007/BF02252079

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation