Solving linear least squares problems by Gram-Schmidt orthogonalization
From MaRDI portal
Publication:5574335
Cites work
- Elimination with weighted row combinations for solving linear equations and least squares problems
- Experiments on Gram-Schmidt Orthogonalization
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Note on the iterative refinement of least squares solution
- Numerical methods for solving linear least squares problems
Cited in
(only showing first 100 items - show all)- A simple and efficient method for variable ranking according to their usefulness for learning
- Numerical aspects of Gram-Schmidt orthogonalization of vectors
- Report on test matrices for generalized inverses
- Direct methods for the solution of linear systems
- 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
- Error analysis of algorithms for computing the projection of a point onto a linear manifold
- Sparse linear problems and the least squares method
- Iterative algorithms for Gram-Schmidt orthogonalization
- Test procedures and test problems for least squares algorithms
- Simultaneous equations estimation. Computational aspects
- Computational methods of linear algebra
- A combined direct-iterative approach for solving large scale singular and rectangular consistent systems of linear equations
- Comparison of two pivotal strategies in sparse plane rotations
- Solution of two-point boundary value problems involving Kronecker products
- On the solution of the linear least squares problems and pseudo-inverses
- A numerical procedure for computing the Moore-Penrose inverse
- Approximation methods for the finite moment problem
- Numerics of Gram-Schmidt orthogonalization
- A note on the generation of \(\Delta\)-orthonormal bases
- Rank-k modification methods for recursive least squares problems
- Solution of augmented linear systems using orthogonal factorizations
- Algebraic and numerical techniques for the computation of matrix determinants
- Numerical behaviour of the modified Gram-Schmidt GMRES implementation
- New interpretation of related Huang's methods
- Accuracy of preconditioned CG-type methods for least squares problems.
- Three-dimensional computation of a magnetic field by mixed finite elements and boundary elements
- Some new properties of the equality constrained and weighted least squares problem
- On the computation of derivatives within LD factorization of parametrized matrices
- A new stable bidiagonal reduction algorithm
- Solution of linear least squares via the ABS algorithm
- Stability analysis of the method of seminormal equations for linear least squares problems
- One-sided reduction to bidiagonal form
- Numerical stability of GMRES
- Accurate downdating of a modified Gram-Schmidt QR decomposition
- The influence of orthogonality on the Arnoldi method
- A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting
- Analysis of the self projected matching pursuit algorithm
- Block Gram-Schmidt algorithms and their stability properties
- Self-guided quantum state learning for mixed states
- Reduction of multivariate mixtures and its applications
- A general approach for designing the MWGS-based information-form Kalman filtering methods
- An efficient and stable Lagrangian matrix approach to Abel integral and integro-differential equations
- A general approach of least squares estimation and optimal filtering
- As good as GOLD: Gram-Schmidt orthogonalization by another name
- Experiments on orthogonalization by biorthogonal representations of orthogonal projectors
- Deflation-accelerated preconditioning of the Poisson-Neumann Schur problem on long domains with a high-order discontinuous element-based collocation method
- On the loss of orthogonality in the second-order Arnoldi process
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms
- Stability of general systems of linear equations
- On the use of generalized inverses in function minimization
- On two direct methods for computing generalized inverses
- Improved Gram-Schmidt type downdating methods
- Pitfalls in fast numerical solvers for fractional differential equations
- GMRES algorithms over 35 years
- Stability analysis of the two-level orthogonal Arnoldi procedure
- An extension of 3D Zernike moments for shape description and retrieval of maps defined in rectangular solids
- Gram-Schmidt orthogonalization: 100 years and more
- Backward error analysis of the shift-and-invert Arnoldi algorithm
- The stability of block variants of classical Gram-Schmidt
- Non-linear systems identification using radial basis functions
- Practical identification of NARMAX models using radial basis functions
- A note on the modified gram-schmidt process
- On Stable Calculation of Linear Functionals
- Modified gram-schmidt process vs. classical gram-schmidt
- Neural networks for nonlinear dynamic system modelling and identification
- Equilibration of matrices to optimize backward numerical stability
- Note on a splitting approach to ill-conditioned least squares problems
- Gram-Schmidt algorithms for covariance propagation†
- scientific article; zbMATH DE number 3552358 (Why is no real title available?)
- Iterative refinement implies numerical stability
- Computer Solution and Perturbation Analysis of Generalized Linear Least Squares Problems
- 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
- Communication lower bounds and optimal algorithms for numerical linear algebra
- A criterion for truncation of theQR-decomposition algorithm for the singular linear least squares problem
- scientific article; zbMATH DE number 1406971 (Why is no real title available?)
- A Note on Inexact Inner Products in GMRES
- Block Modified Gram--Schmidt Algorithms and Their Analysis
- 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
- Class-Incremental Generalized Discriminant Analysis
- Iterative refinement of linear least squares solutions I
- Experiments on Error Growth Associated with Some Linear Least-Squares Procedures
- Some comments on the solution of linear equations
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- Some Results on Sparse Matrices
- Round off error analysis for Gram-Schmidt method and solution of linear least squares problems
- Perturbation theory for pseudo-inverses
- Randomized Gram-Schmidt process with application to GMRES
- Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement
- On accurate stress calculation in static and dynamic problems using the natural factor approach
- Sparse reduced-rank regression for simultaneous rank and variable selection via manifold optimization
- Functional classwise principal component analysis: a classification framework for functional data analysis
- Probabilistic rounding error analysis of modified Gram-Schmidt
- Reorthogonalized block classical Gram-Schmidt using two Cholesky-based TSQR algorithms
- Efficient GMRES+AMG on GPUs: composite smoothers and mixed V-cycles
- Randomized flexible GMRES with deflated restarting
- Robust bounds for Krylov methods revisited
This page was built for publication: Solving linear least squares problems by Gram-Schmidt orthogonalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5574335)