Related papers: Analysis of Compatible Discrete Operator Schemes f…
We propose and analyze a two-level method for mimetic finite difference approximations of second order elliptic boundary value problems. We prove that the two-level algorithm is uniformly convergent, i.e., the number of iterations needed to…
A simple but successful strategy for building a discrete diffusion operator in finite volume schemes of industrial use is to correct the standard two-point flux approximation with a term accounting for the local mesh non-orthogonality.…
We give sufficient conditions for some underdetermined elliptic PDE of any order to construct smooth compactly supported solutions. In particular we show that two smooth elements in the kernel of certain underdetermined linear elliptic…
The paper describes a sparse direct solver for the linear systems that arise from the discretization of an elliptic PDE on a two dimensional domain. The scheme decomposes the domain into thin subdomains, or ``slabs'' and uses a two-level…
This paper is concerned with the construction of graded meshes for approximating so-called singular solutions of elliptic boundary value problems by means of multipatch discontinuous Galerkin Isogeometric Analysis schemes. Such solutions…
We develop a numerical strategy to solve multi-dimensional Poisson equations on dynamically adapted grids for evolutionary problems disclosing propagating fronts. The method is an extension of the multiresolution finite volume scheme used…
The existence of uniformly bounded discrete extension operators is established for conforming Raviart-Thomas and N\'ed\'elec discretisations of $H(div)$ and $H(curl)$ on locally refined partitions of a polyhedral domain into tetrahedra.
We construct and analyze approximation rates of deep operator networks (ONets) between infinite-dimensional spaces that emulate with an exponential rate of convergence the coefficient-to-solution map of elliptic second-order partial…
In this paper we study boundary value problems for higher order elliptic differential operators in divergence form. We consider the two closely related topics of inhomogeneous problems and problems with boundary data in fractional…
In this paper we study boundary value problems for higher order elliptic differential operators in divergence form. We establish well posedness for problems with boundary data in Besov spaces $\dot B^{p,p}_s$, $p\leq 1$, given well…
We establish the existence of liftings into discrete subspaces of $\mathbf{H}(\mathrm{div})$ of piecewise polynomial data on locally refined simplicial partitions of polygonal/polyhedral domains. Our liftings are robust with respect to the…
We consider structured optimisation problems defined in terms of the sum of a smooth and convex function, and a proper, l.s.c., convex (typically non-smooth) one in reflexive variable exponent Lebesgue spaces $L_{p(\cdot)}(\Omega)$. Due to…
We derive a compatible discretization method that relies heavily on the underlying geometric structure, and obeys the topological sequences and commuting properties that are constructed. As a sample problem we consider the…
We generalize our earlier results concerning meshfree collocation methods for semilinear elliptic second order problems to the quasilinear case. The stability question, however, is treated differently, namely by extending a paper on…
Discrete Morse theory emerged as an essential tool for computational geometry and topology. Its core structures are discrete gradient fields, defined as acyclic matchings on a complex $C$, from which topological and geometrical informations…
A discretization scheme for variable coefficient elliptic PDEs in the plane is presented. The scheme is based on high-order Gaussian quadratures and is designed for problems with smooth solutions, such as scattering problems involving soft…
We consider a second order differential operator $A(\msx) = -\:\sum_{i,j=1}^d \partial_i a_{ij}(\msx) \partial_j \:+\: \sum_{j=1}^d \partial_j \big(b_j(\msx) \cdot \big)\:+\: c(\msx)$ on ${\bbR}^d$, on a bounded domain $D$ with Dirichlet…
In this paper, we introduce a multiscale framework based on adaptive edge basis functions to solve second-order linear elliptic PDEs with rough coefficients. One of the main results is that we prove the proposed multiscale method achieves…
We prove that for compactly perturbed elliptic problems, where the corresponding bilinear form satisfies a Garding inequality, adaptive mesh-refinement is capable of overcoming the preasymptotic behavior and eventually leads to convergence…
This work is related to PHG (Parallel Hierarchical Grid). PHG is a toolbox for developing parallel adaptive finite element programs, which is under active development at the State Key Laboratory of Scientific and Engineering Computing. The…