A polynomial dimension-dependence analysis of Bramble--Pasciak--Xu preconditioners

TL;DR

This paper demonstrates that BPX preconditioners for high-dimensional PDEs have condition numbers growing only polynomially with dimension, enabling potential exponential speedups in quantum algorithms.

Contribution

The paper introduces a new quasi-interpolation operator with polynomial dimension dependence and establishes polynomial bounds on BPX preconditioners' condition numbers.

Findings

Condition numbers grow polynomially with dimension

New quasi-interpolation operator with polynomial constants

Implications for quantum computing speedups

Abstract

We investigate the dimension dependence of Bramble--Pasciak--Xu (BPX) preconditioners for high-dimensional partial differential equations and establish that the condition numbers of BPX-preconditioned systems grow only polynomially with the spatial dimension. Our analysis requires a careful derivation of the dimension dependence of several fundamental tools in the theory of finite element methods, including the elliptic regularity, Bramble--Hilbert lemma, trace inequalities, and inverse inequalities. We further introduce a new quasi-interpolation operator into finite element spaces, a variant of the classical Scott--Zhang interpolation, whose associated constants scale polynomially with the dimension. Building on these ingredients, we prove a multilevel norm equivalence theorem and derive a BPX preconditioner with explicit polynomial bounds on its dimensional dependence. This result has notable implications for emerging quantum computing methodologies: recent studies indicate that polynomial dependence of BPX preconditioners on dimension can yield exponential speedups for quantum-algorithmic approaches over their classical counterparts.