|
|
|
|
| LEADER |
03599nmm a2200349 u 4500 |
| 001 |
EB000631615 |
| 003 |
EBX01000000000000000484697 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9781475737264
|
| 100 |
1 |
|
|a Shapira, Yair
|
| 245 |
0 |
0 |
|a Matrix-Based Multigrid
|h Elektronische Ressource
|b Theory and Applications
|c by Yair Shapira
|
| 250 |
|
|
|a 1st ed. 2003
|
| 260 |
|
|
|a New York, NY
|b Springer US
|c 2003, 2003
|
| 300 |
|
|
|a XVI, 221 p. 6 illus
|b online resource
|
| 505 |
0 |
|
|a 1. The Multilevel-Multiscale Approach -- I The Problem and Solution Methods -- 2. PDEs and Discretization Methods -- 3. Iterative Linear-System Solvers -- 4. Multigrid Algorithms -- II Multigrid for Structured Grids -- 5. The Automug Method -- 6. Applications in Image Processing -- 7. The Black-Box Multigrid Method -- 8. The Indefinite Helmholtz Equation -- 9. Matrix-Based Semicoarsening -- III Multigrid for Semi-Structured Grids -- 10. Multigrid for Locally Refined Meshes -- IV Multigrid for Unstructured Grids -- 11. Domain Decomposition -- 12. Algebraic Multilevel Method -- 13. Conclusions -- Appendices -- A C++ Framework for Unstructured Grids -- References
|
| 653 |
|
|
|a Mathematics of Computing
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Numerical Analysis
|
| 653 |
|
|
|a Computational Mathematics and Numerical Analysis
|
| 653 |
|
|
|a Mathematics / Data processing
|
| 653 |
|
|
|a Numerical analysis
|
| 653 |
|
|
|a Applications of Mathematics
|
| 653 |
|
|
|a Mathematics
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Numerical Methods and Algorithms
|
| 028 |
5 |
0 |
|a 10.1007/978-1-4757-3726-4
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-1-4757-3726-4?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 518
|
| 520 |
|
|
|a Many important problems in applied science and engineering, such as the Navier Stokes equations in fluid dynamics, the primitive equations in global climate mod eling, the strain-stress equations in mechanics, the neutron diffusion equations in nuclear engineering, and MRIICT medical simulations, involve complicated sys tems of nonlinear partial differential equations. When discretized, such problems produce extremely large, nonlinear systems of equations, whose numerical solution is prohibitively costly in terms of time and storage. High-performance (parallel) computers and efficient (parallelizable) algorithms are clearly necessary. Three classical approaches to the solution of such systems are: Newton's method, Preconditioned Conjugate Gradients (and related Krylov-space acceleration tech niques), and multigrid methods. The first two approaches require the solution of large sparse linear systems at every iteration, which are themselves often solved by multigrid methods. Developing robust and efficient multigrid algorithms is thus of great importance. The original multigrid algorithm was developed for the Poisson equation in a square, discretized by finite differences on a uniform grid. For this model problem, multigrid exhibits extremely rapid convergence, and actually solves the problem in the minimal possible time. The original algorithm uses rediscretization of the partial differential equation (POE) on each grid in the hierarchy of coarse grids that are used. However, this approach would not work for more complicated problems, such as problems on complicated domains and nonuniform grids, problems with variable coefficients, and non symmetric and indefinite equations. In these cases, matrix-based multi grid methods are in order
|