Jay Gopalakrishnan

Jay Gopalakrishnan

Auto-generated profile, based on publicly available information

Jay Gopalakrishnan

Portland State University PO Box 751 97207 Portland OR USA

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2009 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
BCBernardo Cockburn
Bernardo Cockburn
JGJayadeep Gopalakrishnan
Jayadeep Gopalakrishnan
RLRaytcho Lazarov
Raytcho Lazarov
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, continuous Galerkin, nonconforming, 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 framework allows, in a single implementation, the use of different methods in different elements or subdomains of the computational domain, which are then automatically coupled. Finally, the framework brings about a new point of view, thanks to which it is possible to see how to devise novel methods displaying very localized and simple mortaring techniques, as well as methods permitting an even further reduction of the number of globally coupled degrees of freedom.

18 March 2010 in Mathematics of Computation
Verified
Journal Article
Closed access
PDF file
BCBernardo Cockburn
Bernardo Cockburn
JGJayadeep Gopalakrishnan
Jayadeep Gopalakrishnan
FSFrancisco-Javier Sayas
Francisco-Javier Sayas
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 method applied to a model second-order elliptic problem.

25 October 2010 in Numerical Methods for Partial Differential Equations
Verified
Journal Article
Closed access
PDF file
LDL. Demkowicz
L. Demkowicz
JGJ. Gopalakrishnan
J. Gopalakrishnan

1 April 2010 in Computer Methods in Applied Mechanics and Engineering
Verified
Journal Article
Closed access
LDL. Demkowicz
L. Demkowicz
JGJ. Gopalakrishnan
J. Gopalakrishnan

2 September 2010 in Mathematics of Computation
Verified
Journal Article
Closed access
PDF file
BCBernardo Cockburn
Bernardo Cockburn
JGJayadeep Gopalakrishnan
Jayadeep Gopalakrishnan
NNNgoc Cuong Nguyen
Ngoc Cuong Nguyen
JPJaume Peraire
Jaume Peraire
FSFrancisco-Javier Sayas
Francisco-Javier Sayas
In this paper, we analyze a hybridizable discontinuous Galerkin method for numerically solving the Stokes equations. The method uses polynomials of degree k 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 velocity and the pressure converge with the optimal order of convergence of k + 1 k+1 in L 2 L^2 for any k ≥ 0 k \ge 0 . Moreover, taking advantage of the superconvergence properties of the velocity, we introduce a new element-by-element postprocessing to obtain a new velocity approximation which is exactly divergence-free, H ( \mathbf {H}( div ) ) -conforming, and converges with order k + 2 k+2 for k ≥ 1 k\ge 1 and with order 1 1 for k = 0 k=0 . Numerical experiments are presented which validate the theoretical results.

1 August 2016 in Computers & Mathematics with Applications
Verified
Journal Article
Closed access
CCC. Carstensen
C. Carstensen
LDL. Demkowicz
L. Demkowicz
JGJ. Gopalakrishnan
J. Gopalakrishnan