By Carl de Boor

ISBN-10: 0387953663

ISBN-13: 9780387953663

This ebook relies at the author's event with calculations regarding polynomial splines. It offers these elements of the idea that are in particular invaluable in calculations and stresses the illustration of splines as linear mixtures of B-splines. After chapters summarizing polynomial approximation, a rigorous dialogue of straightforward spline conception is given related to linear, cubic and parabolic splines. The computational dealing with of piecewise polynomial capabilities (of one variable) of arbitrary order is the topic of chapters VII and VIII, whereas chapters IX, X, and XI are dedicated to B-splines. The distances from splines with mounted and with variable knots is mentioned in bankruptcy XII. the rest 5 chapters quandary particular approximation equipment, interpolation, smoothing and least-squares approximation, the answer of a regular differential equation by way of collocation, curve becoming, and floor becoming. the current textual content model differs from the unique in different respects. The publication is now typeset (in simple TeX), the Fortran courses now utilize Fortran seventy seven beneficial properties. The figures were redrawn simply by Matlab, a number of mistakes were corrected, and lots of extra formal statements were supplied with proofs. additional, all formal statements and equations were numbered by means of a similar numbering approach, to allow you to locate any specific merchandise. a huge swap has occured in Chapters IX-XI the place the B-spline conception is now built without delay from the recurrence family members with out recourse to divided modifications. This has introduced in knot insertion as a strong software for offering basic proofs in regards to the shape-preserving houses of the B-spline sequence.

Show description

Read Online or Download A Practical Guide to Splines PDF

Best computational mathematicsematics books

Get Computer Algebra: Systems and Algorithms for Algebraic PDF

This ebook nonetheless continues to be the simplest creation to machine algebra, catering to either the newbie and the skilled natural mathematician and laptop scientist. This up-to-date moment version presents a accomplished assessment, and includes very good references to primary papers and labored examples.

Computational Electronics - download pdf or read online

Beginning with the best semiclassical ways and finishing with the outline of advanced totally quantum-mechanical equipment for quantum shipping research of state of the art units, Computational Electronics: Semiclassical and Quantum gadget Modeling and Simulation offers a complete evaluate of the basic concepts and strategies for successfully reading delivery in semiconductor units.

Computational Science — ICCS 2003: International Conference, by John Daly (auth.), Peter M. A. Sloot, David Abramson, PDF

The four-volume set LNCS 2657, LNCS 2658, LNCS 2659, and LNCS 2660 constitutes the refereed complaints of the 3rd overseas convention on Computational technology, ICCS 2003, held simultaneously in Melbourne, Australia and in St. Petersburg, Russia in June 2003. The 4 volumes current greater than 460 reviewed contributed and invited papers and span the complete variety of computational technological know-how, from foundational matters in laptop technological know-how and algorithmic arithmetic to complex functions in almost all program fields utilising computational strategies.

Extra info for A Practical Guide to Splines

Sample text

N, ν=1 where the first equality follows from the fact that 2 µ ∈ P2n−2 ⊂ P2n−1 . 47 The weights λG ν are the coefficients in the partial fraction decomposition of σn /πn (cf. 33)), n In particular, λG ν = λG σn (z) ν = . 9) ν = 1, 2, . . , n. 43) n R λν dλ(t) − = O(z −2n−1 ) z − t ν=1 z − τνG as z → ∞. By expanding both terms on the left in descending powers of z, we find that n R tk dλ(t) − λν [τνG ]k = 0, ν=1 k = 0, 1, . . , 2n − 1. G G This implies λν = λG ν . 9). 10) R where p2n−1 (f ; · ) is the Hermite interpolation polynomial of degree 2n − 1 satisfying p2n−1 (f ; τνG ) = f (τνG ), p2n−1 (f ; τνG ) = f (τνG ), ν = 1, 2, .

AntiGauss rules, introduced by Laurie (1996), are (n + 1)-point rules having degree of exactness 2n − 1, which integrate polynomials of degree 2n + 1 with an error that is equal in modulus, but opposite in sign, to the error of the n-point Gauss rule. Modified anti-Gauss rules are defined and applied to two-sided estimation of integrals in Calvetti and Reichel (2003a). The problem of approximating r ( > 1) weighted integrals of the same function by a Gauss-like quadrature rule having the same set of nodes has been considered in Borges (1994).

45), when z ∈ C\[a, b], and there holds ρn (z) βn βn+1 βn+2 = ··· , ρn−1 (z) z − αn − z − αn+1 − z − αn+2 − n = 0, 1, 2, . . , z ∈ C\[a, b]. 47) This expresses the “tails” of the Jacobi continued fraction J (z; dλ) (cf. 33) in terms of ratios of the minimal solution {ρn (z)}. 1 are satisfied. 1) ν=1 where the sum on the right provides an approximation to the integral on the left and Rn is the respective error. The τν , assumed mutually distinct, are called the nodes, and λν the weights of the quadrature rule.

Download PDF sample

A Practical Guide to Splines by Carl de Boor


by George
4.4

Rated 4.96 of 5 – based on 39 votes