Observations on the Computation of Eigenvalue and Eigenvector Jacobians

Algorithms

AndrewJ. Liounis¹  ShaneB. Robinson²  JohnA. Christian³ 

[1] NASA Goddard Space Flight Center, Greenbelt, MD 20771, USA;NASA Johnson Space Center, Houston, TX 77058, USA;Rensselaer Polytechnic Institute, Troy, NY 12180, USA;

关键词: eigenvector;    eigenvalue;    jacobian;   

DOI  :  10.3390/a12120245

来源: DOAJ

【 摘 要 】

Many scientific and engineering problems benefit from analytic expressions for eigenvalue and eigenvector derivatives with respect to the elements of the parent matrix. While there exists extensive literature on the calculation of these derivatives, which take the form of Jacobian matrices, there are a variety of deficiencies that have yet to be addressed—including the need for both left and right eigenvectors, limitations on the matrix structure, and issues with complex eigenvalues and eigenvectors. This work addresses these deficiencies by proposing a new analytic solution for the eigenvalue and eigenvector derivatives. The resulting analytic Jacobian matrices are numerically efficient to compute and are valid for the general complex case. It is further shown that this new general result collapses to previously known relations for the special cases of real symmetric matrices and real diagonal matrices. Finally, the new Jacobian expressions are validated using forward finite differencing and performance is compared with another technique.

【 授权许可】

Unknown