Related papers: Optimal quadrature rules for isogeometric analysis
In this article, we present the mathematical analysis of the convergence of the linearized Crank-Nicolson Galerkin method for a nonlinear Schrodinger problem related to a domain with a moving boundary. The convergence analysis of the…
We prove convergence of a class of space-time discontinuous Galerkin schemes for scalar hyperbolic conservation laws. Convergence to the unique entropy solution is shown for all orders of polynomial approximation, provided strictly monotone…
A considerable amount of attention has been given to discontinuous Galerkin methods for hyperbolic problems in numerical relativity, showing potential advantages of the methods in dealing with hydrodynamical shocks and other…
A new finite element method with discontinuous approximation is introduced for solving second order elliptic problem. Since this method combines the features of both conforming finite element method and discontinuous Galerkin (DG) method,…
We develop and analyze a new hybridizable discontinuous Galerkin (HDG) method for solving third-order Korteweg-de Vries type equations. The approximate solutions are defined by a discrete version of a characterization of the exact solution…
We introduce in this paper a technique for the reduced order approximation of parametric symmetric elliptic partial differential equations. For any given dimension, we prove the existence of an optimal subspace of at most that dimension…
Large optimal transport problems can be approached via domain decomposition, i.e. by iteratively solving small partial problems independently and in parallel. Convergence to the global minimizers under suitable assumptions has been shown in…
We propose to use a hybridizable discontinuous Galerkin (HDG) method combined with the continuous Galerkin (CG) method to approximate Maxwell's equations. We make two contributions in this paper. First, even though there are many papers…
For finite element approximations of transport phenomena, it is often necessary to apply a form of limiting to ensure that the discrete solution remains well-behaved and satisfies physical constraints. However, these limiting procedures are…
In this paper we provide key estimates used in the stability and error analysis of discontinuous Galerkin finite element methods (DGFEMs) on domains with curved boundaries. In particular, we review trace estimates, inverse estimates,…
The paper studies Sard's problem on construction of optimal quadrature formulas in the space $W_2^{(m,0)}$ by Sobolev's method. This problem consists of two parts: first calculating the norm of the error functional and then finding the…
Topology optimization is concerned with the identification of optimal shapes of deformable bodies with respect to given target functionals. The focus of this paper is on a topology optimization problem for a time-evolving elastoplastic…
A novel discontinuous Galerkin (DG) method is developed to solve time-dependent bi-harmonic type equations involving fourth derivatives in one and multiple space dimensions. We present the spatial DG discretization based on a mixed…
A conforming discontinuous Galerkin (DG) finite element method has been introduced in [21] on simplicial meshes, which has the flexibility of using discontinuous approximation and the simplicity in formulation of the classic continuous…
First order shape optimization methods, in general, require a large number of iterations until they reach a locally optimal design. While higher order methods can significantly reduce the number of iterations, they exhibit only local…
The embedded discontinuous Galerkin (EDG) method by Cockburn et al. [SIAM J. Numer. Anal., 2009, 47(4), 2686-2707] is obtained from the hybridizable discontinuous Galerkin method by changing the space of the Lagrangian multiplier from…
We develop numerical homotopy algorithms for solving systems of polynomial equations arising from the classical Schubert calculus. These homotopies are optimal in that generically no paths diverge. For problems defined by hypersurface…
We introduce a new optimization problem regarding embeddings of a graph into a Euclidean space and discuss its relation to the two, mutually dual, optimizations problems introduced by Goering-Helmberg-Wappler. We prove that the Laplace…
Many problems in Euclidean geometry, arising in computational design and fabrication, amount to a system of constraints, which is challenging to solve. We suggest a new general approach to the solution, which is to start with analogous…
In this paper we propose and apply the enhanced semidefinite relaxation technique for solving a class of non-convex quadratic optimization problems. The approach is based on enhancing the semidefinite relaxation methodology by complementing…