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)- Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
- Sampling method based projection approach for the reconstruction of 3D acoustically penetrable scatterers
- An unfitted RBF-FD method in a least-squares setting for elliptic PDEs on complex geometries
- Fast computation of reconciled forecasts for hierarchical and grouped time series
- Iterative solution schemes for quadratic DRM-MD
- Tensor methods for the Boltzmann-BGK equation
- Low-rank approximation of linear parabolic equations by space-time tensor Galerkin methods
- Highly accurate verified error bounds for Krylov type linear system solvers
- Algorithms and application for special classes of nonlinear least squares problems
- A regularized factorization-free method for equality-constrained optimization
- Vector extrapolation based Landweber method for discrete ill-posed problems
- Algorithms for integration of stochastic differential equations using parallel optimized sampling in the Stratonovich calculus
- An interior-point implementation developed and tuned for radiation therapy treatment planning
- A novel dictionary learning method based on total least squares approach with application in high dimensional biological data
- The regularizing properties of global GMRES for solving large-scale linear discrete ill-posed problems with several right-hand sides
- Anderson Accelerated Douglas--Rachford Splitting
- LSMR iterative method for solving one- and two-dimensional linear Fredholm integral equations
- A computational framework for edge-preserving regularization in dynamic inverse problems
- Flexible Krylov methods for \(\ell_p\) regularization
- A parameter choice rule for Tikhonov regularization based on predictive risk
- Structure in loss of orthogonality
- On Tikhonov-type regularization with approximated penalty terms
- Learning regularization parameters of inverse problems via deep neural networks
- Towards Practical Large-Scale Randomized Iterative Least Squares Solvers through Uncertainty Quantification
- On the Lanczos and Golub-Kahan reduction methods applied to discrete ill-posed problems.
- A flexible uncertainty propagation framework for general multiphysics systems
- Accuracy of the Lanczos process for the eigenproblem and solution of equations
- Edge-enhancing reconstruction algorithm for three-dimensional electrical impedance tomography
- Incremental regularized least squares for dimensionality reduction of large-scale data
- Edge-promoting reconstruction of absorption and diffusivity in optical tomography
- The block preconditioned \textit{LSQR} and \textit{GL}-\textit{LSQR} algorithms for the block partitioned matrices
- Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization
- The LSQR method for solving tensor least-squares problems
- Conjugate gradient least squares algorithm for solving the generalized coupled Sylvester matrix equations
- Some properties of the Arnoldi-based methods for linear ill-posed problems
- The AZ algorithm for least squares systems with a known incomplete generalized inverse
- Trajectory-based methods for modeling and characterization
- Preconditioning by approximations of the discrete Laplacian for 2‐D non‐linear free convection elliptic equations
- Extension of GKB-FP algorithm to large-scale general-form Tikhonov regularization.
- Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides
- Implementing the alternating direction method of multipliers for big datasets: a case study of least absolute shrinkage and selection operator
- Inversion methods in helioseismology and solar tomography
- A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems
- Goal-oriented optimal approximations of Bayesian linear inverse problems
- On regularizing effects of MINRES and MR-II for large scale symmetric discrete ill-posed problems
- Hybrid and iteratively reweighted regularization by unbiased predictive risk and weighted GCV for projected systems
- A penalty method for PDE-constrained optimization in inverse problems
- Interpretable approximation of high-dimensional data
- A Tikhonov regularized penalty function approach for solving polylinear programming problems
- State estimation with structural priors in fMRI
- Matrix forms of iterative algorithms to solve large-scale discrete ill-posed problems with an application to image restoration
- 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
- Approximate Toeplitz matrix problem using semidefinite programming
- Simple and efficient determination of the Tikhonov regularization parameter chosen by the generalized discrepancy principle for discrete ill-posed problems
- High resolution inverse scattering in two dimensions using recursive linearization
- Solution methods for linear discrete ill-posed problems for color image restoration
- Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
- Simple stopping criteria for the LSQR method applied to discrete ill-posed problems
- Efficient linear discriminant analysis with locality preserving for face recognition
- Parallel tensor methods for high-dimensional linear PDEs
- A new taxonomy of conjugate gradient methods
- A fast and accurate algorithm for spherical harmonic analysis on HEALPix grids with applications to the cosmic microwave background radiation
- Vector processing in simplex and interior methods for linear programming
- The joint bidiagonalization process with partial reorthogonalization
- Solving emission tomography problems on vector machines
- A hybrid sensitivity function and Lanczos bidiagonalization-Tikhonov method for structural model updating: application to a full-scale bridge structure
- Compression approaches for the regularized solutions of linear systems from large-scale inverse problems
- A new iterative method for solving linear Fredholm integral equations using the least squares method
- Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs
- Discrete vector calculus and Helmholtz Hodge decomposition for classical finite difference summation by parts operators
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
- Greedy Tikhonov regularization for large linear ill-posed problems
- Variable projection for nonlinear least squares problems
- Regularization parameter estimation for large-scale Tikhonov regularization using a priori information
- Automatic stopping rule for iterative methods in discrete ill-posed problems
- Conjugate gradient based acceleration for inverse problems
- A new iterative model updating technique based on least squares minimal residual method using measured modal data
- A robust algorithm for semidefinite programming
- An efficient method for solving a matrix least squares problem over a matrix inequality constraint
- Solving Hankel matrix approximation problem using semidefinite programming
- Coordinate difference matrices
- Tensor Equivalents for Solution of Linear Systems: A Parallel Algorithm
- Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
- Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
- Fast \(l_ p\) solution of large, sparse, linear systems: Application to seismic travel time tomography
- The solution of large-scale least-squares problems on supercomputers
- An iterative algorithm for a least squares solution of a matrix equation
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)
