Results on the effect of orderings on SSOR and ILU preconditionings
It is known that for SSOR and ILU preconditionings for solving systems of linear equations, orderings can have an enormous impact on robustness, convergence rate and parallelism. Unfortunately, it has been observed that there is an inverse relation between the convergence rate and the parallelism of typical orderings used in practice. This paper presents some numerical experiments with simple matrices to illustrate this behavior as well as a new theoretical result which sheds some light on this phenomenon and also gives an upper bound on the convergence rate of a number of preconditioners in popular use.
- Research Organization:
- Los Alamos National Lab., NM (US)
- Sponsoring Organization:
- USDOE Assistant Secretary for Management and Administration, Washington, DC (US)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 348916
- Report Number(s):
- LA-UR--98-3841; ON: DE99002488
- Country of Publication:
- United States
- Language:
- English
Similar Records
Preconditioning with a decoupled rowwise ordering on the CM-5
The SSOR preconditioned conjugate-gradient method on parallel computers
Preconditioned least‐squares Petrov–Galerkin reduced order models
Conference
·
Thu Nov 30 23:00:00 EST 1995
·
OSTI ID:125556
The SSOR preconditioned conjugate-gradient method on parallel computers
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6473075
Preconditioned least‐squares Petrov–Galerkin reduced order models
Journal Article
·
Wed Jun 29 00:00:00 EDT 2022
· International Journal for Numerical Methods in Engineering
·
OSTI ID:1886405