.png){kind=icon}
返回
Recurrence triangle for Adomian polynomials
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2010.02.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper a recurrence technique for calculating Adomian polynomials is proposed, the convergence of the series for the Adomian polynomials is discussed, and the dependence of the convergent domain of the solution's decomposition series Sigma(infinity)(n-0)u(n) on the initial component function u(0) is illustrated. By introducing the index vectors of the Adomian polynomials the recurrence relations of the index vectors are discovered and the recurrence triangle is given. The method simplifies the computation of the Adomian polynomials. In order to obtain a solution's decomposition series with larger domain of convergence, we illustrate by examples that the domain of convergence can be changed by choosing a different u0 and a modified iteration. (C) 2010 Elsevier Inc. All rights reserved.
Keyword:
Adomian polynomials
Adomian decomposition method
Nonlinear operator
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
A new modification of the Adomian decomposition method for linear and nonlinear operators线性和非线性算子的Adomian分解方法的新改进
PREAI
分享收藏Prokaryotic transcription regulators: more than just the helix-turn-helix motif.原核转录调控因子：不仅仅是螺旋-转角-螺旋基序。.png)
IF0
PREAI
分享收藏
查看更多内容