CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Algorithms and data structures for multi-adaptive time-stepping

Johan Jansson ; Anders Logg (Institutionen för matematiska vetenskaper, matematik)
ACM Transactions on Mathematical Software (0098-3500). Vol. 35 (2008), 3,
[Artikel, refereegranskad vetenskaplig]

Multi-adaptive Galerkin methods are extensions of the standard continuous and discontinuous Galerkin methods for the numerical solution of initial value problems for ordinary or partial differential equations. In particular, the multi-adaptive methods allow individual and adaptive time steps to be used for different components or in different regions of space. We present algorithms for efficient multi-adaptive time-stepping, including the recursive construction of time slabs and adaptive time step selection. We also present data structures for efficient storage and interpolation of the multi-adaptive solution. The efficiency of the proposed algorithms and data structures is demonstrated for a series of benchmark problems. © 2008 ACM.

Nyckelord: Algorithms , C++ , Continuous Galerkin , Discontinuous Galerkin , DOLFIN , Implementation , Individual time steps , Local time steps , Mcgq , Mdgq , Multi-adaptivity , Multirate , ODE



Denna post skapades 2014-01-05. Senast ändrad 2014-09-29.
CPL Pubid: 191164

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för matematiska vetenskaper, matematik (2005-2016)

Ämnesområden

Matematik
Beräkningsmatematik

Chalmers infrastruktur