File tree Expand file tree Collapse file tree 1 file changed +29
-0
lines changed
Expand file tree Collapse file tree 1 file changed +29
-0
lines changed Original file line number Diff line number Diff line change 1+ # Changelog
2+
3+ All notable changes to this project will be documented in this file.
4+
5+ The format is based on [ Keep a Changelog] ( https://keepachangelog.com/en/1.1.0/ ) ,
6+ and this project adheres to [ Semantic Versioning] ( https://semver.org/spec/v2.0.0.html ) .
7+
8+ ## [ 0.1.0] - 2026-03-10
9+
10+ Initial release of ` approx-chol ` , providing approximate Cholesky factorization
11+ for graph Laplacians in Rust with Python bindings.
12+
13+ ### Added
14+
15+ - Core approximate Cholesky factorization algorithm for SDD/SDDM matrices
16+ - Fallible APIs with structured error types throughout
17+ - CSR sparse matrix representation with checked accessors
18+ - Triangular solve (` solve ` and ` solve_into ` ) for factored systems
19+ - Clique sampling and star/clique-tree internals
20+ - Serialization support via optional ` serde ` feature
21+ - Python bindings (via PyO3/maturin) exposing factorization and solve
22+ - Input validation and borrow-safe ` solve_into ` on the Python side
23+ - Proptest suites for CSR construction and factorization invariants
24+ - Preconditioner effectiveness tests
25+ - Criterion benchmarks for factorization, sampling, solve, and CSR conversion
26+ - Multi-platform CI with coverage reporting
27+ - Dual MIT license for Rust crate and Python package
28+
29+ [ 0.1.0 ] : https://github.com/aai-institute/approx-chol/releases/tag/v0.1.0
You can’t perform that action at this time.
0 commit comments