Questions tagged [arpack]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
0 votes
0 answers
43 views

How do compute lowest eigenvalue using Arpack in C language

Hi I have a problem to calculate lowest eigenvalue in non-symmetric matrix using Arpack, because my matrix is very complicated and even I have a lot of trouble to made a matrix - vector multiplication....
Maciej Lewkowicz's user avatar
1 vote
0 answers
66 views

Optimal Krylov subspace dimension and iteration limits for eigs

When using the eigs function in MATLAB, which is based off of ARPACK, one can manually modify the maximal dimension of the constructed Krylov subspaces, the maximum iteration counts, and the error ...
user45844's user avatar
2 votes
0 answers
49 views

How to reconcile difference between Arpack manual and example?

The ARPACK manual for znaupd on pp. 128–129 says: Mode 2:[...] OP = inv[M]*A and B = M. [...] IDO = 1: compute Y = OP * Z and Z = B * X where IPNTR(1) is the ...
user1318499's user avatar
9 votes
3 answers
839 views

Accuracy issues with Arpack in Julia for eigenvalues of smallest magnitude

Following the documentation of Julia's Arpack package (Cf. https://julialinearalgebra.github.io/Arpack.jl/stable/eigs/) I have computed some largest and smallest magnitude eigenvalues of sparse ...
Stavros Kousidis's user avatar
2 votes
2 answers
740 views

Python scipy eigh(Arpack) giving wrong eigenvalues for generalized eigenvalue problem

I am trying to solve a generalized eigenvalue problem using Arpack, right now the code is using LAPACK but that's too slow, we only need a few eigenvalues and the matrices are sparse so using Arpack ...
Himanshu Chaudhary's user avatar
5 votes
0 answers
102 views

Efficient way to find eigenvalues of complex symmetric matrix with real off-diagonal elements

My goal is to find all eigenvalues (and eigenvectors) in a given range of magnitudes of a complex symmetric matrix with real off-diagonal elements (only diagonal elements are complex). Currently I'm ...
QNA's user avatar
  • 151
1 vote
0 answers
37 views

Can I use the Schur basis returned by ARPACK in a restart capacity?

Reading ARPACK documentation, I see that ARPACK will return an "orthogonal basis for the invariant subspace corresponding to the eigenvalues in D" if eigenvectors are not requested. Can this subspace ...
DJames's user avatar
  • 403
1 vote
0 answers
116 views

How can I maximise orthonormality between degenerate eigenvectors using ARPACK?

I am using ARPACK's zndrv1 to diagonalise a matrix (the context is quantum chemistry). While all vectors have a norm 1, as expected, vectors corresponding to degenerate eigenstates aren't always ...
DJames's user avatar
  • 403
2 votes
2 answers
307 views

Can ARPACK exploit hermiticity when diagonalising a complex matrix?

I have noticed arpack comes with a driver dsdrv1 that exploits symmetry of a real-valued matrix. Is there a way to analogously exploit a Hermitian matrix in some way via z--- drivers? The manual ...
DJames's user avatar
  • 403
2 votes
1 answer
70 views

Partial diagonalisation of large symmetric positive-definite band-diagonal matrices

I want to partially diagonalise real sparse symmetric positive-definite matrices, that are of dimension $n = 10^5$ and I need on the order of $k = 500$ of the smallest eigenvalues and eigenvectors. ...
Kappie001's user avatar
  • 141
3 votes
0 answers
347 views

Left eigenvectors using ARPACK

I'm trying to find both the dominant $k$ left and right eigenvectors, that is, $$V_L\mathcal{A} = \Lambda V_L\\ \mathcal{A}V_R = V_R\Lambda\\ V_LV_R = I_{k\times k}$$ $V_L$ being the $k\times N$ ...
Nikko's user avatar
  • 31
1 vote
0 answers
63 views

Solving 2D Schrodinger Equation with ARPACK: Can I ensure all eigenvectors have the same phase?

I use arpack to solve the 2D Schrodinger, and eigenvalue problem of the form $$Hx = \epsilon x$$ on a uniform grid. All eigenvectors are real in my case. Arpack doesn't normalise the eigenvectors, ...
DJames's user avatar
  • 403
8 votes
0 answers
421 views

Eigenvalue with largest imaginary part

Iterative eigensolvers such as ARPACK, give the option to find a subset of the eigenvalues which have the largest imaginary part. My question is how do these algorithms work. As I understand it, ...
as2457's user avatar
  • 243
2 votes
1 answer
482 views

Computation time of eigenvalues with ARPACK depends on what?

My goal is to compute the k smallest eigenvalues of large symmetric sparse matrices. For this purpose I use python scipy's eigsh method in shift-invert mode which uses ARPACK. The matrices usually ...
Rena's user avatar
  • 21
2 votes
1 answer
646 views

Preconditioning ARPACK eigenvalue solver

I am working on a generalized eigenvalue problem of the form $$ \boldsymbol{A}\cdot\boldsymbol{x}=\lambda\boldsymbol{B}\cdot\boldsymbol{x} $$ where $\boldsymbol{B}$ is not symmetric positive. ...
sebastian_g's user avatar
3 votes
1 answer
343 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 ...
DJames's user avatar
  • 403
1 vote
0 answers
194 views

ARPACK- Reverse Communication Interface [closed]

I am trying to use ARPACK to diagonalize a sparse Hermitian matrix. My program is executing without error but returning incorrect eigenvalues. I have tried to trace the problem back. The work is ...
user1234's user avatar
2 votes
0 answers
481 views

Arpack and Matlab give different values for eigenvalues

I am solving a generalized eigenvalues problem with inversed complex shift: $$(M-\sigma J)^{-1}J \boldsymbol{x} = \boldsymbol{x} \nu \enspace .$$ My matrices are obtained from a finite element ...
Britomarti's user avatar
5 votes
0 answers
519 views

Iteratively finding both left and right eigenvectors for non-symmetric complex matrix

I have a complex, non-Hermitian matrix $\mathbf{A}$, for which I need to find a few eigenvalues and eigenvectors in the generalised eigenvalue problem: $$\mathbf{A}\cdot \mathbf{x} = \lambda \mathbf{...
DaveP's user avatar
  • 161
1 vote
0 answers
225 views

Compute eigenvalues with Arpack

I am using Arpack to compute the eigenvalues of the problem $\lambda Mx = Ax$ with reverse shift method with complex shift. $A$ and $M$ are real, $M$ is symmetric. Then, I use znaupd e zneupd. I use ...
Britomarti's user avatar
2 votes
0 answers
344 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 ...
jengmge's user avatar
  • 51
1 vote
0 answers
82 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 ...
cfdlab's user avatar
  • 2,993