Matrix probing and its conditioning
From MaRDI portal
conditioninglarge deviation estimatespreconditionerspseudodifferential operatorsrandomized algorithmssystem identification
Conditioning of matrices (15A12) Preconditioners for iterative methods (65F08) Numerical computation of matrix norms, conditioning, scaling (65F35) Probabilistic methods, particle methods, etc. for boundary value problems involving PDEs (65N75) Numerical methods for trigonometric approximation and interpolation (65T40) Randomized algorithms (68W20)
Abstract: When a matrix A with n columns is known to be well approximated by a linear combination of basis matrices B_1,..., B_p, we can apply A to a random vector and solve a linear system to recover this linear combination. The same technique can be used to recover an approximation to A^-1. A basic question is whether this linear system is invertible and well-conditioned. In this paper, we show that if the Gram matrix of the B_j's is sufficiently well-conditioned and each B_j has a high numerical rank, then n {proportional} p log^2 n will ensure that the linear system is well-conditioned with high probability. Our main application is probing linear operators with smooth pseudodifferential symbols such as the wave equation Hessian in seismic imaging. We demonstrate numerically that matrix probing can also produce good preconditioners for inverting elliptic operators in variable media.
Recommendations
Cited in
(9)- Estimation of linear operators from scattered impulse responses
- Matrix concentration inequalities via the method of exchangeable pairs
- Compressed absorbing boundary conditions via matrix probing
- The restricted isometry property for time-frequency structured random matrices
- Double sweep preconditioner for optimized Schwarz methods applied to the Helmholtz problem
- Nested Domain Decomposition with Polarized Traces for the 2D Helmholtz Equation
- scientific article; zbMATH DE number 3994917 (Why is no real title available?)
- Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators
- Cornerstones of sampling of operator theory
This page was built for publication: Matrix probing and its conditioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2882338)