#### Filter Results:

#### Publication Year

2003

2009

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We discuss the stability of the Parareal algorithm for an autonomous set of differential equations. The stability function for the algorithm is derived, and stability conditions for the case of real eigenvalues are given. The general case of complex eigenvalues has been investigated by computing the stability regions numerically.

In this paper we show that standard preconditioners for parabolic PDEs discretized by implicit Euler or Crank–Nicolson schemes can be reused for higher–order fully implicit Runge–Kutta time discretization schemes. We prove that the suggested block diagonal preconditioners are order–optimal for A–stable and irreducible Runge–Kutta schemes with invertible… (More)

This article describes two Python modules for solving partial differential equations (PDEs): PyCC is designed as a Matlab-like environment for writing algorithms for solving PDEs, and SyFi creates matrices based on symbolic mathematics, code generation, and the finite element method.

Recently, the authors introduced a preconditioner for the linear systems that arise from fully implicit Runge-Kutta time stepping schemes applied to parabolic PDEs [9]. The preconditioner was a block Jacobi preconditioner, where each of the blocks were based on standard preconditioners for low-order time discretizations like implicit Euler or… (More)

- TRYGVE K. NILSSEN, GUNNAR A. STAFF, KENT–ANDRE MARDAL
- 2009

The PDE part of the bidomain equations is discretized in time with fully implicit Runge–Kutta methods, and the resulting block systems are preconditioned with a block diagonal preconditioner. By studying the time stepping operator in the proper Sobolev spaces we show that the preconditioned systems have bounded condition numbers given that the Runge–Kutta… (More)

Recently, the authors presented different block preconditioners for implicit Runge-Kutta discretization of the heat equation. The preconditioners were block Jacobi and block Gauss-Seidel preconditoners where the blocks reused existing preconditioners for the implicit Euler discretization of the same equation. In this paper we will introduce similar block… (More)

- ‹
- 1
- ›