ILU factorization well suited to the vector processor using a variant of the 5-point difference scheme

DOI10.1016/0010-4655(94)00152-RzbMath0873.65022OpenAlexW2052125291MaRDI QIDQ1359835

Seiji Fujino, Toshiki Takeuchi

Publication date: 30 October 1997

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0010-4655(94)00152-r

zbMATH Keywords

convergencenumerical examplesdifference schemepreconditioned conjugate gradient methodincomplete LU factorization

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Finite difference methods for boundary value problems involving PDEs (65N06)

Cites Work

• A finite difference Galerkin formulation for the incompressible Navier- Stokes equations
• Performance of hyperplane ordering on vector computers
• A fully vectorizable SOR variant
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• A class of first order factorization methods