In this chapter we will give an insight into the development of modern sparse elimination methods. These are driven by a preprocessing phase based on combinatorial algorithms which improve diagonal dominance, reduce fill-in, and improve concurrency to allow for parallel treatment. Moreover, these methods detect dense submatrices which can be handled by dense matrix kernels based on multithreaded level-3 BLAS. We will demonstrate how recent improvements in developing advanced direct solution methods have enabled speeding up parallel circuit simulation without sacrificing accuracy.
CITATION STYLE
Bollhöfer, M., Schenk, O., Janalik, R., Hamm, S., & Gullapalli, K. (2020). State-of-the-Art Sparse Direct Solvers. In Modeling and Simulation in Science, Engineering and Technology (pp. 3–33). Birkhauser. https://doi.org/10.1007/978-3-030-43736-7_1
Mendeley helps you to discover research relevant for your work.