Abstract

A family of symmetric generalized Jacobi polynomials (GJPs) is introduced and used for solving high even-order linear elliptic differential equations in one variable by the Galerkin method. Some efficient and accurate algorithms are developed and implemented for solving such equations. The use of GJPs leads to a simplified analysis, more precise error estimates and very efficient numerical algorithms. The methods lead to linear systems with specially structured matrices that can be efficiently inverted. Two numerical examples are presented aiming to demonstrate the accuracy and the efficiency of the proposed algorithms.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.