Rehabilitation of the Gauss-Jordan algorithm (Q1120248): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Walter Hoffmann / rank | |||
Property / author | |||
Property / author: Walter Hoffmann / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: LINPACK / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: NUMVEC / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monitoring the numerical stability of Gaussian elimination / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3932291 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5185900 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving linear systems on a vector computer / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the stability of Gauss-Jordan elimination with pivoting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4057472 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:18, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rehabilitation of the Gauss-Jordan algorithm |
scientific article |
Statements
Rehabilitation of the Gauss-Jordan algorithm (English)
0 references
1989
0 references
By using vector and parallel computers, a number of algorithms may have a renewed interest. In this paper, the Gauss-Jordan algorithm with column interchanges is analyzed. It is shown that by using the Gauss-Jordan algorithm with column interchanges, a more satisfactory bound for the residual norm can be given. The presented error analysis gives a theoretical evidence that this algorithm yields numerical solutions as good as those obtained by Gauss elimination. Furthermore, the residual of the obtained solution is not larger than that corresponding to the Gauss elimination's solution. For demonstrating that the error and the residual are satisfactory, some computer results are presented. Some results of experiments on a Cyber 205 vector computer are gathered to show that the Gauss-Jordan algorithm is not slower than the Gauss elimination for systems of order up to 25, although for its realization, about 1,5 times work is required.
0 references
vector and parallel computers
0 references
Gauss-Jordan algorithm
0 references
error analysis
0 references
Gauss elimination
0 references
computer results
0 references