✦ LIBER ✦

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

✍ Scribed by D.V. Anderson; A.I. Shestakov

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 477 KB
Volume: 30
Category: Article
ISSN: 0010-4655
DOI: 10.1016/0010-4655(83)90120-0

No coin nor oath required. For personal study only.

✦ Synopsis

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 Catalogue number: ACEV described a slower more general algorithm, ILUCG2, which must be used when the matrix is asymmetric [4].

📜 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

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

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

ILUBCG2: A preconditioned biconjugate gr

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

✍ A.E. Koniges; D.V. Anderson 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 386 KB

## 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 operato

A program for the solution of ill-posed

A program for the solution of ill-posed linear systems arising from the discretization of the Fredholm integral equation of the first kind

✍ Nabih N. Abdelmalek 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 593 KB

A computer program written in FORTRAN IV for obtaining smooth solutions of ill-posed systems of linear equations arising from the discretization of the Fredholm integral equation of the first kind is given. It is based on a novel algorithm by the author. The algorithm is iterative using linear progr

Iterative solution of linear systems ari

Iterative solution of linear systems arising from the Nyström method for the double-layer potential equation over curves with corners

✍ A. Rathsfeld 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 513 KB

## Abstract In this paper we consider a quadrature method for the solution of the double‐layer potential equation corresponding to Laplace's equation in a polygonal domain. We prove the stability for our method in case of special triangulations over the boundary of the polygon. For the solution of