1 citations · 2 across the 10 of their papers we have counts for
14 papers · 1 filter
Efficient algorithms for Bayesian Inverse Problems with Whittle--Matérn Priors
Harbir Antil, Arvind K. Saibaba
This paper tackles efficient methods for Bayesian inverse problems with priors based on Whittle--Matérn Gaussian random fields. The Whittle--Matérn prior is characterized by a mean…
Robust Parameter Identifiability Analysis via Column Subset Selection
Katherine J. Pearce, Ilse C. F. Ipsen, Mansoor A. Haider +2
We advocate a numerically reliable and accurate approach for practical parameter identifiability analysis: Applying column subset selection (CSS) to the sensitivity matrix, instead…
Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix
Eric Hallman, Ilse C. F. Ipsen, Arvind Saibaba
For real symmetric matrices that are accessible only through matrix vector products, we present Monte Carlo estimators for computing the diagonal elements. Our probabilistic bounds…
Randomized algorithms for rounding in the Tensor-Train format
Hussam Al Daas, Grey Ballard, Paul Cazeaux +5
The Tensor-Train (TT) format is a highly compact low-rank representation for high-dimensional tensors. TT is particularly useful when representing approximations to the solutions o…
Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions
Arvind K. Saibaba, Rachel Minster, Misha E. Kilmer
In this paper, we introduce a method for multivariate function approximation using function evaluations, Chebyshev polynomials, and tensor-based compression techniques via the Tuck…
Efficient edge-preserving methods for dynamic inverse problems
Mirjeta Pasha, Arvind K. Saibaba, Silvia Gazzola +2
We consider efficient methods for computing solutions to dynamic inverse problems, where both the quantities of interest and the forward operator (measurement process) may change a…