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).

Filter by
Sorted by
Tagged with
1
vote
1answer
130 views

Parallel Monte Carlo simulation using PETSc

I am trying to do Monte Carlo simulation for a large problem which requires eigensolution of a matrix for each sample. The matrix itself is quite large so much so that I want the eigensolution itself ...
0
votes
2answers
162 views

Computing eigenpairs of singular matrix with ZGEEV?

I've never run into a singular matrix before, so bear with me. I have a complex non-symmetric matrix (about 1000 x 1000) that I know has a couple zero eigenvalues. It isn't guaranteed to be ...
0
votes
1answer
236 views

Diagonalize a circulant-plus-rank-one matrix

Suppose $A=uv^T$ where $u$ and $v$ are non-zero column vectors in $\mathbb{R}^n, n\geq 3$. $\lambda=0$ is an eigenvalue of $A$ since $A$ is not of full rank. $\lambda=v^Tu$ is also an eigenvalue of $A$...
2
votes
0answers
307 views

ARPACK gives different answers from Matlab and NAG

I'm playing with ARPACK. I looked into the examples they provide, zndrv4.f illustrating the usage of the routine znaupd, in the directory of ARPACK/EXAMPLES/COMPLEX/. I also came cross NAG Fortran ...
1
vote
1answer
72 views

LAPACK DGGEVX: BALANC option

I'm using DGGEVX routine from LAPACKE with BALANC option as shown below, but to my surprise changing BALANC option from 'N' to ...
1
vote
0answers
430 views

I am looking for a complex sparse matrix EigenVector solver for GPGPU; preferably CUDA

So far the closest I've found is ViennaCL, which has a Lanczos implementation for Eigenvalues. It is not clear that EigenVectors are produced by this library. Does anyone here know whether ViennaCL ...
4
votes
2answers
3k views

Eigenvectors: MATLAB vs LAPACK DGGEV or DGGEVX

If we call LAPACK DGGEV or DGGEVX routines for two badly-conditioned matrices in a C++ code, will we get the same eigen-values &...
2
votes
0answers
48 views

Eigenvalues and Timestep restriction Follow up

This is a follow-up question to the previous questions I had on eigenvalues. Please let me know if I should edit the previous question itself for asking this. If the eigenvalues of a matrix ...
3
votes
1answer
715 views

Eigenvalues and Timestep restriction

For an equation of the kind $u_t=Au$, time step is usually defined by ensuring that the eigenvalues are within the stability region of the time-stepping scheme employed. If the eigenvalues are on ...
1
vote
0answers
108 views

smallest eigenvalues for linear elasticity

I want to compute a few tens of the smallest eigenvalues of a linear system which is a discretization of a linear elasticity. In the presence of additional constraints like Dirichlet boundary ...
1
vote
0answers
89 views

Eigenvalue analysis of preconditioned partial differential operator

today, I encountered a confused problem by accident, but I have no ideas to deal with it fully. The question can be described as follows: for example, when we need to use FDM/FEM to discrete the ...
5
votes
2answers
866 views

Condition number from incomplete Cholesky factorization

I'm having difficulties patching together from what I read about obtaining the condition number of a real, symmetric, positive definite sparse matrix. In my code, I found that there is incomplete ...
1
vote
0answers
79 views

Time-stepper approach to eigenvalue problem

For a linear system $$ M \dot{u} = Au \qquad \textrm{or} \qquad \dot{u} = L u $$ The generalized eigenvalue problem is $$ A e = \lambda M e $$ We can use the time-stepper approach which essentially ...
3
votes
0answers
250 views

Method with low memory requirement for large-scale eigenvalue problem

