Evaluation of the efficiency of the partially solving method (PSM) in comparison with the Gaussian elimination method (Q1275852): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf03167321 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1977293591 / rank | |||
Normal rank |
Latest revision as of 09:59, 30 July 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