A subspace iteration for eigenvector derivatives

From MaRDI portal





The paper exploits a new direction in the form of an iterative process to simultaneously calculate eigenvector derivatives of many eigenvectors with respect to multi-variables. The method fully uses all the available information from the preceding eigenvalue solution and thus economizes computational efforts. It iterates through two equations derived from the first variation of the two fundamental equations used in a subspace iteration method. It is interesting to notice that, usually, the method does not require good starting trial vectors for improving the overall rate of convergence. An overrelaxed scheme is given as well as an illustrative example. Since the subspace iterations do not require the decomposition of a system-size matrix, the approach seems to be useful for large-scale systems.











This page was built for publication: A subspace iteration for eigenvector derivatives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989494)