Conjugate symplecticity of second-order linear multi-step methods (Q875150)

The paper reviews the two different approaches for symplecticity of linear multi-step methods (LMSM) by \textit{T. Eirola} and \textit{J. M. Sanz-Serna} [Numer. Math. 61, No. 3, 281--290 (1992; Zbl 0741.65056)], \textit{Z. Ge} and \textit{K. Feng} [J. Comput. Math. 6, No.~1, 88--97 (1988; Zbl 0656.70016)], and by \textit{K. Feng} and \textit{Y. K. Tang} [Symplectic multi-step methods. Personal communication (1990)], \textit{E. Hairer} and \textit{P. Leone} [Numerical analysis 1997. Proceedings of the 17th Dundee biennial conference, University of Dundee, GB, June 24--27, 1997. Harlow: Longman. Pitman Res. Notes Math. Ser. 380, 133--149 (1998; Zbl 0902.65027)], respectively, and gives a numerical example between these two approaches. Under a conjugate relation with three difference schemes \(G_i^{\tau}\), \(i=1,2,3\), the main result proves that the \(B\)-series error expansions are equal to those of the trapezoidal, mid-point and Euler forward schemes up to a parameter \(\theta\), respectively. In particular it follows that the second-order symmetric leap-frog scheme cannot be conjugate-symplectic via another LMSM.