-
Notifications
You must be signed in to change notification settings - Fork 53
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
New Algorithms #617
Comments
Hi @KlausC !
I will read the other paper tonight :) |
I am not yet convinced, that BA-GMRES is just GMRES with an appropriate conditioner. I am not sure, how BA-GMRES would compare to I also found that one useful. Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems When I find the time I will make a PR to prove the concept. |
Right. If A is rectangular, that isn't called preconditioning. |
@KlausC You just need to model AB or BA by forming explicitly the matrices or implementing linear operators that perform AB * v or BA * v. When B=A', BA-GMRES is equivalent to MINRES on the normal equations or LSMR. You can see it as MINRES with full reorthogonalization (stable but very expensive). With the current implementation of GMRES in Krylov.jl we can already do AB-GMRES and BA-GMRES. |
Thanks, that would be fine. |
Is it valid to consider the results of this paper from 2011: Inner-Iteration Krylov Subspace Methods for Least Squares Problems?
Especially the algorithm called there "BAGMRES-NRSOR" seems to show outstanding performance.
See also the current 2022 article: GMRES methods for tomographic reconstruction with an unmatched back projector
The text was updated successfully, but these errors were encountered: