File tree Expand file tree Collapse file tree 3 files changed +3
-3
lines changed Expand file tree Collapse file tree 3 files changed +3
-3
lines changed Original file line number Diff line number Diff line change 1
1
# [ Common Solver Options (Solve Keyword Arguments)] (@id solver_options)
2
2
3
3
``` @docs
4
- solve(prob::SciMLBase.NonlinearProblem,args...;kwargs...)
4
+ solve(prob::SciMLBase.NonlinearProblem, args...; kwargs...)
5
5
```
Original file line number Diff line number Diff line change 1
- # Faster Startup and and Static Compilation
1
+ # [ Faster Startup and and Static Compilation] ( @ id fast_startup)
2
2
3
3
In many instances one may want a very lightweight version of NonlinearSolve.jl. For this case there
4
4
exists the solver package SimpleNonlinearSolve.jl. SimpleNonlinearSolve.jl solvers all satisfy the
Original file line number Diff line number Diff line change @@ -12,7 +12,7 @@ An implementation of `Broyden` with reseting and line search.
12
12
- `linesearch`: the line search algorithm to use. Defaults to [`LineSearch()`](@ref),
13
13
which means that no line search is performed. Algorithms from `LineSearches.jl` can be
14
14
used here directly, and they will be converted to the correct `LineSearch`. It is
15
- recommended to use [LiFukushimaLineSearchCache ](@ref) -- a derivative free linesearch
15
+ recommended to use [LiFukushimaLineSearch ](@ref) -- a derivative free linesearch
16
16
specifically designed for Broyden's method.
17
17
"""
18
18
@concrete struct GeneralBroyden <: AbstractNewtonAlgorithm{false, Nothing}
You can’t perform that action at this time.
0 commit comments