Skip to content

docs: fix linkcheck and cross-reference CI failures #942

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.

Sign up for GitHub

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

Merged
ChrisRackauckas merged 3 commits into from
May 28, 2026
+2 −1
Merged

docs: fix linkcheck and cross-reference CI failures #942

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
e572180
docs: fix three CI failures (linkcheck, cross_references, example_block)
ChrisRackauckas May 27, 2026
fc732ed
maybe_wrap_nonlinear_f: narrow skip to DenseSparsityDetector
ChrisRackauckas May 27, 2026
518c36e
Revert maybe_wrap_nonlinear_f change; scope PR to docs-only fixes
ChrisRackauckas May 28, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions docs/make.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -52,6 +52,7 @@ makedocs(;
"https://github.com/devernay/cminpack/blob/d1f5f5a273862ca1bbcf58394e4ac060d9e22c76/hybrj.c",
"https://github.com/devernay/cminpack/blob/d1f5f5a273862ca1bbcf58394e4ac060d9e22c76/lmder.c",
"https://net-informations.com/faq/net/stack-heap.htm", # Unreliable external site
"https://iopscience.iop.org/article/10.1088/1757-899X/1276/1/012010/", # IOP redirects to PerimeterX bot validator from CI
],
checkdocs = :exports,
warnonly = [:missing_docs],
Expand Down
2 changes: 1 addition & 1 deletion docs/src/solvers/bracketing_solvers.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,7 +8,7 @@ Solves for ``f(t) = 0`` in the problem defined by `prob` using the algorithm `al
algorithm is given, a default algorithm will be chosen.

## Recommended Methods
[`modAB`](@ref) (Modified Anderson-Bjork) is the recommended method for the scalar interval
[`ModAB`](@ref) (Modified Anderson-Bjork) is the recommended method for the scalar interval
root-finding problems. It combines Bisection with Anderson-Bjork steps to achieve superlinear
convergence 1.7–1.8, providing optimal convergence rate for poorly behaved functions.
According to our benchmarks, it outperforms the other methods in most cases.
Expand Down
Loading