Efficient numerical realization of discontinuous Galerkin methods for temporal discretization of parabolic problems
We present an efficient and easy to implement approach to solving the semidiscrete equation systems resulting from time discretization of nonlinear parabolic problems with discontinuous Galerkin methods of order r. It is based on applying Newton’s method and decoupling the Newton update equation, wh...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
2013
|
| In: |
Numerische Mathematik
Year: 2013, Volume: 124, Issue: 1, Pages: 151-182 |
| ISSN: | 0945-3245 |
| DOI: | 10.1007/s00211-012-0511-7 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1007/s00211-012-0511-7 Verlag, lizenzpflichtig, Volltext: https://link.springer.com/article/10.1007%2Fs00211-012-0511-7 
|
| Author Notes: | Thomas Richter · Andreas Springer · Boris Vexle |
| Summary: | We present an efficient and easy to implement approach to solving the semidiscrete equation systems resulting from time discretization of nonlinear parabolic problems with discontinuous Galerkin methods of order r. It is based on applying Newton’s method and decoupling the Newton update equation, which consists of a coupled system ofr +1 elliptic problems. In order to avoid complex coefficients which arise inevitably in the equations obtained by a direct decoupling, we decouple not the exact Newton update equation but a suitable approximation. The resulting solution scheme is shown to possess fast linear convergence and consists of several steps with same structure as implicit Euler steps. We construct concrete realizations for order one to three and give numerical evidence that the required computing time is reduced significantly compared to assembling and solving the complete coupled system by Newton’s method. |
|---|---|
| Item Description: | Published online: 23 October 2012 Gesehen am 11.01.2022 |
| Physical Description: | Online Resource |
| ISSN: | 0945-3245 |
| DOI: | 10.1007/s00211-012-0511-7 |