- Notifications
You must be signed in to change notification settings - Fork46
High-performance and differentiation-enabled nonlinear solvers (Newton methods), bracketed rootfinding (bisection, Falsi), with sparsity and Newton-Krylov support.
License
NotificationsYou must be signed in to change notification settings
SciML/NonlinearSolve.jl
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
Fast implementations of root finding algorithms in Julia that satisfy the SciML common interface.
For information on using the package,see the stable documentation. Use thein-development documentation for the version ofthe documentation which contains the unreleased features.
using NonlinearSolve, StaticArraysf(u, p)= u.* u.-2u0=@SVector[1.0,1.0]prob=NonlinearProblem(f, u0)solver=solve(prob)## Bracketing Methodsf(u, p)= u.* u.-2.0u0= (1.0,2.0)# bracketsprob=IntervalNonlinearProblem(f, u0)sol=solve(prob)
If you found this library to be useful in academic work, then please cite:
@article{pal2024nonlinearsolve,title={NonlinearSolve. jl: High-Performance and Robust Solvers for Systems of Nonlinear Equations in Julia},author={Pal, Avik and Holtorf, Flemming and Larsson, Axel and Loman, Torkel and Schaefer, Frank and Qu, Qingyu and Edelman, Alan and Rackauckas, Chris},journal={arXiv preprint arXiv:2403.16341},year={2024}}
About
High-performance and differentiation-enabled nonlinear solvers (Newton methods), bracketed rootfinding (bisection, Falsi), with sparsity and Newton-Krylov support.
Topics
Resources
License
Code of conduct
Security policy
Stars
Watchers
Forks
Packages0
No packages published