Large-scale stochastic linear inversion using hierarchical matrices. Illustrated with an application to crosswell tomography in seismic imaging
From MaRDI portal
Publication:1663467
DOI10.1007/s10596-013-9364-0zbMath1395.62050OpenAlexW1230375122MaRDI QIDQ1663467
Eric Darve, Judith Yue Li, Sivaram Ambikasaran, Peter K. Kitanidis
Publication date: 21 August 2018
Published in: Computational Geosciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10596-013-9364-0
numerical linear algebratomographyhierarchical matriceslarge-scale problemssubsurface imagingstochastic inverse modelinggeostatistical estimation
Bayesian inference (62F15) Image analysis in multivariate analysis (62H35) Probabilistic models, generic numerical methods in probability and statistics (65C20)
Related Items
A fast block low-rank dense solver with applications to finite-element matrices, Likelihood approximation with hierarchical matrices for large spatial datasets, HODLR2D: A New Class of Hierarchical Matrices, HODLR\(d\)D: a new black-box fast algorithm for \(N\)-body problems in \(d\)-dimensions with guaranteed error bounds. Applications to integral equations and support vector machines, Generalized Hybrid Iterative Methods for Large-Scale Bayesian Inverse Problems, Randomized algorithms for generalized Hermitian eigenvalue problems with application to computing Karhunen–Loève expansion, Tucker tensor analysis of Matérn functions in spatial statistics, Hybrid projection methods for large-scale inverse problems with mixed Gaussian priors
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast directional multilevel summation for oscillatory kernels based on Chebyshev interpolation
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- Efficient computation of linearized cross-covariance and auto-covariance matrices of interdependent quantities
- A fast randomized algorithm for the approximation of matrices
- Application of FFT-based algorithms for large-scale universal kriging problems
- The black-box fast multipole method
- On the fast matrix multiplication in the boundary element method by panel clustering
- Fast evaluation of radial basis functions. I
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A theory of pseudoskeleton approximations
- Construction and arithmetics of \(\mathcal H\)-matrices
- A fast adaptive multipole algorithm in three dimensions
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Strong rank revealing LU factorizations
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- The fast multipole method: Numerical implementation
- Randomized algorithms for the low-rank approximation of matrices
- Fast algorithms for hierarchically semiseparable matrices
- Computationally exploitable structure of covariance matrices and generalized convariance matrices in spatial models
- Direct Methods for Sparse Linear Systems
- A theory for multiresolution signal decomposition: the wavelet representation
- The Fast Multipole Method I: Error Analysis and Asymptotic Complexity
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- On the Compression of Low Rank Matrices
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Fast monte-carlo algorithms for finding low-rank approximations
- A fast algorithm for particle simulations
- Computationally efficient restricted maximum likelihood estimation of generalized covariance functions
