Rust + WASM sublinear-time solver for asymmetric diagonally dominant systems. Exposes Neumann series, push, and hybrid random-walk algorithms with npm/npx CLI and Flow-Nexus HTTP streaming for swarm cost propagation and verification.

Easy-to-use linear and non-linear solver

Iterative linear solver for dense/compressed systems with domain decomposition methods.

Source code for the CPU-Free model - a fully autonomous execution model for multi-GPU applications that completely excludes the involvement of the CPU beyond the initial kernel launch.

Python Notebook for a "geometric multigrid solver"

A Python-based Blended sEamLess soLver for Atmospheric dynamics coupled to an ensemble data assimilation engine

BLIT - a library of block (multiple-right-hand-side) iterative sparse linear solvers

Matlab code for block iterative solvers for the DC resistivity equations.

This project shows how to develop and solve sparse Ax=b system. PETSc is utilised for the iterative solution.

Solver library for computational mechanics problems

Numerical Techniques (Matrix Decomposition, Matrix Equation Solvers, Inversion, Iterative Root Finding), All Implemented from scratch in Python

Python interface for htool

Iterative solvers with MPI parallelization

Numerical solver for 2D Poisson equation using finite difference methods. Compares direct vs iterative solvers (Jacobi, Gauss-Seidel, SOR) with convergence analysis and performance benchmarks. Built for my Numerical Analysis semester project.

Lightweight, offline-first routing engine designed for edge logistics—maximizing ROI by anchoring routes around high-value priorities and cutting mileage by 13.26% via deterministic 2-Opt refinement.

Implementation of a Krylov-subspace-like solver for systems of shifted linear problems.

Serial and OpenMP-parallel implementation of the BiCGStab iterative solver for large sparse indefinite linear systems, focusing on efficient sparse matrix-vector multiplication, strong scaling, and reproducible performance benchmarking.

Iterative Solvers for Linear Systems (code for capstone project).

High-performance C++ implementations of iterative methods for solving large sparse linear systems and computing eigenvalues, including Conjugate Gradient, Preconditioned CG, Jacobi, Arnoldi, and QR-based solvers, optimized for memory efficiency and numerical stability.