Stack Exchange Network

Stack Exchange network consists of 174 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [eigenvalues]

Eigenvalues are a special set of scalars associated with a linear system of equations (i.e., a matrix equation) that are sometimes also known as characteristic roots, characteristic values (Hoffman and Kunze 1971), proper values, or latent roots (Marcus and Minc 1988, p. 144).

1
vote
1answer
491 views

LAPACK: ZHEEV and DSYEV give different eigenvalues for real symmetric matrix

exchangers, I have run into a bit of a puzzling problem. To solve an complex eigenvalue-problem, I make use of the LAPACK library function ZHEEV. To test the implementation I used a real symmetric ...
1
vote
0answers
132 views

Spectrum of the Laplace operator

I am studying the discretization of Poisson's equation in $1D$. In Matlab I created different discretization matrices (Laplace operator) according to different sizes of the mesh: ...
4
votes
1answer
205 views

SLEPc eigensolvers take long time to converge for large sparse symmetric matrices

I am leveraging the SLEPc library for solving the first $k$ (where $k = 3$ or $4$) eigenvalues and their corresponding vectors for a matrix of size 200,000. The matrix is sparse and symmetric. I ...
1
vote
0answers
101 views

Computing only the $k$ biggest eigenvalues and eigenvectors with Scalapack

Given that there are eigensolvers in Scalapack that use a divide and conquer method, is there any way we can use Scalapack functions to only compute the first $k$ dominant eigenvalues and ...
1
vote
1answer
84 views

Eigenvalue problem constrained with a penalty method

I am trying to constrain an eigenvalue problem. I am aware of the method utilizing the nullspace of the constraint vectors but I was wondering if it would be to use a penalty method for the same ...
1
vote
0answers
148 views

All eigenpairs of large sparse symmetric matrix

In advance I am sorry for my noobish question. I am a physics PHD student and basically I use python for my math/physics problems. But now I have a problem which requires more computing capacity and ...
4
votes
2answers
267 views

Using a subspace iteration method to obtain eigenvalues. Getting eigenvectors too but I don't understand why

I'm using an iterative subspace algorithm (dsrrit) to obtain the eigenvalues of an eigenvector equation $$ -\nabla^2 \mathbf{x} = \lambda\mathbf{x} $$ where $\nabla^2$ is the usual Laplacian operator. ...
1
vote
1answer
144 views

Iteratively obtaining m eigenvectors using arpack: If I have a good initial guess, how do I use it?

I am trying out the arpack driver dsdrv1, which is used to iteratively obtain the first m eigenvectors from the eigenvalue problem. $$ \hat{A}\mathbf{x} = \lambda\mathbf{x} $$ As it is an iterative ...
2
votes
0answers
110 views

Generalized eigenvalue with null space

Define $S\in\mathbb{R}^{n\times n}$ as $$S:=H+Q^\top V^{-1} Q.$$ $H,V$ are positive semidefinite. Here, $H$, $Q$, and $V$ are large, dense matrices but they are structured: I can write code for ...
1
vote
1answer
102 views

Finding the lowest $n$ eigenvalues of a band-diagonal Matrix

