Related papers: Analysis of radial complex scaling methods: scalar…
We study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint partial differential equations with random data. With the stochastic Galerkin approach, the solutions are represented as…
The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary conditions. These operators can be realized as the…
We consider the Galerkin method for approximating the spectrum of an operator $T+A$ where $T$ is semi-bounded self-adjoint and $A$ satisfies a relative compactness condition. We show that the method is reliable in all regions where it is…
A linear PDE problem for randomly perturbed domains is considered in an adaptive Galerkin framework. The perturbation of the domain's boundary is described by a vector valued random field depending on a countable number of random variables…
We establish spectral convergence results of approximations of unbounded non-selfadjoint linear operators with compact resolvents by operators that converge in generalized strong resolvent sense. The aim is to establish general assumptions…
A matrix method for the solution of direct fractional Sturm-Liouville problems on bounded domain is proposed where the fractional derivative is defined in the Riesz sense. The scheme is based on the application of the Galerkin spectral…
We investigate the numerical approximation of the stochastic Allen--Cahn equation with multiplicative noise on a periodic domain. The considered scheme uses a recently proposed augmented variant of scalar auxiliary variable method for the…
Using a deterministic framework allows us to estimate a function with the purpose of interpolating data in spatial statistics. Radial basis functions are commonly used for scattered data interpolation in a d-dimensional space, however,…
The subject of this work is a new stochastic Galerkin method for second-order elliptic partial differential equations with random diffusion coefficients. It combines operator compression in the stochastic variables with tree-based spline…
In this paper we establish best approximation property of fully discrete Galerkin solutions of second order parabolic problems on convex polygonal and polyhedral domains in the $L^\infty(I;W^{1,\infty}(\Om))$ norm. The discretization method…
We present an efficient procedure for computing resonances and resonant modes of Helmholtz problems posed in exterior domains. The problem is formulated as a nonlinear eigenvalue problem (NEP), where the nonlinearity arises from the use of…
We deal with the numerical solution of the time-dependent partial differential equations using the adaptive space-time discontinuous Galerkin (DG) method. The discretization leads to a nonlinear algebraic system at each time level, the size…
We propose a multiscale method for elliptic problems on complex domains, e.g. domains with cracks or complicated boundary. For local singularities this paper also offers a discrete alternative to enrichment techniques such as XFEM. We…
A general framework for the numerical approximation of evolution problems is presented that allows to preserve exactly an underlying Hamiltonian- or gradient structure. The approach relies on rewriting the evolution problem in a particular…
This work proposes a method for solving linear stochastic optimal control (SOC) problems using sum of squares and semidefinite programming. Previous work had used polynomial optimization to approximate the value function, requiring a high…
Discontinuous Galerkin (DG) discretizations with exact representation of the geometry and local polynomial degree adaptivity are revisited. Hybridization techniques are employed to reduce the computational cost of DG approximations and…
In Becker and Jentzen (2019) and Becker et al. (2017), an explicit temporal semi-discretization scheme and a space-time full-discretization scheme were, respectively, introduced and analyzed for the additive noise-driven stochastic…
In this paper we construct numerical schemes to approximate linear transport equations with slab geometry by diffusion equations. We treat both the case of pure diffusive scaling and the case where kinetic and diffusive scalings coexist.…
With the emergence of Artificial Intelligence, numerical algorithms are moving towards more approximate approaches. For methods such as PCA or diffusion maps, it is necessary to compute eigenvalues of a large matrix, which may also be dense…
We propose an approach to domain adaptation for semantic segmentation that is both practical and highly accurate. In contrast to previous work, we abandon the use of computationally involved adversarial objectives, network ensembles and…