MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

There exist many iterative algorithms for computing eigenvalues of large sparse matrices, e.g. Power, Lanczos, and Arnoldi iteration. Take the Lanczos algorithm for instance. It assumes that the matrix is Hermitian, in the standard inner product space. Since it only requires matrix-vector multiplies and inner products as basic operations, is it possible to apply the algorithm to a non-Hermitian matrix which is self-adjoint under a non-standard inner product and still expect the algorithm to "work" in some sense? I'm imagining this in the case of discretizing self-adjoint operators with respect to a non-standard bilinear form (not necessarily positive definite).

share|cite|improve this question
I suspect that performing Lanczos with a different inner product would be equivalent (in some way) to preconditioned Lanczos. – Paul Tupper Jul 29 '11 at 17:41

Using inner product $(x,My)$ in Lanczos is equivalent to using $M^{-1}$ preconditioner in its preconditioned version. As far as I know, preconditioned version of Lanczos is used for generalized eigen-problems: $A x = \lambda M x$

Preconditioned Lanczos operates with two black-boxes: $Ax$ multiplier and $M^{-1}x$ multiplier.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.