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)- Error bounds for computed least squares estimators
- Macroscopically consistent non-local modeling of heterogeneous media
- scientific article; zbMATH DE number 605133 (Why is no real title available?)
- A golden ratio primal-dual algorithm for structured convex optimization
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Semidefinite programming for the educational testing problem
- An ALE particle method using upwind interpolation
- Improvement of the minimal residual method for solving nonsymmetric linear systems
- Projection method for eigenvalue problems of linear nonsquare matrix pencils
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- Modulus methods for nonnegatively constrained image restoration
- An overview of NSPCG: A nonsymmetric preconditioned conjugate gradient package
- Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- A note on sampling recovery of multivariate functions in the uniform norm
- A polynomial based iterative method for linear parabolic equations
- Krylov Subspace Solvers and Preconditioners
- Hybrid methods for large sparse nonlinear least squares
- Learning multivariate functions with low-dimensional structures using polynomial bases
- A class of incomplete orthogonal factorization methods. II: Implemetation and results
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- Using program package NSPCG to analyze the trunk reservation service protection method
- Analysis of approximate inverses in tomography. II: Iterative inverses
- The non-uniqueness of the atomistic stress tensor and its relationship to the generalized Beltrami representation
- Multipreconditioned GMRES for shifted systems
- A framework for regularization via operator approximation
- A mapped polynomial method for high-accuracy approximations on arbitrary grids
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
- Conjugate gradient-like solution algorithms for the mixed finite element approximation of the biharmonic equation, applied to plate bending problems
- A minimization method for the solution of large symmetriric eigenproblems
- A survey on variational characterizations for nonlinear eigenvalue problems
- Accuracy of preconditioned CG-type methods for least squares problems.
- A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems
- Sparse QR factorization on a massively parallel computer
- Finite element method with optimal nodal velocity
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Sharp 2-norm error bounds for LSQR and the conjugate gradient method
- Bayes meets Krylov: statistically inspired preconditioners for CGLS
- On an iterative method for solving the least squares problem of rank-deficient systems
- An isogeometric collocation method using superconvergent points
- A breakdown of the block CG method
- On iterative solution of the extended normal equations
- A preconditioner for solving large-scale variational inequality problems by a semismooth inexact approach
- Application of fractional derivatives for obtaining new Tikhonov regularization matrices
- The Glowinski-Le Tallec splitting method revisited: a general convergence and convergence rate analysis
- Rapid, efficient analysis of the \(\lambda(n)/C_{k}/r/N\) queue, with application to decomposition of closed queuing networks.
- A stopping criterion for the iterative solution of partial differential equations
- Preconditioners for rank deficient least squares problems
- A new consistent splitting scheme for incompressible Navier-Stokes flows: a least-squares spectral element implementation
- A flow perspective on nonlinear least-squares problems
- Hierarchical orthogonal factorization: sparse least squares problems
- Preconditioners for Krylov subspace methods: An overview
- 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
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)