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
On the geometry of symplectic pencils arising from discrete-time matrix equations
โ Scribed by Nevio Carpanese
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 101 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0167-6911
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper general symplectic matrix pencils are considered disregarding the particular matrix equations from which they arise. A parameterization of the Lagrangian de ating subspaces is given with the only assumption of regularity of the matrix pencil.
๐ SIMILAR VOLUMES
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
## 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
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