检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中山大学,广州510275
出 处:《应用力学学报》2010年第4期687-692,共6页Chinese Journal of Applied Mechanics
基 金:国家自然科学基金(10672194);中俄NSFC-RFBR协议项目(10811120012)
摘 要:将求解域均匀离散,由状态参量在相邻结点间的精细积分关系式,确定一组代数方程;并将其写成矩阵形式,代入边界条件后,代数方程组的系数矩阵可化为块三对角形式。针对这一特性,给出了一种高效的递推消元算法。由于没有离散误差,该方法具有较高的精度,不仅适用于任意边界的常规两点边值问题,还适用于奇异摄动边值问题。数值算例充分证明了本文方法的精度和效率。An efficient precise method for two-point boundary value problems is presented.Firstly,after dividing the interval evenly,a set of algebraic equations,which are written in the form of matrix,are determined by the precise integration relationships of the state parameters between the adjacent nodes.Then turn the coefficient matrices of the algebraic equations into block tridiagonal matrix form by substituting the boundary conditions into the equations.Considering the particular character of the equations,an efficient recursive method is given.The present method is of very high precision with no discrete error.The method can be used not only for conventional two-point boundary value problems of any form but also for singular perturbation problems.Numerical examples show the efficiency and the precision of the present method sufficiently.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30