Skip to content

Commit 8fe131a

Browse files
Merge pull request #263 from avik-pal/ap/fix_docs
Fix docs
2 parents dbed34c + effaa64 commit 8fe131a

File tree

3 files changed

+3
-3
lines changed

3 files changed

+3
-3
lines changed

docs/src/basics/solve.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
# [Common Solver Options (Solve Keyword Arguments)](@id solver_options)
22

33
```@docs
4-
solve(prob::SciMLBase.NonlinearProblem,args...;kwargs...)
4+
solve(prob::SciMLBase.NonlinearProblem, args...; kwargs...)
55
```

docs/src/tutorials/small_compile.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# Faster Startup and and Static Compilation
1+
# [Faster Startup and and Static Compilation](@id fast_startup)
22

33
In many instances one may want a very lightweight version of NonlinearSolve.jl. For this case there
44
exists the solver package SimpleNonlinearSolve.jl. SimpleNonlinearSolve.jl solvers all satisfy the

src/broyden.jl

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ An implementation of `Broyden` with reseting and line search.
1212
- `linesearch`: the line search algorithm to use. Defaults to [`LineSearch()`](@ref),
1313
which means that no line search is performed. Algorithms from `LineSearches.jl` can be
1414
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
1616
specifically designed for Broyden's method.
1717
"""
1818
@concrete struct GeneralBroyden <: AbstractNewtonAlgorithm{false, Nothing}

0 commit comments

Comments
 (0)