Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Publication Year
Articles 1 - 24 of 24
Full-Text Articles in Physical Sciences and Mathematics
The Dpg-Star Method, Leszek Demkowicz, Jay Gopalakrishnan, Brendan Keith
The Dpg-Star Method, Leszek Demkowicz, Jay Gopalakrishnan, Brendan Keith
Portland Institute for Computational Science Publications
This article introduces the DPG-star (from now on, denoted DPG*) finite element method. It is a method that is in some sense dual to the discontinuous Petrov– Galerkin (DPG) method. The DPG methodology can be viewed as a means to solve an overdetermined discretization of a boundary value problem. In the same vein, the DPG* methodology is a means to solve an underdetermined discretization. These two viewpoints are developed by embedding the same operator equation into two different saddle-point problems. The analyses of the two problems have many common elements. Comparison to othermethods in the literature round out the newly …
A Spacetime Dpg Method For The Wave Equation In Multiple Dimensions, Jay Gopalakrishnan, Paulina Sepulveda
A Spacetime Dpg Method For The Wave Equation In Multiple Dimensions, Jay Gopalakrishnan, Paulina Sepulveda
Portland Institute for Computational Science Publications
A spacetime discontinuous Petrov-Galerkin (DPG) method for the linear wave equation is presented. This method is based on a weak formulation that uses a broken graph space. The wellposedness of this formulation is established using a previously presented abstract framework. One of the main tasks in the verification of the conditions of this framework is proving a density result. This is done in detail for a simple domain in arbitrary dimensions. The DPG method based on the weak formulation is then studied theoretically and numerically. Error estimates and numerical results are presented for triangular, rectangular, tetrahedral, and hexahedral meshes of …
Ideals, Big Varieties, And Dynamic Networks, Ian H. Dinwoodie
Ideals, Big Varieties, And Dynamic Networks, Ian H. Dinwoodie
Mathematics and Statistics Faculty Publications and Presentations
The advantage of using algebraic geometry over enumeration for describing sets related to attractors in large dynamic networks from biology is advocated. Examples illustrate the gains.
Filtered Subspace Iteration For Selfadjoint Operators, Jay Gopalakrishnan, Luka Grubišić, Jeffrey S. Ovall
Filtered Subspace Iteration For Selfadjoint Operators, Jay Gopalakrishnan, Luka Grubišić, Jeffrey S. Ovall
Portland Institute for Computational Science Publications
We consider the problem of computing a cluster of eigenvalues (and its associated eigenspace) of a (possibly unbounded) selfadjoint operator in a Hilbert space. A rational function of the operator is constructed such that the eigenspace of interest is its dominant eigenspace, and a subspace iteration procedure is used to approximate this eigenspace. The computed space is then used to obtain approximations of the eigenvalues of interest. An eigenvalue and eigenspace convergence analysis that considers both iteration error and dis- cretization error is provided. A realization of the proposed approach for a model second-order elliptic operator is based on a …
Some Remarks On Interpolation And Best Approximation, Randolph E. Bank, Jeffrey S. Ovall
Some Remarks On Interpolation And Best Approximation, Randolph E. Bank, Jeffrey S. Ovall
Mathematics and Statistics Faculty Publications and Presentations
Sufficient conditions are provided for establishing equivalence between best approximation error and projection/interpolation error in finite-dimensional vector spaces for general (semi)norms. The results are applied to several standard finite element spaces, modes of interpolation and (semi)norms, and a numerical study of the dependence on polynomial degree of constants appearing in our estimates is provided.
A Scalable Preconditioner For A Primal Dpg Method, Andrew T. Barker, Veselin A. Dobrev, Jay Gopalakrishnan, Tzanio Kolev
A Scalable Preconditioner For A Primal Dpg Method, Andrew T. Barker, Veselin A. Dobrev, Jay Gopalakrishnan, Tzanio Kolev
Portland Institute for Computational Science Publications
We show how a scalable preconditioner for the primal discontinuous Petrov-Galerkin (DPG) method can be developed using existing algebraic multigrid (AMG) preconditioning techniques. The stability of the DPG method gives a norm equivalence which allows us to exploit existing AMG algorithms and software. We show how these algebraic preconditioners can be applied directly to a Schur complement system arising from the DPG method. One of our intermediate results shows that a generic stable decomposition implies a stable decomposition for the Schur complement. This justifies the application of algebraic solvers directly to the interface degrees of freedom. Combining such results, we …
Breaking Spaces And Forms For The Dpg Method And Applications Including Maxwell Equations, Carsten Carstensen, Leszek Demkowicz, Jay Gopalakrishnan
Breaking Spaces And Forms For The Dpg Method And Applications Including Maxwell Equations, Carsten Carstensen, Leszek Demkowicz, Jay Gopalakrishnan
Mathematics and Statistics Faculty Publications and Presentations
Discontinuous Petrov Galerkin (DPG) methods are made easily implementable using `broken' test spaces, i.e., spaces of functions with no continuity constraints across mesh element interfaces. Broken spaces derivable from a standard exact sequence of first order (unbroken) Sobolev spaces are of particular interest. A characterization of interface spaces that connect the broken spaces to their unbroken counterparts is provided. Stability of certain formulations using the broken spaces can be derived from the stability of analogues that use unbroken spaces. This technique is used to provide a complete error analysis of DPG methods for Maxwell equations with perfect electric boundary conditions. …
Exact Tests For Singular Network Data, Ian H. Dinwoodie, Kruti Pandya
Exact Tests For Singular Network Data, Ian H. Dinwoodie, Kruti Pandya
Mathematics and Statistics Faculty Publications and Presentations
We propose methodology for exact statistical tests of hypotheses for models of network dynamics. The methodology formulates Markovian exponential families, then uses sequential importance sampling to compute expectations within basins of attraction and within level sets of a sufficient statistic for an over-dispersion model. Comparisons of hypotheses can be done conditional on basins of attraction. Examples are presented.
Convergence Rates Of The Dpg Method With Reduced Test Space Degree, Timaeus Bouma, Jay Gopalakrishnan, Ammar Harb
Convergence Rates Of The Dpg Method With Reduced Test Space Degree, Timaeus Bouma, Jay Gopalakrishnan, Ammar Harb
Mathematics and Statistics Faculty Publications and Presentations
This paper presents a duality theorem of the Aubin-Nitsche type for discontinuous Petrov Galerkin (DPG) methods. This explains the numerically observed higher convergence rates in weaker norms. Considering the specific example of the mild-weak (or primal) DPG method for the Laplace equation, two further results are obtained. First, the DPG method continues to be solvable even when the test space degree is reduced, provided it is odd. Second, a non-conforming method of analysis is developed to explain the numerically observed convergence rates for a test space of reduced degree
A Posteriori Estimates Using Auxiliary Subspace Techniques, Harri Hakula, Michael Neilan, Jeffrey S. Ovall
A Posteriori Estimates Using Auxiliary Subspace Techniques, Harri Hakula, Michael Neilan, Jeffrey S. Ovall
Mathematics and Statistics Faculty Publications and Presentations
A posteriori error estimators based on auxiliary subspace techniques for second order elliptic problems in Rd (d ≥ 2) are considered. In this approach, the solution of a global problem is utilized as the error estimator. As the continuity and coercivity of the problem trivially leads to an efficiency bound, the main focus of this paper is to derive an analogous effectivity bound and to determine the computational complexity of the auxiliary approximation problem. With a carefully chosen auxiliary subspace, we prove that the error is bounded above by the error estimate up to oscillation terms. In addition, we show …
Dispersive And Dissipative Errors In The Dpg Method With Scaled Norms For Helmholtz Equation, Jay Gopalakrishnan, Ignacio Muga, Nicole Olivares
Dispersive And Dissipative Errors In The Dpg Method With Scaled Norms For Helmholtz Equation, Jay Gopalakrishnan, Ignacio Muga, Nicole Olivares
Mathematics and Statistics Faculty Publications and Presentations
This paper studies the discontinuous Petrov--Galerkin (DPG) method, where the test space is normed by a modified graph norm. The modification scales one of the terms in the graph norm by an arbitrary positive scaling parameter. The main finding is that as the parameter approaches zero, better results are obtained, under some circumstances, when the method is applied to the Helmholtz equation. The main tool used is a dispersion analysis on the multiple interacting stencils that form the DPG method. The analysis shows that the discrete wavenumbers of the method are complex, explaining the numerically observed artificial dissipation in the …
Nonnegativity Of Exact And Numerical Solutions Of Some Chemotactic Models, Patrick De Leenheer, Jay Gopalakrishnan, Erica Zuhr
Nonnegativity Of Exact And Numerical Solutions Of Some Chemotactic Models, Patrick De Leenheer, Jay Gopalakrishnan, Erica Zuhr
Mathematics and Statistics Faculty Publications and Presentations
We investigate nonnegativity of exact and numerical solutions to a generalized Keller–Segel model. This model includes the so-called “minimal” Keller–Segel model, but can cover more general chemistry. We use maximum principles and invariant sets to prove that all components of the solution of the generalized model are nonnegative. We then derive numerical methods, using finite element techniques, for the generalized Keller–Segel model. Adapting the ideas in our proof of nonnegativity of exact solutions to the discrete setting, we are able to show nonnegativity of discrete solutions from the numerical methods under certain standard assumptions. One of the numerical methods is …
Convergence Analysis Of A Multigrid Algorithm For The Acoustic Single Layer Equation, Simon Gemmrich, Jay Gopalakrishnan, Nilima Nigam
Convergence Analysis Of A Multigrid Algorithm For The Acoustic Single Layer Equation, Simon Gemmrich, Jay Gopalakrishnan, Nilima Nigam
Mathematics and Statistics Faculty Publications and Presentations
We present and analyze a multigrid algorithm for the acoustic single layer equation in two dimensions. The boundary element formulation of the equation is based on piecewise constant test functions and we make use of a weak inner product in the multigrid scheme as proposed in Bramble et al. (1994) . A full error analysis of the algorithm is presented. We also conduct a numerical study of the effect of the weak inner product on the oscillatory behavior of the eigenfunctions for the Laplace single layer operator.
A Locking-Free Hp Dpg Method For Linear Elasticity With Symmetric Stresses, Jamie Bramwell, Leszek Demkowicz, Jay Gopalakrishnan, Weifeng Qiu
A Locking-Free Hp Dpg Method For Linear Elasticity With Symmetric Stresses, Jamie Bramwell, Leszek Demkowicz, Jay Gopalakrishnan, Weifeng Qiu
Mathematics and Statistics Faculty Publications and Presentations
We present two new methods for linear elasticity that simultaneously yield stress and displacement approximations of optimal accuracy in both the mesh size h and polynomial degree p. This is achieved within the recently developed discontinuous Petrov- Galerkin (DPG) framework. In this framework, both the stress and the displacement ap- proximations are discontinuous across element interfaces. We study locking-free convergence properties and the interrelationships between the two DPG methods.
A Class Of Discontinuous Petrov–Galerkin Methods. Part Iii: Adaptivity, Leszek Demkowicz, Jay Gopalakrishnan, Antti H. Niemi
A Class Of Discontinuous Petrov–Galerkin Methods. Part Iii: Adaptivity, Leszek Demkowicz, Jay Gopalakrishnan, Antti H. Niemi
Mathematics and Statistics Faculty Publications and Presentations
We continue our theoretical and numerical study on the Discontinuous Petrov–Galerkin method with optimal test functions in context of 1D and 2D convection-dominated diffusion problems and hp-adaptivity. With a proper choice of the norm for the test space, we prove robustness (uniform stability with respect to the diffusion parameter) and mesh-independence of the energy norm of the FE error for the 1D problem. With hp-adaptivity and a proper scaling of the norms for the test functions, we establish new limits for solving convection-dominated diffusion problems numerically: for 1D and for 2D problems. The adaptive process is fully automatic and starts …
Analysis Of Hdg Methods For Stokes Flow, Bernardo Cockburn, Jay Gopalakrishnan, Ngoc Cuong Nguyen, Jaume Peraire, Francisco-Javier Sayas
Analysis Of Hdg Methods For Stokes Flow, Bernardo Cockburn, Jay Gopalakrishnan, Ngoc Cuong Nguyen, Jaume Peraire, Francisco-Javier Sayas
Mathematics and Statistics Faculty Publications and Presentations
In this paper, we analyze a hybridizable discontinuous Galerkin method for numerically solving the Stokes equations. The method uses polynomials of degree $ k$ for all the components of the approximate solution of the gradient-velocity-pressure formulation. The novelty of the analysis is the use of a new projection tailored to the very structure of the numerical traces of the method. It renders the analysis of the projection of the errors very concise and allows us to see that the projection of the error in the velocity superconverges. As a consequence, we prove that the approximations of the velocity gradient, the …
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 …
A Projection-Based Error Analysis Of Hdg Methods, Jay Gopalakrishnan, Bernardo Cockburn, Francisco-Javier Sayas
A Projection-Based Error Analysis Of Hdg Methods, Jay Gopalakrishnan, Bernardo Cockburn, Francisco-Javier Sayas
Mathematics and Statistics Faculty Publications and Presentations
We introduce a new technique for the error analysis of hybridizable discontinuous Galerkin (HDG) methods. The technique relies on the use of a new projection whose design is inspired by the form of the numerical traces of the methods. This renders the analysis of the projections of the discretization errors simple and concise. By showing that these projections of the errors are bounded in terms of the distance between the solution and its projection, our studies of influence of the stabilization parameter are reduced to local analyses of approximation by the projection. We illustrate the technique on a specific HDG …
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.
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 …
A Characterization Of Hybridized Mixed Methods For Second Order Elliptic Problems, Bernardo Cockburn, Jay Gopalakrishnan
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.
Microscopic Irreversibility And Gibbs Entropy, John D. Ramshaw
Microscopic Irreversibility And Gibbs Entropy, John D. Ramshaw
Physics Faculty Publications and Presentations
In a recent paper of the same title [J. Non-Equilib. Thermodyn., 15 (1990), 151], Liboff observed that the fine-grained Gibbs entropy of a canonical Hamiltonian system remains constant in time even for Hamiltonians that are not even in momenta and consequently violate time-reversal invariance (TRI). Here we extend this observation to non-canonical Hamiltonian systems, including systems with singular Poisson tensors and pseudo-Hamiltonian systems that violate the Jacobi identity. Necessary and sufficient conditions are given for the Gibbs entropy to be constant in such systems. The concept of TRI is not in general meaningful for such systems, but it is shown …