Calculation Schemes for Solving Sturm- Liouville Problem by Finite-Element Method with Interpolating Hermite Polynomials

Cover Page

Cite item

Abstract

Calculation schemes for solving Sturm-Liouville problem with first-, second-and third-type boundary conditions by finite-element method holding a continuity of derivatives of a required solution in its approximated solution are constructed. Recurrence relations for the calculation in analytical form of the interpolating Hermite polynomials with nodes of arbitrary multiplicity are derived. Using the interpolating Hermite polynomials, the basis piecewise-polynomial functions on finite-element grid with nonuniform step, approximating desired solution of the original problem are constructed and used for reduction to a generalized algebraic eigenvalue problem with banded stiffness and mass matrices. The stiffness and mass matrices are formed by sums of integrals containing the given coefficient and potential functions of the original self-adjoint second-order differential equation and the calculated interpolating Hermite polynomials and their derivatives on the finite element grid. The integrals are calculated using Gauss quadratures and in special cases, including the piecewise continuous polynomial coefficient and potential functions in analytical form. The efficiency and rate of convergence of the proposed calculation schemes and elaborated algorithms and programs implemented in Maple and Fortran is proved by benchmark calculations of exactly solvable Sturm-Liouville problems with continuous and piecewise continuous potential functions.

About the authors

A A Gusev

Joint Institute for Nuclear Research

Email: gooseff@jinr.ru
Laboratory of Information Technologies

Luong Le Hai

Belgorod State National Research University

Email: luonglehai_tcl@yahoo.com.vn

References


Copyright (c) 2014 Гусев А.А., Хай Л.Л.

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies