检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机工程与应用》2012年第16期33-36,84,共5页Computer Engineering and Applications
摘 要:将求解高阶矩阵的最大特征值及其对应的特征向量问题转化为高阶非线性方程组的求解问题。在此基础上,提出了求解矩阵最大特征值及其对应特征向量的拟Newton法,给出求解矩阵最大特征值及其单位化向量重新整理后的Broyden方法公式、BFS方法公式、DFP方法公式及其对应的Broyden算法,BFS算法,DFP算法。以层次分析法中高阶判断矩阵为例验证了该方法的可行性,说明了该方法相对收敛速度快的优势。This paper is aimed to solve the maximum eigenvalue of high order matrix and its corresponding eigenvector through the method which transfers the equations into a higher order nonlinear equations. At the same time,this paper puts forward the Quasi-Newton method which can solve the maximum eigenvalue and its corresponding eigenvector, the rearranging formula and algorithm of Broyden methods are given to solve the maximum eigenvalue and the corresponding eigenvector; the rearranging formula and algorithm of BFS methods; the rearranging formula and algorithm of DFP methods. The judgment matrix of analytic hierarchy process is used as an example. The results show that the idea is feasible and the convergence speed is higher.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49