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)

• 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
• Coordinate difference matrices
• On iterative algorithms for linear least squares problems with bound constraints
• Restrictively preconditioned conjugate gradient method for a series of constantly augmented least squares problems
• 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
• A new fictitious domain method in shape optimization
• Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
• 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
• Preconditioners for symmetrized Toeplitz and multilevel Toeplitz matrices
• 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
• Projected Krylov methods for saddle-point systems
• High resolution inverse scattering in two dimensions using recursive linearization
• 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
• Optimal low-rank approximations of Bayesian linear inverse problems
• 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
• 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
• On the solution of a two ball trust region subproblem
• Projection methods for linear systems
• Discrete vector calculus and Helmholtz Hodge decomposition for classical finite difference summation by parts operators
• Numerical Methods for Large Sparse Linear Least Squares Problems
• An algorithm for solving sparse nonlinear least squares problems
• Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems
• Nonnegative surface fitting with Powell-Sabin splines
• Tensor Equivalents for Solution of Linear Systems: A Parallel Algorithm
• The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
• A preconditioned MINRES method for nonsymmetric Toeplitz matrices
• Parallel tensor methods for high-dimensional linear PDEs
• An efficient method for solving a matrix least squares problem over a matrix inequality constraint
• Implementing an affine scaling algorithm for linear programming
• Testing matrix function algorithms using identities
• Modulated luminescence tomography
• Statistical ranking and combinatorial Hodge theory
• Regularized reconstruction of a surface from its measured gradient field
• On the optimal implementation of the boundary element dual reciprocity method-multi-domain approach for 3D problems
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Iterative Krylov Methods for Large Linear Systems
• Space-time discretization of the heat equation
• 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
• A multidomain boundary element method for unsteady laminar flow using stream function--vorticity equations
• Stochastic matrix-free equilibration
• Regularization parameter determination for discrete ill-posed problems
• LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
• GMRESR: a family of nested GMRES methods
• Some properties of LSQR for large sparse linear least squares problems
• Error estimation in preconditioned conjugate gradients
• Computational results of an interior point algorithm for large scale linear programming
• Invertible smoothing preconditioners for linear discrete ill-posed problems
• Matrix iterative solutions to the least squares problem of \(BXA^{T} = F\) with some linear constraints
• Trust-region and other regularisations of linear least-squares problems
• A Kronecker approximation with a convex constrained optimization method for blind image restoration
• LSQR iterative method for generalized coupled Sylvester matrix equations
• Fast CG-Based Methods for Tikhonov--Phillips Regularization
• Minimum residual methods for augmented systems
• Least squares solution of the linear operator equation
• On the choice of solution subspace for nonstationary iterated Tikhonov regularization
• Developing the CGLS algorithm for the least squares solutions of the general coupled matrix equations
• A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
• A modified finite Newton method for fast solution of large scale linear SVMs
• Regularization by Truncated Total Least Squares
• Matrix-free interior point method
• A Golub-Kahan-type reduction method for matrix pairs
• On the global convergence of the inexact semi-smooth Newton method for absolute value equation

This page was built for software: LSQR