Analysis of a Helmholtz preconditioning problem motivated by uncertainty quantification

This paper analyses the following question: let A j , j = 1,2, be the Galerkin matrices corresponding to finite-element discretisations of the exterior Dirichlet problem for the heterogeneous Helmholtz equations ∇⋅ ( A j ∇ u j ) + k 2 n j u j = − f . How small must ∥ A 1 − A 2 ∥ L q and ∥ n 1 − n 2 ∥ L q be (in terms of k -dependence) for GMRES applied to either ( A 1 ) − 1 A 2 or A 2 ( A 1 ) − 1 to converge in a k -independent number of iterations for arbitrarily large k ? (In other words, for A 1 to be a good left or right preconditioner for A 2 ?) We prove results answering this question, give theoretical evidence for their sharpness, and give numerical experiments supporting the estimates. Our motivation for tackling this question comes from calculating quantities of interest for the Helmholtz equation with random coefficients A and n . Such a calculation may require the solution of many deterministic Helmholtz problems, each with different A and n , and the answer to the question above dictates to what extent a previously calculated inverse of one of the Galerkin matrices can be used as a preconditioner for other Galerkin matrices.