Skip to main content

n-th Order Polynomial Spline Blending

  • Chapter

Part of the book series: International Series of Numerical Mathematics ((ISNM,volume 75))

Abstract

The objective of this paper is to construct an n-th order Blending scheme based on univariate polynomial spline projectors. — Discrete Blending schemes have the general advantage of preserving an asymptotic interpolation error as compared to the corresponding tensor product interpolation but with a reduced number of data.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. de Boor Splines as Linear Combinations of B-Splines.. A Survey.In: Approximation Theory II. Eds.: G. G. Lorentz et al. Academic Press, New York 1976, 1 – 47.

    Google Scholar 

  2. C. de Boor Efficient Computer Manipulation of Tensor Products.. ACM Transactions on Mathematical Software5No.2(1979), 173 – 182.

    Google Scholar 

  3. C. de Boor, A. Pinkus Backward Error Analysis for Totally Positive Linear Systems.. Numer Math.27(1977), 485 – 490

    Article  Google Scholar 

  4. J. C. Cavendish, W. J. Gordon, C. A. Hall Ritz-Galerkin Approximations in Blending Function Spaces.. Numer Math.26(1976), 155 – 178.

    Article  Google Scholar 

  5. F. J. Delvos d-V ariate Boolean Interpolation.. J. Approximation Th.34(1982), 99 – 114.

    Article  Google Scholar 

  6. F. J. Delvos, H. Posdorf N-th Order Blending. In: Spline Functions, Karlsr uhe 1975. Eds.: K. Böhmer et al. Springer, Berlin 1976, 53 – 64.

    Google Scholar 

  7. F. J. Delvos, W. Schempp The Method of Parametric Extension Applied to Right Invertible Operators. Numer Funct Anal and Optimiz..6No. 2 (1983), 135 – 148

    Article  Google Scholar 

  8. W. J. Gordon Distributive Lattices and Approximation of Multivariate Functions.. In: Approximation with Special Emphasis on Spline Functions, Ed.: I. J. Schoenberg. Academic Press, New York 1969, 223 – 277

    Google Scholar 

  9. W. J. Gordon, E. W. Cheney Bivariate and Multivariate Interpolation with Noncommutative Projectors. In: Linear Spaces and Approximation. Eds.: P. L. Butzer, B. Sz.-Nagy. ISLAM 40, Birkhauser, Basel 1977, 381 – 387.

    Google Scholar 

  10. R. Q. Jia Total Positivity of the Discrete Spline Collocation Matrix.. J. Approximation Th.39. (1983), 11 – 23.

    Article  Google Scholar 

  11. M. H. Schultz Spline Analysis.. Prentice-Hall, Englewood Cliffs 1973

    Google Scholar 

  12. L. L. Schumaker Spline Functions: Basic Theory. Wiley, New York 1981

    Google Scholar 

  13. B. Swartz, R. S. Varga Error Bounds for Spline and L-Spline Interpolation. J. Approximation Th.6 (1972), 6–49.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Birkhäuser Verlag Basel

About this chapter

Cite this chapter

Baszenski, G. (1985). n-th Order Polynomial Spline Blending. In: Schempp, W., Zeller, K. (eds) Multivariate Approximation Theory III. International Series of Numerical Mathematics, vol 75. Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-9321-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-9321-3_5

  • Publisher Name: Birkhäuser Basel

  • Print ISBN: 978-3-0348-9995-6

  • Online ISBN: 978-3-0348-9321-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics