Next:
List of Figures
Up:
Guide 5 Solution of Linear Systems
Prev:
Preface
Contents
Preface
List of Figures
Part I: General
1 Solution of linear systems
1.1 Introduction
1.2 Solution by a direct method
1.2.1 Introduction
1.2.2 The MUA data structure
Contents
Example 1: Symmetric matrix
Example 2: Non-symmetric matrix
1.2.3 The B data structure
Contents
1.3 Solution by an iterative method
1.3.1 Introduction
1.3.2 The AMAT data structure
Contents
Example 1: Diagonal matrix in M.M.
Example 2: Symmetric matrix in M.M.
Example 3: Non-symmetric matrix in M.M.
1.4 Solution by domain decomposition
1.5 Correspondence: operator-module
Part II: The modules
1 Direct methods
1.1 Introduction
1.2 The modules
1.2.1 ASEMBV: assembly of B
1.2.2 ASMAPS: assembly of MUA
1.2.3 ASMBMS: assembly of B
1.2.4 ASSMUA: assembly of MUA
1.2.5 CHOLPC: Cholesky factorization
1.2.6 CHOLPS: Cholesky factorization in secondary memory
1.2.7 CLIMPC: boundary conditions
1.2.8 CLIMPS: boundary conditions
1.2.9 CONDL1: construction of NDL1
1.2.10 CROUPC: Crout factorization
1.2.11 DRCHPC: Cholesky forward- and backsubstitution
1.2.12 DRCRPC: Crout forward- and backsubstitution
1.2.13 DRGAPC: Gauss forward- and backsubstitution
1.2.14 FRONT: frontal method
1.2.15 GAUSPC: Gauss factorization
1.2.16 PREPAC: computation of pointers for MUA
1.2.17 PREPAF: computation of pointers for the frontal method
1.3 The algorithms
1.3.1 List of programs
2 Iterative methods
2.1 The modules
2.1.1 ASEMBV: assembly of B
2.1.2 ASSAMA: assembly of AMAT
2.1.3 CLIMGC: boundary conditions
2.1.4 CONDLU: incomplete Gauss factorization
2.1.5 CONDL1: construction of NDL1
2.1.6 CSAMAT: construction of AMAT from MUA
2.1.7 DGRADA: double conjugate gradient
2.1.8 FANIGC: incomplete Cholesky-Crout factorization
2.1.9 GCDIAG: preconditioned conjugate gradient
2.1.10 ICHRGC: preconditioned conjugate gradient
2.1.11 PREPGC: computation of pointers for AMAT
2.1.12 SIMPGC: non-preconditioned conjugate gradient
2.1.13 SSORGC: preconditioned conjugate gradient
2.2 The algorithms
2.2.1 List of programs
3 The domain decomposition method
3.1 Introduction
3.2 The modules
3.2.1 PRSDOM
3.2.2 SDOMVD
3.2.3 SDOMVR
4 Utilities
4.1 AMATB
4.2 AMAT2
4.3 CCAMAT
4.4 CCMUA
4.5 CONDL1
4.6 CSAMAT
4.7 ELVOIS
4.8 IMAMAT
4.9 IMB
4.10 IMMUA
4.11 MUABPC
4.12 MUA2PC
4.13 SDB2MC
4.14 SDB2MS
4.15 TAMMUA
4.16 TAVOIS
Part III: Utilization examples
1 Examples
1.1 Introduction
1.2 The symmetric model problem
1.2.1 Solution by Cholesky in main memory
1.2.2 Solution by Crout in main memory
1.2.3 Solution by Cholesky in secondary memory
1.2.4 Solution by frontal Cholesky
1.2.5 Solution by Conjugate Gradient
1.3 The non-symmetric model problem
1.3.1 Solution by the Gauss method
1.3.2 Solution by Conjugate Gradient
References
Next:
List of Figures
Up:
Guide 5 Solution of Linear Systems
Prev:
Preface