Related papers: Sparsity for parametric PDEs with log-gamma random…
In this paper, we propose a model's sparse representation based on reduced mixed generalized multiscale finite element (GMsFE) basis methods for elliptic PDEs with random inputs. Mixed generalized multiscale finite element method (GMsFEM)…
We study fully-discrete approximations and quadratures of infinite-variate functions in abstract Bochner spaces associated with a Hilbert space $X$ and an infinite-tensor-product Jacobi measure. For target infinite-variate functions taking…
Laguerre polynomials are orthogonal polynomials defined on positive half line with respect to weight $e^{-x}$. They have wide applications in scientific and engineering computations. However, the exponential growth of Laguerre polynomials…
We propose a modification of the standard linear implicit Euler integrator for the weak approximation of parabolic semilinear stochastic PDEs driven by additive space-time white noise. The new method can easily be combined with a finite…
In $\ell^1$-regularization, which is an important tool in signal and image processing, one usually is concerned with signals and images having a sparse representation in some suitable basis, e.g. in a wavelet basis. Many results on…
Sparsity promoting regularization is an important technique for signal reconstruction and several other ill-posed problems. Theoretical investigation typically bases on the assumption that the unknown solution has a sparse representation…
We apply the Tensor Train (TT) approximation to construct the Polynomial Chaos Expansion (PCE) of a random field, and solve the stochastic elliptic diffusion PDE with the stochastic Galerkin discretization. We compare two strategies of the…
We analyze the convergence of compressive sensing based sampling techniques for the efficient evaluation of functionals of solutions for a class of high-dimensional, affine-parametric, linear operator equations which depend on possibly…
Uncertainty quantification (UQ) has received much attention in the literature in the past decade. In this context, Sparse Polynomial chaos expansions (PCE) have been shown to be among the most promising methods because of their ability to…
We show that the expected solution operator of prototypical linear elliptic partial differential operators with random coefficients is well approximated by a computable sparse matrix. This result is based on a random localized orthogonal…
This work deals with a regularization method enforcing solution sparsity of linear ill-posed problems by appropriate discretization in the image space. Namely, we formulate the so called least error method in an $\ell^1$ setting and perform…
The application of Stochastic Differential Equations (SDEs) to the analysis of temporal data has attracted increasing attention, due to their ability to describe complex dynamics with physically interpretable equations. In this paper, we…
This article proposes an efficient numerical method for solving nonlinear partial differential equations (PDEs) based on sparse Gaussian processes (SGPs). Gaussian processes (GPs) have been extensively studied for solving PDEs by…
Stochastic Galerkin methods for non-affine coefficient representations are known to cause major difficulties from theoretical and numerical points of view. In this work, an adaptive Galerkin FE method for linear parametric PDEs with…
This investigation is motivated by PDE-constrained optimization problems arising in connection with electrocardiograms (ECGs) and electroencephalography (EEG). Standard sparsity regularization does not necessarily produce adequate results…
Implicit schemes are popular methods for the integration of time dependent PDEs such as hyperbolic and parabolic PDEs. However the necessity to solve corresponding linear systems at each time step constitutes a complexity bottleneck in…
In this article, we discuss the composite likelihood estimation of sparse Gaussian graphical models. When there are symmetry constraints on the concentration matrix or partial correlation matrix, the likelihood estimation can be…
It is known that standard stochastic Galerkin methods face challenges when solving partial differential equations (PDEs) with random inputs. These challenges are typically attributed to the large number of required physical basis functions…
In this paper, we propose a sparse spectral-Galerkin approximation scheme for solving the second-order partial differential equations on an arbitrary tetrahedron. Generalized Koornwinder polynomials are introduced on the reference…
Approximating the invariant measure and the expectation of the functionals for parabolic stochastic partial differential equations (SPDEs) with non-globally Lipschitz coefficients is an active research area and is far from being well…