A parallel sparse linear system solver for large-scale circuit simulation based on Schur Complement

In this paper, the parallelism of large sparse matrix solve in circuit simulation is studied. We present an efficient matrix ordering strategy to permute the circuit conductance matrix into Bordered Block Diagonal (BBD) form with a small connection matrix. Target on multi-core and shared memory architecture, the sparse linear system is solved in parallel using Schur Complement algorithm. The suitable matrix partition dimension is investigated for better performance. The experimental results suggest an average 6.8x speedup when our method is in comparison with KLU.