Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have a 3-dimensional array that is potentially very large and I need to do quite a lot of operations with it.

Is there a systematic way to choose a subspace of a certain size, such that the norm (any norm) of the projection of the array onto the subspace is as large as possible?

If it was two dimensions I would diagonalize and then then add eigenvectors to my subspace with the largest eigenvalue until I was satisfied. But what do you do with 3-dimensional array?

Btw, I'm a physicist and the 3-dimensional array is the electron-phonon coupling:)

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.