AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (224.4 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

A new algorithm based on compressed Legendre polynomials for solving boundary value problems

Hui ZhuLiangcai Mei( )Yingzhen Lin
Zhuhai Campus, Beijing Institute of Technology, Zhuhai 519088, China
Show Author Information

Abstract

In this paper, we discuss a novel numerical algorithm for solving boundary value problems. We introduce an orthonormal basis generated from compressed Legendre polynomials. This basis can avoid Runge phenomenon caused by high-order polynomial approximation. Based on the new basis, a numerical algorithm of two-point boundary value problems is established. The convergence and stability of the method are proved. The whole analysis is also applicable to higher order equations or equations with more complex boundary conditions. Four numerical examples are tested to illustrate the accuracy and efficiency of the algorithm. The results show that our algorithm have higher accuracy for solving linear and nonlinear problems.

CLC number: 65L05, 65L10

References

【1】
【1】
 
 
AIMS Mathematics
Pages 3277-3289

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Zhu H, Mei L, Lin Y. A new algorithm based on compressed Legendre polynomials for solving boundary value problems. AIMS Mathematics, 2022, 7(3): 3277-3289. https://doi.org/10.3934/math.2022182

113

Views

2

Downloads

2

Crossref

2

Web of Science

2

Scopus

Received: 21 September 2021
Accepted: 18 November 2021
Published: 15 March 2021
©2022 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)