Open Access. Powered by Scholars. Published by Universities.®

Applied Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 13 of 13

Full-Text Articles in Applied Mathematics

Analysis Of The Dpg Method For The Poisson Equation, Leszek Demkowicz, Jay Gopalakrishnan Jan 2011

Analysis Of The Dpg Method For The Poisson Equation, Leszek Demkowicz, Jay Gopalakrishnan

Mathematics and Statistics Faculty Publications and Presentations

We give an error analysis of the recently developed DPG method applied to solve the Poisson equation and a convection-dffusion problem. We prove that the method is quasioptimal. Error estimates in terms of both the mesh size h and the polynomial degree p (for various element shapes) can be derived from our results. Results of extensive numerical experiments are also presented.


Polynomial Extension Operators. Part Ii, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl Jan 2009

Polynomial Extension Operators. Part Ii, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl

Mathematics and Statistics Faculty Publications and Presentations

Consider the tangential trace of a vector polynomial on the surface of a tetrahedron. We construct an extension operator that extends such a trace function into a polynomial on the tetrahedron. This operator can be continuously extended to the trace space of H(curl ). Furthermore, it satisfies a commutativity property with an extension operator we constructed in Part I of this series. Such extensions are a fundamental ingredient of high order finite element analysis.


Multigrid Convergence For Second Order Elliptic Problems With Smooth Complex Coefficients, Jay Gopalakrishnan, Joseph E. Pasciak Jan 2008

Multigrid Convergence For Second Order Elliptic Problems With Smooth Complex Coefficients, Jay Gopalakrishnan, Joseph E. Pasciak

Mathematics and Statistics Faculty Publications and Presentations

The finite element method when applied to a second order partial differential equation in divergence form can generate operators that are neither Hermitian nor definite when the coefficient function is complex valued. For such problems, under a uniqueness assumption, we prove the continuous dependence of the exact solution and its finite element approximations on data provided that the coefficients are smooth and uniformly bounded away from zero. Then we show that a multigrid algorithm converges once the coarse mesh size is smaller than some fixed number, providing an efficient solver for computing discrete approximations. Numerical experiments, while confirming the theory, …


Locally Conservative Fluxes For The Continuous Galerkin Method, Bernardo Cockburn, Jay Gopalakrishnan, Haiying Wang Jan 2007

Locally Conservative Fluxes For The Continuous Galerkin Method, Bernardo Cockburn, Jay Gopalakrishnan, Haiying Wang

Mathematics and Statistics Faculty Publications and Presentations

The standard continuous Galerkin (CG) finite element method for second order elliptic problems suffers from its inability to provide conservative flux approximations, a much needed quantity in many applications. We show how to overcome this shortcoming by using a two step postprocessing. The first step is the computation of a numerical flux trace defined on element inter- faces and is motivated by the structure of the numerical traces of discontinuous Galerkin methods. This computation is non-local in that it requires the solution of a symmetric positive definite system, but the system is well conditioned independently of mesh size, so it …


The Convergence Of V-Cycle Multigrid Algorithms For Axisymmetric Laplace And Maxwell Equations, Jay Gopalakrishnan, Joseph E. Pasciak Jan 2006

The Convergence Of V-Cycle Multigrid Algorithms For Axisymmetric Laplace And Maxwell Equations, Jay Gopalakrishnan, Joseph E. Pasciak

Mathematics and Statistics Faculty Publications and Presentations

We investigate some simple finite element discretizations for the axisymmetric Laplace equation and the azimuthal component of the axisymmetric Maxwell equations as well as multigrid algorithms for these discretizations. Our analysis is targeted at simple model problems and our main result is that the standard V-cycle with point smoothing converges at a rate independent of the number of unknowns. This is contrary to suggestions in the existing literature that line relaxations and semicoarsening are needed in multigrid algorithms to overcome difficulties caused by the singularities in the axisymmetric Maxwell problems. Our multigrid analysis proceeds by applying the well known regularity …


Error Analysis Of Variable Degree Mixed Methods For Elliptic Problems Via Hybridization, Bernardo Cockburn, Jay Gopalakrishnan Mar 2005

Error Analysis Of Variable Degree Mixed Methods For Elliptic Problems Via Hybridization, Bernardo Cockburn, Jay Gopalakrishnan

Mathematics and Statistics Faculty Publications and Presentations

A new approach to error analysis of hybridized mixed methods is proposed and applied to study a new hybridized variable degree Raviart-Thomas method for second order elliptic problems. The approach gives error estimates for the Lagrange multipliers without using error estimates for the other variables. Error estimates for the primal and flux variables then follow from those for the Lagrange multipliers. In contrast, traditional error analyses obtain error estimates for the flux and primal variables first and then use it to get error estimates for the Lagrange multipliers. The new approach not only gives new error estimates for the new …


Incompressible Finite Elements Via Hybridization. Part Ii: The Stokes System In Three Space Dimensions, Bernardo Cockburn, Jay Gopalakrishnan Jan 2005

Incompressible Finite Elements Via Hybridization. Part Ii: The Stokes System In Three Space Dimensions, Bernardo Cockburn, Jay Gopalakrishnan

Mathematics and Statistics Faculty Publications and Presentations

