Related papers: Optimal quadrature rules for isogeometric analysis
We define new geometric constants for normed planes, determine their optimal values, and characterize types of planes for which these optimal values are attained. Relations of these constants to several topics, such as areas and distances…
We want to propose a new discretization ansatz for the second order Hessian complex exploiting benefits of isogeometric analysis, namely the possibility of high-order convergence and smoothness of test functions. Although our approach is…
A local convergence rate is established for a Gauss orthogonal collocation method applied to optimal control problems with control constraints. If the Hamiltonian possesses a strong convexity property, then the theory yields convergence for…
This paper is concerned with developing accurate and efficient numerical methods for one-dimensional fully nonlinear second order elliptic and parabolic partial differential equations (PDEs). In the paper we present a general framework for…
We design an arbitrary high-order accurate nodal discontinuous Galerkin spectral element approximation for the nonlinear two dimensional shallow water equations with non-constant, possibly discontinuous, bathymetry on unstructured, possibly…
The purpose of this work is the development of space-time discretization schemes for phase-field optimal control problems. First, a time discretization of the forward problem is derived using a discontinuous Galerkin formulation. Here, a…
We present new and efficient quadrature rules for computing the stiffness matrices of mass-lumped tetrahedral elements for wave propagation modelling. These quadrature rules allow for a more efficient implementation of the mass-lumped…
In this paper we present new stability and optimal error analyses of hybridized discontinuous Galerkin (HDG) methods which do not require elliptic regularity assumptions. To obtain error estimates without elliptic regularity assumptions, we…
Motivated by applications to numerical simulation of flows in highly heterogeneous porous media, we develop multiscale finite element methods for second order elliptic equations. We discuss a multiscale model reduction technique in the…
In this paper we provide a priori error estimates in standard Sobolev (semi-)norms for approximation in spline spaces of maximal smoothness on arbitrary grids. The error estimates are expressed in terms of a power of the maximal grid…
We establish a variety of results extending the well-known Pontryagin maximum principle of optimal control to discrete-time optimal control problems posed on smooth manifolds. These results are organized around a new theorem on critical and…
We present an algebraic method for constructing a highly effective coarse grid correction to accelerate domain decomposition. The coarse problem is constructed from the original matrix and a small set of input vectors that span a low-degree…
We present an isogeometric collocation method for solving the biharmonic equation over planar bilinearly parameterized multi-patch domains. The developed approach is based on the use of the globally $C^4$-smooth isogeometric spline space…
As a first step towards a mathematically rigorous understanding of adaptive spectral/$hp$ discretizations of elliptic boundary-value problems, we study the performance of adaptive Legendre-Galerkin methods in one space dimension. These…
We introduce a high-order spline geometric approach for the initial boundary value problem for Maxwell's equations. The method is geometric in the sense that it discretizes in structure preserving fashion the two de Rham sequences of…
We develop a high order accurate numerical method for solving the elastic wave equation in second-order form. We hybridize the computationally efficient Cartesian grid formulation of finite differences with geometrically flexible…
Isogeometric Analysis is a high-order discretization method for boundary value problems that uses a number of degrees of freedom which is as small as for a low-order method. Standard isogeometric discretizations require a global…
We perform a posteriori error analysis in the supremum norm for the quadratic discontinuous Galerkin method for the elliptic obstacle problem. We define two discrete sets (motivated by Gaddam, Gudi and Kamana [1]), one set having integral…
Convex optimization encompasses a wide range of optimization problems that contain many efficiently solvable subclasses. Interior point methods are currently the state-of-the-art approach for solving such problems, particularly effective…
We derive the first exact, rigorous but practical, globally valid remainder terms for asymptotic expansions about saddles and contour endpoints of arbitrary order degeneracy derived from the method of steepest descents. The exact remainder…