Searcharxiv⌕ Search

arXiv subjects

Fabio Nobile

Publications and source records attributed to Fabio Nobile.

At least 55 records · Page 3Linked to original sources

Stable high-order randomized cubature formulae in arbitrary dimension

We propose and analyse randomized cubature formulae for the numerical integration of functions with respect to a given probability measure $μ$ defined on a domain $Γ\subseteq \mathbb{R}^d$, in any dimension $d$. Each cubature formula is exact on a given finite-dimensional subspace $V_n\subset L^2(Γ,μ)$ of dimension $n$, and uses pointwise evaluations of the integrand function $ϕ: Γ\to \mathbb{R}$ at $m>n$ independent random points. These points are drawn from a suitable auxiliary probability measure that depends on $V_n$. We show that, up to a logarithmic factor, a linear proportionality between $m$ and $n$ with dimension-independent constant ensures stability of the cubature formula with high probability. We also prove error estimates in probability and in expectation for any $n\geq 1$ and $m>n$, thus covering both preasymptotic and asymptotic regimes. Our analysis shows that the expected cubature error decays as $\sqrt{n/m}$ times the $L(Γ, μ)$-best approximation error of $ϕ$ in $V_n$. On the one hand, for fixed $n$ and $m\to \infty$ our cubature formula can be seen as a variance reduction technique for a Monte Carlo estimator, and can lead to enormous variance reduction for smooth integrand functions and subspaces $V_n$ with spectral approximation properties. On the other hand, when we let $n,m\to\infty$, our cubature becomes of high order with spectral convergence. As a further contribution, we analyse also another cubature formula whose expected error decays as $\sqrt{1/m}$ times the $L^2(Γ,μ)$-best approximation error of $ϕ$ in $V_n$, which is asymptotically optimal but with constants that can be larger in the preasymptotic regime. Finally we show that, under a more demanding (at least quadratic) proportionality betweeen $m$ and $n$, the weights of the cubature are positive with high probability.

math.NA↗

Function integration, reconstruction and approximation using rank-1 lattices

We consider rank-1 lattices for integration and reconstruction of functions with series expansion supported on a finite index set. We explore the connection between the periodic Fourier space and the non-periodic cosine space and Chebyshev space, via tent transform and then cosine transform, to transfer known results from the periodic setting into new insights for the non-periodic settings. Fast discrete cosine transform can be applied for the reconstruction phase. To reduce the size of the auxiliary index set in the associated component-by-component (CBC) construction for the lattice generating vectors, we work with a bi-orthonormal set of basis functions, leading to three methods for function reconstruction in the non-periodic settings. We provide new theory and efficient algorithmic strategies for the CBC construction. We also interpret our results in the context of general function approximation and discrete least-squares approximation.

math.NA↗

PDE-constrained optimal control problems with uncertain parameters using SAGA

We consider an optimal control problem (OCP) for a partial differential equation (PDE) with random coefficients. The optimal control function is a deterministic, distributed forcing term that minimizes an expected quadratic regularized loss functional. For the numerical approximation of this PDE-constrained OCP, we replace the expectation in the objective functional by a suitable quadrature formula and, eventually, discretize the PDE by a Galerkin method. To practically solve such approximate OCP, we propose an importance sampling version the SAGA algorithm, a type of Stochastic Gradient algorithm with a fixed-length memory term, which computes at each iteration the gradient of the loss functional in only one quadrature point, randomly chosen from a possibly non-uniform distribution. We provide a full error and complexity analysis of the proposed numerical scheme. In particular we compare the complexity of the generalized SAGA algorithm with importance sampling, with that of the Stochastic Gradient (SG) and the Conjugate Gradient (CG) algorithms, applied to the same discretized OCP.We show that SAGA converges exponentially in the number of iterations as for a CG algorithm and has a similar asymptotic computational complexity, in terms of computational cost versus accuracy (proportional with the time required if no parallel computing is used). Moreover, it features good pre-asymptotic properties, as shown by our numerical experiments, which makes it appealing in a limited budget context.

math.OC↗

Wavelet-Fourier CORSING techniques for multi-dimensional advection-diffusion-reaction equations

We present and analyze a novel wavelet-Fourier technique for the numerical treatment of multidimensional advection-diffusion-reaction equations based on the CORSING (COmpRessed SolvING) paradigm. Combining the Petrov-Galerkin technique with the compressed sensing approach, the proposed method is able to approximate the largest coefficients of the solution with respect to a biorthogonal wavelet basis. Namely, we assemble a compressed discretization based on randomized subsampling of the Fourier test space and we employ sparse recovery techniques to approximate the solution to the PDE. In this paper, we provide the first rigorous recovery error bounds and effective recipes for the implementation of the CORSING technique in the multi-dimensional setting. Our theoretical analysis relies on new estimates for the local a-coherence, which measures interferences between wavelet and Fourier basis functions with respect to the metric induced by the PDE operator. The stability and robustness of the proposed scheme is shown by numerical illustrations in the one-, two-, and three-dimensional case.

