Results 151 to 160 of about 180,343 (197)

A randomized method for solving discrete ill-posed problems

Cybernetics and Systems Analysis, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rachkovskij, D. A., Revunova, E. G.
openaire   +2 more sources

An improved preconditioned LSQR for discrete ill-posed problems

Mathematics and Computers in Simulation, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bunse-Gerstner, Angelika, Guerra-Ones, Valia, De La Vega, Humberto Madrid   +2 more
openaire   +1 more source

Confidence Intervals for Discrete Approximations to Ill-Posed Problems

Journal of Computational and Graphical Statistics, 1994
Abstract We consider the linear model Y = Xβ + e that is obtained by discretizing a system of first-kind integral equations describing a set of physical measurements. The n vector β represents the desired quantities, the m x n matrix X represents the instrument response functions, and the m vector Y contains the measurements actually obtained.
Bert W. Rust, Dianne P. O'leary
openaire   +1 more source

Schultz matrix iteration based method for stable solution of discrete ill-posed problems

Linear Algebra and its Applications, 2018
In this paper, we propose an iterative method for solving discrete ill-posed problems based on matrix iterations generated by Schultz method and known to converge to the Moore–Penrose pseudoinverse of a matrix.
F. Bazán, Everton Boos
semanticscholar   +1 more source

The regularizing properties of global GMRES for solving large-scale linear discrete ill-posed problems with several right-hand sides

, 2020
The global Krylov subspace iterative methods are an attractive class of iterative solvers for solving linear systems with several right-hand sides.
Hui Zhang, H. Dai
semanticscholar   +1 more source

Invertible smoothing preconditioners for linear discrete ill-posed problems

Applied Numerical Mathematics, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Calvetti, D., Reichel, L., Shuibi, A.
openaire   +1 more source

Iterative exponential filtering for large discrete ill-posed problems

Numerische Mathematik, 1999
This paper presents an iterative method for the solution of discrete linear ill-posed problems with a symmetric, possible indefinite or singular matrix. The rigth-hand side vector of the linear system \(Ax= g\), represents the given data and is assumed to be contaminated by measurement errors.
Calvetti, D., Reichel, L., Zhang, Q.
openaire   +2 more sources

An L-ribbon for large underdetermined linear discrete ill-posed problems

Numerical Algorithms, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Calvetti D., Morigi S., Reichel L., Sgallari F.   +3 more
openaire   +1 more source

An Application of Systolic Arrays to Linear Discrete Ill-Posed Problems

SIAM Journal on Scientific and Statistical Computing, 1986
This paper deals with the use of systolic arrays for the efficient solution of ill-conditioned linear systems \(Kx=y\), as they appear e.g. when discretizing Fredholm integral equations of the first kind. The (stable) method of solution is (as usual) Tikhonov regularization, where \(Kx=y\) is replaced by \(\| Kx-y\|^ 2+\alpha \| Lx\|^ 2\to \min\) with ...
Eldén, Lars, Schreiber, Robert
openaire   +2 more sources

Tikhonov regularization with MTRSVD method for solving large-scale discrete ill-posed problems

Journal of Computational and Applied Mathematics, 2021
Guang-Xin Huang, Yuanyuan Liu, F. Yin
semanticscholar   +1 more source