Fast implementation of partial Gram-Schmidt algorithm using tree data structure with sequential row pointers data structure to solve structural problems (PGS) (Q1334875)
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: Fast implementation of partial Gram-Schmidt algorithm using tree data structure with sequential row pointers data structure to solve structural problems (PGS) |
scientific article; zbMATH DE number 644338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast implementation of partial Gram-Schmidt algorithm using tree data structure with sequential row pointers data structure to solve structural problems (PGS) |
scientific article; zbMATH DE number 644338 |
Statements
Fast implementation of partial Gram-Schmidt algorithm using tree data structure with sequential row pointers data structure to solve structural problems (PGS) (English)
0 references
1 November 1994
0 references
Tree data structure with sequential row pointers data structure is developed and used to implement the partial Gram-Schmidt (PGS) triangulation algorithm. This algorithm is used for solving linear least squares problems where the matrix is highly sparse. The numerical results show, that in all examples PGS is not more efficient than the incomplete Givens rotations.
0 references
comparison of methods
0 references
sparse matrix
0 references
tree data structure
0 references
partial Gram- Schmidt triangulation algorithm
0 references
row pointers data structure
0 references
linear least squares problems
0 references
numerical results
0 references
incomplete Givens rotations
0 references
0.759045422077179
0 references
0.7105699777603149
0 references
0.6815299987792969
0 references
0.6774767637252808
0 references
0.6768046021461487
0 references
