PDE Solvers as Operators#
Consider the elliptic PDE
with Dirichlet boundary conditions
where \(\Omega\) is a domain in \(\mathbb{R}^d\), \(a\) and \(f\) are scalar functions on \(\Omega\), and \(g\) is a scalar function on \(\partial\Omega\).
Let’s think a bit about the solver. What sort of object is it? Consider the space of scalar functions on \(\Omega\):
Similarly, let \(\mathcal{A}\), \(\mathcal{F}\), and \(\mathcal{G}\) be the spaces of scalar functions for \(a\), \(f\), and \(g\), respectively, on their corresponding domains. The solver is a map
that takes the coefficients \(a\), \(f\), and \(g\) and returns the solution \(u\):
We call maps with function-valued inputs and outputs operators. The solver is an operator that maps the coefficients to the solution.
Uncertainty in function-valued inputs#
We may be uncertain about the function-valued inputs to a scientific model. For example, we may not know the exact values of the thermal conductivity \(a\). We can model this uncertainty by considering \(a\) as a random field. Similarly for \(f\) and \(g\).
The most common choice of random field is a Gaussian process. Now, the thermal conductivity \(a\) is positive, so we can model it as a log-Gaussian process. We say:
and we can set
where \(m\) is a mean function and \(k\) is a covariance function. Recall that you can use the mean function to encode information about trends and the covariance function to encode information about smoothness.
Uncertainty propagation with Monte Carlo#
Recall that you can sample Gaussian random fields wherever you like. So, you can sample \(h\) at a set of points \(\{x_i\}_{i=1}^n\). Then, you can compute the thermal conductivity at these points:
where the function values
are drawn from a multivariate normal distribution:
with
and
If you pick the points \(\{x_i\}_{i=1}^n\) to be the nodes of a finite element mesh, then you can compute the solution \(u\) at these points. You can then use the finite element solver to interpolate the solution to the entire domain. You can repeat this process many times to get a Monte Carlo estimate of the statistics of the solution.
Finite coordinates for function-valued inputs#
Sampling a field at \(n\) mesh points replaces one function-valued input with a vector in \(\mathbb{R}^n\). When \(n\) is large, a surrogate constructed directly on those values must learn in a high-dimensional input space, which can require many model evaluations. The next step is to approximate the field with a shorter vector of coordinates that retains its dominant variation.
Singular value decomposition provides the low-rank matrix construction used to identify such coordinates. Principal component analysis and the Karhunen–Loève expansion then provide data-driven and covariance-driven representations, respectively. These finite coordinate systems turn a function-valued uncertainty problem into a lower-dimensional uncertainty-propagation problem.