math.NA↗

Regularity and sparse approximation of the recursive first moment equations for the lognormal Darcy problem

We study the Darcy boundary value problem with log-normal permeability field. We adopt a perturbation approach, expanding the solution in Taylor series around the nominal value of the coefficient, and approximating the expected value of the stochastic solution of the PDE by the expected value of its Taylor polynomial. The recursive deterministic equation satisfied by the expected value of the Taylor polynomial (first moment equation) is formally derived. Well-posedness and regularity results for the recursion are proved to hold in Sobolev space-valued Hölder spaces with mixed regularity. The recursive first moment equation is then discretized by means of a sparse approximation technique, and the convergence rates are derived.

math.NA↗

Multilevel ensemble Kalman filtering for spatio-temporal processes

We design and analyse the performance of a multilevel ensemble Kalman filter method (MLEnKF) for filtering settings where the underlying state-space model is an infinite-dimensional spatio-temporal process. We consider underlying models that needs to be simulated by numerical methods, with discretization in both space and time. The multilevel Monte Carlo (MLMC) sampling strategy, achieving variance reduction through pairwise coupling of ensemble particles on neighboring resolutions, is used in the sample-moment step of MLEnKF to produce an efficient hierarchical filtering method for spatio-temporal models. Under sufficient regularity, MLEnKF is proven to be more efficient for weak approximations than EnKF, asymptotically in the large-ensemble and fine-numerical-resolution limit. Numerical examples support our theoretical findings.

math.NA↗

Existence of dynamical low rank approximations for random semi-linear evolutionary equations on the maximal interval

An existence result is presented for the dynamical low rank (DLR) approximation for random semi-linear evolutionary equations. The DLR solution approximates the true solution at each time instant by a linear combination of products of deterministic and stochastic basis functions, both of which evolve over time. A key to our proof is to find a suitable equivalent formulation of the original problem. The so-called Dual Dynamically Orthogonal formulation turns out to be convenient. Based on this formulation, the DLR approximation is recast to an abstract Cauchy problem in a suitable linear space, for which existence and uniqueness of the solution in the maximal interval are established.

math.NA↗

A Multilevel Stochastic Gradient method for PDE-constrained Optimal Control Problems with uncertain parameters

In this paper, we present a multilevel Monte Carlo (MLMC) version of the Stochastic Gradient (SG) method for optimization under uncertainty, in order to tackle Optimal Control Problems (OCP) where the constraints are described in the form of PDEs with random parameters. The deterministic control acts as a distributed forcing term in the random PDE and the objective function is an expected quadratic loss. We use a Stochastic Gradient approach to compute the optimal control, where the steepest descent direction of the expected loss, at each iteration, is replaced by independent MLMC estimators with increasing accuracy and computational cost. The refinement strategy is chosen a-priori such that the bias and, possibly, the variance of the MLMC estimator decays as a function of the iteration counter. Detailed convergence and complexity analyses of the proposed strategy are presented and asymptotically optimal decay rates are identified such that the total computational work is minimized. We also present and analyze an alternative version of the multilevel SG algorithm that uses a randomized MLMC estimator at each iteration. Our methodology is validated through a numerical example.

math.OC↗

Sparse Polynomial Chaos expansions using Variational Relevance Vector Machines

The challenges for non-intrusive methods for Polynomial Chaos modeling lie in the computational efficiency and accuracy under a limited number of model simulations. These challenges can be addressed by enforcing sparsity in the series representation through retaining only the most important basis terms. In this work, we present a novel sparse Bayesian learning technique for obtaining sparse Polynomial Chaos expansions which is based on a Relevance Vector Machine model and is trained using Variational Inference. The methodology shows great potential in high-dimensional data-driven settings using relatively few data points and achieves user-controlled sparse levels that are comparable to other methods such as compressive sensing. The proposed approach is illustrated on two numerical examples, a synthetic response function that is explored for validation purposes and a low-carbon steel plate with random Young's modulus and random loading, which is modeled by stochastic finite element with 38 input random variables.

stat.ML↗

Fast Least-Squares Padé approximation of problems with normal operators and meromorphic structure

