-
Notifications
You must be signed in to change notification settings - Fork 24
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
Smoothing Methods like Jacobi & Gauss-Seidel #116
Comments
Hey @Ceyron, this relates to #113 and #8 . Those methods would be very useful in multigrid methods that could be used for preconditioners to feed into e.g. GMRES. I am currently running a project that needs those. It could be nice to coordinate; I suggested to implement an example with preconditioning for solving a 2D Poisson system in #8, although I have not advanced on that yet. |
I'd be happy to take a PR on these :) |
Excellent. Then, we could start working on this in the coming weeks. @vboussange: Do you already have some code for Jacobi or Gauss-Seidel? Otherwise, I would start looking into subclassing a new iterative solver since I need it for my research anyway. |
No problem 👍 Cool, then I'd start fresh with Jacobi & GaussSeidel. I want to create a first draft and afterward loop you in for some feedback. |
Hi Patrick & Jason,
Thanks for this wonderful library. I was curious if you are interested in adding smoothing methods based on matrix decomposition, such as the Jacobi method or Gauss-Seidel (potentially with the option for relaxation).
Certainly, these solvers a way less efficient than the Krylov ones and need matrix materialization (the state of sparse matrices in JAX is not mature enough?!?), but they could complete the suite of solvers. They might also serve as a nice educational example.
The text was updated successfully, but these errors were encountered: