๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

ILUCG3: Subprograms for the solution of a linear asymmetric matrix equation arising from a 7, 15, 19 or 27 point 3D discretization

โœ Scribed by D.V. Anderson


Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
79 KB
Volume
35
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

โœฆ Synopsis


Title of program: ILUCG3 (Incomplete LU factorized Conjugate Gradient algorithm for 3D asymmetric problems)


๐Ÿ“œ SIMILAR VOLUMES


ICCG3: Subprograms for the solution of a
โœ D.V. Anderson ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 605 KB

Title of program: ICCG3 (Incomplete Cholesky factorized Con-treated by similar methods in two dimensions using the codes jugate Gradient algorithm for 3D symmetric problems) ICCG2 [4] and ILUCG2 [5]. These problems share the common feature of being stiff and requiring implicit solution Catalogue num

ILUCG2: Subprograms for the solution of
โœ A.I. Shestakov; D.V. Anderson ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 485 KB

Title of program: ILUCG2 (Incomplete LU factorized Con-being stiff and requiring implicit solution techniques. Generjugate Gradient algorithm for 2D problems) ally, the resulting matrix equations are asymmetric; we solve them here with the ILUCG2 program. In a subsequent article Catalogue number: AC

ICCG2: Subprograms for the solution of a
โœ D.V. Anderson; A.I. Shestakov ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 477 KB

Title ofprogram: ICCG2 (Incomplete Cholesky factorized Con-being stiff and requiring implicit solution techniques. Somejugate Gradient algorithm for 2D symmetric problems) times, the resulting matrix equations are symmetric; we solve them here with the ICCG2 coding. In a previous article we Catalogu