The application of the preconditioned biconjugate gradient algorithm to NLTE rate matrix equations (Q1201048)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The application of the preconditioned biconjugate gradient algorithm to NLTE rate matrix equations |
scientific article; zbMATH DE number 97174
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The application of the preconditioned biconjugate gradient algorithm to NLTE rate matrix equations |
scientific article; zbMATH DE number 97174 |
Statements
The application of the preconditioned biconjugate gradient algorithm to NLTE rate matrix equations (English)
0 references
17 January 1993
0 references
The solution of the system of ordinary differential equations (1) \(\partial u/\partial t=R\cdot u\) where \(u\in \mathbb{R}^ N\), \(R\) is a (time dependent) rate matrix, is considered with \(N\) very large (e.g. \(N\sim 1000)\). In equation (1) \(R\) is linearized about \(u\) and the resulting linear problem is solved with a simple one-step difference equation. The preconditioned biconjugate gradient algorithm and its variant, the preconditioned conjugate gradient squared algorithm, are applied to the linear system arising from a simple backward Euler differencing of (1). It is found that the iterations were rapidly convergent when (1) describes nonlocal thermal equilibria (NLTE) problems.
0 references
nonlinear system
0 references
matrix differential equation
0 references
convergence
0 references
iterative method
0 references
preconditioned conjugate gradient squared algorithm
0 references
backward Euler differencing
0 references
nonlocal thermal equilibria
0 references
0 references
0 references
0 references
0 references