Abstract
This paper introduces the blossomed and grafted blossomed trees (BT and GBT, respectively) which are two new types of rooted trees. The trees consist of a finite number of solid and hollow vertices that represent buds and blossoms, respectively. Then the relation between them and derivative operators in a differential equation is analyzed. These concepts not only demonstrate how natural phenomena can be inspiring in mathematics, but also we can devise a method based on the BT and GBT for finding s-stage Runge–Kutta coefficients, with the appropriate degree of accuracy. However, solving higher-order differential equations in the general form entails dealing with numerous complex expressions, while the new algorithm based on the BT and GBT provides simplicity and practicability. One of the advantages of using BT and GBT is easier ordering and standardizing the relations derived from derivative operators in differential equations and synchronizing them with numerical methods such as the Runge–Kutta algorithms. In brief, this approach helps avoiding mistakes in spite of a high volume of processing operations. Moreover, the kth-order derivative for monotonically labeled GBT having n buds and blossoms using these types of trees with \(k+n\) buds and blossoms is studied. This strategy is also adopted for GBT without labeling.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abell ML, Braselton JP (2018) Introductory differential equations. Academic Press, Cambridge
Ableidinger M, Buckwar E (2017) Weak stochastic Runge–Kutta Munthe–Kaas methods for finite spin ensembles. Appl Numer Math 118:50–63
Asai Y, Kloeden PE (2019) Numerical schemes for ordinary delay differential equations with random noise. Appl Math Comput 347:306–318
Bertaccini D, Donatelli M, Durastante F, Capizzano SS (2017) Weak stochastic Runge–Kutta Munthe–Kaas methods for finite spin ensembles. Linear Algebra Appl 533:507–535
Bremer J (2018) On the numerical solution of second order ordinary differential equations in the high-frequency regime. Appl Comput Harmon A 44(2):312–349
Brouder Ch (2004) Trees, renormalization and differential equations. BIT 44:425–438
Butcher JC (2008) Numerical method for ordinary differential equations, 2nd edn. Wiley, New York
Certaine J (1960) The solution of ordinary differential equations with large time constants. Wiley, New York, pp 128–132
Duana S, Tian H (2016) Exponential fitting Runge–Kutta methods for the delayed recruitment/renewal equation. J Comput Appl Math 303:31–39
Eremin AS (2019) Functional continuous Runge–Kutta methods with reuse. Appl Numer Math 146:165–181
Famelis ITh, Tsitouras Ch (2016) On modifications of Runge–Kutta–Nyström methods for solving \(y^{(4)}=f(x, y)\). Appl Math Comput 273:726–734
Famelis ITh, Tsitouras Ch (2017) Symbolic derivation of Runge–Kutta–Nyström type order conditions and methods for solving \(y^{\prime \prime \prime }=f(x, y)\). Appl Math Comput 297:50–60
Galanin MP, Konev SA (2018) Development and application of an exponential method for integrating stiff systems based on the classical Runge–Kutta method. Differ Equ 54(7):889–899
Greenspan D (2006) Numerical solution of ordinary differential equations: for classical, relativistic and nano systems. Wiley, New York
Hairer E, Wanner G (2004) Solving ordinary differential equations II: stiff and differential algebraic problems, 2nd edn. Springer, Berlin
Hassani H, Mehrabi S, Naraghirad E, Naghmachi M, Yüzbaşi S (2020) An optimization method based on the generalized polynomials for a model of HIV infection of CD4\(^{+}\) T cells. Iran J Sci Technol Trans Sci 44:407–416
Hosseini MM (2006) A modified pseudospectral method for numerical solution of ordinary differential equations systems. Appl Math Comput 176:470–475
Hussain KA, Ismail F, Rabiei F, Senu N (2017) Fourth-order improved Runge–Kutta method for directly solving special third-order ordinary differential equations. Iran J Sci Technol Trans Sci 41:429–437
Hussain KA, Ismail F, Senu N, Rabiei F (2017) Fourth-order improved Runge–Kutta method for directly solving special third-order ordinary differential equations. Iran J Sci Technol Trans Sci 41(2):429–437
Iserles A, Ramaswami G, Sofroniou M (1998) Runge–Kutta methods for quadratic ordinary differential equations. BIT 38:315–346
John Cooper G, Sayfy A (1983) Additive Runge–Kutta methods for stiff ordinary differential equations. Math Comp 40:207–218
Koikari S (2005) Rooted tree analysis of Runge–Kutta methods with exact treatment of linear terms. J Comput Appl Math 177(2):427–453
Komori Y (2007) Multi-colored rooted tree analysis of the weak order conditions of a stochastic Runge-Kutta family. Appl Numer Math 57(2):147–165
Komori Y, Mitsui T, Sugiura H (1997) Rooted tree analysis of the order conditions of row-type scheme for stochastic differential equations. BIT 37(1):43–66
Kutta W (1901) Beitrag zur näherungsweisen Integration totaler Differentialgleichungen, Münich
Lambert JD (1991) Numerical methods for ordinary differential systems: the initial value problem. Wiley, New York
Lyakhov DA, Gerdt VP, Michels DL (2020) On the algorithmic linearizability of nonlinear ordinary differential equations. J Symb Comput 98:3–22
Merson RH (1957) An operational method for the study of integration processes. In: Proceedings of the symposium, data processing, weapons research establishment, salisbury, Australia
Mirzaee F, Samadyar N (2019) On the numerical method for solving a system of nonlinear fractional ordinary differential equations arising in HIV infection of CD4\(^{+}\) T cells. Iran J Sci Technol Trans Sci 43:1127–1138
Podisuka M, Udomchalermpat S (2013) Numerical solutions of second order iterative ordinary differential equations. Procedia-Soc Behav Sci 88:196–204
Runge C (1895) Über die numerische Auflösung von Differentialgleichungen. Math Ann 46(2):167–178
Scholz S (1989) Implicit Runge–Kutta methods with a global error estimation for stiff differential equations. ZAMM-Z Angew Math Me 69(8):253–257
Takayasua A, Matsueb K, Sasakic T, Tanakad K, Mizuguchid M (2017) Numerical validation of blow-up solutions of ordinary differential equations. J Comput Appl Math 314:10–29
Tenreiro Machado JA, Galhano AMSF (1995) Evaluation of manipulator direct dynamics using customized Runge–Kutta methods. Syst Anal Model Simul 17(3):229–239
Tsitourasa Ch, Famelis ITh, Simos TE (2011) On modified Runge–Kutta trees and methods. Comput Math Appl 62:2101–2111
Vaquero JM, Kleefeld B (2016) Extrapolated stabilized explicit Runge–Kutta methods. J Comput Phys 326:141–155
Yankovskii AP (2016) Study of the spectral stability of generalized Runge–Kutta methods in the initial problem for the transfer equation. J Math Sci 215(2):196–217
Zeiner M, Schwarz M, Schmid U (2019) On linear-time data dissemination in dynamic rooted trees. Discrete Appl Math 225:307–319
Zhang L, Ji L (2019) Stochastic multi-symplectic Runge–Kutta methods for stochastic Hamiltonian PDEs. Appl Numer Math 135:396–406
Zhang GL, Song MH (2019) Impulsive continuous Runge–Kutta methods for impulsive delay differential equations. Appl Math Comput 341:160–173
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Rights and permissions
About this article
Cite this article
Hassani, H., Machado, J.A.T., Dahaghin, M.S. et al. Relation Between New Rooted Trees and Derivatives of Differential Equations. Iran J Sci Technol Trans Sci 45, 1025–1036 (2021). https://doi.org/10.1007/s40995-021-01077-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40995-021-01077-5
Keywords
- Blossomed trees
- Grafted blossomed trees
- Runge–Kutta methods
- Monotonically labeled trees
- System of differential equations