Timeline for Eigenvalue problem for symmetric block tridiagonal matrices?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 17 at 8:07 | comment | added | Sakurai.JJ | If the matrix ${\bf B}$ is symmetric, we can use Theorem 4.1 in the paper: DOI: 10.1080/09720529.2020.1854939. In this case, the eigenvalues of matrix ${\bf M}$ are the same as eigenvalues of the matrix ${\bf A} + 2\cos\left(\frac{j \pi}{N+1}\bf{B}\right) $ where $N$ is the number of matrices $\bf{A}$ in the matrix $\bf{M}$. | |
| Nov 6, 2012 at 17:58 | comment | added | Suvrit | Think about a 2 by 2 block matrix---seems to get its exact eigenvalues, knowing the eigenvalues of A and B does not really help that much (to get bounds, yes, but to get exact ones...) | |
| Oct 9, 2012 at 22:16 | comment | added | Christopher A. Wong | How does this problem differ from the usual symmetric eigenvalue computation? Indeed, you should be able to calculate the eigenvalues faster than $n^3$ time because of the "tridiagonal" structure. | |
| Oct 8, 2012 at 21:47 | history | edited | Mojtaba | CC BY-SA 3.0 |
edited title
|
| Oct 8, 2012 at 20:28 | comment | added | Denis Serre | Presumably, $A$ is symmetric. | |
| Oct 8, 2012 at 20:01 | history | edited | Yemon Choi | CC BY-SA 3.0 |
fixed LaTeX, edited tags
|
| Oct 8, 2012 at 19:58 | history | asked | Mojtaba | CC BY-SA 3.0 |