I am wondering why sparse is faster on solving circuit problems? What's the fundamental difference between Sparse and a generic LU linear system solver?
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Sparse 's pivoting algorithms take advantage of the fact that the circuit matricies generally have values on the diagonals, and those values are often the largest values in the row. This reduces the time required to perform pivoting and generally results in a more robust reordering.
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
I am wondering why sparse is faster on solving circuit problems? What's the fundamental difference between Sparse and a generic LU linear system solver?
Sparse 's pivoting algorithms take advantage of the fact that the circuit matricies generally have values on the diagonals, and those values are often the largest values in the row. This reduces the time required to perform pivoting and generally results in a more robust reordering.