期刊
COMPUTERS & MATHEMATICS WITH APPLICATIONS
卷 76, 期 6, 页码 1458-1475出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.camwa.2018.06.038
关键词
Partially bisymmetric solution; Conjugate gradient normal equations residual minimizing (CGNR) method; Submatrix constraint; Quadratic inverse eigenvalue problem
The inverse eigenvalue problems play an important role in broad application areas such as system identification, Hopfield neural networks, control design, mass-spring system and molecular spectroscopy. This paper proposes an algorithm that yields a new method to efficiently and accurately compute the partially bisymmetric solutions (M, C, K) under prescribed submatrix constraints of the quadratic inverse eigenvalue problem MX Lambda(2) + CX Lambda + KX = 0. The algorithm is developed based on the conjugate gradient normal equations residual minimizing (CGNR) method. We discuss the convergence properties of the algorithm. Finally, the performance of the algorithm is tested on two numerical examples and compared to the previous algorithm. (C) 2018 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据