Bernardo Cockburn
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Bernardo Cockburn has a total of 100 co-authors. Here are the top co-authors by number of shared publications:
- Jay Gopalakrishnan
Portland State University PO Box 751 97207 Portland OR USA
6 shared publications - Ke Shi
Department of Mathematics and Statistics, Old Dominion University Norfolk, VA 23529, USA#TAB
5 shared publications - Dominik Schötzau
University of British Columbia
4 shared publications - Fatih Celiker
Department of Mathematics, Wayne State University, Detroit, USA
4 shared publications - Guido Kanschat
Interdisciplinary Center for Scientific Computing (IWR), Heidelberg University, Heidelberg, Germany
4 shared publications - Guosheng Fu
School of Mathematics, University of Minnesota, Minneapolis, MN 55455, USA
4 shared publications
Latest Publications
- Open Access
Improved $L^2$-error estimates for the wave equation discretized using hybrid nonconforming methods on simplicial meshes
We present improved $L^2$-error estimates on the time-integrated primal variable for the wave equation in its first-order formulation. The space discretization relies on a hybrid nonconforming method, such as the hybridizable discontinuous Galerkin, the hybrid high-order or the weak Galerkin methods. We consider both equal-order and mixed-order settings on simplices, and include the lowest-order case with piecewise constant unknowns on the faces and in the cells. Our main result is a superclose, resp., optimal bound on the above error in the equal-, resp., mixed-order case. A key result of independent interest to achieve these estimates are novel approximation estimates for an interpolation operator inspired from the hybridizable discontinuous Galerkin literature.
Open AccessImproved $L^2$-error estimates for the wave equation discretized using hybrid nonconforming methods on simplicial meshes
We present improved $L^2$-error estimates on the time-integrated primal variable for the wave equation in its first-order formulation. The space discretization relies on a hybrid nonconforming method, such as the hybridizable discontinuous Galerkin, the hybrid high-order or the weak Galerkin methods. We consider both equal-order and mixed-order settings on simplices, and include the lowest-order case with piecewise constant unknowns on the faces and in the cells. Our main result is a superclose, resp., optimal bound on the above error in the equal-, resp., mixed-order case. A key result of independent interest to achieve these estimates are novel approximation estimates for an interpolation operator inspired from the hybridizable discontinuous Galerkin literature.
- Open Access
Improved L^2-error estimates for the wave equation discretized using hybrid nonconforming methods on simplicial meshes
We present improved L^2-error estimates on the time-integrated primal variable for the wave equation in its first-order formulation. The space discretization relies on a hybrid nonconforming method, such as the hybridizable discontinuous Galerkin, the hybrid high-order or the weak Galerkin methods. We consider both equal-order and mixed-order settings on simplices, and include the lowest-order case with piecewise constant unknowns on the faces and in the cells. Our main result is a superclose, resp., optimal bound on the above error in the equal-, resp., mixed-order case. A key result of independent interest to achieve these estimates are novel approximation estimates for an interpolation operator inspired from the hybridizable discontinuous Galerkin literature.
Open AccessImproved L^2-error estimates for the wave equation discretized using hybrid nonconforming methods on simplicial meshes
We present improved L^2-error estimates on the time-integrated primal variable for the wave equation in its first-order formulation. The space discretization relies on a hybrid nonconforming method, such as the hybridizable discontinuous Galerkin, the hybrid high-order or the weak Galerkin methods. We consider both equal-order and mixed-order settings on simplices, and include the lowest-order case with piecewise constant unknowns on the faces and in the cells. Our main result is a superclose, resp., optimal bound on the above error in the equal-, resp., mixed-order case. A key result of independent interest to achieve these estimates are novel approximation estimates for an interpolation operator inspired from the hybridizable discontinuous Galerkin literature.
- 3 April 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 103 (2) , 1-49
Turbo Post-processing for Discontinuous Galerkin Methods: One-Dimensional Linear Transport
- 3 April 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 103 (2) , 1-49
Turbo Post-processing for Discontinuous Galerkin Methods: One-Dimensional Linear Transport
- Open Access
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematics in Engineering
- Vol. 6 (2) , 221-237
Efficient implementation of the hybridized Raviart-Thomas mixed method by converting flux subspaces into stabilizations
We show how to reduce the computational time of the practical implementation of the Raviart-Thomas mixed method for second-order elliptic problems. The implementation takes advantage of a recent result which states that certain local subspaces of the vector unknown can be eliminated from the equations by transforming them into stabilization functions; see the paper published online in JJIAM on August 10, 2023. We describe in detail the new implementation (in MATLAB and a laptop with Intel(R) Core (TM) i7-8700 processor which has six cores and hyperthreading) and present numerical results showing 10 to 20% reduction in the computational time for the Raviart-Thomas method of index $ k $, with $ k $ ranging from 1 to 20, applied to a model problem.- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematics in Engineering
- Vol. 6 (2) , 221-237
Open AccessEfficient implementation of the hybridized Raviart-Thomas mixed method by converting flux subspaces into stabilizations
We show how to reduce the computational time of the practical implementation of the Raviart-Thomas mixed method for second-order elliptic problems. The implementation takes advantage of a recent result which states that certain local subspaces of the vector unknown can be eliminated from the equations by transforming them into stabilization functions; see the paper published online in JJIAM on August 10, 2023. We describe in detail the new implementation (in MATLAB and a laptop with Intel(R) Core (TM) i7-8700 processor which has six cores and hyperthreading) and present numerical results showing 10 to 20% reduction in the computational time for the Raviart-Thomas method of index $ k $, with $ k $ ranging from 1 to 20, applied to a model problem. - Open Access
Efficient implementation of the hybridized Raviart-Thomas mixed method by converting flux subspaces into stabilizations
We show how to reduce the computational time of the practical implementation of the Raviart-Thomas mixed method for second-order elliptic problems. The implementation takes advantage of a recent result which states that certain local subspaces of the vector unknown can be eliminated from the equations by transforming them into stabilization functions; see the paper published online in JJIAM on August 10, 2023. We describe in detail the new implementation (in MATLAB and a laptop with Intel(R) Core (TM) i7-8700 processor which has six cores and hyperthreading) and present numerical results showing 10 to 20% reduction in the computational time for the Raviart-Thomas method of index $k$, with $k$ ranging from 1 to 20, applied to a model problem.Open AccessEfficient implementation of the hybridized Raviart-Thomas mixed method by converting flux subspaces into stabilizations
We show how to reduce the computational time of the practical implementation of the Raviart-Thomas mixed method for second-order elliptic problems. The implementation takes advantage of a recent result which states that certain local subspaces of the vector unknown can be eliminated from the equations by transforming them into stabilization functions; see the paper published online in JJIAM on August 10, 2023. We describe in detail the new implementation (in MATLAB and a laptop with Intel(R) Core (TM) i7-8700 processor which has six cores and hyperthreading) and present numerical results showing 10 to 20% reduction in the computational time for the Raviart-Thomas method of index $k$, with $k$ ranging from 1 to 20, applied to a model problem. - 10 August 2023
- Published by Springer Nature in Japan Journal of Industrial and Applied Mathematics
- Vol. 40 (3) , 1637-1676
Hybridizable discontinuous Galerkin methods for second-order elliptic problems: overview, a new result and open problems
- 10 August 2023
- Published by Springer Nature in Japan Journal of Industrial and Applied Mathematics
- Vol. 40 (3) , 1637-1676
Hybridizable discontinuous Galerkin methods for second-order elliptic problems: overview, a new result and open problems
- Open Access
- 5 April 2023
- Published by Frontiers Media SA in Frontiers in Applied Mathematics and Statistics
- Vol. 9
Combining finite element space-discretizations with symplectic time-marching schemes for linear Hamiltonian systems
We provide a short introduction to the devising of a special type of methods for numerically approximating the solution of Hamiltonian partial differential equations. These methods use Galerkin space-discretizations which result in a system of ODEs displaying a discrete version of the Hamiltonian structure of the original system. The resulting system of ODEs is then discretized by a symplectic time-marching method. This combination results in high-order accurate, fully discrete methods which can preserve the invariants of the Hamiltonian defining the ODE system. We restrict our attention to linear Hamiltonian systems, as the main results can be obtained easily and directly, and are applicable to many Hamiltonian systems of practical interest including acoustics, elastodynamics, and electromagnetism. After a brief description of the Hamiltonian systems of our interest, we provide a brief introduction to symplectic time-marching methods for linear systems of ODEs which does not require any background on the subject. We describe then the case in which finite-difference space-discretizations are used and focus on the popular Yee scheme (1966) for electromagnetism. Finally, we consider the case of finite-element space discretizations. The emphasis is placed on the conservation properties of the fully discrete schemes. We end by describing ongoing work.
- 5 April 2023
- Published by Frontiers Media SA in Frontiers in Applied Mathematics and Statistics
- Vol. 9
Open AccessCombining finite element space-discretizations with symplectic time-marching schemes for linear Hamiltonian systems
We provide a short introduction to the devising of a special type of methods for numerically approximating the solution of Hamiltonian partial differential equations. These methods use Galerkin space-discretizations which result in a system of ODEs displaying a discrete version of the Hamiltonian structure of the original system. The resulting system of ODEs is then discretized by a symplectic time-marching method. This combination results in high-order accurate, fully discrete methods which can preserve the invariants of the Hamiltonian defining the ODE system. We restrict our attention to linear Hamiltonian systems, as the main results can be obtained easily and directly, and are applicable to many Hamiltonian systems of practical interest including acoustics, elastodynamics, and electromagnetism. After a brief description of the Hamiltonian systems of our interest, we provide a brief introduction to symplectic time-marching methods for linear systems of ODEs which does not require any background on the subject. We describe then the case in which finite-difference space-discretizations are used and focus on the popular Yee scheme (1966) for electromagnetism. Finally, we consider the case of finite-element space discretizations. The emphasis is placed on the conservation properties of the fully discrete schemes. We end by describing ongoing work.
- 26 March 2022
- Published by Walter de Gruyter GmbH in Computational Methods in Applied Mathematics
- Vol. 22 (4) , 775-796
Discontinuous Galerkin Methods with Time-Operators in Their Numerical Traces for Time-Dependent Electromagnetics
We present a new class of discontinuous Galerkin methods for the space discretization of the time-dependent Maxwell equations whose main feature is the use of time derivatives and/or time integrals in the stabilization part of their numerical traces. These numerical traces are chosen in such a way that the resulting semidiscrete schemes exactly conserve a discrete version of the energy. We introduce four model ways of achieving this and show that, when using the mid-point rule to march in time, the fully discrete schemes also conserve the discrete energy. Moreover, we propose a new three-step technique to devise fully discrete schemes of arbitrary order of accuracy which conserve the energy in time. The first step consists in transforming the semidiscrete scheme into a Hamiltonian dynamical system. The second step consists in applying a symplectic time-marching method to this dynamical system in order to guarantee that the resulting fully discrete method conserves the discrete energy in time. The third and last step consists in reversing the above-mentioned transformation to rewrite the fully discrete scheme in terms of the original variables.
- 26 March 2022
- Published by Walter de Gruyter GmbH in Computational Methods in Applied Mathematics
- Vol. 22 (4) , 775-796
Discontinuous Galerkin Methods with Time-Operators in Their Numerical Traces for Time-Dependent Electromagnetics
We present a new class of discontinuous Galerkin methods for the space discretization of the time-dependent Maxwell equations whose main feature is the use of time derivatives and/or time integrals in the stabilization part of their numerical traces. These numerical traces are chosen in such a way that the resulting semidiscrete schemes exactly conserve a discrete version of the energy. We introduce four model ways of achieving this and show that, when using the mid-point rule to march in time, the fully discrete schemes also conserve the discrete energy. Moreover, we propose a new three-step technique to devise fully discrete schemes of arbitrary order of accuracy which conserve the energy in time. The first step consists in transforming the semidiscrete scheme into a Hamiltonian dynamical system. The second step consists in applying a symplectic time-marching method to this dynamical system in order to guarantee that the resulting fully discrete method conserves the discrete energy in time. The third and last step consists in reversing the above-mentioned transformation to rewrite the fully discrete scheme in terms of the original variables.
- 1 January 2022
- Published by Elsevier in Journal of Computational Physics
- Vol. 449
An adjoint-based super-convergent Galerkin approximation of eigenvalues
- 1 January 2022
- Published by Elsevier in Journal of Computational Physics
- Vol. 449
An adjoint-based super-convergent Galerkin approximation of eigenvalues