In this work, we consider the approximation of Hilbert space-valued meromorphic functions that arise as solution maps of parametric PDEs whose operator is the shift of an operator with normal and compact resolvent, e.g. the Helmholtz equation. In this restrictive setting, we propose a simplified version of the Least-Squares Padé approximation technique introduced in [6] following [11]. In particular, the estimation of the poles of the target function reduces to a low-dimensional eigenproblem for a Gramian matrix, allowing for a robust and efficient numerical implementation (hence the "fast" in the name). Moreover, we prove several theoretical results that improve and extend those in [6], including the exponential decay of the error in the approximation of the poles, and the convergence in measure of the approximant to the target function. The latter result extends the classical one for scalar Padé approximation to our functional framework. We provide numerical results that confirm the improved accuracy of the proposed method with respect to the one introduced in [6] for differential operators with normal and compact resolvent.

math.NA↗

Sparse approximation of multilinear problems with applications to kernel-based methods in UQ

We provide a framework for the sparse approximation of multilinear problems and show that several problems in uncertainty quantification fit within this framework. In these problems, the value of a multilinear map has to be approximated using approximations of different accuracy and computational work of the arguments of this map. We propose and analyze a generalized version of Smolyak's algorithm, which provides sparse approximation formulas with convergence rates that mitigate the curse of dimension that appears in multilinear approximation problems with a large number of arguments. We apply the general framework to response surface approximation and optimization under uncertainty for parametric partial differential equations using kernel-based approximation. The theoretical results are supplemented by numerical experiments.

math.NA↗

Least-Squares Padé approximation of parametric and stochastic Helmholtz maps

The present work deals with the rational model order reduction method based on the single-point Least-Square (LS) Padé approximation technique introduced in [3]. Algorithmical aspects concerning the construction of the rational LS-Padé approximant are described. In particular, the computation of the Padé denominator is reduced to the calculation of the eigenvector corresponding to the minimal eigenvalue of a Gramian matrix. The LS-Padé technique is employed to approximate the frequency response map associated to various parametric time-harmonic wave problems, namely, a transmission/reflection problem, a scattering problem and a problem in high-frequency regime. In all cases we establish the meromorphy of the frequency response map. The Helmholtz equation with stochastic wavenumber is also considered. In particular, for Lipschitz functionals of the solution, and their corresponding probability measures, we establish weak convergence of the measure derived from the LS-Padé approximant to the true one. 2D numerical tests are performed, which confirm the effectiveness of the approximation method.

math.NA↗

Multilevel weighted least squares polynomial approximation

Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required to achieve quasi-optimal approximation in a given polynomial subspace scales, up to a logarithmic factor, linearly in the dimension of this space. However, in many applications, the computation of samples includes a numerical discretization error. Thus, obtaining polynomial approximations with a single level method can become prohibitively expensive, as it requires a sufficiently large number of samples, each computed with a sufficiently small discretization error. As a solution to this problem, we propose a multilevel method that utilizes samples computed with different accuracies and is able to match the accuracy of single-level approximations with reduced computational cost. We derive complexity bounds under certain assumptions about polynomial approximability and sample work. Furthermore, we propose an adaptive algorithm for situations where such assumptions cannot be verified a priori. Finally, we provide an efficient algorithm for the sampling from optimal distributions and an analysis of computationally favorable alternative distributions. Numerical experiments underscore the practical applicability of our method.

math.NA↗

Uncertainty Quantification of geochemical and mechanical compaction in layered sedimentary basins

In this work we propose an Uncertainty Quantification methodology for sedimentary basins evolution under mechanical and geochemical compaction processes, which we model as a coupled, time-dependent, non-linear, monodimensional (depth-only) system of PDEs with uncertain parameters. While in previous works (Formaggia et al. 2013, Porta et al., 2014) we assumed a simplified depositional history with only one material, in this work we consider multi-layered basins, in which each layer is characterized by a different material, and hence by different properties. This setting requires several improvements with respect to our earlier works, both concerning the deterministic solver and the stochastic discretization. On the deterministic side, we replace the previous fixed-point iterative solver with a more efficient Newton solver at each step of the time-discretization. On the stochastic side, the multi-layered structure gives rise to discontinuities in the dependence of the state variables on the uncertain parameters, that need an appropriate treatment for surrogate modeling techniques, such as sparse grids, to be effective. We propose an innovative methodology to this end which relies on a change of coordinate system to align the discontinuities of the target function within the random parameter space. The reference coordinate system is built upon exploiting physical features of the problem at hand. We employ the locations of material interfaces, which display a smooth dependence on the random parameters and are therefore amenable to sparse grid polynomial approximations. We showcase the capabilities of our numerical methodologies through two synthetic test cases. In particular, we show that our methodology reproduces with high accuracy multi-modal probability density functions displayed by target state variables (e.g., porosity).

