GitHub

Fast sparse LU factorization using left-looking algorithm and OpenMP parallel.

This LU solver uses the pure Gilbert-Peierls left-looking algorithm, which is suitable for very sparse linear systems, such as circuit problems. This LU solver uses OpenMP to parallelize the LU ...
GitHub

SubtreeLU -- Parallel Sparse LU Factorization

SubtreeLU is a high-performance parallel sparse LU factorization algorithm for SPICE-like circuit simulation. It is designed to be used in circuit simulation software, particularly for solving large ...
IEEE

Algorithmic Advancements and a Comparative Investigation of Left and Right Looking Sparse LU Factorization on GPU Platform for Circuit Simulation

Abstract: Sparse LU factorization is a key tool in the solution of large linear set of algebraic equations encompassing a wide range of computing applications. Recent advances in this field exploit ...
IEEE

Implementation of Block Algorithm for LU Factorization

Abstract: Applying blocking technology to the computation of big dense matrices can make a better use of computer’s memory hierarchies and increase computing efficiency. The blocked algorithm for LU ...
Oak Ridge National Lab

SparseLU, A Novel Algorithm and Math Library for Sparse LU Factorization

2022 IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms (IA3) Decomposing sparse matrices into lower and upper triangular matrices (sparse LU factorization) is a key operation ...