Monte Carlo Estimators for the Schatten p-norm of Symmetric Positive Semidefinite Matrices

05/20/2020 ∙ by Ethan Dudley, et al. ∙ 0

We present numerical methods for computing the Schatten p-norm of positive semi-definite matrices. Our motivation stems from uncertainty quantification and optimal experimental design for inverse problems, where the Schatten p-norm defines a design criterion known as the P-optimal criterion. Computing the Schatten p-norm of high-dimensional matrices is computationally expensive. We propose a matrix-free method to estimate the Schatten p-norm using a Monte Carlo estimator and derive convergence results and error estimates for the estimator. To efficiently compute the Schatten p-norm for non-integer and large values of p, we use an estimator using a Chebyshev polynomial approximation and extend our convergence and error analysis to this setting as well. We demonstrate the performance of our proposed estimators on several test matrices and through an application to optimal experimental design of a model inverse problem.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.