Home Super-Exponentially Convergent Parallel Algorithm for a Fractional Eigenvalue Problem of Jacobi-Type
Article
Licensed
Unlicensed Requires Authentication

Super-Exponentially Convergent Parallel Algorithm for a Fractional Eigenvalue Problem of Jacobi-Type

  • Ivan Gavrilyuk ORCID logo EMAIL logo , Volodymyr Makarov ORCID logo and Nataliia Romaniuk ORCID logo
Published/Copyright: June 17, 2017

Abstract

A new algorithm for eigenvalue problems for the fractional Jacobi-type ODE is proposed. The algorithm is based on piecewise approximation of the coefficients of the differential equation with subsequent recursive procedure adapted from some homotopy considerations. As a result, the eigenvalue problem (which is in fact nonlinear) is replaced by a sequence of linear boundary value problems (besides the first one) with a singular linear operator called the exact functional discrete scheme (EFDS). A finite subsequence of m terms, called truncated functional discrete scheme (TFDS), is the basis for our algorithm. The approach provides super-exponential convergence rate as m. The eigenpairs can be computed in parallel for all given indexes. The algorithm is based on some recurrence procedures including the basic arithmetical operations with the coefficients of some expansions only. This is an exact symbolic algorithm (ESA) for m= and a truncated symbolic algorithm (TSA) for a finite m. Numerical examples are presented to support the theory.

Acknowledgements

We want to thank the anonymous referees for their helpful remarks which contributed to improvement of the article.

References

[1] G. Adomian, Solving Frontier Problems of Physics: The Decomposition Method, Kluwer Academic Publishers, Dordrecht, 1994. 10.1007/978-94-015-8289-6Search in Google Scholar

[2] E. L. Allgower, Introduction to Numerical Continuation Methods, Colorado State University, Colorado, 1990. 10.1007/978-3-642-61257-2Search in Google Scholar

[3] P. Antunes and R. Ferreira, An augmented-rbf method for solving fractional Sturm–Liouville eigenvalue problem, SIAM J. Sci. Comput. 37 (2003), no. 1, A515–A535. 10.1137/140954209Search in Google Scholar

[4] M. A. Armstrong, Basic Topology, Springer, New York, 1983. 10.1007/978-1-4757-1793-8Search in Google Scholar

[5] H. Bateman and A. Erdèlyi, Higher Trancendental Functions. Volume 1 and 2, McGraw-Hill, New York, 1953. Search in Google Scholar

[6] S. Chen, J. Shen and L.-L. Wang, Generalized Jacobi functions and their applications to fractional differential equations, Math. Comp. 85 (2016), 1603–1638. 10.1090/mcom3035Search in Google Scholar

[7] I. I. Demkiv, I. P. Gavrilyuk and V. L. Makarov, Super-exponentially convergent parallel algorithm for the eigenvalue problems with fractional derivatives, Comput. Methods Appl. Math. 16 (2016), no. 4, 633–652. 10.1515/cmam-2016-0018Search in Google Scholar

[8] G. M. Fichtenholz, Foundations of Mathematical Analysis, Nauka, Moscow, 1968. Search in Google Scholar

[9] N. Ford and M. Morgado, Fractional boundary value problems: Analysis and numerical methods, Fract. Calc. Appl. Anal. 14 (2011), no. 4, 554–567. 10.2478/s13540-011-0034-4Search in Google Scholar

[10] I. Gavrilyuk, V. Makarov, M. Hermann and M. Kutniv, Exact and Truncated Difference Schemes for Boundary Value ODEs, Birkhäuser, Basel, 2011. 10.1007/978-3-0348-0107-2Search in Google Scholar

[11] I. P. Gavrilyuk, V. Makarov and N. Romaniuk, Super-exponentially convergent parallel algorithm for an abstract eigenvalue problem with applications to ODEs, Nonl. Oscillations 18 (2015), no. 3, 332–356. Search in Google Scholar

[12] I. S. Gradshteyn, I. M. Ryzhik, Y. V. Geronimus and M. Y. Tseytlin, Table of Integrals, Series, and Products, Academic Press, New York, 2014. Search in Google Scholar

[13] A. Gusev, V. Gerdt, M. Kaschiev, V. Rostovtsev, V. Samoylov, T. Tupikova and S. Vinitsky, A symbolic-numerical algorithm for solving the eigenvalue problem for a hydrogen atom in magnetic field, Computer Algebra in Scientific Computing (CASC 2006), Lecture Notes in Comput. Sci. 4194, Springer, Berlin (2006), 205–218. 10.1007/11870814_17Search in Google Scholar

[14] V. L. Makarov, On a functional-difference method of an arbitrary accuracy order for a Sturm–Liouville problem with piecewise smooth coefficients, DAN SSSR 320 (1991), no. 1, 34–39. Search in Google Scholar

[15] V. L. Makarov, The FD-method for first-order linear hyperbolic differential equations with piecewise smooth coefficients, J. Math. Sci. 77 (1995), no. 5, 3399–3405. 10.1007/BF02367984Search in Google Scholar

[16] V. L. Makarov, FD-method – an exponential convergence rate, Comput. Appl. Math. 82 (1997), 69–74. Search in Google Scholar

[17] V. L. Makarov, Exact solutions of a spectral problem for the Schrödinger differential operator with polynomial potential in 2, Dopov. Nac. Akad. Nauk Ukr. 1 (2017), 3–9. 10.15407/dopovidi2017.01.003Search in Google Scholar

[18] A. Malinowska, T. Odzijewicz and D. Torres, Advanced Methods in the Fractional Calculus of Variations, Springer, Berlin, 2015. 10.1007/978-3-319-14756-7Search in Google Scholar

[19] J. Pryce, Numerical Solution of Sturm–Liouville Problems, Oxford University Press, Oxford, 1993. Search in Google Scholar

[20] R. Rach, A bibliography of the theory and applications of the Adomian decomposition method, Kybernetes 41 (2012), no. 7–8, 10.1108/k.2012.06741gaa.007. 10.1108/k.2012.06741gaa.007Search in Google Scholar

[21] E. M. Reingold, J. Nievergelt and N. Deo, Combinatorial Algorithms. Theory and Practice, Prentice-Hall, Englewood Cliffs, 1977. Search in Google Scholar

[22] F. Tricomi and A. Erdèlyi, The asymptotic expansion of a ratio of gamma functions, Pacific J. Math. 1 (1951), no. 1, 133–142. 10.2140/pjm.1951.1.133Search in Google Scholar

[23] N. J. Vilenkin, Combinatorics, Nauka, Moscow, 1969. Search in Google Scholar

Received: 2016-11-3
Revised: 2017-4-1
Accepted: 2017-5-9
Published Online: 2017-6-17
Published in Print: 2018-1-1

© 2018 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 29.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/cmam-2017-0010/html
Scroll to top button