Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Publication Year
Articles 1 - 23 of 23
Full-Text Articles in Physical Sciences and Mathematics
Simulating Dislocation Densities With Finite Element Analysis, Ja'nya Breeden, Dow Drake, Saurabh Puri
Simulating Dislocation Densities With Finite Element Analysis, Ja'nya Breeden, Dow Drake, Saurabh Puri
REU Final Reports
A one-dimensional set of nonlinear time-dependent partial differential equations developed by Acharya (2010) is studied to observe how differing levels of applied strain affect dislocation walls. The framework of this model consists of a convective and diffusive term which is used to develop a linear system of equations to test two methods of the finite element method. The linear system of partial differential equations is used to determine whether the standard or Discontinuous Galerkin method will be used. The Discontinuous Galerkin method is implemented to discretize the continuum model and the results of simulations involving zero and non-zero applied strain …
Trefftz Finite Elements On Curvilinear Polygons, Akash Anand, Jeffrey S. Ovall, Samuel E. Reynolds, Steffen Weisser
Trefftz Finite Elements On Curvilinear Polygons, Akash Anand, Jeffrey S. Ovall, Samuel E. Reynolds, Steffen Weisser
Mathematics and Statistics Faculty Publications and Presentations
We present a Trefftz-type finite element method on meshes consisting of curvilinear polygons. Local basis functions are computed using integral equation techniques that allow for the efficient and accurate evaluation of quantities needed in the formation of local stiffness matrices. To define our local finite element spaces in the presence of curved edges, we must also properly define what it means for a function defined on a curved edge to be "polynomial" of a given degree on that edge. We consider two natural choices, before settling on the one that yields the inclusion of complete polynomial spaces in our local …
Spectral Discretization Errors In Filtered Subspace Iteration, Jay Gopalakrishnan, Luka Grubišić, Jeffrey S. Ovall
Spectral Discretization Errors In Filtered Subspace Iteration, Jay Gopalakrishnan, Luka Grubišić, Jeffrey S. Ovall
Mathematics and Statistics Faculty Publications and Presentations
We consider filtered subspace iteration for approximating a cluster of eigenvalues (and its associated eigenspace) of a (possibly unbounded) selfadjoint operator in a Hilbert space. The algorithm is motivated by a quadrature approximation of an operator-valued contour integral of the resolvent. Resolvents on infinite dimensional spaces are discretized in computable finite-dimensional spaces before the algorithm is applied. This study focuses on how such discretizations result in errors in the eigenspace approximations computed by the algorithm. The computed eigenspace is then used to obtain approximations of the eigenvalue cluster. Bounds for the Hausdorff distance between the computed and exact eigenvalue clusters …
The Auxiliary Space Preconditioner For The De Rham Complex, Jay Gopalakrishnan, Martin Neumüller, Panayot S. Vassilevski
The Auxiliary Space Preconditioner For The De Rham Complex, Jay Gopalakrishnan, Martin Neumüller, Panayot S. Vassilevski
Portland Institute for Computational Science Publications
We generalize the construction and analysis of auxiliary space preconditioners to the n-dimensional finite element subcomplex of the de Rham complex. These preconditioners are based on a generalization of a decomposition of Sobolev space functions into a regular part and a potential. A discrete version is easily established using the tools of finite element exterior calculus. We then discuss the four-dimensional de Rham complex in detail. By identifying forms in four dimensions (4D) with simple proxies, form operations are written out in terms of familiar algebraic operations on matrices, vectors, and scalars. This provides the basis for our implementation of …
Derivation Of The Hellinger-Reissner Variational Form Of The Linear Elasticity Equations, And A Finite Element Discretization, Bram Fouts
REU Final Reports
In this paper we are going to derive the linear elasticity equations in the Strong Form to the Hellinger Reissner Form. We find a suitable solution to solve our stress tensor. Then we will use finite element discretization from. We will run tests on a unit cube and multiple other shapes, which are described at the end. We view the different magnitudes of the displacement vector of each shape.
On The Coupling Of Dpg And Bem, Thomas Führer, Norbert Heuer, Michael Karkulik
On The Coupling Of Dpg And Bem, Thomas Führer, Norbert Heuer, Michael Karkulik
Mathematics and Statistics Faculty Publications and Presentations
We develop and analyze strategies to couple the discontinuous Petrov-Galerkin method with optimal test functions to (i) least-squares boundary elements and (ii) various variants of standard Galerkin boundary elements. An essential feature of our method is that, despite the use of boundary integral equations, optimal test functions have to be computed only locally. We apply our findings to a standard transmission problem in full space and present numerical experiments to validate our theory.
Symmetric Nonconforming Mixed Finite Elements For Linear Elasticity, Jay Gopalakrishnan, Johnny Guzmán
Symmetric Nonconforming Mixed Finite Elements For Linear Elasticity, Jay Gopalakrishnan, Johnny Guzmán
Mathematics and Statistics Faculty Publications and Presentations
We present a family of mixed methods for linear elasticity that yield exactly symmetric, but only weakly conforming, stress approximations. The method is presented in both two and three dimensions (on triangular and tetrahedral meshes). The method is efficiently implementable by hybridization. The degrees of freedom of the Lagrange multipliers, which approximate the displacements at the faces, solve a symmetric positive-definite system. The design and analysis of this method is motivated by a new set of unisolvent degrees of freedom for symmetric polynomial matrices. These new degrees of freedom are also used to give a new simple calculation of the …
Commuting Smoothed Projectors In Weighted Norms With An Application To Axisymmetric Maxwell Equations, Jay Gopalakrishnan, Minah Oh
Commuting Smoothed Projectors In Weighted Norms With An Application To Axisymmetric Maxwell Equations, Jay Gopalakrishnan, Minah Oh
Mathematics and Statistics Faculty Publications and Presentations
We construct finite element projectors that can be applied to functions with low regularity. These projectors are continuous in a weighted norm arising naturally when modeling devices with axial symmetry. They have important commuting diagram properties needed for finite element analysis. As an application, we use the projectors to prove quasioptimal convergence for the edge finite element approximation of the axisymmetric time-harmonic Maxwell equations on nonsmooth domains. Supplementary numerical investigations on convergence deterioration at high wavenumbers and near Maxwell eigenvalues and are also reported.
A Second Elasticity Element Using The Matrix Bubble, Jay Gopalakrishnan, Johnny Guzmán
A Second Elasticity Element Using The Matrix Bubble, Jay Gopalakrishnan, Johnny Guzmán
Mathematics and Statistics Faculty Publications and Presentations
We presented a family of finite elements that use a polynomial space augmented by certain matrix bubbles in Cockburn et al. (2010) A new elasticity element made for enforcing weak stress symmetry. Math. Comput., 79, 1331–1349 . In this sequel we exhibit a second family of elements that use the same matrix bubble. This second element uses a stress space smaller than the first while maintaining the same space for rotations (which are the Lagrange multipliers corresponding to a weak symmetry constraint). The space of displacements is of one degree less than the first method. The analysis, while similar to …
A Class Of Discontinuous Petrov–Galerkin Methods. Part Iv: The Optimal Test Norm And Time-Harmonic Wave Propagation In 1d., Jeffrey Zitelli, Leszek Demkowicz, Jay Gopalakrishnan, D. Pardo, V. M. Calo
A Class Of Discontinuous Petrov–Galerkin Methods. Part Iv: The Optimal Test Norm And Time-Harmonic Wave Propagation In 1d., Jeffrey Zitelli, Leszek Demkowicz, Jay Gopalakrishnan, D. Pardo, V. M. Calo
Mathematics and Statistics Faculty Publications and Presentations
The phase error, or the pollution effect in the finite element solution of wave propagation problems, is a well known phenomenon that must be confronted when solving problems in the high-frequency range. This paper presents a new method with no phase errors for one-dimensional (1D) time-harmonic wave propagation problems using new ideas that hold promise for the multidimensional case. The method is constructed within the framework of the discontinuous Petrov–Galerkin (DPG) method with optimal test functions. We have previously shown that such methods select solutions that are the best possible approximations in an energy norm dual to any selected test …
A Class Of Discontinuous Petrov–Galerkin Methods. Part I: The Transport Equation, Leszek Demkowicz, Jay Gopalakrishnan
A Class Of Discontinuous Petrov–Galerkin Methods. Part I: The Transport Equation, Leszek Demkowicz, Jay Gopalakrishnan
Mathematics and Statistics Faculty Publications and Presentations
Considering a simple model transport problem, we present a new finite element method. While the new method fits in the class of discontinuous Galerkin (DG) methods, it differs from standard DG and streamline diffusion methods, in that it uses a space of discontinuous trial functions tailored for stability. The new method, unlike the older approaches, yields optimal estimates for the primal variable in both the element size h and polynomial degree p, and outperforms the standard upwind DG method.
Unified Hybridization Of Discontinuous Galerkin, Mixed, And Continuous Galerkin Methods For Second Order Elliptic Problems, Bernardo Cockburn, Jay Gopalakrishnan, Raytcho Lazarov
Unified Hybridization Of Discontinuous Galerkin, Mixed, And Continuous Galerkin Methods For Second Order Elliptic Problems, Bernardo Cockburn, Jay Gopalakrishnan, Raytcho Lazarov
Mathematics and Statistics Faculty Publications and Presentations
We introduce a unifying framework for hybridization of finite element methods for second order elliptic problems. The methods fitting in the framework are a general class of mixed-dual finite element methods including hybridized mixed, continu- ous Galerkin, non-conforming and a new, wide class of hybridizable discontinuous Galerkin methods. The distinctive feature of the methods in this framework is that the only globally coupled degrees of freedom are those of an approximation of the solution defined only on the boundaries of the elements. Since the associated matrix is sparse, symmetric and positive definite, these methods can be efficiently implemented. Moreover, the …
Polynomial Extension Operators. Part Ii, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl
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.
Polynomial Extension Operators. Part I, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl
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
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
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 …
Error Analysis Of Variable Degree Mixed Methods For Elliptic Problems Via Hybridization, Bernardo Cockburn, Jay Gopalakrishnan
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
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
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 …
A Multilevel Discontinuous Galerkin Method, Jay Gopalakrishnan, Guido Kanschat
A Multilevel Discontinuous Galerkin Method, Jay Gopalakrishnan, Guido Kanschat
Mathematics and Statistics Faculty Publications and Presentations
A variable V-cycle preconditioner for an interior penalty finite element discretization for elliptic problems is presented. An analysis under a mild regularity assumption shows that the preconditioner is uniform. The interior penalty method is then combined with a discontinuous Galerkin scheme to arrive at a discretization scheme for an advection-diffusion problem, for which an error estimate is proved. A multigrid algorithm for this method is presented, and numerical experiments indicating its robustness with respect to diffusion coefficient are reported.
A Schwarz Preconditioner For A Hybridized Mixed Method, Jay Gopalakrishnan
A Schwarz Preconditioner For A Hybridized Mixed Method, Jay Gopalakrishnan
Mathematics and Statistics Faculty Publications and Presentations
In this paper, we provide a Schwarz preconditioner for the hybridized versions of the Raviart-Thomas and Brezzi-Douglas-Marini mixed methods. The preconditioner is for the linear equation for Lagrange multipliers arrived at by eliminating the ux as well as the primal variable. We also prove a condition number estimate for this equation when no preconditioner is used. Although preconditioners for the lowest order case of the Raviart-Thomas method have been constructed previously by exploiting its connection with a nonconforming method, our approach is different, in that we use a new variational characterization of the Lagrange multiplier equation. This allows us to …
An Efficient Method For Band Structure Calculations In 3d Photonic Crystals, David C. Dobson, Jay Gopalakrishnan, Joseph E. Pasciak
An Efficient Method For Band Structure Calculations In 3d Photonic Crystals, David C. Dobson, Jay Gopalakrishnan, Joseph E. Pasciak
Mathematics and Statistics Faculty Publications and Presentations
A method for computing band structures for three-dimensional photonic crystals is described. The method combines a mixed finite element discretization on a uniform grid with a fast Fourier transform preconditioner and a preconditioned subspace iteration algorithm. Numerical examples illustrating the behavior of the method are presented.
Mortar Estimates Independent Of Number Of Subdomains, Jay Gopalakrishnan
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.