Skip to content

Commit 78ab622

Browse files
Update README.md
1 parent 85f8b56 commit 78ab622

File tree

1 file changed

+21
-0
lines changed

1 file changed

+21
-0
lines changed

README.md

Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -36,3 +36,24 @@ u0 = (1.0, 2.0) # brackets
3636
probB = IntervalNonlinearProblem(f, u0)
3737
sol = solve(probB, Falsi())
3838
```
39+
40+
## v1.0 Breaking Release Highlights!
41+
42+
v1.0 has been released for NonlinearSolve.jl, making it a decentralized solver library
43+
akin to DifferentialEquations.jl. For simple implementations of nonlinear solvers,
44+
you can now use SimpleNonlinearSolve.jl. `Falsi`, `Bisection`, and `NewtonRahpson`
45+
implementations designed for scalar and static vector inputs have all moved to the
46+
lower dependency version. NonlinearSolve.jl is thus designed for the larger scale
47+
more complex implementations, with `NewtonRahpson` now sporting support for
48+
LinearSolve.jl and soon SparseDiffTools.jl to allow for preconditioned Newton-Krylov and
49+
exploitation of sparsity. The two pieces will continue to grow in this direction,
50+
with NonlinearSolve.jl gaining more and more wrapped solver libraries and support
51+
for more complex methods, while SimpleNonlinearSolve.jl will keep a lower dependency
52+
version with implementations for small scale problems that do not need all of the
53+
extra tooling.
54+
55+
Additionally, `NonlinearProblem` was split into `NonlinearProblem` and `IntervalNonlinearProblem`,
56+
i.e. the bracketing versions now have their own problem definition, rather than using
57+
a `Tuple` for `u0` in a `NonlinearProblem`. This helps for finding problem-algorithm
58+
pairing errors at type time and overall improves the documentation / makes the roles
59+
more clear.

0 commit comments

Comments
 (0)