LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
From MaRDI portal
Publication:3936097
Cited in
(only showing first 100 items - show all)- Reconstructing material properties by deconvolution of full-field measurement images: the conductivity case
- Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
- Iterative solution of linear systems in the 20th century
- Regularized reconstruction of a surface from its measured gradient field
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- The stability of formulae of the Gohberg-Semencul-Trench type for Moore-Penrose and group inverses of Toeplitz matrices
- Combined single domain and subdomain BEM for 3D laminar viscous flow
- Trust-region and other regularisations of linear least-squares problems
- Solving linearly constrained matrix least squares problem by LSQR
- Stochastic matrix-free equilibration
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Sparsity- and continuity-promoting seismic image recovery with curvelet frames
- A regularized structured total least squares algorithm for high-resolution image reconstruction
- A relaxed version of Karmarkar's method
- Computational results of an interior point algorithm for large scale linear programming
- Implementing cholesky factorization for interior point methods of linear programming
- Knot tightening by constrained gradient descent
- The role eigenvalues play in forming GMRES residual norms with non-normal matrices
- On the real convergence rate of the conjugate gradient method
- Sylvester Tikhonov-regularization methods in image restoration
- On application of fast and adaptive periodic Battle-Lemarie wavelets for modeling of multiple lossy transmission lines
- The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides
- Computing projections with LSQR
- Skew-symmetric methods for nonsymmetric linear systems with multiple right-hand sides
- Extending the CGLS algorithm for least squares solutions of the generalized Sylvester-transpose matrix equations
- Old and new parameter choice rules for discrete ill-posed problems
- A Kronecker approximation with a convex constrained optimization method for blind image restoration
- LSQR iterative method for generalized coupled Sylvester matrix equations
- Algorithm 937: MINRES-QLP for symmetric and Hermitian linear equations and least-squares problems
- Solution of sparse rectangular systems using LSQR and Craig
- SIRT- and CG-type methods for the iterative solution of sparse linear least-squares problems
- Two projection methods for regularized total least squares approximation
- A Golub-Kahan-type reduction method for matrix pairs
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- Invertible smoothing preconditioners for linear discrete ill-posed problems
- Sylvester equations and the numerical solution of partial fractional differential equations
- Matrix iterative solutions to the least squares problem of \(BXA^{T} = F\) with some linear constraints
- Cascadic multilevel methods for fast nonsymmetric blur- and noise-removal
- LSQR iterative common symmetric solutions to matrix equations \(AXB = E\) and \(CXD = F\)
- An augmented LSQR method
- Minimization of functionals on the solution of a large-scale discrete ill-posed problem
- On the estimation of a large sparse Bayesian system: the Snaer program
- A matrix LSQR iterative method to solve matrix equation \(AXB=C\)
- Space-time discretization of the heat equation
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- LSQR
- Matrix-free interior point method
- Regularization parameter determination for discrete ill-posed problems
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Noise-reducing cascadic multilevel methods for linear discrete ill-posed problems
- On the generalized reflexive and anti-reflexive solutions to a system of matrix equations
- Persistent cohomology and circular coordinates
- An iterative algorithm for least squares problem in quaternionic quantum theory
- An approximate inverse preconditioner for Toeplitz systems with multiple right-hand sides
- Modulated luminescence tomography
- Simple backward error bounds for linear least-squares problems
- Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
- Factorization strategies for third-order tensors
- Least squares solution of the linear operator equation
- On the choice of solution subspace for nonstationary iterated Tikhonov regularization
- Velocity-vorticity formulation for 3D natural convection in an inclined enclosure by BEM
- Error estimation in preconditioned conjugate gradients
- Inexact semismooth Newton methods for large-scale complementarity problems
- Developing the CGLS algorithm for the least squares solutions of the general coupled matrix equations
- An efficient computational approach for evaluating radiation flux for laser driven inertial confinement fusion targets
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- On the global convergence of the inexact semi-smooth Newton method for absolute value equation
- Some properties of LSQR for large sparse linear least squares problems
- Error estimates for the regularization of least squares problems
- Error estimates for large-scale ill-posed problems
- Direct minimization of the discontinuous least-squares spectral element method for viscoelastic fluids
- Generalized Hybrid Iterative Methods for Large-Scale Bayesian Inverse Problems
- GKB-FP: An algorithm for large-scale discrete ill-posed problems
- Statistical ranking and combinatorial Hodge theory
- A generalized LSQR algorithm
- Multistep matrix splitting iteration preconditioning for singular linear systems
- Inheritance of the discrete Picard condition in Krylov subspace methods
- Regularized total least squares based on quadratic eigenvalue problem solvers
- Parameter selection and preconditioning for a graph form solver
- Minimum residual methods for augmented systems
- Orthogonal projection regularization operators
- On solutions of matrix equation \(XF-AX=C\) and \(XF-A\widetilde{X}=C\) over quaternion field
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- Quadratically constrained least squares and quadratic problems
- FGMRES for linear discrete ill-posed problems
- Restrictively preconditioned conjugate gradient method for a series of constantly augmented least squares problems
- Preconditioners for symmetrized Toeplitz and multilevel Toeplitz matrices
- Testing matrix function algorithms using identities
- Large scale least squares scattered data fitting
- Solving semidefinite programs using preconditioned conjugate gradients
- Fast boundary-domain integral method for heat transfer simulations
- Computational experience with numerical methods for nonnegative least-squares problems.
- A survey of direct methods for sparse linear systems
- A preconditioned MINRES method for nonsymmetric Toeplitz matrices
- Conditioning of multiple-point statistics facies simulations to tomographic images
- A generalized projection iterative methods for solving non-singular linear systems
- Fitting multiple Bell curves stably and accurately to a time series as applied to Hubbert cycles or other phenomena
- Approximating the extreme Ritz values and upper bounds for the \(A\)-norm of the error in CG
This page was built for publication: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936097)
