Guido Kanschat

Guido Kanschat

Auto-generated profile, based on publicly available information

Guido Kanschat

Interdisciplinary Center for Scientific Computing (IWR), Heidelberg University, Heidelberg, Germany

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

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

Representative Publications

View All Publications
15 August 2007 in ACM Transactions on Mathematical Software
Verified
Journal Article
Open access
PDF file
WBW. Bangerth
W. Bangerth
RHR. Hartmann
R. Hartmann
GKG. Kanschat
G. Kanschat
An overview of the software design and data abstraction decisions chosen for deal.II, a general purpose finite element library written in C++, is given. The library uses advanced object-oriented and data encapsulation techniques to break finite element implementations into smaller blocks that can be arranged to fit users requirements. Through this approach, deal.II supports a large number of different applications covering a wide range of scientific areas, programming methodologies, and application-specific algorithms, without imposing a rigid framework into which they have to fit. A judicious use of programming techniques allows us to avoid the computational costs frequently associated with abstract object-oriented class libraries. The paper presents a detailed description of the abstractions chosen for defining geometric information of meshes and the handling of degrees of freedom associated with finite element spaces, as well as of linear algebra, input/output capabilities and of interfaces to other software, such as visualization tools. Finally, some results obtained with applications built atop deal.II are shown to demonstrate the powerful capabilities of this toolbox.

5 October 2004 in Mathematics of Computation
Verified
Journal Article
Open access
PDF file
BCBernardo Cockburn
Bernardo Cockburn
GKGuido Kanschat
Guido Kanschat
DSDominik Schötzau
Dominik Schötzau
In this paper a new local discontinuous Galerkin method for the incompressible stationary Navier-Stokes equations is proposed and analyzed. Four important features render this method unique: its stability, its local conservativity, its high-order accuracy, and the exact satisfaction of the incompressibility constraint. Although the method uses completely discontinuous approximations, a globally divergence-free approximate velocity in H ( d i v ; Ω ) H(\mathrm {div};\Omega ) is obtained by simple, element-by-element post-processing. Optimal error estimates are proven and an iterative procedure used to compute the approximate solution is shown to converge. This procedure is nothing but a discrete version of the classical fixed point iteration used to obtain existence and uniqueness of solutions to the incompressible Navier-Stokes equations by solving a sequence of Oseen problems. Numerical results are shown which verify the theoretical rates of convergence. They also confirm the independence of the number of fixed point iterations with respect to the discretization parameters. Finally, they show that the method works well for a wide range of Reynolds numbers.

10 September 2006 in Journal of Scientific Computing
Verified
Journal Article
Closed access
PDF file
BCBernardo Cockburn
Bernardo Cockburn
GKGuido Kanschat
Guido Kanschat
DSDominik Schötzau
Dominik Schötzau

1 January 2001 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
BCBernardo Cockburn
Bernardo Cockburn
GKGuido Kanschat
Guido Kanschat
IPIlaria Perugia
Ilaria Perugia
DSDominik Schötzau
Dominik Schötzau
In this paper, we present a superconvergence result for the local discontinuous Galerkin (LDG) method for a model elliptic problem on Cartesian grids. We identify a special numerical flux for which the L 2 -norm of the gradient and the L 2 -norm of the potential are of orders k+1/2 and k+1, respectively, when tensor product polynomials of degree at most k are used; for arbitrary meshes, this special LDG method gives only the orders of convergence of k and k+1/2, respectively. We present a series of numerical examples which establish the sharpness of our theoretical results.

1 January 2002 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
BCBernardo Cockburn
Bernardo Cockburn
GKGuido Kanschat
Guido Kanschat
DSDominik Schötzau
Dominik Schötzau
CSChristoph Schwab
Christoph Schwab
In this paper, we introduce and analyze local discontinuous Galerkin methods for the Stokes system. For a class of shape regular meshes with hanging nodes we derive a priori estimates for the L 2 -norm of the errors in the velocities and the pressure. We show that optimal-order estimates are obtainedwhen polynomials of degree k are used for each component of the velocity and polynomials of degree k-1 for the pressure, for any $k\ge1$. We also consider the case in which all the unknowns are approximated with polynomials of degree k and show that, although the orders of convergence remain the same, the method is more efficient. Numerical experiments verifying these facts are displayed.

1 January 2016 in Journal of Numerical Mathematics
Verified
Journal Article
Closed access
WBWolfgang Bangerth
Wolfgang Bangerth
DDDenis Davydov
Denis Davydov
THTimo Heister
Timo Heister
LHLuca Heltai
Luca Heltai
GKGuido Kanschat
Guido Kanschat
DWDavid Wells
David Wells
This paper provides an overview of the new features of the finite element library deal.II version 8.4.