Related papers: On Element SDD Approximability
We provide an approach to implementing the shallow atmosphere approximation in three dimensional finite element discretisations for dynamical cores. The approach makes use of the fact that the shallow atmosphere approximation metric can be…
In this paper the semi-discrete finite element approximation of initial boundary value problems for Maxwell's equations in nonliear media of Kerr-type is investigated. For the case of N\'ed\'elec elements from the first family, a priori…
We present a simple method to deal with caustics in the semiclassical approximation to the thermal density matrix of a particle moving on the line. For simplicity, only its diagonal elements are considered. The only ingredient we require is…
In this paper we consider approximations of Neumann problems for the integral fractional Laplacian by continuous, piecewise linear finite elements. We analyze the weak formulation of such problems, including their well-posedness and…
A general adaptive refinement strategy for solving linear elliptic partial differential equation with random data is proposed and analysed herein. The adaptive strategy extends the a posteriori error estimation framework introduced by…
A finite element method for elliptic problems with discontinuous coefficients is presented. The discontinuity is assumed to take place along a closed smooth curve. The proposed method allows to deal with meshes that are not adapted to the…
In the context of unfitted finite element discretizations the realization of high order methods is challenging due to the fact that the geometry approximation has to be sufficiently accurate. Recently a new unfitted finite element method…
While much attention of neural network methods is devoted to high-dimensional PDE problems, in this work we consider methods designed to work for elliptic problems on domains $\Omega \subset \mathbb{R} ^d, $ $d=1,2,3$ in association with…
We show that Laplacian and symmetric diagonally dominant (SDD) matrices can be well approximated by linear-sized sparse Cholesky factorizations. We show that these matrices have constant-factor approximations of the form $L L^{T}$, where…
We combine the parameterization method for invariant manifolds with the finite element method for elliptic PDEs,to obtain a new computational framework for high order approximation of invariant manifolds attached to unstable equilibrium…
We consider the problem of domain approximation in finite element methods for Maxwell equations on curved domains, i.e., when affine or polynomial meshes fail to exactly cover the domain of interest. In such cases, one is forced to…
Matrices arising in scientific applications frequently admit linear low-rank approximations due to smoothness in the physical and/or temporal domain of the problem. In large-scale problems, computing an optimal low-rank approximation can be…
The problem of approximating a matrix by a low-rank one has been extensively studied. This problem assumes, however, that the whole matrix has a low-rank structure. This assumption is often false for real-world matrices. We consider the…
The matrix low-rank approximation problem with additional convex constraints can find many applications and has been extensively studied before. However, this problem is shown to be nonconvex and NP-hard; most of the existing solutions are…
Spherical radial basis functions are used to define approximate solutions to strongly elliptic pseudodifferential equations on the unit sphere. These equations arise from geodesy. The approximate solutions are found by the Galerkin and…
We consider the problem of approximating nonconvex quadratic optimization with ellipsoid constraints (ECQP). We show some SDP-based approximation bounds for special cases of (ECQP) can be improved by trivially applying the extened Pataki's…
We discuss the approximation of eigenvalue problems associated with elliptic partial differential equations using the virtual element method. After recalling the abstract theory, we present a model problem, describing in detail the features…
We derive computable error estimates for finite element approximations of linear elliptic partial differential equations (PDE) with rough stochastic coefficients. In this setting, the exact solutions contain high frequency content that…
We consider an elliptic partial differential equation in non-divergence form with a random diffusion matrix and random forcing term. To address this, we propose a mixed-type continuous finite element discretization in the physical domain,…
A unit spherical Euclidean distance matrix (EDM) D is a matrix whose entries can be realized as the interpoint (squared) Euclidean distances of n points on a unit sphere. In this paper, given such a D and 1 \leq k < l \leq n, we present a…