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 ...
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

GPU-Accelerated Parallel Sparse LU Factorization Method for Fast Circuit Analysis

Abstract: Lower upper (LU) factorization for sparse matrices is the most important computing step for circuit simulation problems. However, parallelizing LU factorization on the graphic processing ...
GitHub

moniba-ravan/block-lu-factorization

This repository contains the implementation of Block LU-Factorization in C using OpenMP for parallel computation. Block LU-Factorization extends the traditional LU factorization by splitting matrices ...
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 ...