Abstract
Eight FORTRAN subprograms for dealing computationally with piecewise polynomial functions (of one variable) are presented. The package is built around an algorithm for the stable evaluation of B-splines of arbitrary order and with knots of arbitrary multiplicity. Four examples illustrate how one might use these routines: interpolation by splines of general order k (and not necessarily at the knots); least squares approximation by splines to discrete data; the determination of the derivative of a spline with respect to a knot; and the approximate solution of an ordinary differential equation with rather general side conditions by collocation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
