Evaluation of the efficiency of the partially solving method (PSM) in comparison with the Gaussian elimination method (Q1275852): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5571270 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new efficient solution method for a system of linear equations: Partially Solving Method (PSM) / rank | |||
Normal rank | |||
Revision as of 17:05, 28 May 2024
scientific article
| 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 |
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
