diff options
author | Elizabeth Hunt <elizabeth.hunt@simponic.xyz> | 2023-11-27 14:45:48 -0700 |
---|---|---|
committer | Elizabeth Hunt <elizabeth.hunt@simponic.xyz> | 2023-11-27 14:54:39 -0700 |
commit | 0981ffa00ce520df1134714206a70bcc1a08303e (patch) | |
tree | f16746740c43bbaa582392c3d702b1d0ae16876e /src/eigen.c | |
parent | 793c01c9bd61a5b461b44fc7ede04cc1dd90a4ec (diff) | |
download | cmath-0981ffa00ce520df1134714206a70bcc1a08303e.tar.gz cmath-0981ffa00ce520df1134714206a70bcc1a08303e.zip |
q5 hw7
Diffstat (limited to 'src/eigen.c')
-rw-r--r-- | src/eigen.c | 26 |
1 files changed, 26 insertions, 0 deletions
diff --git a/src/eigen.c b/src/eigen.c index c4af461..92ef88c 100644 --- a/src/eigen.c +++ b/src/eigen.c @@ -84,6 +84,32 @@ double shift_inverse_power_eigenvalue(Matrix_double *m, Array_double *v, return lambda; } +Array_double *partition_find_eigenvalues(Matrix_double *m, + Matrix_double *guesses, + double tolerance, + size_t max_iterations) { + assert(guesses->rows >= + 2); // we need at least, the most and least dominant eigenvalues + + double end = dominant_eigenvalue(m, guesses->data[guesses->rows - 1], + tolerance, max_iterations); + double begin = + least_dominant_eigenvalue(m, guesses->data[0], tolerance, max_iterations); + + double delta = (end - begin) / guesses->rows; + Array_double *eigenvalues = InitArrayWithSize(double, guesses->rows, 0.0); + for (size_t i = 0; i < guesses->rows; i++) { + double box_midpoint = ((delta * i) + (delta * (i + 1))) / 2; + + double nearest_eigenvalue = shift_inverse_power_eigenvalue( + m, guesses->data[i], box_midpoint, tolerance, max_iterations); + + eigenvalues->data[i] = nearest_eigenvalue; + } + + return eigenvalues; +} + double least_dominant_eigenvalue(Matrix_double *m, Array_double *v, double tolerance, size_t max_iterations) { return shift_inverse_power_eigenvalue(m, v, 0.0, tolerance, max_iterations); |