Skip to content
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

Tutorial change for Bracketing method #211

Merged
merged 1 commit into from
Sep 15, 2023
Merged

Tutorial change for Bracketing method #211

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
16 changes: 13 additions & 3 deletions docs/src/tutorials/nonlinear.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -21,15 +21,25 @@ AbstractArray for automatic differentiation.

## Using Bracketing Methods

For scalar rootfinding problems, bracketing methods exist. In this case, one passes
For scalar rootfinding problems, bracketing methods exist in `SimpleNonlinearSolve`. In this case, one passes
a bracket instead of an initial condition, for example:

```@example
using NonlinearSolve
using SimpleNonlinearSolve
f(u, p) = u * u - 2.0
uspan = (1.0, 2.0) # brackets
probB = IntervalNonlinearProblem(f, uspan)
sol = solve(probB, Falsi())
sol = solve(probB, ITP())
```

The user can also set a tolerance that suits the application.

```@example
using SimpleNonlinearSolve
f(u, p) = u * u - 2.0
uspan = (1.0, 2.0) # brackets
probB = IntervalNonlinearProblem(f, uspan)
sol = solve(probB, ITP(), abstol = 0.01)
```

## Using Jacobian Free Newton Krylov (JNFK) Methods
Expand Down
Loading