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

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

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

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

Abstract: Task-based runtime systems have demonstrated efficiency in leveraging the capabilities of large, heterogeneous architectures. Many linear algebra algorithms and applications have been ...