I am working on the flow stability problem. In this work the main complication is solving generalized eigenvalue problem for a large scale Non-Hermitian matrix. I need only one eigenvalue (most left ...
0
votes
2answers
3k views

Most efficient library to diagonalize exactly large hermitian or unitary matrices

I am working on a physics problem which requires obtaining the exact eigenvalues and eigenvectors of Hermitian and Unitary matrices numerically. Naturally I would like to ask the experts what are the ...
5
votes
1answer
573 views

Applying Dirichlet b.c. to the Eigenvalue-Problem

If you use a FEM (on the variational formulation), you can discretize some continuous eigenvalue problem, $$L u = \lambda u \ \ \text{on} \ \Omega,$$ into some discrete, generalized eigenvalue problem,...
2
votes
1answer
2k views

Constructing matrix from eigenvalues, eigenvectors (Inconsistency with Matlab's eig())

Let $F_1$, $F_2$ be the foci points of an ellipse $\mathcal{E}\colon \mathbf{x}^TA\mathbf{x}=1$, $\mathbf{x}\in\mathbb{R}^2$, $A\in\mathbb{S}_{++}^{2}$. Let also $a$, $b$ be the semi-axes of $\mathcal{...
3
votes
1answer
1k views

Fast way to compute all eigenvalues of a dense Hermitian matrix

I am finding the eigenvalues of dense NxN Hermitian matrix which is calculated from a density operator in quantum physics. All the eigenvalues are needed as I need to calculate the sum of the absolute ...
1
vote
1answer
65 views

eigenvalue of small symmetric matrices

If I am to solve a symmetric eigenvalue system $A=QDQ^T$, where $A\in\mathcal{R}^{n\times n}$ and $n$ is small (in the range 4 - 64); I want all the eigenvectors and eigenvalues; There are two major ...
2
votes
1answer
1k views

How can QR iteration with complex matrices produce complex diagonal entries?

In Lapack (zhseqr) and matlab, the eigenvalues of a complex matrix are computed successfully. I notice that QR iteration or algorithm is involved with that process. QR iteration repeats to call QR ...
0
votes
1answer
1k views

Flop counts for LAPACK symmetric eigenvalue routines DSYEV, DSYEVD, DSYEVX and DSYEVR

LAPACK has following 4 routines for calculating eigenvalues of a real symmetric matrix; namely DSYEV, DSYEVD, DSYEVX and DSYEVR (DSYEVR being the recommended one). If I were to calculate both ...
2
votes
3answers
1k views

Eigenvalues of a sparse banded nonsymmetric matrix from an elliptic operator

I have a sparse matrix coming from the discretization of a 3D elliptic PDE. The matrix is banded with seven non-zeros diagonals. The sparsity pattern of the matrix looks like this (the actual matrix ...
1
vote
3answers
640 views

How to find the smallest positive eigenvalue of a large general system if they are all in +/- pairs of real eigenvalues

I used MKL Lapack SBGVX because it can solve for "selected" eigenvalues/modes (both positive and negative), thinking it would be efficient, but it is extremely slow when compared with Bathe's subspace ...
5
votes
1answer
148 views

Computing eigendecomposition of a Hermitian matrix that is almost unitary

I have a dense Hermitian matrix that is approximately unitary, so it has eigenvalues that are $\sim \pm1$. I would like to compute all the eigenvectors corresponding to the $+1$ eigenvalue (not ...
3
votes
2answers
1k views

Finding eigenvalues of a complex symmetric tridiagonal matrix

I am trying to find specific eigenvalues and -vectors of a large complex symmetric tridiagonal matrix (at least 10000x10000, and ideally larger). I know roughly which eigenvalues I am looking for, so ...
1
vote
0answers
189 views

Shift-Invert in Anasazi/Belos using Tpetra Sparse Matrices

I am currently trying to port my code over to Trilinos because the problems that I am working on are too big for LAPACK/ARPACK. Specifically I am computing the generalized eigenvalues/eigenvectors: $$...
0
votes
0answers
135 views

Algorithms to compute largest gap between smallest nonzero eigenvalues of sparse symmetric matrix

I am looking mainly for c/c++ implementations but also for theoretical algorithms to compute gaps between smallest positive eigenvalues of symmetric, singular matrix or real numbers. To be precise, I ...
5
votes
2answers
215 views

Is there guaranteed global solver for such an eigenvalue problem?

The original nonlinear optimization problem I have is as follows: For constant symmetric matrices $A=A^T, B_i=B_i^T(\forall i\in\mathbb{N}) \in \mathbb{R}^{n\times n}, \text{rank}(A)=n,$ $$\arg\min\...
1
vote
0answers
95 views

Is it possible to construct such a symmetric matrix with desired eigenvalues?

Suppose a real, dense and asymmetric square matrix $A\in\mathbb{R}^{n\times n}$, all its eigenvalues $\lambda_i \in \mathbb R$ Is it possible to construct a symmetric matrix $B\in\mathbb{R}^{n\times ...
1
vote
0answers
148 views

Efficient way to do congruent transformation using matrix inverse?

I know a square self-adjoint matrix $S_{vv}$ and I want to find: $S_{rr} = HS_{vv}H^{\dagger}$ where $\dagger$ denotes conjugate transpose. I do not know $H$ but I do know $H^{-1}$. What is the ...
2
votes
0answers
59 views

Are the eigenvalues of the product matrix of two real symmetric square matrices also real values?

Suppose $A,B \in \mathbb{R}^{n\times n}; A=A^T, B=B^T$, let $C = AB, D =BA$, If we have all the real eigenvalues of $A$ and $B$, e.g. the eigenvalue decomposition of them: $A=P\Lambda_1 P^T$, $B=Q\...
4
votes
1answer
276 views

What is the most efficient way to obtain the max eigenvalue of a specific symmetric matrix via Eigen C++

Suppose I have a symmetric matrix $A_{1000\times 1000}$, which can be represented by: $A = J G J^T$ where $J$ in 1000x3 is full column rank dense matrix; $G$ in 3x3 is a nonsingular dense matrix. ...
6
votes
2answers
1k views

matlab eigs: wrong eigenvalues for tridiagonal matrix

I try to compute eigenvalues of the tridiagonal matrix coming from finite difference scheme. For small mesh size, eigs works well. But for large size it fails. Here is an example where eigs fails. Is ...
3
votes
1answer
1k views

How to use eigenvalue information to efficiently diagonalize matrices?

I apologize if this question in a more general form has been asked before. I have a tridiagonal Toeplitz matrix $K$, whose eigenvalues and eigenvectors are known analytically for any dimension $N$ [1]....
1
vote
3answers
555 views

Real eigenvalues finding

I have a question about matrix diagonalization. I don't know if this is the right forum... Is there a way to compute the smallest real eigenvalue (and eigenvector if possible) of a general real nxn ...
1
vote
1answer
311 views

Is there congruent transform implementation for dense symmetric matrix in Eigen(C++)?

I need to determine whether a real dense symmetric matrix is positive definite or not. One possible way is to obtain all the eigen values and check the sign of the minimum eigen value but requires ...
3
votes
1answer
681 views

Generalized eigenvalue problem using ARPACK

Is it possible to solve the eigenvalue problem: $$Ax = \lambda Mx$$ using ARPACK when $A$ and $M$ are both non-symmetric complex matrices? According to this documentation, the function ...
1
vote
3answers
1k views

Eigenvectors: Mathematica vs. LAPACK dgeev

I've been using LAPACK dgeev in FORTRAN in the last months spending hours to diagonalize ~4000*4000 matrices. It takes about 2'75 hours to find eigenvalues and ...
6
votes
2answers
409 views

What algorithms are known for computing exact eigenvalues for rational matrices?

Let $M$ be a matrix which has the following properties: 1) $M$ is Hermitian 2) $M$ has only rational entries 3) $M$ is known to have rational eigenvalues What algorithms are there for exactly ...
4
votes
2answers
1k views

2D Schrödinger time-independent finite difference and eigenvalues

I'm learning about numerical methods to obtain the eigenvalues of a system. I have to find the eigenvalues for the time-independent Schrödinger equation but I'm having some difficulties understanding ...
2
votes
0answers
75 views

Estimating eigenvalues from time-dependent non-linear operator

I have a very sparse non-linear system $N(u) = 0$ that can be solved as a time-dependent ODE, $\frac{du}{dt} = N(u)$, and explicitly integrated until $\frac{du}{dt} = N(u) = 0$, e.g. by forward euler, ...
2
votes
1answer
1k views

Estimating the spectral radius when the dominant eigenvalues are complex conjugates

I want to determine the spectral radius of a large non-symmetric matrix $A$ whose dominant eigenvalues are a pair of complex conjugates. My first instinct was to use a power iteration with a starting ...
6
votes
2answers
917 views

Computing smallest eigenvectors of a sparse matrix, having its inverse

I'm a bit confused by the vast amount of literature on solving eigenvalue problems. I have a sparse (large) matrix which I have already factored (by Cholesky or LDU). I would like to compute few ...
5
votes
3answers
6k views

Algorithm for Principal Eigenvector of a Real Symmetric 3x3 Matrix

I have a 3x3 covariance matrix (so, real, symmetric, dense, 3x3), I would like it's principal eigenvector, and speed is a concern. Is there a fast algorithm for this specific problem? I've seen ...
7
votes
2answers
922 views

Can all eigenvalues of a Hermitian Toeplitz matrix be computed in $\tilde{O}(n)$ time?

I know there are "superfast" $O(n \log^p n)$ algorithms for solving Toeplitz linear systems. Is it possible to compute all eigenvalues of such a matrix with the same complexity?
4
votes
1answer
763 views

Solving Coupled ODE eigenvalue problem

I've been trying to find some resources that would help me figure out how to numerically solve a coupled system of ODEs which is also an eigenvalue problem. The system is something like: $ \tag{1} ...
2
votes
1answer
159 views

Solving the elliptic eigenproblem with periodic boundary conditions

Given an energy level $\mu$, I'm looking to calculate the eigenvectors corresponding to the time-independent Schrodinger operator on the torus (that is, periodic boundary conditions)-- $H = -h^2 \...
3
votes
1answer
609 views

Jacobi Iteration diverges?

I'm working through a problem in a textbook as follows: "Consider the $d \times d$ Toeplitz matrix $$ A = \left[ \begin{array}{ccccc} 2 & 1 & 0 & \cdots & 0 \\ -1 &2 &1&\...
5
votes
1answer
822 views

Eigenvalue Decomposition of Hermitian Matrix in Scala

I'm working on helping my friend create code to perform the Overlap Dirac Operator and have come across one part that I'm not sure what to do. I need to compute the Eigenvalues and corresponding ...
16
votes
1answer
3k views

Why does SciPy eigsh() produce erroneous eigenvalues in case of harmonic oscillator?

I'm developing some larger code to perform eigenvalue computations of huge sparse matrices, in the context of computational physics. I test my routines against the simple harmonic oscillator in one ...