LSQR

swMATH530MaRDI QIDQ13285FDOQ13285

Author name not available (Why is that?)

Described by source

• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares

Cited In (only showing first 100 items - show all)

• On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
• Accuracy of the Lanczos Process for the Eigenproblem and Solution of Equations
• On Tikhonov-type regularization with approximated penalty terms
• Spectral condition‐number estimation of large sparse 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
• Flexible Krylov Methods for $\ell_p$ Regularization
• Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
• LSMR iterative method for solving one- and two-dimensional linear Fredholm integral equations
• Highly accurate verified error bounds for Krylov type linear system solvers
• On regularizing effects of MINRES and MR-II for large scale symmetric discrete ill-posed problems
• A penalty method for PDE-constrained optimization in inverse problems
• Edge-promoting reconstruction of absorption and diffusivity in optical tomography
• Edge-Enhancing Reconstruction Algorithm for Three-Dimensional Electrical Impedance Tomography
• Goal-Oriented Optimal Approximations of Bayesian Linear Inverse Problems
• A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
• Incremental regularized least squares for dimensionality reduction of large-scale data
• The block preconditioned \textit{LSQR} and \textit{GL}-\textit{LSQR} algorithms for the block partitioned matrices
• An ALE particle method using upwind interpolation
• An augmented stability result for the Lanczos Hermitian matrix tridiagonalization process
• Low-rank approximation of linear parabolic equations by space-time tensor Galerkin methods
• Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides
• Structure in loss of orthogonality
• Tensor methods for the Boltzmann-BGK equation
• An isogeometric collocation method using superconvergent points
• A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems
• Fast computation of reconciled forecasts for hierarchical and grouped time series
• Implementing the Alternating Direction Method of Multipliers for Big Datasets: A Case Study of Least Absolute Shrinkage and Selection Operator
• Trajectory-Based Methods for Modeling and Characterization
• Combinatorial characterization of the null spaces of symmetric H-matrices
• Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization
• The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
• A new consistent splitting scheme for incompressible Navier-Stokes flows: a least-squares spectral element implementation
• An unfitted RBF-FD method in a least-squares setting for elliptic PDEs on complex geometries
• Some Properties of the Arnoldi-Based Methods for Linear Ill-Posed Problems
• Extension of GKB‐FP algorithm to large‐scale general‐form Tikhonov regularization
• A Flexible Uncertainty Propagation Framework for General Multiphysics Systems
• The LSQR method for solving tensor least-squares problems
• A useful form of unitary matrix obtained from any sequence of unit 2-norm \(n\)-vectors
• Inversion methods in helioseismology and solar tomography
• An interior-point implementation developed and tuned for radiation therapy treatment planning
• A Tikhonov regularized penalty function approach for solving polylinear programming problems
• A parameter choice rule for Tikhonov regularization based on predictive risk
• Conjugate gradient least squares algorithm for solving the generalized coupled Sylvester matrix equations
• Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods
• State estimation with structural priors in fMRI
• Iterative solution schemes for quadratic DRM-MD
• A convergence analysis of the performance of the DRM-MD boundary integral approach
• A Regularized Factorization-Free Method for Equality-Constrained Optimization
• Bayes Meets Krylov: Statistically Inspired Preconditioners for CGLS
• Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
• The AZ Algorithm for Least Squares Systems with a Known Incomplete Generalized Inverse
• 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
• Approximating the extreme Ritz values and upper bounds for the \(A\)-norm of the error in CG
• On iterative algorithms for linear least squares problems with bound constraints
• Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
• FFT-Based Preconditioners for Toeplitz-Block Least Squares Problems
• Inverse radiation problem of temperature field in three-dimensional rectangular enclosure containing inhomogeneous, anisotropically scattering media
• Some results on the regularization of LSQR for large-scale discrete ill-posed problems
• Projected Krylov Methods for Saddle-Point Systems
• High Resolution Inverse Scattering in Two Dimensions Using Recursive Linearization
• A new fictitious domain method in shape optimization
• A multi-iterate method to solve systems of nonlinear equations
• A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization
• Subspace preconditioned LSQR for discrete ill-posed problems
• A new iterative model updating technique based on least squares minimal residual method using measured modal data
• Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems
• Solving Hankel matrix approximation problem using semidefinite programming
• Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
• The block Lanczos algorithm for linear ill-posed problems
• Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
• Iterative techniques for rough surface scattering problems
• Title not available (Why is that?)
• Rank and null space calculations using matrix decomposition without column interchanges
• Large scale least squares scattered data fitting
• Automatic stopping rule for iterative methods in discrete ill-posed problems
• Preconditioning and Iterative Solution of All-at-Once Systems for Evolutionary Partial Differential Equations
• Partial condition number for the equality constrained linear least squares problem
• The solution of large-scale least-squares problems on supercomputers
• Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm
• Vector processing in simplex and interior methods for linear programming
• Solving emission tomography problems on vector machines
• Weighted Golub-Kahan-Lanczos bidiagonalization algorithms
• A Preconditioned MINRES Method for Nonsymmetric Toeplitz Matrices
• Efficient linear discriminant analysis with locality preserving for face recognition
• Conjugate gradient based acceleration for inverse problems
• Large tridiagonal and block tridiagonal linear systems on vector and parallel computers
• Computational experience with numerical methods for nonnegative least-squares problems.
• Solution methods for linear discrete ill-posed problems for color image restoration
• An a posteriori error estimate for finite element approximations of a singularly perturbed advection-diffusion problem
• Simple and efficient determination of the Tikhonov regularization parameter chosen by the generalized discrepancy principle for discrete ill-posed problems
• Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
• Simple stopping criteria for the LSQR method applied to discrete ill-posed problems
• Coordinate Difference Matrices
• Variable projection for nonlinear least squares problems
• FGMRES for linear discrete ill-posed problems
• Approximate Toeplitz matrix problem using semidefinite programming
• A fast and accurate algorithm for spherical harmonic analysis on HEALPix grids with applications to the cosmic microwave background radiation

This page was built for software: LSQR