Combined incomplete LU and strongly implicit procedure preconditioning
- Univ. of Trondheim (Norway)
For the solution of large sparse linear systems of equations, the Krylov-subspace methods have gained great merit. Their efficiency are, however, largely dependent upon preconditioning of the equation-system. A family of matrix factorisations often used for preconditioning, is obtained from a truncated Gaussian elimination, ILU(p). Less common, supposedly due to it`s restriction to certain sparsity patterns, is factorisations generated by the strongly implicit procedure (SIP). The ideas from ILU(p) and SIP are used in this paper to construct a generalized strongly implicit procedure, applicable to matrices with any sparsity pattern. The new algorithm has been run on some test equations, and efficiency improvements over ILU(p) was found.
- Research Organization:
- Front Range Scientific Computations, Inc., Lakewood, CO (United States)
- OSTI ID:
- 433358
- Report Number(s):
- CONF-9604167-Vol.1; ON: DE96015306; TRN: 97:000720-0031
- Resource Relation:
- Conference: Copper Mountain conference on iterative methods, Copper Mountain, CO (United States), 9-13 Apr 1996; Other Information: PBD: [1996]; Related Information: Is Part Of Copper Mountain conference on iterative methods: Proceedings: Volume 1; PB: 422 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
KRYSI, an ODE solver combining a semi-implicit Runge-Kutta method and a preconditioned Krylov method
Marker ReDistancing/Level Set Method for High-Fidelity Implicit Interface Tracking