scientific article; zbMATH DE number 17928
From MaRDI portal
Publication:3975281
[For the entire collection see Zbl 0727.00014.] The well known facts about the modified Gram-Schmidt orthogonalization process are trivially generalized to the case of the \(M\)-norm instead of the Euclidean norm under the assumption that \(M\) is given in the form of a product \(B^ TB\), where \(B\) is an \(m\times n\) matrix of full rank. Finally, the implementation of a block version of this algorithm is presented, that is suitable for parallel architectures with hierarchical memory systems and that is again a slight generalization of a known algorithm.
Recommendations
Cited in
(10)- Ordered modified Gram-Schmidt orthogonalization revised
- Reorthogonalized block classical Gram-Schmidt
- Efficient implementations of the modified Gram-Schmidt orthogonalization with a non-standard inner product
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Orthogonalization Via Deflation: A Minimum Norm Approach for Low-Rank Approximations of a Matrix
- scientific article; zbMATH DE number 125628 (Why is no real title available?)
- Cholesky-like factorization of symmetric indefinite matrices and orthogonalization with respect to bilinear forms
- SVD-updating using orthonormal μ-rotations
- Householder Orthogonalization with a Nonstandard Inner Product
- Numerical stability of orthogonalization methods with a non-standard inner product
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3975281)