.png){kind=icon}
返回
A time integration algorithm for linear transient analysis based on the reproducing kernel method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cma.2009.06.011.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper a new algorithm based on the reproducing kernel method is presented for linear transient analysis using very large time steps. In the conventional time integration methods, the required accuracy is always achieved by either decreasing the size of time steps or increasing the order of approximations. The proposed method, however, does not require a restriction on the size of the time step. The required approximating functions for integration of governing equations are determined using the concept of reproduction of the solution within each time step. A recurrence relationship is obtained through solving the governing equation by the point collocation based reproducing kernel method within the time step. In collocation points, the values of external excitation can be obtained either through the approximation between the values at the beginning and the end of each time step or assigning the exact values of the external force. Hence, one advantage of this new method is the independency of the sampling rates of external excitation from the size of the time step. The proposed method is applied for solving first and second order differential equations, and advantages of the method are illustrated through a number of numerical examples. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Step by step integration
Reproducing kernel method
Point collocation
Transient analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.3W
被引数:
5.6W
机构
引用论文
.png){kind=icon}
查看更多内容