Applying Haar-Sinc Spectral Method for Solving time-fractional Burger Equation

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Pirkhedri Ali

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Mathematics and Computational Sciences Year:2024 | Volume:5 | Issue:1 Page(s): 43-54

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Applying Haar-Sinc Spectral Method for Solving time-fractional Burger Equation

Author(s)

Pirkhedri Ali | Issue Writer Certificate

Keywords

Time-fractional

Burgers’ equation

Haar functions

Sinc functions

Collocation method

L2-error

L ∞ -error

Convergence rate

Abstract

Haar-Sinc spectral method is used for the numerical approximation of time fractional Burgers’equations with variable and constant coefficients. The main idea in this method is using a linear discretization of time and space by combination of Haar and Sinc functions, respectively. While implementing the method, the operational matrices of the fractional integral of the fractional Haar functions are made, and by using them, an algebraic equation is obtained. Then, using the Collocation method, the algebraic equation is converted into a system of equations, and after solving the system with Maple software, the numerical results of the problem is obtained. The accuracy and speed of the proposed algorithm are tested by obtaining L∞, L2 error and the Convergence rate.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans