-
-
Notifications
You must be signed in to change notification settings - Fork 42
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
Impoving NLS Solvers #236
Impoving NLS Solvers #236
Conversation
Codecov Report
@@ Coverage Diff @@
## master #236 +/- ##
===========================================
+ Coverage 20.19% 93.22% +73.03%
===========================================
Files 9 12 +3
Lines 832 901 +69
===========================================
+ Hits 168 840 +672
+ Misses 664 61 -603
... and 4 files with indirect coverage changes 📣 We’re building smart automated test selection to slash your CI/CD build times. Learn more |
What's this actually used for? Generally that's a bad idea |
For GaussNewton and LM if it is NLLS. For a NLProblem we can get around by dropping the |
I did that dispatch for the sparse arrays case, because the in place hits the generic matmul code |
For Matrices it seems to hit the correct BLAS dispatches of |
Let's hold off a merge on this. We should be specializing the |
564950a
to
1a97686
Compare
While I am at it let me wrap FastLM as well |
@ChrisRackauckas I will handle the |
mul!(A, J', J)
seems slower thanA .= J' * J
(@ChrisRackauckas any idea why?)