MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

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

Any reference on how to solve the problem $Ax + c = \lambda Bx$ , where $A$, $B$ are full rank matrices, $c$ and $x$ are vectors and $\lambda$ is an unknown constant. I want to solve for both $x$ and $\lambda$. Without the vector c, this is a Generalized Eigen problem and is easy to solve.

I actually don't need the value of $\lambda$ I care only about $x$. I just need a citation and I can follow it up.

share|cite|improve this question
up vote 0 down vote accepted

I think what is missing from the statement of the problem is a normalization condition on x, such as $\|x\|=1$. Problems of this kind are known as inhomogeneous eigenvalue problems, and there is some literature about them. See e.g. R.M.M. Mattheij and G. Soderlind, Linear Algebra and its Applications 88 (1987). p. 507.

share|cite|improve this answer
Thank you. This is precisely what I am looking for. Do you know if matlab or R have any implementations of this ? – user12463 Jan 24 '11 at 22:22
I much doubt that this is implemented in any "standard" packages. – Michael Renardy Jan 25 '11 at 0:14

Since affine transformations (your $Ax + c$) are linear transformations in one dimension higher, this is easy to reduce to the Generalized eigenproblem you know how to solve...

share|cite|improve this answer

Your equation is $(\lambda B-A)x=c$. Since $B$ has full rank, this has a solution for all but finitely many $\lambda$. You can't solve for $x$ and $\lambda$ as there's a solution $x(\lambda)$ for almost all $\lambda$.

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.