High-performance and differentiation-enabled nonlinear solvers (Newton methods), bracketed rootfinding (bisection, Falsi), with sparsity and Newton-Krylov support.
-
Updated
Aug 23, 2024 - Julia
High-performance and differentiation-enabled nonlinear solvers (Newton methods), bracketed rootfinding (bisection, Falsi), with sparsity and Newton-Krylov support.
Approximate Minimum Degree Ordering in Julia
A little Julia module to allow factorization and backslash to work with hyperdual-valued arrays and sparse arrays.
Add a description, image, and links to the sparse-matrices topic page so that developers can more easily learn about it.
To associate your repository with the sparse-matrices topic, visit your repo's landing page and select "manage topics."