Welcome to MathOverflow

Question

7

Hi,

I'm looking for a way to get the negative eigenspace of a large (sparse) symmetric matrix. This matrix is basically a discretized version of the operator $-\Delta + V$, $V$ negative, on some domain $[-L,L]$ with Dirichlet BC, so its spectrum consists of a few negative eigenvalues (which I want to find), and a lot of positive ones (whose distribution is roughly known).

The way I currently do it is to use the shift-invert mode of ARPACK (so Lanczos), with a negative shift and 'LM' mode (lowest magnitude). This requires me to choose a good shift: too large a shift might miss negative eigenvalues, and too small a shift leads to slow convergence. The 'LA' mode (lowest algebraic) is just not an option, it's too slow/imprecise.

Is there any better method out there?

flag	asked Nov 17 2011 at 13:26 Antoine Levitt 233●2●5

	LM = largest magnitude, not lowest. Not that that's likely to be your problem...just thought I'd mention it for future readers. – Jeff Aug 24 at 21:30
	Did you ever find a solution? I'm having a similar problem now. – Jeff Aug 24 at 21:32
	Unfortunately, no. I just used a well-chosen shift. – Antoine Levitt Oct 19 at 22:00

Andrew T. Barker · Answer 1 · 2011-11-17 15:04:14Z UTC

1

If you are interested in software for doing this problem quickly, you might consider the SLEPc package which includes various sparse and parallel eigenvalue algorithms. It is quite difficult to get set up but once you do you will be able to experiment with different methods easily.

answered Nov 17 2011 at 15:04

Andrew T. Barker
221●1●5

I'd rather not switch environment. At the moment I'm using python with numpy/scipy. SLEPc does advise in its user manual jacobi-davidson methods, which are apparently better for finding interior eigenvalues. Pysparse provides python bindings for this, I'll try and find out if that works better. – Antoine Levitt Nov 17 2011 at 15:24

Federico Poloni · Answer 2 · 2011-11-17 13:37:14Z UTC

0

Arpack with which = 'SR'?

answered Nov 17 2011 at 13:37

Federico Poloni
4,249●1●12●24

That's basically SA (when the matrix is symmetric). It's extremely slow, presumably because the positive spectrum is so large (largest eigenvalues are proportional to the inverse square of the stepsize of the grid), and it messes up the convergence. – Antoine Levitt Nov 17 2011 at 13:41

Algorithm for the smallest (algebraic) eigenvalues of a symmetric (sparse) matrix

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

2 Answers

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.