Eigenvalues of block matrix/Related non-linear eigenvalue problem

Click For Summary
SUMMARY

The discussion focuses on determining the eigenvalues of a block matrix M defined as M = \begin{pmatrix} A & B \\ I & 0 \end{pmatrix}, where A = I + 3\alpha J and B = -\alpha J. The problem arises from the discretization of a PDE with a matrix size potentially reaching 5000. The author seeks an efficient numerical method to solve the non-linear eigenvalue problem without resorting to a full 2n by 2n matrix computation. The conclusion indicates that the eigenvalues of M can be derived from those of B, leading to a quadratic equation that simplifies the problem.

PREREQUISITES
  • Understanding of block matrices and their properties
  • Familiarity with eigenvalue problems and eigenvectors
  • Knowledge of numerical methods for solving eigenvalue problems
  • Basic concepts of partial differential equations (PDEs) and their discretization
NEXT STEPS
  • Research numerical methods for solving non-linear eigenvalue problems
  • Learn about the properties of block matrices in linear algebra
  • Explore the relationship between eigenvalues of block matrices and their components
  • Investigate efficient algorithms for large-scale eigenvalue computations
USEFUL FOR

Mathematicians, numerical analysts, and engineers working with eigenvalue problems, particularly in the context of partial differential equations and large matrix computations.

pasmith
Science Advisor
Homework Helper
Messages
3,348
Reaction score
1,891
TL;DR
I need to determine whether the eigenvalues of a large [itex]2n[/itex] by [itex]2n[/itex] block matrix are inside the unit circle, and have reduced the problem to an [itex]n[/itex]-dimensional non-linear eigenvalue problem.
I have a matrix M which in block form is defined as follows: <br /> \begin{pmatrix} A (\equiv I + 3\alpha J) &amp; B (\equiv -\alpha J) \\ I &amp; 0 \end{pmatrix} where J is an n-by-n complex matrix, I is the identity and \alpha \in (0,1] is a parameter. The problem is to determine whether the eigenvalues of M lie in the unit circle.

This comes from the discretization of a PDE, so n is potentially on the order of 5000 and I'm looking for a numerical method. I would prefer not to have to find the eigenvalues of a 2n by 2n matrix if there's a more efficient way to solve an equivalent n-dimensional problem.

By definition \lambda is an eigenvalue of M if and only if there exist (p_1, p_2) \in (\mathbb{C}^{n})^2 \setminus \{(0,0)\} such that <br /> \begin{pmatrix}A &amp; B \\ I &amp; 0 \end{pmatrix} <br /> \begin{pmatrix} p_1 \\ p_2 \end{pmatrix} = \lambda \begin{pmatrix} p_1 \\ p_2 \end{pmatrix}. This leads me to the non-linear eigenvalue problem <br /> \lambda(A - \lambda I)p_2 = -B p_2 with p_1 = \lambda p_2, which in terms of J is
<br /> \lambda(3 \alpha J - (\lambda - 1)I)p_2 = \alpha J p_2.<br /> Is there an efficient algorithm to solve this?

Alternatively, if the eigenvalues of M can be determined directly from those of J then so much the better.
 
Last edited:
Physics news on Phys.org
On further reflection, given the relationship between A and B, we can obtain eigenvalues of M in terms of those of B as follows:

Since A = I - 3B, if p_2 is an eigenvector of B with eigenvalue \mu then p_2 is also an eigenvector of A with eigenvalue 1 - 3\mu, since
Ap_2 = (I - 3B)p_2 = (1 - 3\mu)p_2. Thus <br /> (\lambda(1 - 3\mu) + \mu)p_2 = \lambda^2 p_2 and as p_2 \neq 0 we must have <br /> \lambda^2 - (1 - 3\mu)\lambda - \mu = 0.

Conversely, if p_2 \neq 0 is a solution of the non-linear eigenproblem with eigenvalue \lambda then <br /> \begin{align*}<br /> &amp;\lambda(I - 3B)p_2 + Bp_2 = \lambda^2 p_2 \\<br /> \Leftrightarrow \qquad&amp; B(1 - 3 \lambda)p_2 = (\lambda^2 - \lambda) p_2<br /> \end{align*} Now if \lambda = \frac13 then the left hand side is zero and the right hand side is -\frac29 p_2, which by assumption is not zero. Thus \lambda \neq \frac13 and so <br /> Bp_2 = \frac{\lambda^2 - \lambda}{1 - 3\lambda}p_2 as required.

Problem solved.
 
  • Like
Likes   Reactions: Keith_McClary

Similar threads

  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 33 ·
2
Replies
33
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K