Bidiagonalization of Matrices and Solution of Linear Equations
From MaRDI portal
Publication:5656303
DOI10.1137/0711019zbMATH Open0244.65023OpenAlexW2048566309MaRDI QIDQ5656303FDOQ5656303
Authors: Christopher C. Paige
Publication date: 1974
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0711019
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Cited In (37)
- Iterative algorithm for solving a class of quaternion matrix equation over the generalized \((P, Q)\)-reflexive matrices
- Sharp 2-norm error bounds for LSQR and the conjugate gradient method
- Quasi-Toeplitz matrix arithmetic: a MATLAB toolbox
- Computing projections with LSQR
- An efficient algorithm for the reflexive solution of the quaternion matrix equation \(AXB + CX^HD = F\)
- PLSS: A Projected Linear Systems Solver
- Lanczos tridiagonalization and core problems
- Accuracy of preconditioned CG-type methods for least squares problems.
- Parallel Prony's Method with Multivariate Matrix Pencil Approach and Its Numerical Aspects
- Computational methods of linear algebra
- Estimating error norms in CG-like algorithms for least-squares and least-norm problems
- Title not available (Why is that?)
- New matrix iterative methods for constraint solutions of the matrix equation \(AXB=C\)
- A new method for the bisymmetric minimum norm solution of the consistent matrix equations \(A_1XB_1 = C_1\), \(A_2XB_2 = C_2\)
- The periodic QR algorithm is a disguised QR algorithm
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems
- Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
- On Krylov subspace methods for skew-symmetric and shifted skew-symmetric linear systems
- A tridiagonalization method for symmetric saddle-point systems
- Weighted Golub-Kahan-Lanczos bidiagonalization algorithms
- Iterative solution methods for certain sparse linear systems with a non- symmetric matrix arising from PDE-problems
- Time-domain input-output representations of linear systems
- Paige's algorithm for solving a class of tensor least squares problem
- Simple stopping criteria for the LSQR method applied to discrete ill-posed problems
- On the preconditioning of the bidiagonalization technique
- On an iterative method for solving the least squares problem of rank-deficient systems
- <scp>TriCG</scp> and <scp>TriMR</scp>: Two Iterative Methods for Symmetric Quasi-definite Systems
- An augmented LSQR method
- An iterative algorithm for robust simulation of the Sylvester matrix differential equations
- Iterative algorithms for least-squares solutions of a quaternion matrix equation
- LNLQ: an iterative method for least-norm problems with an error minimization property
- Efficient forecasting of chaotic systems with block-diagonal and binary reservoir computing
- Solving coupled tensor equations via higher order LSQR methods
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- On the exponential of semi-infinite quasi-Toeplitz matrices
- An efficient iterative method for solving a class of constrained tensor least squares problem
This page was built for publication: Bidiagonalization of Matrices and Solution of Linear Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5656303)