High-performance and differentiation-enabled nonlinear solvers (Newton methods), bracketed rootfinding (bisection, Falsi), with sparsity and Newton-Krylov support.
-
Updated
Aug 7, 2025 - Julia
High-performance and differentiation-enabled nonlinear solvers (Newton methods), bracketed rootfinding (bisection, Falsi), with sparsity and Newton-Krylov support.
LinearSolve.jl: High-Performance Unified Interface for Linear Solvers in Julia. Easily switch between factorization and Krylov methods, add preconditioners, and all in one interface.
Factorization of Symmetric Matrices
A Julia implementation of incomplete LU factorization with zero level of fill in.
A Julia library for computing tree decompositions and chordal completions of graphs.
Approximate Minimum Degree Ordering in Julia
Limited-Memory Factorization of Symmetric Matrices
Almost block diagonal matrices factorization and solving in Julia
Implementation of Factor-augmented Vector Autoregressive process (FAVAR(p)).
Contains an implementation of lazily represented matrix structures that allow for the application of the Woodbury Identity.
This repository contains the files necessary for symbolically calculating multivariate power expansions.
Add a description, image, and links to the factorization topic page so that developers can more easily learn about it.
To associate your repository with the factorization topic, visit your repo's landing page and select "manage topics."