pith. sign in

arxiv: 1703.09096 · v1 · pith:JDXLZBBPnew · submitted 2017-03-27 · 🧮 math.NA · cs.NA

Jacobi-Davidson method on low-rank matrix manifolds

classification 🧮 math.NA cs.NA
keywords methodjacobi-davidsonlow-rankmatrixadvantagesarisescasecomplexity
0
0 comments X
read the original abstract

In this work we generalize the Jacobi-Davidson method to the case when eigenvector can be reshaped into a low-rank matrix. In this setting the proposed method inherits advantages of the original Jacobi-Davidson method, has lower complexity and requires less storage. We also introduce low-rank version of the Rayleigh quotient iteration which naturally arises in the Jacobi-Davidson method.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.