engleski

Efficient Eigenvalue Computation by Block Modification of the Indefinite One-Sided Jacobi Algorithm

Besides accuracy, a modern eigenvalue algorithm should have comparable efficiency with the other algorithms for the same purpose. We will show how to improve performance of the one-sided indefinite Jacobi algorithm. It can be ``blocked'' in a similar manner as the ordinary one, but instead of the ordinary CS decomposition we will need an indefinite version of the CS decomposition.

eigenvalue computation; indefinite Jacobi algorithm; block algorithm

nije evidentirano