Final Report, DE-FG01-06ER25718 Domain Decomposition and Parallel Computing
- New York Univ. (NYU), NY (United States). Courant Inst.
The goal of this project is to develop and improve domain decomposition algorithms for a variety of partial differential equations such as those of linear elasticity and electro-magnetics.These iterative methods are designed for massively parallel computing systems and allow the fast solution of the very large systems of algebraic equations that arise in large scale and complicated simulations. A special emphasis is placed on problems arising from Maxwell's equation. The approximate solvers, the preconditioners, are combined with the conjugate gradient method and must always include a solver of a coarse model in order to have a performance which is independent of the number of processors used in the computer simulation. A recent development allows for an adaptive construction of this coarse component of the preconditioner.
- Research Organization:
- New York Univ. (NYU), NY (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC)
- DOE Contract Number:
- FG02-06ER25718
- OSTI ID:
- 1183895
- Report Number(s):
- DOE-NYU-25718
- Country of Publication:
- United States
- Language:
- English
Similar Records
On the Degradation of the Effectiveness of Nonlinear Diffusion Acceleration with Parallel Block Jacobi Splitting
A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation