LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
From MaRDI portal
(Redirected from Publication:3936097)
Cited in
(only showing first 100 items - show all)- Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems
- Trust-region and other regularisations of linear least-squares problems
- On the estimation of a large sparse Bayesian system: the Snaer program
- Error estimates for the regularization of least squares problems
- Error estimates for large-scale ill-posed problems
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- An interior-point method for large constrained discrete ill-posed problems
- Report on test matrices for generalized inverses
- Rank and null space calculations using matrix decomposition without column interchanges
- Solving or resolving inadequate and noisy tomographic systems
- Finite element method with optimal nodal velocity
- Fast \(l_ p\) solution of large, sparse, linear systems: Application to seismic travel time tomography
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
- A relaxed version of Karmarkar's method
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- Conjugate gradient type methods and preconditioning
- Preconditioning techniques for nonsymmetric and indefinite linear systems
- Quadratically constrained least squares and quadratic problems
- Computational results of an interior point algorithm for large scale linear programming
- A polynomial based iterative method for linear parabolic equations
- Minimum residual methods for augmented systems
- The conjugate gradient regularization method in computed tomography problems
- Iterative techniques for rough surface scattering problems
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Using program package NSPCG to analyze the trunk reservation service protection method
- Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation
- LSQR
- An overview of NSPCG: A nonsymmetric preconditioned conjugate gradient package
- Inexact trust region method for large sparse systems of nonlinear equations
- On the solution of a two ball trust region subproblem
- An implicit shift bidiagonalization algorithm for ill-posed systems
- On application of fast and adaptive periodic Battle-Lemarie wavelets for modeling of multiple lossy transmission lines
- A new taxonomy of conjugate gradient methods
- An a posteriori error estimate for finite element approximations of a singularly perturbed advection-diffusion problem
- Rapid, efficient analysis of the \(\lambda(n)/C_{k}/r/N\) queue, with application to decomposition of closed queuing networks.
- A fast implementation for GMRES method
- Accuracy of preconditioned CG-type methods for least squares problems.
- Iterative solution of linear systems in the 20th century
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- An ALE particle method using upwind interpolation
- Fast computation of reconciled forecasts for hierarchical and grouped time series
- Macroscopically consistent non-local modeling of heterogeneous media
- An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks
- The block Lanczos algorithm for linear ill-posed problems
- A stopping criterion for the iterative solution of partial differential equations
- Conjugate gradient based acceleration for inverse 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
- Partial condition number for the equality constrained linear least squares problem
- State estimation with structural priors in fMRI
- Some results on the regularization of LSQR for large-scale discrete ill-posed problems
- Fast boundary-domain integral method for heat transfer simulations
- Weighted Golub-Kahan-Lanczos bidiagonalization algorithms
- On the generalized reflexive and anti-reflexive solutions to a system of matrix equations
- Solution methods for linear discrete ill-posed problems for color image restoration
- An isogeometric collocation method using superconvergent points
- Inversion methods in helioseismology and solar tomography
- An algorithm for solving sparse nonlinear least squares problems
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Large scale least squares scattered data fitting
- Analysis of approximate inverses in tomography. II: Iterative inverses
- A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems
- Highly accurate verified error bounds for Krylov type linear system solvers
- A regularized structured total least squares algorithm for high-resolution image reconstruction
- Nonnegative surface fitting with Powell-Sabin splines
- New insights in GMRES-like methods with variable preconditioners
- Solution of sparse rectangular systems using LSQR and Craig
- Conjugate gradient-like solution algorithms for the mixed finite element approximation of the biharmonic equation, applied to plate bending problems
- Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
- Hybrid methods for large sparse nonlinear least squares
- A primal-dual potential reduction method for problems involving matrix inequalities
- Minimization of functionals on the solution of a large-scale discrete ill-posed problem
- Old and new parameter choice rules for discrete ill-posed problems
- Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
- GKB-FP: An algorithm for large-scale discrete ill-posed problems
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
- A weighted view on the partial least-squares algorithm
- On Tikhonov-type regularization with approximated penalty terms
- The Glowinski-Le Tallec splitting method revisited: a general convergence and convergence rate analysis
- 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
- Parallel tensor methods for high-dimensional linear PDEs
- Integral equation formulation of an unsteady diffusion-convection equation with variable coefficient and velocity
- A flow perspective on nonlinear least-squares problems
- A golden ratio primal-dual algorithm for structured convex optimization
- Structure in loss of orthogonality
- A novel dictionary learning method based on total least squares approach with application in high dimensional biological data
- A survey on variational characterizations for nonlinear eigenvalue problems
- The LSQR method for solving tensor least-squares problems
- A new approximation algorithm for solving generalized Lyapunov matrix equations
- \(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite trace
- Color image and video restoration using tensor CP decomposition
- Quantum beetle swarm algorithm optimized extreme learning machine for intrusion detection
- A least squares approach for saddle point problems
- The non-uniqueness of the atomistic stress tensor and its relationship to the generalized Beltrami representation
- Tensor methods for the Boltzmann-BGK equation
- Preconditioner for estimation of multipole sources via full waveform inversion
- An unfitted RBF-FD method in a least-squares setting for elliptic PDEs on complex geometries
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)