math.NA↗

Hybrid collocation perturbation for PDEs with random domains

In this work we consider the problem of approximating the statistics of a given Quantity of Interest (QoI) that depends on the solution of a linear elliptic PDE defined over a random domain parameterized by $N$ random variables. The random domain is split into large and small variations contributions. The large variations are approximated by applying a sparse grid stochastic collocation method. The small variations are approximated with a stochastic collocation-perturbation method. Convergence rates for the variance of the QoI are derived and compared to those obtained in numerical experiments. Our approach significantly reduces the dimensionality of the stochastic problem. The computational cost of this method increases at most quadratically with respect to the number of dimensions of the small variations. Moreover, for the case that the small and large variations are independent the cost increases linearly.

math.NA↗

Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

We analyze the accuracy of the discrete least-squares approximation of a function $u$ in multivariate polynomial spaces $\mathbb{P}_Λ:={\rm span} \{y\mapsto y^ν\,: \, ν\in Λ\}$ with $Λ\subset \mathbb{N}_0^d$ over the domain $Γ:=[-1,1]^d$, based on the sampling of this function at points $y^1,\dots,y^m \in Γ$. The samples are independently drawn according to a given probability density $ρ$ belonging to the class of multivariate beta densities, which includes the uniform and Chebyshev densities as particular cases. We restrict our attention to polynomial spaces associated with \emph{downward closed} sets $Λ$ of \emph{prescribed} cardinality $n$, and we optimize the choice of the space for the given sample. This implies, in particular, that the selected polynomial space depends on the sample. We are interested in comparing the error of this least-squares approximation measured in $L^2(Γ,dρ)$ with the best achievable polynomial approximation error when using downward closed sets of cardinality $n$. We establish conditions between the dimension $n$ and the size $m$ of the sample, under which these two errors are proven to be comparable. Our main finding is that the dimension $d$ enters only moderately in the resulting trade-off between $m$ and $n$, in terms of a logarithmic factor $\ln(d)$, and is even absent when the optimization is restricted to a relevant subclass of downward closed sets, named {\it anchored} sets. In principle, this allows one to use these methods in arbitrarily high or even infinite dimension. Our analysis builds upon [2] which considered fixed and nonoptimized downward closed multi-index sets. Potential applications of the proposed results are found in the development and analysis of numerical methods for computing the solution to high-dimensional parametric or stochastic PDEs.

math.NA↗

Multilevel ensemble Kalman filtering for spatially extended models

This work embeds a multilevel Monte Carlo (MLMC) sampling strategy into the Monte Carlo step of the ensemble Kalman filter (EnKF), thereby yielding a multilevel ensemble Kalman filter (MLEnKF) which has provably superior asymptotic cost to a given accuracy level. The development of MLEnKF for finite-dimensional state-spaces in the work [20] is here extended to models with infinite-dimensional state- spaces in the form of spatial fields. A concrete example is given to illustrate the results.

math.NA↗

Multi-index Stochastic Collocation convergence rates for random PDEs with parametric regularity

We analyze the recent Multi-index Stochastic Collocation (MISC) method for computing statistics of the solution of a partial differential equation (PDEs) with random data, where the random coefficient is parametrized by means of a countable sequence of terms in a suitable expansion. MISC is a combination technique based on mixed differences of spatial approximations and quadratures over the space of random data and, naturally, the error analysis uses the joint regularity of the solution with respect to both the variables in the physical domain and parametric variables. In MISC, the number of problem solutions performed at each discretization level is not determined by balancing the spatial and stochastic components of the error, but rather by suitably extending the knapsack-problem approach employed in the construction of the quasi-optimal sparse-grids and Multi-index Monte Carlo methods. We use a greedy optimization procedure to select the most effective mixed differences to include in the MISC estimator. We apply our theoretical estimates to a linear elliptic PDEs in which the log-diffusion coefficient is modeled as a random field, with a covariance similar to a Matérn model, whose realizations have spatial regularity determined by a scalar parameter. We conduct a complexity analysis based on a summability argument showing algebraic rates of convergence with respect to the overall computational work. The rate of convergence depends on the smoothness parameter, the physical dimensionality and the efficiency of the linear solver. Numerical experiments show the effectiveness of MISC in this infinite-dimensional setting compared with the Multi-index Monte Carlo method and compare the convergence rate against the rates predicted in our theoretical analysis.

math.NA↗