Services & Resources / Wolfram Forums
MathGroup Archive
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 1998

[Date Index] [Thread Index] [Author Index]

Search the Archive

Is there a lowest Eigenvalues function around?

  • To:
  • Subject: [mg10988] Is there a lowest Eigenvalues function around?
  • From: "Christopher R. Carlen" <>
  • Date: Mon, 16 Feb 1998 03:39:55 -0500
  • Organization: epix Internet Services

I have to find the eigenvalues of very large matrices, ie 1024x1024 up
to over 10000x10000 .  I run out of memory when trying to do more than
about 1600x1600 .  I know there are algorithms to find the lowest or
highest eigenvalues of a matrix, but the Mathematica function
Eigenvalues[] finds all of them.  

Does anyone know if there is an implementation of a lowest-eigenvalues
function anywhere?  I have looked aroung at but didn't
find anything.

Also, I wonder about memory usage in storing matrices.  If a matrix is
sparse, does it require less memory to store and manipulate than a
not-sparse matrix?  Does a matrix with only real values require less
memory than a complex matrix?

Christopher R. Carlen          <--- Reply here, please.
My OS is Linux v2

  • Next by Date: Re: Can Mathematica help me?
  • Prev by thread: creating animations (newbie)
  • Next by thread: Re: Is there a lowest Eigenvalues function around?