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-4zbMath0807.65036OpenAlexW2059028966WikidataQ111898557 ScholiaQ111898557MaRDI QIDQ1334875

Mohd Mustafa Hamed, Manzur Ali Ajiz, Mansoor Al-A'Ali

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

zbMATH Keywords

comparison of methodsnumerical resultssparse matrixtree data structurelinear least squares problemsincomplete Givens rotationspartial Gram- Schmidt triangulation algorithmrow pointers data structure

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

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)