ACM Home Page
Please provide us with feedback. Feedback
Algorithms and Data Structures for Multi-Adaptive Time-Stepping
Full text PdfPdf (1.13 MB)
Source
ACM Transactions on Mathematical Software (TOMS) archive
Volume 35 ,  Issue 3  (October 2008) table of contents
Article No. 17  
Year of Publication: 2008
ISSN:0098-3500
Authors
Johan Jansson  Royal Institute of Technology, Stockholm
Anders Logg  University of Oslo
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 158,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1391989.1391990
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Alexander, S. G. and Agnor, C. B. 1998. n-body simulations of late stage planetary formation with a simple fragmentation model. ICARUS 132, 113--124.
 
2
Davé, R., Dubinski, J., and Hernquist, L. 1997. Parallel treeSPH. New Astronomy 2, 277--297.
 
3
 
4
Delfour, M., Hager, W., and Trochu, F. 1981. Discontinuous Galerkin methods for ordinary differential equations. Math. Comp. 36, 455--473.
 
5
Dupont, T., Hoffman, J., Johnson, C., Kirby, R. C., Larson, M. G., Logg, A., and Scott, L. R. 2003. The FEniCS project. Tech. Rep. 2003--21, Chalmers Finite Element Center Preprint Series.
 
6
 
7
Eriksson, K., Estep, D., Hansbo, P., and Johnson, C. 1995. Introduction to adaptive methods for differential equations. Acta Numerica 4, 105--158.
 
8
 
9
 
10
 
11
 
12
 
13
Eriksson, K., Johnson, C., and Thomée, V. 1985. Time discretization of parabolic problems by the discontinuous Galerkin method. RAIRO MAN 19, 611--643.
 
14
 
15
Estep, D. and French, D. 1994. Global error control for the continuous Galerkin finite element method for ordinary differential equations. M2AN 28, 815--852.
 
16
Estep, D., Larson, M., and Williams, R. 2000. Estimating the error of numerical solutions of systems of nonlinear reaction--diffusion equations. Memoirs of the American Mathematical Society 696, 1--109.
 
17
Estep, D. and Stuart, A. 2002. The dynamical behavior of the discontinuous Galerkin method and related difference schemes. Math. Comp. 71, 1075--1103.
 
18
Estep, D. and Williams, R. 1996. Accurate parallel integration of large sparse systems of differential equations. Math. Models. Meth. Appl. Sci. 6, 535--568.
 
19
FEniCS. 2008. The FEniCS project. www.fenics.org.
 
20
 
21
Free Software Foundation. 1999. GNU LGPL. URL: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
 
22
 
23
Hoffman, J. and Logg, A. 2002. DOLFIN: Dynamic Object oriented Library for FINite element computation. Tech. Rep. 2002--06, Chalmers Finite Element Center Preprint Series.
 
24
Hughes, T. J. R., Levit, I., and Winget, J. 1983a. Element-by-element implicit algorithms for heat-conduction. J. Eng. Mech.-ASCE 109, 576--585.
 
25
Hughes, T. J. R., Levit, I., and Winget, J. 1983b. An element-by-element solution algorithm for problems of structural and solid mechanics. Comput. Meth. Appl. Mech. Eng. 36, 241--254.
 
26
Hulme, B. L. 1972a. Discrete Galerkin and related one-step methods for ordinary differential equations. Math. Comput. 26, 120, 881--891.
 
27
Hulme, B. L. 1972b. One-step piecewise polynomial Galerkin methods for initial value problems. Math. Comput. 26, 118, 415--426.
 
28
Jamet, P. 1978. Galerkin-type approximations which are discontinuous in time for parabolic equations in a variable domain. SIAM J. Numer. Anal. 15, 5, 912--928.
 
29
Johnson, C. 1988. Error estimates and adaptive time-step control for a class of one-step methods for stiff ordinary differential equations. SIAM J. Numer. Anal. 25, 4, 908--926.
30
31
 
32
Lew, A., Marsden, J. E., Ortiz, M., and West, M. 2003. Asynchronous variational integrators. Arch. Rational. Mech. Anal. 167, 85--146.
 
33
 
34
 
35
Logg, A. 2004. Automation of computational mathematical modeling. Ph.D. thesis, Chalmers University of Technology, Sweden.
 
36
 
37
Logg, A. 2007. Automating the finite element method. Arch. Comput. Methods Eng. 14, 93--138.
 
38
Logg, A., Wells, G. et al. DOLFIN: A general-purpose finite element library. http://www.fenics.org/dolfin/.
 
39
Makino, J. and Aarseth, S. 1992. On a Hermite integrator with Ahmad-Cohen scheme for gravitational many-body problems. Publ. Astron. Soc. Japan 44, 141--151.
 
40
Osher, S. and Sanders, R. 1983. Numerical approximations to nonlinear conservation laws with locally varying time and space grids. Math. Comp. 41, 321--336.
 
41
Savcenco, V. 2008. Multirate numerical integration for ordinary differential equations. Ph.D. thesis, Universiteit van Amsterdam.
 
42
Savcenco, V., Hundsdorfer, W., and Verwer, J. 2005. A multirate time stepping strategy for parabolic PDEs. Tech. Rep. MAS--E0516, Centrum voor Wiskunde en Informatica (CWI).
43

Collaborative Colleagues:
Johan Jansson: colleagues
Anders Logg: colleagues