Volumetric emission tomography for combustion processes

SJ Grauer, K Mohri, T Yu, H Liu, W Cai - Progress in Energy and …, 2023 - Elsevier
This is a comprehensive, critical, and pedagogical review of volumetric emission
tomography for combustion processes. Many flames that are of interest to scientists and …

Tomographic absorption spectroscopy for the study of gas dynamics and reactive flows

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 …

Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm

D Needell, R Ward, N Srebro - Advances in neural …, 2014 - proceedings.neurips.cc
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 …

[图书][B] Fundamentals of computerized tomography: image reconstruction from projections

GT Herman - 2009 - books.google.com
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 …

A unified treatment of some iterative algorithms in signal processing and image reconstruction

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; …

A randomized Kaczmarz algorithm with exponential convergence

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 …

On greedy randomized Kaczmarz method for solving large sparse linear systems

ZZ Bai, WT Wu - SIAM Journal on Scientific Computing, 2018 - SIAM
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 and its applications for inverse problems

Y Censor, T Elfving, N Kopf, T Bortfeld - Inverse problems, 2005 - iopscience.iop.org
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 …

Paved with good intentions: analysis of a randomized block Kaczmarz method

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 …

Randomized extended Kaczmarz for solving least squares

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 …