Ordered modified Gram-Schmidt orthogonalization revised

DOI10.1016/0377-0427(95)00075-5MaRDI QIDQ1917854zbMATH OpenOpenAlexFDO

Authors Július Štuller

Publication date 24 February 1997

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-0427(95)00075-5

zbMATH Keywords

Gram-Schmidt algorithmordered modified Gram-Schmidt orthogonalization

Mathematics Subject Classification ID

Orthogonalization in numerical linear algebra (65F25)

Review text

\textit{B. Nour-Omid}, \textit{W. S. Dunbar} and \textit{A. D. Woodbury} [Ordered modified Gram-Schmidt orthogonalization, unpublished paper (1991)] proposed an ordered modified Gram-Schmidt algorithm, which was supposed to improve the orthogonality state of the solution. Thorough analysis, even of a simple, planar case, shows [cf. \textit{J. Štuller}, Some comments on the ordered modified Gram-Schmidt orthogonalization, Research Report No. 586, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, (1994)] that, yet in the exact arithmetic, one cannot expect to obtain -- independently of the forward, reverse, or any other type, including ``ordered, orthogonalization -- the desired solution: a vector in the orthogonal complement of the given vectors. For the planar case, some simple rules of the thumb can be given to minimize the error, but we are not sure whether they can directly be generalized to higher dimensions as has been done by Nour-Omid et al. [loc. cit.]. Naturally, in finite precision, the situation is even worse. The unique way out we see in the iterative Gram-Schmidt methods [cf. \textit{A. Björck}, Linear Algebra Appl. 197-198, 297-316 (1994; Zbl 0801.65039)] for which we [loc. cit.] presented several algorithms with different criterions of efficiency applied to.

Recommendations

• Iterative algorithms for Gram-Schmidt orthogonalization
• An approach of orthogonalization within the Gram-Schmidt algorithm
• The loss of orthogonality in the Gram-Schmidt orthogonalization process
• Numerics of Gram-Schmidt orthogonalization
• scientific article; zbMATH DE number 1439806
• A Robust Criterion for the Modified Gram--Schmidt Algorithm with Selective Reorthogonalization
• An approximate orthogonalization technique for arbitrary rectangular matrices
• When modified Gram-Schmidt generates a well-conditioned set of vectors
• scientific article; zbMATH DE number 17928
• Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm

Cites work

• Numerics of Gram-Schmidt orthogonalization
• Ordered modified Gram-Schmidt orthogonalization revised

Cited in

(8)

• Influence of iterated Gram-Schmidt orthonormalization in the asymptotic numerical method
• Ordered modified Gram-Schmidt orthogonalization revised
• Robust method for semantic segmentation of whole-slide blood cell microscopic images
• A Rank-k Update Procedure for Reorthogonalizing the Orthogonal Factor from Modified Gram--Schmidt
• When modified Gram-Schmidt generates a well-conditioned set of vectors
• Relaxed-inertial proximal point algorithms for nonconvex equilibrium problems with applications
• Strongly quasiconvex functions: what we know (so far)
• An approach of orthogonalization within the Gram-Schmidt algorithm

This page was built for publication: Ordered modified Gram-Schmidt orthogonalization revised

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917854)