Pages that link to "Item:Q3936097"
From MaRDI portal
The following pages link to LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares (Q3936097):
Displaying 50 items.
- An iterative algorithm for least squares problem in quaternionic quantum theory (Q711148) (← links)
- Automatic stopping rule for iterative methods in discrete ill-posed problems (Q747217) (← links)
- Vector processing in simplex and interior methods for linear programming (Q751499) (← links)
- Solving emission tomography problems on vector machines (Q753694) (← links)
- On iterative algorithms for linear least squares problems with bound constraints (Q756372) (← links)
- Efficient linear discriminant analysis with locality preserving for face recognition (Q763374) (← links)
- Simple stopping criteria for the LSQR method applied to discrete ill-posed problems (Q780395) (← links)
- Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications (Q780416) (← links)
- A fast and accurate algorithm for spherical harmonic analysis on HEALPix grids with applications to the cosmic microwave background radiation (Q781995) (← links)
- On the real convergence rate of the conjugate gradient method (Q808614) (← links)
- The joint bidiagonalization process with partial reorthogonalization (Q820739) (← links)
- A hybrid sensitivity function and Lanczos bidiagonalization-Tikhonov method for structural model updating: application to a full-scale bridge structure (Q822132) (← links)
- Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs (Q827077) (← links)
- Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy (Q836250) (← links)
- A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
- Noise-reducing cascadic multilevel methods for linear discrete ill-posed problems (Q849144) (← links)
- Least squares collocation solution of elliptic problems in general regions (Q853246) (← links)
- Lanczos tridiagonalization and core problems (Q869895) (← links)
- Matrix iterative solutions to the least squares problem of \(BXA^{T} = F\) with some linear constraints (Q870162) (← links)
- Solving Hankel matrix approximation problem using semidefinite programming (Q875374) (← links)
- Conditioning of multiple-point statistics facies simulations to tomographic images (Q887570) (← links)
- Fitting multiple Bell curves stably and accurately to a time series as applied to Hubbert cycles or other phenomena (Q888387) (← links)
- A Golub-Kahan-type reduction method for matrix pairs (Q896215) (← links)
- Compression approaches for the regularized solutions of linear systems from large-scale inverse problems (Q901334) (← links)
- A new iterative method for solving linear Fredholm integral equations using the least squares method (Q902777) (← links)
- SIRT- and CG-type methods for the iterative solution of sparse linear least-squares problems (Q915373) (← links)
- The solution of large-scale least-squares problems on supercomputers (Q918420) (← links)
- Efficient GOCE satellite gravity field recovery based on least-squares using QR decomposition (Q925855) (← links)
- Inverse radiation problem of temperature field in three-dimensional rectangular enclosure containing inhomogeneous, anisotropically scattering media (Q936267) (← links)
- Velocity-vorticity formulation for 3D natural convection in an inclined enclosure by BEM (Q945747) (← links)
- A new fictitious domain method in shape optimization (Q953216) (← links)
- Semidefinite programming for the educational testing problem (Q953303) (← links)
- Partial least-squares vs. Lanczos bidiagonalization. I: Analysis of a projection method for multiple regression (Q956896) (← links)
- Cascadic multilevel methods for fast nonsymmetric blur- and noise-removal (Q972301) (← links)
- Sparse QR factorization on a massively parallel computer (Q973426) (← links)
- Meshless thin plate spline methods for the modified Helmholtz equation (Q995331) (← links)
- Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems (Q1008678) (← links)
- Trust-region and other regularisations of linear least-squares problems (Q1014897) (← links)
- On the estimation of a large sparse Bayesian system: the Snaer program (Q1023766) (← links)
- Error estimates for the regularization of least squares problems (Q1027769) (← links)
- Error estimates for large-scale ill-posed problems (Q1027793) (← links)
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit (Q1029548) (← links)
- An interior-point method for large constrained discrete ill-posed problems (Q1044857) (← links)
- Report on test matrices for generalized inverses (Q1059367) (← links)
- Rank and null space calculations using matrix decomposition without column interchanges (Q1074304) (← links)
- Solving or resolving inadequate and noisy tomographic systems (Q1074329) (← links)
- Finite element method with optimal nodal velocity (Q1098251) (← links)
- Fast \(l_ p\) solution of large, sparse, linear systems: Application to seismic travel time tomography (Q1098560) (← links)
- A survey of the advances in the exploitation of the sparsity in the solution of large problems (Q1099926) (← links)
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value (Q1103522) (← links)
