Structured Random Sketching for PDE Inverse Problems
From MaRDI portal
Publication:5146630
DOI10.1137/20M1310497zbMath1461.65057arXiv1909.11290OpenAlexW3102968907MaRDI QIDQ5146630
Kit Newton, Stephen J. Wright, Qin Li, Ke Chen
Publication date: 26 January 2021
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.11290
Related Items
On unifying randomized methods for inverse problems, Tensor-Structured Sketching for Constrained Least Squares
Cites Work
- Unnamed Item
- Unnamed Item
- Faster least squares approximation
- Randomized interpolative decomposition of separated representations
- Hanson-Wright inequality and sub-Gaussian concentration
- Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument
- Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares
- The Fast Cauchy Transform and Faster Robust Linear Regression
- Randomized Alternating Least Squares for Canonical Tensor Decompositions: Application to A PDE With Random Data
- Computational Advertising: Techniques for Targeting Relevant Ads
- Randomized Sketches of Convex Programs With Sharp Guarantees
- A fast randomized algorithm for overdetermined linear least-squares regression
- Randomized Algorithms for Matrices and Data
- Low-Rank Approximation and Regression in Input Sparsity Time
- Extensions of Lipschitz mappings into a Hilbert space
- Random weighted projections, random quadratic forms and random eigenvectors
- Optical tomography in medical imaging
- Electrical Impedance Tomography
- Stability of stationary inverse transport equation in diffusion scaling
- High-Dimensional Probability
- A Practical Randomized CP Tensor Decomposition
- Electrical impedance tomography
- Subspace embeddings for the L 1 -norm with applications
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Compressed matrix multiplication
