Fast implementation of partial Gram-Schmidt algorithm using tree data structure with sequential row pointers data structure to solve structural problems (PGS)
DOI10.1016/0965-9978(93)90067-4zbMATH Open0807.65036OpenAlexW2059028966WikidataQ111898557 ScholiaQ111898557MaRDI QIDQ1334875FDOQ1334875
Authors: Manzur Ali Ajiz, Mansoor Al-A'Ali, Mohd Mustafa Hamed 
Publication date: 1 November 1994
Published in: Advances in Engineering Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0965-9978(93)90067-4
Recommendations
- Fast dynamic multilayer data structure to implement Gram-Schmidt orthogonalization algorithm (FDM)
- A Data Structure for Sparse $QR$ and $LU$ Factorizations
- Tree organization of the data structure for Cholesky factorization
- A fast pointer-based solver for simultaneous linear equations
- Parallel algorithms for sparse triangular system solution
numerical resultssparse matrixcomparison of methodstree data structurelinear least squares problemsincomplete Givens rotationspartial Gram- Schmidt triangulation algorithmrow pointers data structure
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
This page was built for publication: Fast implementation of partial Gram-Schmidt algorithm using tree data structure with sequential row pointers data structure to solve structural problems (PGS)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334875)
