Analysis of incomplete matrix factorizations as multigrid smoothers for vector and parallel computers
Conference
·
· Appl. Math. Comput.; (United States)
OSTI ID:5606455
The cost of smoothing is usually a major expense in multigrid codes. Efficient vectorizable and parallelizable versions of incomplete block-matrix factorization methods used as smoothers for multigrid methods are discussed in this paper. The methods are particularly interesting for computers with parallel processors with pipelines, because both multitasking with little overhead and vectorization can be achieved. 21 references.
- OSTI ID:
- 5606455
- Report Number(s):
- CONF-8503293-
- Conference Information:
- Journal Name: Appl. Math. Comput.; (United States) Journal Volume: 19
- Country of Publication:
- United States
- Language:
- English
Similar Records
Multigrid Smoothers for Ultra-Parallel Computing: Additional Theory and Discussion
Implementation of iterative methods for large sparse nonsymmetric linear systems on a parallel vector machine
Stable parallel elimination for boundary valve ODEs
Technical Report
·
Tue Jun 14 00:00:00 EDT 2011
·
OSTI ID:1122232
Implementation of iterative methods for large sparse nonsymmetric linear systems on a parallel vector machine
Journal Article
·
Sun Dec 31 23:00:00 EST 1989
· International Journal of Supercomputer Applications; (United States)
·
OSTI ID:5001594
Stable parallel elimination for boundary valve ODEs
Technical Report
·
Sun Mar 31 23:00:00 EST 1991
·
OSTI ID:10189186