✦ LIBER ✦

ILUBCG2: A preconditioned biconjugate gradient routine for the solution of linear asymmetric matrix equations arising from 9-point discretizations

✍ Scribed by A.E. Koniges; D.V. Anderson

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 386 KB
Volume: 43
Category: Article
ISSN: 0010-4655
DOI: 10.1016/0010-4655(87)90213-x

No coin nor oath required. For personal study only.

✦ Synopsis

Nature of the physical problem

Certain elliptic and parabolic partial differential equations that arise in plasma physics and other applications are solved in two dimensions. The implicit solution techniques used for these equations give rise to a system of linear equations whose matrix operator is sparse -often 9-banded -and generally asymmetric. We provide a fast algorithm for their solution.

📜 SIMILAR VOLUMES

ILUCG2: Subprograms for the solution of

ILUCG2: Subprograms for the solution of a linear asymmetric matrix equation arising from a 9-point discretization

✍ 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

ICCG2: Subprograms for the solution of a linear symmetric matrix equation arising from a 9-point discretization

✍ 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

ILUCG3: Subprograms for the solution of

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

✍ D.V. Anderson 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 616 KB

ICCG3: Subprograms for the solution of a

ICCG3: Subprograms for the solution of a linear symmetric matrix equation arising from A 7, 15, 19 or 27 point 3d discretization

✍ 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