Abstract
This paper proposes and investigates a class of new linear multi-step methods for solving general oscillatory second-order initial value problems \(y^{\prime \prime }(t)+My(t)=f(t,y(t),y^{\prime }(t))\), where M is a positive semi-definite matrix containing implicitly the frequencies of the problem. The new methods, with coefficients depending on the frequency matrix M, incorporate the special structure of the problem brought by the linear term My(t) and integrate exactly the unperturbed oscillator \(y^{\prime \prime }(t)+My(t)=\mathbf {0}\). This class of new methods can be viewed extensions of famous Gautschi-type methods from special oscillatory problem to general oscillatory problem. A rigorous error analysis is given and the local truncation errors of the solution and the derivative are presented. Numerical experiments show that our new methods are more efficient in comparison with the well-known high quality methods proposed in the scientific literature.






Similar content being viewed by others
References
Aubry, A., Chartier, P.: Pseudo-symplectic Runge–Kutta methods. BIT 38, 439–461 (1998)
Avdyushev, V.A.: Special perturbation theory methods in celestial mechanics, I. Principles for the construction and substantiation of the application. Russ. Phys. J. 49, 1344–1353 (2006)
Franco, J.M.: Runge–Kutta–Nyström methods adapted to the numerical integration of perturbed oscillators. Comput. Phys. Commun. 147, 770–787 (2002)
García-Alonso, F., Reyes, J., Ferrádiz, J., Vigo-Aguiar, J.: Accurate numerical integration of perturbed oscillatory systems in two frequencies. ACM Trans. Math. Softw. 36, 21–34 (2009)
López, D.J., Martín, P.: A numerical method for the integration of perturbed linear problems. Appl. Math. Comput. 96, 65–73 (1998)
Ramos, H., Vigo-Aguiar, J.: Variable-stepsize Chebyshev-type methods for the integration of secondorder I.V.P.s. J. Comput. Appl. Math. 204, 102–113 (2007)
Jordan, D.W., Smith, P.: Nonlinear Ordinary Differential Equations. An introduction for scientists and engineers, 4th edn. Oxford University Press, Oxford (2007)
Butcher, J.C.: The Numerical Analysis of Ordinary Differential Equations, 2nd edn. Wiley, New York (2008)
Hairer, E., Nørsett, S.P., Wanner, G.: Solving Ordinary Differential Equations I: Nonstiff Problems, 2nd edn. Springer, Berlin (2002)
Franco, J.M.: New methods for oscillatory systems based on ARKN methods. Appl. Numer. Math. 56, 1040–1053 (2006)
Wu, X., You, X., Xia, J.: Order conditions for ARKN methods solving oscillatory systems. Comput. Phys. Commun. 180, 2250–2257 (2009)
Hairer, E., Lubich, C., Wanner, G.: Geometric Numerical Integration, Structure-Preserving Algorithms for Ordinary Differential Equations, 2nd edn. Springer, Berlin (2006)
Yang, H., Wu, X.: Trigonometrically-fitted ARKN methods for perturbed oscillators. Appl. Numer. Math. 58, 1375–1395 (2008)
Vigo-Aguiar, J., Ramos, H.: Dissipative Chebyshev exponential-fitted methods for numerical solution of second-order differential equations. J. Comput. Appl. Math. 158, 187–211 (2003)
Jator, S.N., Swindell, S., French, R.: Trigonometrically fitted block Numerov type method for \(y^{\prime \prime } = f (x, y, y^{\prime } )\). Numer. Algorithms 62, 13–26 (2013)
Brugnano, L., Trigiante, D.: Solving Differential Problems by Multistep Initial and Boundary Value Methods. Gordon and Breach Science Publishers, Amsterdam (1998)
Jator, S.N.: A sixth order linear multistep method for the direct solution of \(y^{\prime \prime } = f (x, y, y^{\prime })\). Int. J. Pure Appl. Math. 40, 457–472 (2007)
Jator, S.N.: Solving second order initial value problems by a hybrid multistep method without predictors. Appl. Math. Comput. 217, 4036–4046 (2010)
Jator, S.N.: On a class of hybrid methods for \(y^{\prime \prime }= f (x, y, y^{\prime })\). Int. J. Pure Appl. Math. 59(4), 381–395 (2010)
Ramos, H., Mehta, S., Vigo-Aguiar, J.: A unified approach for the development of \(k\)-step block Falkner-type methods for solving general second-order initial-value problems in ODEs. J. Comput. Appl. Math. 318, 550–564 (2017)
Ramos, H., Singhc, G.: A note on variable step-size formulation of a Simpson’s-type second derivative block method for solving stiff systems. Appl. Math. Lett. 64, 101–107 (2017)
Wu, X., You, X., Li, J.: Note on derivation of order conditions for ARKN methods for perturbed oscillators. Comput. Phys. Commun. 180, 1545–1549 (2009)
Wu, X., Wang, B.: Multidimensional adapted Runge–Kutta–Nyström methods for oscillatory systems. Comput. Phys. Commun. 181, 1955–1962 (2010)
Yang, H., Wu, X., You, X., Fang, Y.: Extended RKN-type methods for numerical integration of perturbed oscillators. Comput. Phys. Commun. 180, 1777–1794 (2009)
Wu, X., You, X., Shi, W., Wang, B.: ERKN integrators for systems of oscillatory second-order differential equations. Comput. Phys. Commun. 181, 1873–1887 (2010)
You, X., Zhao, J., Yang, H., Fang, Y., Wu, X.: Order conditions for RKN methods solving general second-order oscillatory systems. Numer. Algorithms 66, 147–176 (2014)
Van de Vyver, H.: An adapted explicit hybrid method of Numerov type for the numerical integration of perturbed oscillators. Appl. Math. Comput. 186, 1385–1394 (2007)
Franco, J.M., Palacian, J.F.: High order adaptive methods of Nyström–Cowell type. J. Comput. Appl. Math. 81, 115–134 (1997)
Chen, Z., Qiu, Z., Li, J., You, X.: Two-derivative Runge-Kutta-Nyström methods for second-order ordinary differential equations. Numer. Algorithms (2015). doi:10.1007/s11075-015-9979-4
Weinberger, H.F.: A First Course in Partial Differential Equations with Complex Variables and Transform Methods. Dover Publications Inc., New York (1965)
Higham, N.J., Al-Mohy, A.H.: Computing matrix functions. Acta Numer. 19, 159–208 (2010)
Acknowledgements
The authors are sincerely thankful to the anonymous referees for their constructive comments and valuable suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
The research was supported in part by the Natural Science Foundation of China under Grant No.: 11401164, by Hebei Natural Science Foundation of China under Grant No.: A2014205136, by the Natural Science Foundation of China under Grant No.: 11201113 and by the Specialized Research Foundation for the Doctoral Program of Higher Education under Grant No.: 20121303120001, by the Natural Science Foundation of China under Grant No.: 11401163, by Hebei Natural Science Foundation of China under Grant No.: A2014205133.
Appendices
Appendix 1: The proof of (15)
In fact
results in
Replacing l with \(i-1\), we obtain the first formula of (15). The second one can be obtained similarly.
Appendix 2: Specific examples of particular methods
ASNSMS3K4P: The method is designed for \(y^{\prime \prime }+My=f(t,y,y^{\prime })\) and can be expressed as
where \( f_{n+1}=f(t_{n+1},\bar{y}_{n+1},\bar{y^{\prime }}_{n+1})\) and \( f_{j}=f(t_{j},y_{j},y_{j}^{\prime })\) for \(j=n,n-1,n-2\). \(\nabla ^jf_n\) denotes the jth backward difference, defined recursively by
and
ASNSMS4K5P: The method is designed for \(y^{\prime \prime }+My=f(t,y,y^{\prime })\) and can be expressed as
where \( f_{n+1}=f(t_{n+1},\bar{y}_{n+1},\bar{y^{\prime }}_{n+1})\) and \( f_{j}=f(t_{j},y_{j},y_{j}^{\prime })\) for \(j=n,n-1,n-2,n-3\). \(\nabla ^jf_n\) denotes the jth backward difference, defined recursively by
and
ADAMS3K4P:The method is designed for \(y^{\prime }=f(t,y)\) and can be expressed as
where \( f_{n+1}=f(t_{n+1},\bar{y}_{n+1})\) and \( f_{j}=f(t_{j},y_{j})\) for \(j=n,n-1,n-2\).
ADAMS4K5P:The method is designed for \(y^{\prime }=f(t,y)\) and can be expressed as
where \( f_{n+1}=f(t_{n+1},\bar{y}_{n+1})\) and \( f_{j}=f(t_{j},y_{j})\) for \(j=n,n-1,n-2,n-3\).
RKN4S4P: The method is designed for \(y^{\prime \prime }=f(t,y,y^{\prime })\) and can be expressed as
where
RK4S4P:The method is designed for \(y^{\prime }=f(t,y)\) and can be expressed as
where
ARKN4S4P: The method is designed for \(y^{\prime \prime }+My=f(t,y,y^{\prime })\) and can be expressed as
where
ARKN6S5P: The method is designed for \(y^{\prime \prime }+My=f(t,y,y^{\prime })\) and can be expressed as
where
and
Rights and permissions
About this article
Cite this article
Li, J., Wang, X. & Lu, M. A class of linear multi-step method adapted to general oscillatory second-order initial value problems. J. Appl. Math. Comput. 56, 561–591 (2018). https://doi.org/10.1007/s12190-017-1087-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-017-1087-2