Timeline for Programming with Fortran, large eigen value problem
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2017 at 12:35 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| Jun 12, 2013 at 14:13 | comment | added | Max Hutchinson | I don't know of any. You should probably just explicitly populate it. If the matrix is banded and symmetric (or Hermitian), then you can use BLAS (netlib.org/blas/dsbmv.f of zhbmv.f) and LAPACK (netlib.org/lapack/complex16/dsbev.f or zhbev.f). | |
| Jun 12, 2013 at 11:44 | comment | added | lorniper | however, in order to save memory, I want to use banded storage, do you know any routine that is able to format a sparse matrix A in banded form? | |
| Jun 11, 2013 at 21:43 | comment | added | Max Hutchinson | With ARPACK, you don't actually pass a matrix to the library. Instead, it uses a "reverse communication interface" to give you a vector, x, and ask you to compute y = Ax for it. In a sense, your 'matrix' is really a linear operator that you can implement however you like. Ref: caam.rice.edu/software/ARPACK/UG/node9.html | |
| Jun 11, 2013 at 20:21 | comment | added | lorniper | what did you mean by "store the data however you like". the problem is essentially two steps, 1) how to declare A as a sparse matrix, 2) how to solve Ax=lBy? | |
| Jun 11, 2013 at 18:57 | vote | accept | lorniper | ||
| Jun 11, 2013 at 16:16 | history | answered | Max Hutchinson | CC BY-SA 3.0 |