New iterative method based on Laplace decomposition algorithm (Q2375478): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2013/286529 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969672048 / rank
 
Normal rank

Revision as of 22:15, 19 March 2024

scientific article
Language Label Description Also known as
English
New iterative method based on Laplace decomposition algorithm
scientific article

    Statements

    New iterative method based on Laplace decomposition algorithm (English)
    0 references
    0 references
    0 references
    14 June 2013
    0 references
    Summary: We introduce a new form of Laplace decomposition algorithm (LDA). By this form a new iterative method was achieved in which there is no need to calculate Adomian polynomials, which require so much computational time for higher-order approximations. We have implemented this method for the solutions of different types of nonlinear pantograph equations to support the proposed analysis.
    0 references
    0 references
    0 references
    0 references