Group Homotopy algorithm with a parameterized Newton iteration for symmetric eigen problems

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we develop a general Homotopy method called the Group Homotopy method to solve the symmetric eigenproblem. The Group Homotopy method overcomes notable drawbacks of the existing Homotopy method, namely, (i) the possibility of breakdown or having a slow rate of convergence in the presence of clustering of the eigenvalues and (ii) the absence of any definite criterion to choose a step size that guarantees the convergence of the method. On the other hand, the Group Homotopy method maintains attractive features of the ordinary Homotopy method such as the natural parallelism and the structure preserving properties. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Baik, R., Datta, K., & Hong, Y. (2005). Group Homotopy algorithm with a parameterized Newton iteration for symmetric eigen problems. In Lecture Notes in Computer Science (Vol. 3516, pp. 899–907). Springer Verlag. https://doi.org/10.1007/11428862_134

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free