Exponentially convergent symbolic algorithm of the functional-discrete method for the fourth order Sturm-Liouville problems with polynomial coefficients
Volodymyr Makarov, Nataliia Romaniuk

TL;DR
This paper introduces a symbolic, exponentially convergent algorithm for solving fourth order Sturm-Liouville problems with polynomial coefficients, improving accuracy and efficiency over previous methods by avoiding boundary value problem solutions and integrals.
Contribution
The paper develops a new symbolic implementation of the functional-discrete method that guarantees exponential convergence and simplifies computations for fourth order Sturm-Liouville problems with polynomial coefficients.
Findings
The algorithm achieves exponential convergence rates.
It provides exact analytical expressions for eigenpair corrections.
Numerical examples confirm improved accuracy and efficiency.
Abstract
A new symbolic algorithmic implementation of the functional-discrete (FD-) method is developed and justified for the solution of fourth order Sturm--Liouville problem on a finite interval in the Hilbert space. The eigenvalue problem for the fourth order ordinary differential equation with polynomial coefficients is investigated. The sufficient conditions of an exponential convergence rate of the proposed approach are received. The obtained estimates of the absolute errors of FD-method significantly improve the accuracy of the estimates obtained earlier by I.P~Gavrilyuk, V.L.~Makarov and A.M.~Popov in 2010. Our algorithm is symbolic and operates with the decomposition coefficients of the eigenfunction corrections in some basis. The number of summands in these decompositions depends on the degree of the potential coefficients and the correction number. Our method uses only the algebraic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
