Solving linear least squares problems by Gram-Schmidt orthogonalization
From MaRDI portal
Publication:5574335
DOI10.1007/BF01934122zbMath0183.17802MaRDI QIDQ5574335
Publication date: 1967
Published in: BIT (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement ⋮ Sparse reduced-rank regression for simultaneous rank and variable selection via manifold optimization ⋮ As good as GOLD: Gram-Schmidt orthogonalization by another name ⋮ Rank-\(k\) modification methods for recursive least squares problems ⋮ Unnamed Item ⋮ Experiments on orthogonalization by biorthogonal representations of orthogonal projectors ⋮ Solution of augmented linear systems using orthogonal factorizations ⋮ Backward error analysis of the shift-and-invert Arnoldi algorithm ⋮ Deflation-accelerated preconditioning of the Poisson-Neumann Schur problem on long domains with a high-order discontinuous element-based collocation method ⋮ Some comments on the solution of linear equations ⋮ Error analysis of algorithms for computing the projection of a point onto a linear manifold ⋮ Unnamed Item ⋮ On Stable Calculation of Linear Functionals ⋮ Numerical stability of GMRES ⋮ A note on the error analysis of classical Gram-Schmidt ⋮ Note on a splitting approach to ill-conditioned least squares problems ⋮ Sparse linear problems and the least squares method ⋮ Algebraic and numerical techniques for the computation of matrix determinants ⋮ Computer Solution and Perturbation Analysis of Generalized Linear Least Squares Problems ⋮ Numerical behaviour of the modified Gram-Schmidt GMRES implementation ⋮ Accurate downdating of a modified Gram-Schmidt QR decomposition ⋮ Iterative algorithms for Gram-Schmidt orthogonalization ⋮ Gram-Schmidt orthogonalization: 100 years and more ⋮ New interpretation of related Huang's methods ⋮ On accurate stress calculation in static and dynamic problems using the natural factor approach ⋮ Non-linear systems identification using radial basis functions ⋮ Neural networks for nonlinear dynamic system modelling and identification ⋮ Practical identification of NARMAX models using radial basis functions ⋮ Test procedures and test problems for least squares algorithms ⋮ Experiments on Error Growth Associated with Some Linear Least-Squares Procedures ⋮ A Note on Inexact Inner Products in GMRES ⋮ Round off error analysis for Gram-Schmidt method and solution of linear least squares problems ⋮ Simultaneous equations estimation. Computational aspects ⋮ Computational methods of linear algebra ⋮ On the loss of orthogonality in the second-order Arnoldi process ⋮ Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems ⋮ A combined direct-iterative approach for solving large scale singular and rectangular consistent systems of linear equations ⋮ GMRES algorithms over 35 years ⋮ Accuracy of preconditioned CG-type methods for least squares problems. ⋮ Perturbation theory for pseudo-inverses ⋮ Comparison of two pivotal strategies in sparse plane rotations ⋮ Reduction of multivariate mixtures and its applications ⋮ On the computation of derivatives within LD factorization of parametrized matrices ⋮ A general approach for designing the MWGS-based information-form Kalman filtering methods ⋮ A note on the modified gram-schmidt process ⋮ The influence of orthogonality on the Arnoldi method ⋮ A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting ⋮ Some Results on Sparse Matrices ⋮ Equilibration of matrices to optimize backward numerical stability ⋮ The geometry of the set of scaled projections ⋮ Gram-Schmidt algorithms for covariance propagation† ⋮ Solution of two-point boundary value problems involving Kronecker products ⋮ Numerical stability of orthogonalization methods with a non-standard inner product ⋮ Analysis of the self projected matching pursuit algorithm ⋮ Rounding error analysis of the classical Gram-Schmidt orthogonalization process ⋮ A new stable bidiagonal reduction algorithm ⋮ On the solution of the linear least squares problems and pseudo-inverses ⋮ Iterative refinement implies numerical stability ⋮ On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ Stability Analysis of the Two-level Orthogonal Arnoldi Procedure ⋮ An approach of orthogonalization within the Gram-Schmidt algorithm ⋮ A numerical procedure for computing the Moore-Penrose inverse ⋮ An efficient and stable Lagrangian matrix approach to Abel integral and integro-differential equations ⋮ Solution of linear least squares via the ABS algorithm ⋮ Class-Incremental Generalized Discriminant Analysis ⋮ The Stability of Block Variants of Classical Gram--Schmidt ⋮ Stability of general systems of linear equations ⋮ A simple and efficient method for variable ranking according to their usefulness for learning ⋮ Solving the linear least squares problem with very high relative accuracy ⋮ A direct error analysis for least squares ⋮ The numerical stability of the lattice algorithm for least squares linear prediction problems ⋮ On the use of generalized inverses in function minimization ⋮ Stability analysis of the method of seminormal equations for linear least squares problems ⋮ On two direct methods for computing generalized inverses ⋮ Modified gram-schmidt process vs. classical gram-schmidt ⋮ Extended model set, global data and threshold model identification of severely non-linear systems ⋮ Orthogonal least squares methods and their application to non-linear system identification ⋮ Block Gram-Schmidt algorithms and their stability properties ⋮ Block Modified Gram--Schmidt Algorithms and Their Analysis ⋮ Numerical aspects of Gram-Schmidt orthogonalization of vectors ⋮ Improved Gram-Schmidt type downdating methods ⋮ Pitfalls in fast numerical solvers for fractional differential equations ⋮ Three-dimensional computation of a magnetic field by mixed finite elements and boundary elements ⋮ Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs ⋮ Cholesky-Like Factorization of Symmetric Indefinite Matrices and Orthogonalization with Respect to Bilinear Forms ⋮ Some new properties of the equality constrained and weighted least squares problem ⋮ Report on test matrices for generalized inverses ⋮ One-sided reduction to bidiagonal form ⋮ An Extension of 3D Zernike Moments for Shape Description and Retrieval of Maps Defined in Rectangular Solids ⋮ Self-guided quantum state learning for mixed states ⋮ Direct methods for the solution of linear systems ⋮ Randomized Gram--Schmidt Process with Application to GMRES ⋮ Approximation methods for the finite moment problem ⋮ A criterion for truncation of theQR-decomposition algorithm for the singular linear least squares problem ⋮ The projection method for solving nonlinear systems of equations under the most violated constraint control ⋮ Solution of nonlinear systems of equations by an optimal projection method ⋮ Numerics of Gram-Schmidt orthogonalization ⋮ The loss of orthogonality in the Gram-Schmidt orthogonalization process ⋮ Iterative refinement of linear least squares solutions I
Cites Work
This page was built for publication: Solving linear least squares problems by Gram-Schmidt orthogonalization
