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

DOI10.2307/2005398zbMath0345.65021OpenAlexW4240893730MaRDI QIDQ4114699

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

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

Numerical computation of matrix norms, conditioning, scaling (65F35) Orthogonalization in numerical linear algebra (65F25) Algorithms in computer science (68W99)

Related Items

A modified Gram--Schmidt-based downdating technique for ULV decompositions with applications to recursive TLS problems, Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration, Adaptive cross approximation for ill-posed problems, Implementations of the GMRES method, Rank-\(k\) modification methods for recursive least squares problems, Projected nonstationary iterated Tikhonov regularization, Tuning strategy for the proximity parameter in convex minimization, SVD update methods for large matrices and applications, An efficient bounded-variable nonlinear least-squares algorithm for embedded MPC, On the choice of solution subspace for nonstationary iterated Tikhonov regularization, Two-way bidiagonalization scheme for downdating the singular-value decomposition, New methods for adapting and for approximating inverses as preconditioners, Mixed forward-backward stability of the two-level orthogonal Arnoldi method for quadratic problems, Parameter determination for Tikhonov regularization problems in general form, A Gauss-Newton iteration for total least squares problems, A note on the error analysis of classical Gram-Schmidt, Minimizing the tracking error of cardinality constrained portfolios, Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems, The stable computation of formal orthogonal polynomials, Accurate downdating of a modified Gram-Schmidt QR decomposition, Iterative algorithms for Gram-Schmidt orthogonalization, The implicit application of a rational filter in the RKS method, Finding leading modes of a viscous free surface flow: An asymmetric generalized eigenproblem, 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 block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems, Updating QR factorization procedure for solution of linear least squares problem with equality constraints, A dual projective simplex method for linear programming, Modifying the generalized singular value decomposition with application in direction-of-arrival finding, Test procedures and test problems for least squares algorithms, On the choice of subspace for large-scale Tikhonov regularization problems in general form, An improved algorithm for the computation of structural invariants of a system pencil and related geometric aspects, An iterative method for Tikhonov regularization with a general linear regularization operator, Incremental complete LDA for face recognition, A mathematical biography of Danny C. Sorensen, Large-scale Tikhonov regularization via reduction by orthogonal projection, Reorthogonalized block classical Gram-Schmidt, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Tikhonov regularization via flexible Arnoldi reduction, Searching for a best least absolute deviations solution of an overdetermined system of linear equations motivated by searching for a best least absolute deviations hyperplane on the basis of given data, A spectrum slicing method for the Kohn-Sham problem, Recursive approximation of the dominant eigenspace of an indefinite matrix, Parallel solution of large-scale eigenvalue problem for master equation in protein folding dynamics, On the orthogonal factorization and its updating in band-structured matrix computations, Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction, The fast recursive row-Householder subspace tracking algorithm, A fast algorithm for clusterwise linear regression, On optimizing Jacobi-Davidson method for calculating eigenvalues in low dimensional structures using eight band \(\mathbf{k}\cdot\mathbf{p}\) model, Block Krylov-Schur method for large symmetric eigenvalue problems, Some greedy algorithms for sparse polynomial chaos expansions, A parallel subdomain by subdomain implementation of the implicitly restarted Arnoldi/Lanczos method, 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, GMRES with embedded ensemble propagation for the efficient solution of parametric linear systems in uncertainty quantification of computational models, Efficient recursive least squares solver for rank-deficient matrices, Variations on the Gram--Schmidt and the Huang algorithms for linear systems: A numerical study, On the choice of regularization matrix for an \(\ell_2\)-\(\ell_q\) minimization method for image restoration, A numerically stable dual method for solving strictly convex quadratic programs, An \(\ell^2\)-\(\ell^q\) regularization method for large discrete ill-posed problems, Deflated block Krylov subspace methods for large scale eigenvalue problems, Order reduction of bilinear MIMO dynamical systems using new block Krylov subspaces, A massively-parallel electronic-structure calculations based on real-space density functional theory, A range-space implementation for large quadratic programs with small active sets, An approach of orthogonalization within the Gram-Schmidt algorithm, A spectral scheme for Kohn-Sham density functional theory of clusters, A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes, Clusterwise linear regression, Detecting a hyperbolic quadratic eigenvalue problem by using a subspace algorithm, Solution of linear least squares via the ABS algorithm, Approximation of matrix operators applied to multiple vectors, A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization, Block RLS using row Householder reflections, About Henrici's transformation for accelerating vector sequences, A key to choose subspace size in implicitly restarted Arnoldi method, The Householder compressor theorem and its application in subspace tracking, An \(\ell^p\)-\(\ell^q\) minimization method with cross-validation for the restoration of impulse noise contaminated images, Fast alternating direction multipliers method by generalized Krylov subspaces, The numerically stable reconstruction of Jacobi matrices from spectral data, Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class, Accelerating the regularized decomposition method for two stage stochastic linear problems, An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems, Block Gram-Schmidt algorithms and their stability properties, A subspace SQP method for equality constrained optimization, Sparse radial basis function approximation with spatially variable shape parameters, A comparison of parameter choice rules for \(\ell^p\)-\(\ell^q\) minimization, Numerical aspects of Gram-Schmidt orthogonalization of vectors, Restrictions on implicit filtering techniques for orthogonal projection methods, 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, The trace minimization method for the symmetric generalized eigenvalue problem, ABS algorithms for linear equations and optimization, 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, Numerics of Gram-Schmidt orthogonalization, Sensitivity method for basis inverse representation in multistage stochastic linear programming problems, The loss of orthogonality in the Gram-Schmidt orthogonalization process, A new technique for determining coupled modes of structure-acoustic systems, Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices, A regularized decomposition method for minimizing a sum of polyhedral functions, On Efficiently Computing the Eigenvalues of Limited-Memory Quasi-Newton Matrices, Gram-Schmidt orthogonalization: 100 years and more, A subspace version of the Wang-Yuan augmented Lagrangian-trust region method for equality constrained optimization, Limited memory restarted \(\ell^p\)-\(\ell^q\) minimization methods using generalized Krylov subspaces, Some numerical aspects of Arnoldi-Tikhonov regularization, A distributed block Chebyshev-Davidson algorithm for parallel spectral clustering, A Gauss-Newton method for mixed least squares-total least squares problems, Deflated and restarted Krylov subspace methods for Sylvester tensor equations, Quaternions in Collective Dynamics, Modulus-based iterative methods for constrained ℓ _p – ℓ _q minimization, GMRES algorithms over 35 years, Robust Multisecant Quasi-Newton Variants for Parallel Fluid-Structure Simulations---and Other Multiphysics Applications, On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems, Projected Newton method for noise constrained ℓ _p regularization, On restarting the Arnoldi method for large nonsymmetric eigenvalue problems, A geometric approach to subspace updates and orthogonal matrix decompositions under rank-one modifications, Modifiable low-rank approximation to a matrix, Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques, Rounding error analysis of the classical Gram-Schmidt orthogonalization process, Constructing a speculative kernel machine for pattern classification, A weighted gram-schmidt method for convex quadratic programming, 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, Regularization of nonlinear ill-posed problems by exponential integrators, Compact Two-Sided Krylov Methods for Nonlinear Eigenvalue Problems, A subspace implementation of quasi-Newton trust region methods for unconstrained optimization, Stability Analysis of the Two-level Orthogonal Arnoldi Procedure, On QR factorization updatings, A DEIM Induced CUR Factorization, A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems, A stable method for solving certain constrained least squares problems, Randomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector Operations, The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software, Three new algorithms based on the sequential secant method, A comparison of algorithms for forming the QR decomposition for use in regression, An algorithm for hierarchical optimization of large-scale problems with nested structure, Initial Guesses for Sequences of Linear Systems in a GPU-Accelerated Incompressible Flow Solver, Improved Gram-Schmidt type downdating methods, Hybrid projection methods for large-scale inverse problems with mixed Gaussian priors, Efficient Krylov Subspace Techniques for Model Order Reduction of Automotive Structures in Vibroacoustic Applications