W Cai, CF Kaminski - Progress in energy and combustion science, 2017 - Elsevier
Optical imaging techniques are ubiquitous for the resolution of non-uniformities in gas flows. Planar imaging techniques such as laser-induced fluorescence are well established and …
We improve a recent gurantee of Bach and Moulines on the linear convergence of SGD for smooth and strongly convex objectives, reducing a quadratic dependence on the strong …
This revised and updated second edition–now with two new chapters-is the only book to give a comprehensive overview of computer algorithms for image reconstruction. It covers …
C Byrne - Inverse problems, 2003 - iopscience.iop.org
Let T be a (possibly nonlinear) continuous operator on Hilbert space. If, for some starting vector x, the orbit sequence {T kx, k= 0, 1,...} converges, then the limit z is a fixed point of T; …
T Strohmer, R Vershynin - Journal of Fourier Analysis and Applications, 2009 - Springer
The Kaczmarz method for solving linear systems of equations is an iterative algorithm that has found many applications ranging from computer tomography to digital signal …
For solving large-scale systems of linear equations by iteration methods, we introduce an effective probability criterion for selecting the working rows from the coefficient matrix and …
The multiple-sets split feasibility problem requires finding a point closest to a family of closed convex sets in one space such that its image under a linear transformation will be closest to …
D Needell, JA Tropp - Linear Algebra and its Applications, 2014 - Elsevier
The block Kaczmarz method is an iterative scheme for solving overdetermined least-squares problems. At each step, the algorithm projects the current iterate onto the solution space of a …
A Zouzias, NM Freris - SIAM Journal on Matrix Analysis and Applications, 2013 - SIAM
We present a randomized iterative algorithm that exponentially converges in the mean square to the minimum \ell_2-norm least squares solution of a given linear system of …