Relative-error bounds for the LU decomposition via the GTH algorithm (Q1923301)
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: Relative-error bounds for the LU decomposition via the GTH algorithm |
scientific article; zbMATH DE number 932027
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relative-error bounds for the LU decomposition via the GTH algorithm |
scientific article; zbMATH DE number 932027 |
Statements
Relative-error bounds for the LU decomposition via the GTH algorithm (English)
0 references
7 October 1996
0 references
In an earlier paper, the author has shown that a modified form of Gaussian elimination for finding the steady state distribution of a finite state Markov chain has a low relative error. In this paper, he shows that the LU decomposition computed in the above-mentioned process also has a low relative error. Results of some computational experiments are also given.
0 references
numerical example
0 references
Markov chain
0 references
LU decomposition
0 references