We introduce a method that gives exactly incompressible velocity approximations to Stokes ow in three space dimensions. The method is designed by extending the ideas in Part I (http://archives.pdx.edu/ds/psu/10914) of this series, where the Stokes system in two space dimensions was considered. Thus we hybridize a vorticity-velocity formulation to obtain a new mixed method coupling approximations of tangential velocity and pressure on mesh faces. Once this relatively small tangential velocity-pressure system is solved, it is possible to recover a globally divergence-free numerical approximation of the fluid velocity, an approximation of the vorticity whose tangential component is continuous across …


Incompressible Finite Elements Via Hybridization. Part I: The Stokes System In Two Space Dimensions, Bernardo Cockburn, Jay Gopalakrishnan Jan 2005

Incompressible Finite Elements Via Hybridization. Part I: The Stokes System In Two Space Dimensions, Bernardo Cockburn, Jay Gopalakrishnan

Mathematics and Statistics Faculty Publications and Presentations

In this paper, we introduce a new and efficient way to compute exactly divergence-free velocity approximations for the Stokes equations in two space dimensions. We begin by considering a mixed method that provides an exactly divergence-free approximation of the velocity and a continuous approximation of the vorticity. We then rewrite this method solely in terms of the tangential fluid velocity and the pressure on mesh edges by means of a new hybridization technique. This novel formulation bypasses the difficult task of constructing an exactly divergence-free basis for velocity approximations. Moreover, the discrete system resulting from our method has fewer degrees …


Quasioptimality Of Some Spectral Mixed Methods, Jay Gopalakrishnan, Leszek Demkowicz Jan 2004

Quasioptimality Of Some Spectral Mixed Methods, Jay Gopalakrishnan, Leszek Demkowicz

Mathematics and Statistics Faculty Publications and Presentations

In this paper, we construct a sequence of projectors into certain polynomial spaces satisfying a commuting diagram property with norm bounds independent of the polynomial degree. Using the projectors, we obtain quasioptimality of some spectralmixed methods, including the Raviart–Thomas method and mixed formulations of Maxwell equations. We also prove some discrete Friedrichs type inequalities involving curl.


A Characterization Of Hybridized Mixed Methods For Second Order Elliptic Problems, Bernardo Cockburn, Jay Gopalakrishnan Jan 2004

A Characterization Of Hybridized Mixed Methods For Second Order Elliptic Problems, Bernardo Cockburn, Jay Gopalakrishnan

Mathematics and Statistics Faculty Publications and Presentations

In this paper, we give a new characterization of the approximate solution given by hybridized mixed methods for second order self-adjoint elliptic problems. We apply this characterization to obtain an explicit formula for the entries of the matrix equation for the Lagrange multiplier unknowns resulting from hybridization. We also obtain necessary and sufficient conditions under which the multipliers of the Raviart–Thomas and the Brezzi–Douglas–Marini methods of similar order are identical.


Analysis Of A Multigrid Algorithm For Time Harmonic Maxwell Equations, Jay Gopalakrishnan, Joseph E. Pasciak, Leszek Demkowicz Jan 2004

Analysis Of A Multigrid Algorithm For Time Harmonic Maxwell Equations, Jay Gopalakrishnan, Joseph E. Pasciak, Leszek Demkowicz

Mathematics and Statistics Faculty Publications and Presentations

This paper considers a multigrid algorithm suitable for efficient solution of indefinite linear systems arising from finite element discretization of time harmonic Maxwell equations. In particular, a "backslash" multigrid cycle is proven to converge at rates independent of refinement level if certain indefinite block smoothers are used. The method of analysis involves comparing the multigrid error reduction operator with that of a related positive definite multigrid operator. This idea has previously been used in multigrid analysis of indefinite second order elliptic problems. However, the Maxwell application involves a nonelliptic indefinite operator. With the help of a few new estimates, the …


Mortar Estimates Independent Of Number Of Subdomains, Jay Gopalakrishnan Jan 2000

Mortar Estimates Independent Of Number Of Subdomains, Jay Gopalakrishnan

Mathematics and Statistics Faculty Publications and Presentations

The stability and error estimates for the mortar finite element method are well established. This work examines the dependence of constants in these estimates on shape and number of subdomains. By means of a Poincar´e inequality and some scaling arguments, these estimates are found not to deteriorate with increase in number of subdomains.


Multigrid For The Mortar Finite Element Method, Jay Gopalakrishnan, Joseph E. Pasciak Jan 2000

Multigrid For The Mortar Finite Element Method, Jay Gopalakrishnan, Joseph E. Pasciak

Mathematics and Statistics Faculty Publications and Presentations

A multigrid technique for uniformly preconditioning linear systems arising from a mortar finite element discretization of second order elliptic boundary value problems is described and analyzed. These problems are posed on domains partitioned into subdomains, each of which is independently triangulated in a multilevel fashion. The multilevel mortar finite element spaces based on such triangulations (which need not align across subdomain interfaces) are in general not nested. Suitable grid transfer operators and smoothers are developed which lead to a variable Vcycle preconditioner resulting in a uniformly preconditioned algebraic system. Computational results illustrating the theory are also presented.