MathGroup Archive 2006

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

Search the Archive

Re: for higher dimensions?

  • To: mathgroup at smc.vnet.net
  • Subject: [mg68532] Re: for higher dimensions?
  • From: AES <siegman at stanford.edu>
  • Date: Wed, 9 Aug 2006 04:18:53 -0400 (EDT)
  • Organization: Stanford University
  • References: <eb9p00$srh$1@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

In article <eb9p00$srh$1 at smc.vnet.net>,
 "Adriano Pascoletti" <pascolet at dimi.uniud.it> wrote:

> Yes. Use Eigensystem.
> For instance
> 
> M = {{2, 0, -3}, {3, 5, 6}, {1, 1, -1}};esys = Eigensystem[M];
> 

Thanks -- but this, in my interpretation at least, is a 3 X 3 but still 
*two-dimensional* (rows and columns) matrix. 

My current task is to find eigensolutions to a problem that might be 
written most conveniently, with it's indices shown explicitly, as

   M_{i,j,m,n} A_{m,n}  = lambda A_{i,j}  

with M known and the objective being find a set of eigenvalues lambda[k] 
and "eigenmatrices"  A_{i,j}[k] that satisfy this equation.


  • Prev by Date: Re: Multiplying Elements of arrays: Inner product
  • Next by Date: Re: MemberQ
  • Previous by thread: Re: How to get the output of Minimize function in x = a format
  • Next by thread: RE: Re: for higher dimensions?