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

Mathematics Commons

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

Articles 1 - 4 of 4

Full-Text Articles in Mathematics

Polynomial Extension Operators. Part I, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl Jan 2008

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

Mathematics and Statistics Faculty Publications and Presentations

In this series of papers, we construct operators that extend certain given functions on the boundary of a tetrahedron into the interior of the tetrahedron, with continuity properties in appropriate Sobolev norms. These extensions are novel in that they have certain polynomial preservation properties important in the analysis of high order finite elements. This part of the series is devoted to introducing our new technique for constructing the extensions, and its application to the case of polynomial extensions from H½(∂K) into H¹(K), for any tetrahedron K.


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, …


A Mixed Method For Axisymmetric Div-Curl Systems, Dylan M. Copeland, Jay Gopalakrishnan, Joseph E. Pasciak Jan 2008

A Mixed Method For Axisymmetric Div-Curl Systems, Dylan M. Copeland, Jay Gopalakrishnan, Joseph E. Pasciak

Mathematics and Statistics Faculty Publications and Presentations

We present a mixed method for a three-dimensional axisymmetric div-curl system reduced to a two-dimensional computational domain via cylindrical coordinates. We show that when the meridian axisymmetric Maxwell problem is approximated by a mixed method using the lowest order Nédélec elements (for the vector variable) and linear elements (for the Lagrange multiplier), one obtains optimal error estimates in certain weighted Sobolev norms. The main ingredient of the analysis is a sequence of projectors in the weighted norms satisfying some commutativity properties.


Asymptotic And Numerical Techniques For Resonances Of Thin Photonic Structures, Jay Gopalakrishnan, Shari Moskow, Fadil Santosa Jan 2008

Asymptotic And Numerical Techniques For Resonances Of Thin Photonic Structures, Jay Gopalakrishnan, Shari Moskow, Fadil Santosa

Mathematics and Statistics Faculty Publications and Presentations

We consider the problem of calculating resonance frequencies and radiative losses of an optical resonator. The optical resonator is in the form of a thin membrane with variable dielectric properties. This work provides two very different approaches for doing such calculations. The first is an asymptotic method which exploits the small thickness and high index of the membrane. We derive a limiting resonance problem as the thickness goes to zero, and for the case of a simple resonance, find a first order correction. The limiting problem and the correction are in one less space dimension, which can make the approach …