I have a real sparse matrix of the form $$ \left( \begin{array}{ccc} h_{11} & h_{12} & 0 & h_{14} & & & \\ h_{21} & h_{22} & h_{23} & 0 & h_{25} & & ...
2
votes
0answers
273 views

Numerical solution of Dirac equation (eigenvalue problem)

Suppose we have equation of the form: $$H \Psi = E \Psi $$ where $H$ is Dirac Hamiltonian (also my question can be answered by people who are not familiar with Dirac Hamiltonian but familiar with ...
3
votes
2answers
353 views

PageRank using Inverse Iteration Method by Cleve Moler

I was trying to understand how to use the inverse interation method to compute the page rank as an exercise. In this chapter (page 4) about page rank (by Cleve Moler), the author suggests to use the ...
-1
votes
0answers
64 views

Compute all eigenvalues of a large sparse matrix [duplicate]

I am a physicist and I am trying to calculate the vibrational spectrum of a very large systems. I need whole spectrum of vibrational modes, that leads to a symmetric system. Basically, I need to solve ...
4
votes
1answer
94 views

Compute specific eigenvalues in the complex plane with Feast?

In physical problems, it's quite common that we need to solve for specific eigenvalues in the complex plane, e.g. with a positive real part and negative imaginary part. In this case, we are looking ...
11
votes
2answers
766 views

Compute all eigenvalues of a very big and very sparse adjacency matrix

I have two graphs with nearly n~100000 nodes each. In both graphs, each node is connected to exactly 3 other nodes so the adjacency matrix is symmetric and very sparse. The hard part is I need all ...
1
vote
0answers
59 views

What's the optimal method to solve for the top eigenvectors of a very large, real, symmetric matrix of limited rank?

Consider a real symmetric matrix of dimension N~10^5 and rank m~2000. What is the most efficient algorithm for determining the top m eigenvectors? If the answer isn't obvious, are there existing ...
2
votes
2answers
541 views

Compute all eigenvectors and eigenvalues of small symmetric matrices

My problem is to compute eigenvectors and eigenvalues of a lot of small (n < 30) symetric, positive definite matrices. So far I am using LAPACK's DSYEV. The priority is speed more than accuracy. ...
1
vote
1answer
153 views

FEM or FD eigenvalue equation to get wave number instead of cutoff frequency

To get cutoff frequencies and eigenmode field distributions for a waveguide, one uses following equation: $$1/\epsilon ∇ \times 1/\mu ∇ \times E = \omega^2 E$$ With $ \omega^2 $ as eigenvalues. This ...
4
votes
0answers
120 views

Eigenvalues of a Laplacian operator on an irregular mesh

I have the following setting: An irregularly-shaped domain, expressed as a mesh of points A Laplacian operator, together with boundary conditions I am looking for the eigenvalues of that operator, i....
0
votes
1answer
114 views

Imposing boundary conditions for PDE quadratic eigenvalue problem

I have a quadratic eigenvalue problem of the form: $$(A_2 s^2 + A_1 s + A_0)\hat{v} = 0$$ where $s$ is the eigenvalue. The matrices $A_i$ contain derivatives up to order six, and I have six boundary ...
6
votes
0answers
158 views

Will penalty-augmented stiffness matrix cause numerical issues in eigenvalue analysis?

In the finite element method, we often construct the constraints of the system by adding penalty-function terms ( which often are many many magnitudes, up to $10^6$ order bigger than the largest ...
1
vote
1answer
56 views

Appropriate algorithm for smallest several eigen(values|vectors) of a ~300 DoF system?

I'm no expert on the different types of algorithms to compute eigenvalues and vectors for a real, symmetric matrix (coming from linear mass and stiffness matrices for a frame FEA model). I am looking ...
2
votes
0answers
40 views

Preconditioning matrix with known spectrum

Assume I know all eigenvalues of a matrix $A$ fall into a certain set $\Omega \subset \mathbb{C}$. Is there any way I can exploit this knowledge to design a preconditioner for $A$? Some further ...
3
votes
1answer
495 views

How to improve this double-shift QR algorithm for non-symmetric matrices?

I've implemented a version of the double-shift QR algorithm featured in this report from ETH Zurich (Begins on page 77). The algorithm takes advantage of the Implicit Q theorem by applying an ...
6
votes
2answers
586 views

Numerical Solution to Schrödinger Equation--Multiple Wells

I am trying to solve for the allowed wavefunctions and energies for a 1D quartic potential well. To do this I am using the patching method (https://engineering.dartmouth.edu/microeng/otherweb/...
3
votes
0answers
95 views

Eigenvalue decomposition of the sum: $AA^T$ + diag($u$)

Suppose $A\in\mathbb{R}^{n\times c}$,$u\in\mathbb{R}^n$,$n\gg c$. The time complexity of eigenvalue decomposing directly for matrix $AA^T+\text{diag}(u)$ is $O(n^3)$. And it is easy to avoid $O(n^3)$ ...
7
votes
1answer
275 views

Eigenvalues of $ab^T$

In deriving a Newton scheme, I end up with a Jacobian matrix of the form $J=I+ab^T$ where $a,b$ are vectors. For practical reasons, I want to approximate it by a symmetric positive definite matrix. ...
2
votes
1answer
242 views

finite difference frequency domain Eigenvalue matrix to get eigenmodes

I am using the FDFD method to calculate eigenmodes for an empty wave guide. It's a 1x1meter structure with a PEC boundary. (Here I have 6x6 points to make it simple). Sounds simple, but I can't get it ...
4
votes
3answers
165 views

Eigenvectors of Black-box matrix

$\DeclareMathOperator{\diag}{diag}$ Consider the generalized eigenproblem $A\mathbf{x}=\lambda B\mathbf{x}$. When solving PDEs numerically (specifically, I am interested on finding the Dirichlet ...
3
votes
2answers
477 views

Zero Eigenvalues in Lanczos Algorithm

I need to find the smallest few eigenvalues of a Hamiltonian (exact diagonalization) I use Python, and SciPy's built-in sparse eigenvalue solver. I notice, however, that for my small system (only a ...
6
votes
1answer
155 views

Is there an eigenvalue estimation method more accurate than Gershgorin's, which uses no multiplication?

Suppose I have a real symmetric matrix. I would like to tell wether it has at least $k$ strictly positive eigenvalues, but using only additions (no multiplications). Is there a method that I could use?...
3
votes
1answer
174 views

Generalized Eigenvalue Problem from linear stability analysis

I also posted this in the physics forum, but maybe here it fits better. I am trying to solve a generalized eigenvalue problem raised by linear stability analysis $$AV=\lambda BV.$$ $A$ and $B$ are ...
0
votes
1answer
75 views

Most efficient way to compute eigenvectors / values of this matrix?

I have a symmetric $ 3 \times 3 $ matrix $A$ and I need to compute the eigenvectors and eigenvalues of this. I know that I can use something like Lapack, but I also know that this can be computed ...
4
votes
2answers
214 views

Determine numerical infinity for Schrodinger equation $−\psi''(x) + x^ 2 \psi(x) = E\psi(x)$

Consider the following Schrodinger equation for the harmonic oscillator with real $x$: $$ −ψ''(x) + x^ 2 ψ(x) = Eψ(x). $$ I solve the last equation using shooting method and implicit Runge-Kutta ...
4
votes
2answers
993 views

Stabilizing a 3x3 real symmetric matrix eigenvalue calculation

I have many 3x3 real symmetric matrices for which I need to determine the eigenvalues. Wikipedia gives a nice non-iterative algorithm for this case, which I have translated into C++: ...
0
votes
1answer
67 views

Construct tridiagonal matrix from eigenvalues

I have a sort of reverse problem, and I'm not sure if there is a simple solution. I have a tridiagonal Hermitian matrix: $$ A = \begin{bmatrix} 0 & a_1 & 0 & 0 & 0 \\ a_1 & 0 &...
4
votes
1answer
1k views

Quality of eigenvalue approximation in Lanczos method

I try to familiarize myself with iterative eigenvalue solvers such as Lanczos. So I tried rewrite it to python directly according to wiki. But it doesn't seem to work. The problem: it approximates ...
5
votes
1answer
172 views

Eigenvectors of slightly perturbed matrix

Assume I know eigen-pairs $(\epsilon_i,\vec\phi_i)$ for matrix operator $\hat H$ that $ \hat H \vec \phi_i = \epsilon_i \vec \phi_i $ Now I have slightly perturbed $\hat H' = \hat H + \hat R$ were ...
4
votes
1answer
518 views

Power Iteration over Rayleigh Quotient Iteration?

It is a commonly known fact that the Rayleigh Quotient converges cubically (1), while the Power Iteration may converge slowly if the difference between the dominant and second-dominant eigenvalue is ...
8
votes
1answer
776 views

What is the state of the art algorithm for diagonalizing real symmetric matrices?

There are many methods for diagonalizing matrices, probably the most widely used is the combination of Householder transformations and the QR algorithm. Is there any superior method for diagonalizing ...
0
votes
1answer
211 views

Boundary conditions generalized eigenvalue problem

Consider the following eigenvalue problem \begin{equation} \mathcal {L} x(s) = \lambda x(s), \end{equation} where \begin{equation} \mathcal {L} = \alpha \partial^4_s + (s^2-1)\partial^2_s + s \...
1
vote
0answers
202 views

Computing eigenvectors from the QR algorithm

I've seen a few other posts on this topic but none have full answers. I'm trying to implement some eigen-decomposition algorithms. I've managed to get the Explicit QR algorithm and the Implicit (...
3
votes
0answers
134 views

scipy.linalg.sparse.eigsh does not work for generalised eigenvalues

I asked this question over at StackOverflow and someone told me that I'd get a better answer here. So here's my problem: I'm working on a machine learning project which involves doing a Principal ...
11
votes
1answer
598 views

Smallest eigenvalue without inverse

Suppose $A\in\mathbb{R}^{n\times n}$ is a symmetric, positive definite matrix. $A$ is big enough that it's expensive to solve $Ax=b$ directly. Is there an iterative algorithm for finding the ...
4
votes
2answers
325 views

Known issues with eigenvalue numerics?

Are there any known issues (such as precision issues) with $\mathsf{MATLAB}$ eig and charpoly functions for large enough $\{-1,0,+1\}$ matrices? Even if I change $1$ or $2$ entries between matrices ...
3
votes
1answer
413 views

Calculating left eigenvector when I know the right eigenvector

I'm using power iteration to find the dominant right eigenvector of some large-ish matrices ($1000\times 1000$ to $10000\times 10000$ or so, maybe I'll need to go bigger later) with non-negative ...
3
votes
0answers
137 views

Eigenvalue-style optimization with quadratic constraints

Suppose $A\in\mathbb{R}^{n\times n}$ is symmetric and positive definite and that we have several symmetric matrices $B_i\in\mathbb{R}^{n\times n}$ that are low-rank and indefinite. I need an ...
1
vote
1answer
83 views

solving a hyperbolic set of equations - upwind type method

I want to solve a set of hyperbolic equations (not the Euler equations) using an upwind type method. I am interested in using a first order upwind scheme and one that is not based on the method of ...
3
votes
2answers
146 views

what do zero real parts of eigenvalues mean? Any good references?

I am solving a 1D advection problem of the the form $$dQ/dt=[A]Q$$ where {Q} is the vector of unknowns and [A] is the matrix of coefficients of spatial discretisation. I have worked out the ...
4
votes
2answers
266 views

Accuracy of numerical methods in finding eigenvalues

I have a problem with assesing the accuracy of my numerical calculation. I have a 2nd order ODE. It is an eigenvalue problem of the form: $$ y'' + ay' + \lambda^2y = 0, $$ and the boundary condiations ...