相关论文: Analysis of FEAST spectral approximations using th…
The classical arguments employed when obtaining error estimates of Finite Element (FE) discretisations of elliptic problems lead to more restrictive assumptions on the regularity of the exact solution when applied to non-conforming methods.…
The FEAST eigensolver is extended to the computation of the singular triplets of a large matrix $A$ with the singular values in a given interval. The resulting FEAST SVDsolver is subspace iteration applied to an approximate spectral…
We develop, analyze, and experimentally explore residual-based loss functions for machine learning of parameter-to-solution maps in the context of parameter-dependent families of partial differential equations (PDEs). Our primary concern is…
This work analyzes the overall computational complexity of the stochastic Galerkin finite element method (SGFEM) for approximating the solution of parameterized elliptic partial differential equations with both affine and non-affine random…
We introduce a new family of discontinuous Galerkin (DG) finite element schemes for the discretization of first order systems of hyperbolic partial differential equations (PDE) on unstructured simplex meshes in two and three space…
The linear FEAST algorithm is a method for solving linear eigenvalue problems. It uses complex contour integration to calculate the eigenvectors whose eigenvalues that are located inside some user-defined region in the complex plane. This…
Motivated by a geometric problem, we introduce a new non-convex graph partitioning objective where the optimality criterion is given by the sum of the Dirichlet eigenvalues of the partition components. A relaxed formulation is identified…
The third paper in our series on open source MATLAB / GNU Octave implementation of the discontinuous Galerkin (DG) method(s) focuses on a hybridized formulation. The main aim of this ongoing work is to develop rapid prototyping techniques…
The discontinuous Petrov-Galerkin method is a minimal residual method with broken test spaces and is introduced for a nonlinear model problem in this paper. Its lowest-order version applies to a nonlinear uniformly convex model example and…
We present a new line-based discontinuous Galerkin (DG) discretization scheme for first- and second-order systems of partial differential equations. The scheme is based on fully unstructured meshes of quadrilateral or hexahedral elements,…
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 a recent article [1], the FEAST algorithm has been presented as a general purpose eigenvalue solver which is ideally suited for addressing the numerical challenges in electronic structure calculations. Here, FEAST is presented beyond the…
Identifying parameters in partial differential equations (PDEs) represents a very broad class of applied inverse problems. In recent years, several unsupervised learning approaches using (deep) neural networks have been developed to solve…
Near-optimal computational complexity of an adaptive stochastic Galerkin method with independently refined spatial meshes for elliptic partial differential equations is shown. The method takes advantage of multilevel structure in expansions…
A reduced model for large deformations of prestrained plates consists of minimizing a second order bending energy subject to a nonconvex metric constraint. The former involves the second fundamental form of the middle plate and the later is…
This article deals with the computation of guaranteed lower bounds of the error in the framework of finite element (FE) and domain decomposition (DD) methods. In addition to a fully parallel computation, the proposed lower bounds separate…
We analyze the discontinuous Petrov-Galerkin (DPG) method with optimal test functions when applied to solve the Reissner-Mindlin model of plate bending. We prove that the hybrid variational formulation underlying the DPG method is…
We propose a least-squares penalization as a means to extend the discontinuous Petrov-Galerkin (DPG) method with optimal test functions to a class of semilinear elliptic problems. The nonlinear contributions are replaced with independent…
Two numerical methods with graded temporal grids are analyzed for fractional evolution equations. One is a low-order discontinuous Galerkin (DG) discretization in the case of fractional order $0<\alpha<1$, and the other one is a low-order…
We consider a time dependent problem generated by a nonlocal operator in space. Applying a discretization scheme based on $hp$-Finite Elements and a Caffarelli-Silvestre extension we obtain a semidiscrete semigroup. The discretization in…