Algorithms and Data Structures for Multi-Adaptive Time-Stepping
2008 (English)In: ACM Transactions on Mathematical Software, ISSN 0098-3500, Vol. 35, no 3Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2008. Vol. 35, no 3
Algorithms, Performance, Multi-adaptivity, individual time steps, local, time steps, multirate, ODE, continuous Galerkin, discontinuous, Galerkin, mcgq, mdgq, C plus, implementation, algorithms, DOLFIN, ordinary differential-equations, finite-element methods, locally, varying time, parabolic problems, galerkin methods, conservation-laws, approximations, integration, schemes, model
IdentifiersURN: urn:nbn:se:kth:diva-18245ISI: 000264243800001ScopusID: 2-s2.0-56349106061OAI: oai:DiVA.org:kth-18245DiVA: diva2:336291
QC 201005252010-08-052010-08-052010-09-22Bibliographically approved