Atjaunināt sīkdatņu piekrišanu

Scattered Data Approximation [Mīkstie vāki]

(Georg-August-Universität, Göttingen, Germany)
  • Formāts: Paperback / softback, 348 pages, height x width x depth: 229x152x20 mm, weight: 510 g, Worked examples or Exercises
  • Sērija : Cambridge Monographs on Applied and Computational Mathematics
  • Izdošanas datums: 11-Feb-2010
  • Izdevniecība: Cambridge University Press
  • ISBN-10: 0521131014
  • ISBN-13: 9780521131018
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 84,63 €
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 348 pages, height x width x depth: 229x152x20 mm, weight: 510 g, Worked examples or Exercises
  • Sērija : Cambridge Monographs on Applied and Computational Mathematics
  • Izdošanas datums: 11-Feb-2010
  • Izdevniecība: Cambridge University Press
  • ISBN-10: 0521131014
  • ISBN-13: 9780521131018
Citas grāmatas par šo tēmu:
A complete self-contained introduction to the theory of scattered data approximation. Written with graduates and researchers in mind, the text brings together much of the necessary background material into a single treatment and provides students with complete proofs to the theory developed within.

Many practical applications require the reconstruction of a multivariate function from discrete, unstructured data. This book gives a self-contained, complete introduction into this subject. It concentrates on truly meshless methods such as radial basis functions, moving least squares, and partitions of unity. The book starts with an overview on typical applications of scattered data approximation, coming from surface reconstruction, fluid-structure interaction, and the numerical solution of partial differential equations. It then leads the reader from basic properties to the current state of research, addressing all important issues, such as existence, uniqueness, approximation properties, numerical stability, and efficient implementation. Each chapter ends with a section giving information on the historical background and hints for further reading. Complete proofs are included, making this perfectly suited for graduate courses on multivariate approximation and it can be used to support courses in computer aided geometric design, and meshless methods for partial differential equations.

Recenzijas

Review of the hardback: ' designed as a comprehensive and self-contained introduction to the field of multivariate scattered data approximation The book offers an interesting reading for both the beginner and the specialist throughout its variety of topics and its careful exposition, this book will appeal to everyone interested in the theory and numerical applications of meshless methods for scattered data approximation.' Zentralblatt MATH Review of the hardback: 'I highly recommend it for a graduate course on multivariate approximation theory, computer-aided geometric design, and meshless methods for partial differential equations.' Numerical Algorithms

Papildus informācija

A self-contained introduction to the theory of scattered data approximation, suitable for graduates and researchers.
Preface ix
1 Applications and motivations
1(17)
1.1 Surface reconstruction
1(5)
1.2 Fluid-structure interaction advection
6(1)
1.3 Grid-free semi-Lagrangian advection
7(6)
1.5 Learning from splines
13(2)
1.5 Approximation and approximation orders
15(1)
1.6 Notation
15(1)
1.7 Notes and comments
16(2)
2 Haar spaces and multivariate polynomials
18(6)
2.1 The Mairhuber-Curtis theorem
18(1)
2.2 Multivariate polynomials
19(5)
3 Local polynomial reproduction
24(11)
3.1 Definition and basic properties
24(2)
3.2 Norming sets
26(2)
3.3 Existence for regions with cone condition
28(6)
3.4 Notes and comments
34(1)
4 Moving least squares
35(11)
4.1 Definition and characterization
35(5)
4.2 Local polynomial reproduction by moving least squares
40(3)
4.3 Generalizations
43(1)
4.4 Notes and comments
44(2)
5 Auxiliary tools from analysis and measure theory
46(18)
5.1 Bessel functions
46(8)
5.2 Fourier transform and approximation by convolution
54(6)
5.3 Measure theory
60(4)
6 Positive definite functions
64(21)
6.1 Defintion and basic properties
64(3)
6.2 Bochner's characterization
67(11)
6.3 Radial functions
78(4)
6.4 Functions, kernels, and other norms
82(2)
6.5 Notes and comments
84(1)
7 Completely monotone functions
85(12)
7.1 Definition and first characterization
86(2)
7.2 The Bernstein-Hausdorff-Widder characterization
88(5)
7.3 Schoenberg's characerization
93(3)
7.4 Notes and comments
96(1)
8 Conditionally positive definite functions
97(22)
8.1 Definition and basic propoerties
97(6)
8.2 An analogue of Bochner's characterization
103(6)
8.3 Examples of generalized Fourier transforms
109(4)
8.4 Radial conditionally positive definite functions
113(3)
8.5 Interpolations by conditionally positive definite functions
116(1)
8.6 Notes and comments
117(2)
9 Compactly supported functions
119(14)
9.1 General remarks
119(1)
9.2 Dimension walk
120(3)
9.3 Piecewise polynomial functions with local support
123(4)
9.4 Compactly supported functions of minimal degree
127(3)
9.5 Generalizations
130(2)
9.6 Notes and comments
132(1)
10 Native spaces
133(39)
10.1 Reproducing-kernel Hilbert spaces
133(3)
10.2 Native spaces for positive definite kernels
136(5)
10.3 Native spaces for conditionally positive definite kernels
141(9)
10.4 Further characterizations of native spaces
150(6)
10.5 Special cases of native spaces
156(11)
10.6 Anembedding theorem
167(1)
10.7 Restriction and extension
168(2)
10.8 Notes and comments
170(2)
11 Error estimates for radial basis function interpolation
172(34)
11.1 Power function and first estimates
172(5)
11.2 Error estimates in terms of the fill distance
177(6)
11.3 Estimates for popular basis functions
183(5)
11.4 Spectral convergence for Gaussians and (inverse) multiquadics
188(3)
11.5 Improved error estimates
191(3)
11.6 Improved Sobolev bounds for functions with scattered zeros
194(10)
11.7 Notes and comments
204(2)
12 Stability
206(17)
12.1 Trade-off principle
208(1)
12.2 Lower bounds for λmin
209(6)
12.3 Change of Basis
215(7)
12.4 Notes and commetns
222(1)
13 Optimal recovery
223(7)
13.1 Minimal properties of radial basis functions
223(3)
13.2 Abstract optimal recovery
226(3)
13.3 Notes and comments
229(1)
14 Data structures
230(23)
14.1 The fixed-grid method
231(6)
14.2 kd-Trees
237(6)
14.3 bd-Trees
243(3)
14.4 Range trees
246(5)
14.5 Notes and comments
251(2)
15 Numerical methods
253(36)
15.1 Fast multipole methods
253(12)
15.3 Approximation of Lagrange functions
265(15)
15.4 Partition of unity
280(1)
15.5 Multilevel methods
280(3)
15.6 A greedy algorithm
283(4)
15.7 Concluding remarks
287(1)
15.8 Notes and comments
287(2)
16 Generalized interpolation
289(19)
16.1 Optimal recovery in Hilbert spaces
289(3)
16.2 Hermite-Birkhoff interpolation
292(4)
16.3 Solving PDEs by collocation
296(10)
16.4 Notes and comments
306(2)
17 Interpolation on spheres and other manifolds
308(15)
17.1 Spherical harmonies
308(2)
17.2 Positive definite functions on the sphere
310(4)
17.3 Error estimates
314(2)
17.4 Interpolation on compact manifolds
316(5)
17.5 Notes and comments
321(2)
References 323(11)
Index 334
Holger Wendland is Associate Professor at the Institute for Numerical and Applied Mathematics at Georg-August-University, Gottingen.