检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]新疆工学院,乌鲁木齐830008
出 处:《计算物理》1992年第1期99-105,共7页Chinese Journal of Computational Physics
摘 要:将按单元集成有限元代数方程组换为按结点集成,并利用贮量集中的思想来处理右端项,得到一维最紧凑存贮的有限元方法,使总体矩阵元素紧凑为未知结点数的三倍以下,比矩形网格有限差分法所需存贮单元还要少,程序结构也更简单合理。同时减少了计算量,提高了运算效率,其优越性在解非线性问题时更为明显。In the essay, the finite element algebraic equations by element assembling is replaced by node assembling, and the right term is dealt with by the idea of lumped mass, and the most compactly-stored finite element method is obtained.Thus, the total matrix elements are reduced to less than three times of unknown node, and the stored -units are even less than which the rectangle grid finite-difference method needs. The program structure is more rational and simpler, meanwhile the calculation quantity is reduced and the computational effciency is improded. All these become more obvious in process of solving nonlinear problems.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28