We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent c2c4ded commit 69b2f43Copy full SHA for 69b2f43
docs/src/solvers/NonlinearSystemSolvers.md
@@ -64,7 +64,7 @@ features, but have a bit of overhead on very small problems.
64
likely fail.
65
- `FastShortcutNonlinearPolyalg()`: The default method. A polyalgorithm that mixes fast methods
66
with fallbacks to robust methods to allow for solving easy problems quickly without sacrificing
67
- robustnes on the hard problems.
+ robustness on the hard problems.
68
- `GeneralBroyden()`: Generalization of Broyden's Quasi-Newton Method with Line Search and
69
Automatic Jacobian Resetting. This is a fast method but unstable when the condition number of
70
the Jacobian matrix is sufficiently large.
0 commit comments