High-performance and differentiation-enabled nonlinear solvers (Newton methods), bracketed rootfinding (bisection, Falsi), with sparsity and Newton-Krylov support.
-
Updated
Mar 23, 2025 - Julia
High-performance and differentiation-enabled nonlinear solvers (Newton methods), bracketed rootfinding (bisection, Falsi), with sparsity and Newton-Krylov support.
The Interpolate, Truncate, Project (ITP) Root-Finding Algorithm
Contains the codes and formal context files for (maximal) antichains of Tamari lattices
Functions for numerical analysis methods - Bisection, False-Position, Newton-Raphson, Secant Method, Brent's Method
A general-purpose bracketing rootfinder for ATS2, employing the ITP algorithm. Mirror of the default branch of the Mercurial repository at https://sourceforge.net/p/chemoelectric/ats2-itp-rootfinder
Package to let you easily represent and progress Bracket-style single elimination Tournaments, allowing you to focus on matchup logic and analysis without worrying about the boilerplate. Supports 2, 4, 8, 16, 32, 64...2^n starting teams.
Add a description, image, and links to the bracketing topic page so that developers can more easily learn about it.
To associate your repository with the bracketing topic, visit your repo's landing page and select "manage topics."