-
Notifications
You must be signed in to change notification settings - Fork 25
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Computing generalized eigenvalues #127
base: master
Are you sure you want to change the base?
Conversation
I have yet to add tests. First I'm wondering whether this package is the right place to add this functionality and whether it's deemed useful. It is at least to me :-) |
Codecov ReportPatch coverage has no change and project coverage change:
Additional details and impacted files@@ Coverage Diff @@
## master #127 +/- ##
===========================================
- Coverage 96.08% 72.74% -23.35%
===========================================
Files 11 12 +1
Lines 1636 2161 +525
===========================================
Hits 1572 1572
- Misses 64 589 +525
☔ View full report in Codecov by Sentry. |
Looking at this code, at other parts of GenericLinearAlgebra and at LinearAlgebra, I see many opportunities for better integration (and less code in total). For this PR:
It might make the implementation quite a bit shorter. |
I'm sorry for the silence here. This contributions is highly appreciated. I'm a bit stretched for the time being but will try to get this reviewed over the summer. |
This is the PR mentioned in #126 and based on code provided to me by @thijssteel.
It implements
eigval(A, B)
for generic matrices A and B using the QZ algorithm. Copying a comment from the code:Two orthogonal matrices Q and Z are constructed to reduce the "pencil"
(A,B)
to another formQ'*(A,B)*Z
:A
andB
are reduced to upper Hessenberg and upper triangular form, respectively (see:hesstriangular
)