0
$\begingroup$

I realize that this might be somewhat of an unusual and specific question.

I know that the eigenvalues of symmetric matrices are used in a number of ways in scientific computing, such as for finding numerical solutions to differential equations.

However, when considering real-time applications, I have only been able to find applications which also require the eigenvectors to be found. These include the MUSIC algorithm and principal component analysis.

Does anyone here know of any real-time applications/algorithms which only requires the eigenvalues of symmetric matrices?

EDIT:

The reason I am asking is that I have designed a hardware architecture for finding eigenvalues of symmetric matrices. I am looking for some kind of application where I can demonstrate its capabilities.

$\endgroup$
  • $\begingroup$ Do you care about eigenvectors as well? $\endgroup$ – Laurent Duval May 11 at 22:01
  • $\begingroup$ @LaurentDuval No, I only care about eigenvalues $\endgroup$ – user3120921 May 12 at 6:21
0
$\begingroup$

OK, you know that complex sinusoids are eigenfunctions (eigenvectors) of linear time-invariant (LTI) systems (which are linear operators). Guess what you see when you look at a spectrum: it's the eigenvalues corresponding to the eigenvector of any given frequency. So, basic signal theory uses eigenvectors to understand the fact that the frequency- and time-domain representation of signals are equivalent.

In MUSIC especially, the eigenvalues are of great importance – they signify the power of that eigenvector of the observed system (i.e. the power of the frequency component in case of that eigenvector spanning the signal subspace). So, MUSIC depends on the eigenvalues.

Basically, all symmetrical MIMO schemes that involve precoding decompose a matrix using the EVD into especially a diagonal matrix with the Eigenvalues as entries – and the question whether, and with what power, a decomposed "virtual" channel is used depends on the magnitude of the respective eigenvalue. So, MIMO, Precoding, and in the context of power assignment waterfilling for these channels depend on eigenvalues.


Now, for things that are "borderline" signal processing:

Graph theory has a relatively rich interaction with linear algebra. The Spectrum of a Graph is basically equivalently used to Spectra of Matrices.

Especially for random graphs, statements on bounds and distribution of eigenvalues of the (often unboundedly large) adjacency matrix are useful to describe degree distributions, and how reliably one can remove random edges from the graph without cutting the graph.

You can imagine the relevance of that to the theory of routing in communication networks; but in the case of random parity-check codes, the distribution of node degrees and cycle lengths is an important thing that can be at lest approximated through this.

| improve this answer | |
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.