Approximate factorizations with S/P consistently ordered M-factors (Q1263235): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q114233895, #quickstatements; #temporary_batch_1712261475387 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114233895 / rank | |||
Normal rank | |||
Revision as of 22:35, 4 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate factorizations with S/P consistently ordered M-factors |
scientific article |
Statements
Approximate factorizations with S/P consistently ordered M-factors (English)
0 references
1989
0 references
When the triangular factors are ``S/P consistently ordered'' M-matrices than the behavior of a modified incomplete factorization for positive definite linear systems is predictable if nonstrict-diagonal dominance is given. Quasi-singular problems can also be solved at the same speed as regular ones. Numerical examples are presented.
0 references
S/P consistently ordered M-matrices
0 references
incomplete factorization
0 references
positive definite linear systems
0 references
nonstrict-diagonal dominance
0 references
Quasi-singular problems
0 references
Numerical examples
0 references
