Evaluation of the efficiency of the partially solving method (PSM) in comparison with the Gaussian elimination method (Q1275852)
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: Evaluation of the efficiency of the partially solving method (PSM) in comparison with the Gaussian elimination method |
scientific article; zbMATH DE number 1239889
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Evaluation of the efficiency of the partially solving method (PSM) in comparison with the Gaussian elimination method |
scientific article; zbMATH DE number 1239889 |
Statements
Evaluation of the efficiency of the partially solving method (PSM) in comparison with the Gaussian elimination method (English)
0 references
9 March 1999
0 references
Recently, the authors have studied a new method (partially solving method, or PSM) for solving linear algebraic non-singular systems \(Ax= b\) which deals with one subsystem at each processing style and is suitable for large sparse systems. In this paper, the efficiency of PSM is investigated as a function of the size and sparsity of the system. A comparison is made with the standard Gaussian elimination method.
0 references
computational efficiency
0 references
partially solving method
0 references
large sparse systems
0 references
comparison
0 references
Gaussian elimination method
0 references
0.8988242
0 references
0.8580264
0 references
0.84870374
0 references
0.8346123
0 references
0.83359087
0 references
0.83265543
0 references
0.83097154
0 references
0.8263551
0 references
