Numerical aspects of Gram-Schmidt orthogonalization of vectors

DOI10.1016/0024-3795(83)80037-8zbMath0515.65036OpenAlexW2023019467MaRDI QIDQ1052042

Axel Ruhe

Publication date: 1983

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(83)80037-8

zbMATH Keywords

eigenvaluesGram-Schmidt orthogonalizationKrylov subspaceoblique projectionsbiorthogonalizationGauss-Jacobi and Gauss-Seidel iterations

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonalization in numerical linear algebra (65F25)

Related Items (25)

A LATIN-based model reduction approach for the simulation of cycling damage ⋮ An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A ⋮ On the modified Gram-Schmidt algorithm for weighted and constrained linear least squares problems ⋮ Analysis of the effects of a pulsed electromagnetic field on the dynamic response of electrically conductive composites ⋮ Iterative algorithms for Gram-Schmidt orthogonalization ⋮ Gram-Schmidt orthogonalization: 100 years and more ⋮ Methods and algorithms of solving spectral problems for polynomial and rational matrices ⋮ Conjugate gradients acceleration of coordinate descent for linear systems ⋮ On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems ⋮ On the loss of orthogonality in the second-order Arnoldi process ⋮ Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices ⋮ A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting ⋮ A multi-temporal scale model reduction approach for the computation of fatigue damage ⋮ Order reduction of bilinear MIMO dynamical systems using new block Krylov subspaces ⋮ A new randomized Gauss-Seidel method for solving linear least-squares problems ⋮ Recursive interpolation algorithm: A formalism for solving systems of linear equations. I: Direct methods ⋮ Interpreting linear systems of equalities and inequalities. Application to the water supply problem ⋮ Coupling non-conforming discretizations of PDEs by spectral approximation of the Lagrange multiplier space ⋮ Gauss-Seidel method with oblique direction ⋮ Block Gram-Schmidt algorithms and their stability properties ⋮ Improved Gram-Schmidt type downdating methods ⋮ Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian ⋮ One-sided reduction to bidiagonal form ⋮ Randomized Gram--Schmidt Process with Application to GMRES ⋮ Numerics of Gram-Schmidt orthogonalization

Uses Software

• LINPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• A machine independent algorithm for computing percentage points of the \(\chi^2\)-distribution
• Numerical methods for solving linear least squares problems
• The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
• The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• Iterative refinement of linear least squares solutions II
• Solving linear least squares problems by Gram-Schmidt orthogonalization

This page was built for publication: Numerical aspects of Gram-Schmidt orthogonalization of vectors