Peter Hübner 1999 Class. Quantum Grav. 16 2823 doi:10.1088/0264-9381/16/9/302
Peter Hübner
Show affiliationsThis is the second paper in a series describing a numerical implementation of the conformal Einstein equation. This paper deals with the technical details of the numerical code used to perform numerical time evolutions from a `minimal' set of data.
We outline the numerical construction of a complete set of data for our equations from a minimal set of data. The second- and the fourth-order discretizations, which are used for the construction of the complete data set and for the numerical integration of the time evolution equations, are described and their efficiencies are compared. By using the fourth-order scheme we reduce our computer resource requirements - with respect to memory as well as computation time - by at least two orders of magnitude as compared to the second-order scheme.
83C05 Einstein's equations (general structure, canonical formalism, Cauchy problems)
Issue 9 (September 1999)
Received 26 March 1999
Peter Hübner 1999 Class. Quantum Grav. 16 2823
Siek Hyung et al. 1999 ApJ 514 878
Brian L. Rachford et al. 2001 ApJ 555 839
Theodore Simon and Wayne B. Landsman 1997 ApJ 483 435
Jaume Garriga et al JCAP01(2006)017
Don N Page 1998 Class. Quantum Grav. 15 1669
Reginald D Smith J. Stat. Mech. (2006) P02006
Jeffrey S Kline et al 2009 Supercond. Sci. Technol. 22 015004
Kathy-Anne Brickman Soderberg et al 2009 New J. Phys. 11 055022
Ruben Krasnopolsky et al. 2009 ApJ 703 1863