Related papers: A matrix-free isogeometric Galerkin method for Kar…
Many boundary element integral equation kernels are based on the Green's functions of the Laplace and Helmholtz equations in three dimensions. These include, for example, the Laplace, Helmholtz, elasticity, Stokes, and Maxwell's equations.…
We investigate a macro-element variant of the hybridized discontinuous Galerkin (HDG) method, using patches of standard simplicial elements that can have non-matching interfaces. Coupled via the HDG technique, our method enables local…
In this paper, we consider low-rank approximations for the solutions to the stochastic Helmholtz equation with random coefficients. A Stochastic Galerkin finite element method is used for the discretization of the Helmholtz problem.…
Recent hardware-aware matrix-free algorithms for higher-order finite-element (FE) discretized matrix-vector multiplications reduce floating point operations and data access costs compared to traditional sparse matrix approaches. This work…
The technique of complex scaling for time harmonic wave type equations relies on a complex coordinate stretching to generate exponentially decaying solutions. In this work, we use a Galerkin method with ansatz functions with infinite…
A promising approach for scalable Gaussian processes (GPs) is the Karhunen-Lo\`eve (KL) decomposition, in which the GP kernel is represented by a set of basis functions which are the eigenfunctions of the kernel operator. Such decomposed…
Finite-element (FE) discretisations have emerged as a powerful real-space alternative to large-scale Kohn-Sham density functional theory (DFT) calculations, offering systematic convergence, excellent parallel scalability, while…
In the context of isogeometric analysis, we consider two discretization approaches that make the resulting stiffness matrix nonsymmetric even if the differential operator is self-adjoint. These are the collocation method and the…
Approximation of elliptic PDEs with random diffusion coefficients typically requires a representation of the diffusion field in terms of a sequence $y=(y_j)_{j\geq 1}$ of scalar random variables. One may then apply high-dimensional…
Strong approximation errors of both finite element semi-discretization and spatio-temporal full discretization are analyzed for the stochastic Allen-Cahn equation driven by additive noise in space dimension $d \leq 3$. The full…
We consider nodal-based Lagrangian interpolations for the finite element approximation of the Maxwell eigenvalue problem. The first approach introduced is a standard Galerkin method on Powell-Sabin meshes, which has recently been shown to…
We present and analyze a new hybridizable discontinuous Galerkin method (HDG) for the Reissner-Mindlin plate bending system. Our method is based on the formulation utilizing Helmholtz Decomposition. Then the system is decomposed into three…
The solution, $x$, of the linear system of equations $A x\approx b$ arising from the discretization of an ill-posed integral equation with a square integrable kernel $H(s,t)$ is considered. The Tikhonov regularized solution $ x(\lambda)$ is…
We study the high-order local discontinuous Galerkin (LDG) method for the $p$-Laplace equation. We reformulate our spatial discretization as an equivalent convex minimization problem and use a preconditioned gradient descent method as the…
In this paper, the authors devise a new discretization scheme for div-curl systems defined in connected domains with heterogeneous media by using the weak Galerkin finite element method. Two types of boundary value problems are considered…
This article proposes a new numerical algorithm for second order elliptic equations in non-divergence form. The new method is based on a discrete weak Hessian operator locally constructed by following the weak Galerkin strategy. The…
In this paper, we use an implicit two-derivative deferred correction time discretization approach and combine it with a spatial discretization of the discontinuous Galerkin spectral element method to solve (non-)linear PDEs. The resulting…
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…
We construct quasi-Monte Carlo methods to approximate the expected values of linear functionals of Galerkin discretizations of parametric operator equations which depend on a possibly infinite sequence of parameters. Such problems arise in…
In this note we consider the continuous Galerkin time stepping method of arbitrary order as a possible discretization scheme of nonlinear initial value problems. In addition, we develop and generalize a well known existing result for the…