# High-Order Implicit Time-Marching Methods Based on Generalized Summation-By-Parts Operators

@article{Boom2015HighOrderIT, title={High-Order Implicit Time-Marching Methods Based on Generalized Summation-By-Parts Operators}, author={Pieter D. Boom and David W. Zingg}, journal={SIAM J. Scientific Computing}, year={2015}, volume={37} }

- Published in SIAM J. Scientific Computing 2015
DOI:10.1137/15M1014917

This article extends the theory of classical finite-difference summation-by-parts (FD-SBP) time-marching methods to the generalized summation-by-parts (GSBP) framework. Dual-consistent GSBP time-marching methods are shown to retain A- and L-stability, as well as superconvergence of integral functionals when integrated with the quadrature associated with the discretization. This also implies that the solution approximated at the end of each time step is superconvergent. In addition, GSBP time… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 18 CITATIONS

## Gamblets for opening the complexity-bottleneck of implicit schemes for hyperbolic and parabolic ODEs/PDEs with rough coefficients

VIEW 18 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## Convergence and stability properties of summation-by-parts in time

VIEW 8 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Generalized summation by parts operators: Second derivative and time-marching methods

VIEW 3 EXCERPTS

CITES BACKGROUND & RESULTS

## Runge-Kutta Characterization of the Generalized Summation-by-Parts Approach in Time

VIEW 9 EXCERPTS

CITES METHODS & BACKGROUND

## Extension of Tensor-Product Generalized and Dense-Norm Summation-by-Parts Operators to Curvilinear Coordinates

VIEW 1 EXCERPT

CITES BACKGROUND

## Some notes on summation by parts time integration methods

VIEW 2 EXCERPTS

CITES METHODS & BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 12 REFERENCES