John C. Butcher
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
John C. Butcher has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Yuto Miyatake
D3 Center, The University of Osaka, Toyonaka, Japan
4 shared publications D.J.L. Chen
Ling Tung Institute of Technology
3 shared publications- Ali Abdi
Faculty of Mathematics, Statistics and Computer Science, University of Tabriz, Tabriz, Iran
2 shared publications Gulshad Imran
University of Auckland
2 shared publications- Shun Sato
Department of Mathematical Sciences Graduate School of Science Tokyo Metropolitan University 1-1 Minami-Osawa Hachioji-shi, Tokyo 192-0397 Japan
2 shared publications - Taketomo Mitsui
Department of Mathematical Informatics, Graduate School of Informatics, Nagoya University, Nagoya, Japan
2 shared publications
Latest Publications
- 4 May 2025
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 65 (2) , 1-10
On the B-series composition theorem
- 4 May 2025
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 65 (2) , 1-10
On the B-series composition theorem
- Open Access
On the B-series composition theorem
The B-series composition theorem has been an important topic in numerical analysis of ordinary differential equations for the past-half century. Traditional proofs of this theorem rely on labelled trees, whereas recent developments in B-series analysis favour the use of unlabelled trees. In this paper, we present a new proof of the B-series composition theorem that does not depend on labelled trees. A key challenge in this approach is accurately counting combinations related to ``pruning.'' This challenge is overcome by introducing the concept of ``assignment.''
Open AccessOn the B-series composition theorem
The B-series composition theorem has been an important topic in numerical analysis of ordinary differential equations for the past-half century. Traditional proofs of this theorem rely on labelled trees, whereas recent developments in B-series analysis favour the use of unlabelled trees. In this paper, we present a new proof of the B-series composition theorem that does not depend on labelled trees. A key challenge in this approach is accurately counting combinations related to ``pruning.'' This challenge is overcome by introducing the concept of ``assignment.''
- Open Access
A New Solution to a Cubic Diophantine Equation
A positive integer, which can be written as the sum of two positive cubes in two different ways, is known as a “Ramanujan number”. The most famous example is , which was identified by Ramanujan as the lowest such number. In this paper, we consider the homogeneous cubic Diophantine equation , where there is no restriction on the signs of the integers . We show that every solution can be written in terms of two parameters in the ring . It is also shown that solutions with arbitrarily high values of arise amongst the primitive solutions.Open AccessA New Solution to a Cubic Diophantine Equation
A positive integer, which can be written as the sum of two positive cubes in two different ways, is known as a “Ramanujan number”. The most famous example is , which was identified by Ramanujan as the lowest such number. In this paper, we consider the homogeneous cubic Diophantine equation , where there is no restriction on the signs of the integers . We show that every solution can be written in terms of two parameters in the ring . It is also shown that solutions with arbitrarily high values of arise amongst the primitive solutions. - Open Access
High-order linearly implicit schemes conserving quadratic invariants
In this paper, we propose linearly implicit and arbitrary high-order conservative numerical schemes for ordinary differential equations with a quadratic invariant. Many differential equations have invariants, and numerical schemes for preserving them have been extensively studied. Since linear invariants can be easily kept after discretisation, quadratic invariants are essentially the simplest ones. Quadratic invariants are important objects that appear not only in many physical examples but also in the computationally efficient conservative schemes for general invariants such as scalar auxiliary variable approach, which have been studied in recent years. It is known that quadratic invariants can be kept relatively easily compared to general invariants, and indeed can be preserved by canonical Runge--Kutta methods. However, there is no unified method for constructing linearly implicit and high order conservative schemes. In this paper, we construct such schemes based on canonical Runge--Kutta methods and prove some properties involving accuracy.
Open AccessHigh-order linearly implicit schemes conserving quadratic invariants
In this paper, we propose linearly implicit and arbitrary high-order conservative numerical schemes for ordinary differential equations with a quadratic invariant. Many differential equations have invariants, and numerical schemes for preserving them have been extensively studied. Since linear invariants can be easily kept after discretisation, quadratic invariants are essentially the simplest ones. Quadratic invariants are important objects that appear not only in many physical examples but also in the computationally efficient conservative schemes for general invariants such as scalar auxiliary variable approach, which have been studied in recent years. It is known that quadratic invariants can be kept relatively easily compared to general invariants, and indeed can be preserved by canonical Runge--Kutta methods. However, there is no unified method for constructing linearly implicit and high order conservative schemes. In this paper, we construct such schemes based on canonical Runge--Kutta methods and prove some properties involving accuracy.
- 2 April 2021
- Published by Springer Nature
- p. 151-176
Algebraic Analysis and Integration Methods
- 2 April 2021
- Published by Springer Nature
- p. 177-209
B-series and Runge–Kutta methods
- 2 April 2021
- Published by Springer Nature
- p. 247-289
B-Series and Geometric Integration
- 2 April 2021
- Published by Springer Nature
- p. 211-246
B-Series and Multivalue Methods
- 2 April 2021
- Published by Springer Nature
- p. 1-37
Differential equations, numerical methods and algebraic analysis
- 2 April 2021
- Published by Springer Nature
- p. 1-37
Differential equations, numerical methods and algebraic analysis
- 2 April 2021
- Published by Springer Nature
- p. 39-97
Trees and forests