Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with eigenvalues
Search options not deleted
user 122659
eigenvalues of matrices or operators
4
votes
2
answers
547
views
Is it possible to use the Laplace Transform to calculate eigenvalues?
The relationship of Eigenvalues with Gradient Descent
Let $A$ be a symmetric (and thus diagonalizable) matrix, with diagonalization
$$A=VDV^T.$$
Let us define the quadratic function
$$f(x) = x^T A x.$$ … If we could invert our Laplace transform we would of course immediately get the eigenvalues as the non-zero "frequencies" in our discrete measure $\mu$. …
- 385
2
votes
Is it possible to use the Laplace Transform to calculate eigenvalues?
A very unsatisfying answer is matrix exponentiation (which is very expensive itself):
$$x_n=\exp(ihA)x_{n-1}$$
results in
$$
x_n^{(j)} = \exp(ih\lambda_jn) x_0^{(j)}
$$
and thus
$$
\|x_n\|^2 = \sum_{j …
- 385