Optimal Constraint Projection for Hyperbolic Evolution Systems

Techniques are developed for projecting the solutions of symmetric hyperbolic evolution systems onto the constraint submanifold (the constraint-satisfying subset of the dynamical field space). These optimal projections map a field configuration to the ``nearest'' configuration in the constraint submanifold, where distances between configurations are measured with the natural metric on the space of dynamical fields. The construction and use of these projections is illustrated for a new representation of the scalar field equation that exhibits both bulk and boundary generated constraint violations. Numerical simulations on a black-hole background show that bulk constraint violations cannot be controlled by constraint-preserving boundary conditions alone, but are effectively controlled by constraint projection. Simulations also show that constraint violations entering through boundaries cannot be controlled by constraint projection alone, but are controlled by constraint-preserving boundary conditions. Numerical solutions to the pathological scalar field system are shown to converge to solutions of a standard representation of the scalar field equation when constraint projection and constraint-preserving boundary conditions are used together.Comment: final version with minor changes; 16 pages, 14 figure

Stabilization of high-order solutions of the cubic Nonlinear Schrodinger Equation

In this paper we consider the stabilization of non-fundamental unstable stationary solutions of the cubic nonlinear Schrodinger equation. Specifically we study the stabilization of radially symmetric solutions with nodes and asymmetric complex stationary solutions. For the first ones we find partial stabilization similar to that recently found for vortex solutions while for the later ones stabilization does not seem possible

A Comparison of Consistent Discretizations for Elliptic Problems on Polyhedral Grids

In this work, we review a set of consistent discretizations for second-order elliptic equations, and compare and contrast them with respect to accuracy, monotonicity, and factors affecting their computational cost (degrees of freedom, sparsity, and condition numbers). Our comparisons include the linear and nonlinear TPFA method, multipoint flux-approximation (MPFA-O), mimetic methods, and virtual element methods. We focus on incompressible flow and study the effects of deformed cell geometries and anisotropic permeability.acceptedVersio

Numerical Computations with H(div)-Finite Elements for the Brinkman Problem

The H(div)-conforming approach for the Brinkman equation is studied numerically, verifying the theoretical a priori and a posteriori analysis in previous work of the authors. Furthermore, the results are extended to cover a non-constant permeability. A hybridization technique for the problem is presented, complete with a convergence analysis and numerical verification. Finally, the numerical convergence studies are complemented with numerical examples of applications to domain decomposition and adaptive mesh refinement.Comment: Minor clarifications, added references. Reordering of some figures. To appear in Computational Geosciences, final article available at http://www.springerlink.co

An effective mass theorem for the bidimensional electron gas in a strong magnetic field

We study the limiting behavior of a singularly perturbed Schr\"odinger-Poisson system describing a 3-dimensional electron gas strongly confined in the vicinity of a plane $(x,y)$ and subject to a strong uniform magnetic field in the plane of the gas. The coupled effects of the confinement and of the magnetic field induce fast oscillations in time that need to be averaged out. We obtain at the limit a system of 2-dimensional Schr\"odinger equations in the plane $(x,y)$, coupled through an effective selfconsistent electrical potential. In the direction perpendicular to the magnetic field, the electron mass is modified by the field, as the result of an averaging of the cyclotron motion. The main tools of the analysis are the adaptation of the second order long-time averaging theory of ODEs to our PDEs context, and the use of a Sobolev scale adapted to the confinement operator

Natural preconditioning and iterative methods for saddle point systems

The solution of quadratic or locally quadratic extremum problems subject to linear(ized) constraints gives rise to linear systems in saddle point form. This is true whether in the continuous or the discrete setting, so saddle point systems arising from the discretization of partial differential equation problems, such as those describing electromagnetic problems or incompressible flow, lead to equations with this structure, as do, for example, interior point methods and the sequential quadratic programming approach to nonlinear optimization. This survey concerns iterative solution methods for these problems and, in particular, shows how the problem formulation leads to natural preconditioners which guarantee a fast rate of convergence of the relevant iterative methods. These preconditioners are related to the original extremum problem and their effectiveness---in terms of rapidity of convergence---is established here via a proof of general bounds on the eigenvalues of the preconditioned saddle point matrix on which iteration convergence depends

Tutorial on Hybridizable Discontinous Galerkin (HDG) for second-order elliptic problems

The HDG is a new class of discontinuous Galerkin (DG) methods that shares favorable properties with classical mixed methods such as the well known Raviart-Thomas methods. In particular, HDG provides optimal convergence of both the primal and the dual variables of the mixed formulation. This property enables the construction of superconvergent solutions, contrary to other popular DG methods. In addition, its reduced computational cost, compared to other DG methods, has made HDG an attractive alternative for solving problems governed by partial differential equations. A tutorial on HDG for the numerical solution of second-order elliptic problems is presented. Particular emphasis is placed on providing all the necessary details for the implementation of HDG methods.Peer ReviewedPreprin

L2−estimates for the DG IIPG-0 scheme

We discuss the optimality in L2 of a variant of the Incomplete Discontinuous Galerkin Interior Penalty method (IIPG) for second order linear elliptic problems. We prove optimal estimate, in two and three dimensions, for the lowest order case under suitable regularity assumptions on the data and on the mesh. We also provide numerical evidence, in one dimension, of the necessity of the regularity assumptions