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)- A nonmonotone semismooth inexact Newton method
- Semidefinite programming for the educational testing problem
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- Hierarchical orthogonal factorization: sparse least squares problems
- The joint bidiagonalization process with partial reorthogonalization
- A hybrid sensitivity function and Lanczos bidiagonalization-Tikhonov method for structural model updating: application to a full-scale bridge structure
- Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs
- Error bounds for computed least squares estimators
- A flexible uncertainty propagation framework for general multiphysics systems
- Modulated luminescence tomography
- Some properties of the Arnoldi-based methods for linear ill-posed problems
- LSQR algorithm with structured preconditioner for the least squares problem in quaternionic quantum theory
- Implementing the alternating direction method of multipliers for big datasets: a case study of least absolute shrinkage and selection operator
- On Tikhonov-type regularization with approximated penalty terms
- An iterative method to compute minimum norm solutions of ill-posed problems in Hilbert spaces
- Statistical ranking and combinatorial Hodge theory
- Statistical Methods in Imaging
- Thick-restarted joint Lanczos bidiagonalization for the GSVD
- A convergence result for some Krylov-Tikhonov methods in Hilbert spaces
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Knot tightening by constrained gradient descent
- A least squares approach for saddle point problems
- Numerical analytic methods for calculating wave fields and restoring the velocity characteristics of inhomogeneous elastic media in the Baikal rift zone
- An interior-point method for large constrained discrete ill-posed problems
- A robust algorithm for semidefinite programming
- Regularized reconstruction of a surface from its measured gradient field
- An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks
- A variable projection method for large-scale inverse problems with \(\ell^1\) regularization
- Approximating the extreme Ritz values and upper bounds for the \(A\)-norm of the error in CG
- Modulus methods for nonnegatively constrained image restoration
- Color image and video restoration using tensor CP decomposition
- Generalized inverse problems for part symmetric matrices on a subspace in structural dynamic model updating
- On the convergence of the Bl-LSQR algorithm for solving matrix equations
- Conjugate gradient-like solution algorithms for the mixed finite element approximation of the biharmonic equation, applied to plate bending problems
- Quantum beetle swarm algorithm optimized extreme learning machine for intrusion detection
- A survey of direct methods for sparse linear systems
- Approximation of high-dimensional periodic functions with Fourier-based methods
- SIRT- and CG-type methods for the iterative solution of sparse linear least-squares problems
- The Conjugate Residual Method in Linesearch and Trust-Region Methods
- Coordinate difference matrices
- Vector extrapolation based Landweber method for discrete ill-posed problems
- The regularizing properties of global GMRES for solving large-scale linear discrete ill-posed problems with several right-hand sides
- Learning multivariate functions with low-dimensional structures using polynomial bases
- On numerical solution stability of the Laplace equation in absence of the Dirichlet boundary condition: benchmark problem proposal
- HOBi-CGSTAB and HOBi-CRSTAB methods for solving some tensor equations
- Finite element method with optimal nodal velocity
- Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- slimTrain---A Stochastic Approximation Method for Training Separable Deep Neural Networks
- A survey on variational characterizations for nonlinear eigenvalue problems
- Inverse radiation analysis of simultaneous estimation of temperature field and radiative properties in a two-dimensional participating medium
- A skew-symmetric Lanczos bidiagonalization method for computing several extremal eigenpairs of a large skew-symmetric matrix
- SOLVING SPARSE LEAST SQUARES PROBLEMS WITH PRECONDITIONED CGLS METHOD ON PARALLEL DISTRIBUTED MEMORY COMPUTERS
- A CCBM-based generalized GKB iterative regularization algorithm for inverse Cauchy problems
- A Bayesian linear model for the high-dimensional inverse problem of seismic tomography
- Two projection methods for regularized total least squares approximation
- ANOVA approximation with mixed tensor product basis on scattered points
- Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
- Optimal regularized inverse matrices for inverse problems
- On iterative algorithms for linear least squares problems with bound constraints
- Space-time discretization of the heat equation
- Hybrid methods for large sparse nonlinear least squares
- Matrix iterative algorithms for least-squares problem in quaternionic quantum theory
- Modeling service-time distributions for queueing network simulation
- LSMR iterative method for solving one- and two-dimensional linear Fredholm integral equations
- Sparse QR factorization on a massively parallel computer
- Noise-insensitive discriminative subspace fuzzy clustering
- The stability of formulae of the Gohberg-Semencul-Trench type for Moore-Penrose and group inverses of Toeplitz matrices
- Solving linearly constrained matrix least squares problem by LSQR
- Solving semidefinite programs using preconditioned conjugate gradients
- Backward perturbation analysis for scaled total least-squares problems
- Convergence analysis of LSQR for compact operator equations
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- A polynomial based iterative method for linear parabolic equations
- Conjugate gradients for symmetric positive semidefinite least-squares problems
- Highly accurate verified error bounds for Krylov type linear system solvers
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
- Noise-reducing cascadic multilevel methods for linear discrete ill-posed problems
- Sharp 2-norm error bounds for LSQR and the conjugate gradient method
- Inverse radiation problem of temperature field in three-dimensional rectangular enclosure containing inhomogeneous, anisotropically scattering media
- Computing non-negative tensor factorizations
- Restrictively preconditioned conjugate gradient method for a series of constantly augmented least squares problems
- Rapid, efficient analysis of the \(\lambda(n)/C_{k}/r/N\) queue, with application to decomposition of closed queuing networks.
- A generalized projection iterative methods for solving non-singular linear systems
- A Krylov-Schur approach to the truncated SVD
- Computing projections with LSQR
- LSQR iterative common symmetric solutions to matrix equations AXB = E and CXD = F
- Wavelet-in-time multigrid-in-space preconditioning of parabolic evolution equations
- Stochastic matrix-free equilibration
- Cascadic multilevel methods for fast nonsymmetric blur- and noise-removal
- Optimization of random feature method in the high-precision regime
- Boundary element methods in diffraction of a point-source acoustic wave by a rigid infinite wedge
- Regularization parameter determination for discrete ill-posed problems
- Some results on the regularization of LSQR for large-scale discrete ill-posed problems
- Sampled limited memory methods for massive linear inverse problems
- Anderson Accelerated Douglas--Rachford Splitting
- Extending the CGLS algorithm for least squares solutions of the generalized Sylvester-transpose matrix equations
- On regularizing effects of MINRES and MR-II for large scale symmetric discrete ill-posed problems
- On a generalization of Regińska's parameter choice rule and its numerical realization in large-scale multi-parameter Tikhonov regularization
- Trajectory-based methods for modeling and characterization
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)
