Skip to content

Commit bf6bcce

Browse files
Update NonlinearSystemSolvers.md
1 parent 168e325 commit bf6bcce

File tree

1 file changed

+7
-3
lines changed

1 file changed

+7
-3
lines changed

docs/src/solvers/NonlinearSystemSolvers.md

Lines changed: 7 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -7,19 +7,23 @@ Solves for ``f(u)=0`` in the problem defined by `prob` using the algorithm
77

88
## Recommended Methods
99

10-
`TrustRegion` is a good choice for most problems. For large
10+
`NewtonRaphson` is a good choice for most problems. For large
1111
systems, it can make use of sparsity patterns for sparse automatic differentiation
1212
and sparse linear solving of very large systems. That said, as a classic Newton
1313
method, its stability region can be smaller than other methods. Meanwhile,
14-
`SimpleNewtonRaphson` and `SimpleTrustRegion` are implementations which are specialized for
15-
small equations. They are non-allocating on static arrays and thus really well-optimized
14+
`SimpleNewtonRaphson` is an implementation which is specialized for
15+
small equations. It is non-allocating on static arrays and thus really well-optimized
1616
for small systems, thus usually outperforming the other methods when such types are
1717
used for `u0`. `DynamicSS` can be a good choice for high stability.
1818

1919
For a system which is very non-stiff (i.e., the condition number of the Jacobian
2020
is small, or the eigenvalues of the Jacobian are within a few orders of magnitude),
2121
then `NLSolveJL`'s `:anderson` can be a good choice.
2222

23+
!!! note
24+
25+
`TrustRegion` and `SimpleTrustRegion` are still in development.
26+
2327
## Full List of Methods
2428

2529
!!! note

0 commit comments

Comments
 (0)