Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization

DOI10.2307/2005398zbMath0345.65021MaRDI QIDQ4114699

G. W. Stewart, Linda Kaufman, William B. Gragg, James W. Daniel

Publication date: 1976

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2005398

Mathematics Subject Classification ID

65F35: Numerical computation of matrix norms, conditioning, scaling

65F25: Orthogonalization in numerical linear algebra

68W99: Algorithms in computer science

Related Items

Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques, An algorithm for hierarchical optimization of large-scale problems with nested structure, On restarting the Arnoldi method for large nonsymmetric eigenvalue problems, A numerically stable dual method for solving strictly convex quadratic programs, Variations on the Gram--Schmidt and the Huang algorithms for linear systems: A numerical study, The numerically stable reconstruction of Jacobi matrices from spectral data, The loss of orthogonality in the Gram-Schmidt orthogonalization process, A note on the error analysis of classical Gram-Schmidt, Numerical aspects of Gram-Schmidt orthogonalization of vectors, Computing the CS decomposition of a partitioned orthonormal matrix, The strict Chebyshev solution of overdetermined systems of linear equations with rank deficient matrix, Up- and down-dating procedures for linear \(L_ 1\) regression, Iterative algorithms for Gram-Schmidt orthogonalization, Finding leading modes of a viscous free surface flow: An asymmetric generalized eigenproblem, A dual projective simplex method for linear programming, Test procedures and test problems for least squares algorithms, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, On the orthogonal factorization and its updating in band-structured matrix computations, A fast algorithm for clusterwise linear regression, A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes, Clusterwise linear regression, Block RLS using row Householder reflections, About Henrici's transformation for accelerating vector sequences, Accelerating the regularized decomposition method for two stage stochastic linear problems, Restrictions on implicit filtering techniques for orthogonal projection methods, Numerics of Gram-Schmidt orthogonalization, Sensitivity method for basis inverse representation in multistage stochastic linear programming problems, Implementations of the GMRES method, Rank-\(k\) modification methods for recursive least squares problems, New methods for adapting and for approximating inverses as preconditioners, Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems, The implicit application of a rational filter in the RKS method, Modifying the generalized singular value decomposition with application in direction-of-arrival finding, An improved algorithm for the computation of structural invariants of a system pencil and related geometric aspects, The trace minimization method for the symmetric generalized eigenvalue problem, ABS algorithms for linear equations and optimization, Solution of linear least squares via the ABS algorithm, Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class, An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems, One-sided reduction to bidiagonal form, Numerical integration of the time-dependent Schrödinger equation for laser-driven helium, Enriched Krylov subspace methods for ill-posed problems, A modified Gram--Schmidt-based downdating technique for ULV decompositions with applications to recursive TLS problems, Two-way bidiagonalization scheme for downdating the singular-value decomposition, The stable computation of formal orthogonal polynomials, Accurate downdating of a modified Gram-Schmidt QR decomposition, Model reduction of state space systems via an implicitly restarted Lanczos method, An adaptive block Lanczos algorithm, Solution of large eigenvalue problems in electronic structure calculations, A projective simplex algorithm using LU decomposition, The influence of orthogonality on the Arnoldi method, A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting, A range-space implementation for large quadratic programs with small active sets, Tuning strategy for the proximity parameter in convex minimization, Rounding error analysis of the classical Gram-Schmidt orthogonalization process, Constructing a speculative kernel machine for pattern classification, A periodic Krylov-Schur algorithm for large matrix products, A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices, Diffusion wavelets, A subspace implementation of quasi-Newton trust region methods for unconstrained optimization, A comparison of algorithms for forming the QR decomposition for use in regression, Improved Gram-Schmidt type downdating methods, A weighted gram-schmidt method for convex quadratic programming, On QR factorization updatings, A regularized decomposition method for minimizing a sum of polyhedral functions, Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices, A stable method for solving certain constrained least squares problems, Three new algorithms based on the sequential secant method