Rust sparse LU decomposition using Gilbert and Peierls method
-
Updated
Sep 17, 2023 - Rust
Rust sparse LU decomposition using Gilbert and Peierls method
Analysis and implementation of the GMRES iterative method for solving sparse linear systems. Numerical Methods course project of Facultad de Ingenieria - UDELAR.
GNU Octave sparsersb plugin sources mirror
This project shows how to develop and solve sparse Ax=b system. PETSc is utilised for the iterative solution.
Fortran Package Manager version of LSMR: Sparse Equations and Least Squares
Heat diffusion over a lattice network.
Comparison of Sparse Linear Systems solvers via Cholesky Decomposition.
A Parallel Multithreaded Sparse Triangular Linear System Solver
Sparse LU factorization with partial pivoting in Rust
Parallel GMRES for solving sparse linear systems
Dummy repository for libHSL
Golang implementation of lis
Fortran wrapper for AMGCL with OpenMP/OpenCL support
This is a sparse iterative parallel linear solver I developed during my PhD. The solver works by splitting the matrix into blocks which are then solved in parallel. The solver assumes the input matrix to already have been ordered by a Reverse Cuthill-Mckee reordering algorithm.
A refactored version of SPARSKIT2 from Fortran77 to Fortran95
LDL factorisation for quasi-definite linear systems
COLAMD column approximate minimum degree ordering algorithm
A vizualiser for sparse matrices
A complete example of batched refactorization in cuSOLVER.
Solve matrix equations in python.
Add a description, image, and links to the sparse-linear-systems topic page so that developers can more easily learn about it.
To associate your repository with the sparse-linear-systems topic, visit your repo's landing page and select "manage topics."