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 ...
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: 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 ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback