| Box Splines 1993 Edition Contributor(s): Boor, Carl de (Author), Höllig, Klaus (Author), Riemenschneider, Sherman (Author) |
|
 |
ISBN: 0387941010 ISBN-13: 9780387941011 Publisher: Springer OUR PRICE: $52.24 Product Type: Hardcover - Other Formats Published: November 1993 Annotation: This book on box splines is the first book giving a complete development for any kind of multivariate spline. Box splines give rise to an intriguing and beautiful mathematical theory that is much richer and more intricate than the univariate case because of the complexity of smoothly joining polynomial pieces on polyhedral cells. The purpose of this book is to provide the basic facts about box splines in a cohesive way with simple, complete proofs, many illustrations, and with an up-to-date bibliography. It is not the book's intention to be encyclopedic about the subject, but rather to provide the fundamental knowledge necessary to familiarize graduate students and researchers in analysis, numerical analysis, and engineering with a subject that surely will have as many widespread applications as its univariate predecessor. This book will be used as a supplementary text for graduate courses. The book begins with chapters on box splines defined, linear algebra of box spline spaces, and quasi-interpolants and approximation power. It continues with cardinal interpolation and difference equations, approximation by cardinal splines and wavelets. The book concludes with discrete box splines and linear diophantine equations, and subdivision algorithms. |
| Additional Information |
| BISAC Categories: - Mathematics | Mathematical Analysis |
| Dewey: 511.42 |
| LCCN: 93005263 |
| Series: Mathematical Sciences Research Institute Publications |
| Physical Information: 0.56" H x 6.14" W x 9.21" (1.10 lbs) 201 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: Compactly supported smooth piecewise polynomial functions provide an efficient tool for the approximation of curves and surfaces and other smooth functions of one and several arguments. Since they are locally polynomial, they are easy to evaluate. Since they are smooth, they can be used when smoothness is required, as in the numerical solution of partial differential equations (in the Finite Element method) or the modeling of smooth sur- faces (in Computer Aided Geometric Design). Since they are compactly supported, their linear span has the needed flexibility to approximate at all, and the systems to be solved in the construction of approximations are 'banded'. The construction of compactly supported smooth piecewise polynomials becomes ever more difficult as the dimension, s, of their domain G IRs, i. e., the number of arguments, increases. In the univariate case, there is only one kind of cell in any useful partition, namely, an interval, and its boundary consists of two separated points, across which polynomial pieces would have to be matched as one constructs a smooth piecewise polynomial function. This can be done easily, with the only limitation that the num- ber of smoothness conditions across such a breakpoint should not exceed the polynomial degree (since that would force the two joining polynomial pieces to coincide). In particular, on any partition, there are (nontrivial) compactly supported piecewise polynomials of degree k and in C(k-l), of which the univariate B-spline is the most useful example. |
