Impact of Reordering on the LU Factorization Performance of Bordered Block-Diagonal Sparse Matrix
Power engineers rely on computer-based simulation tools to assess grid performance and ensure security. At the core of these tools are solvers for sparse linear equations. When transformed into a bordered block-diagonal (BBD) structure, part of the sparse linear equation solving can be parallelized. This work focuses on using the Schur-complement-based method for LU factorization on BBD matrices, specifically, Jacobian matrices from large-scale systems. Our findings show that the natural ordering method outperforms the default ordering method in computational performance for each block of the BBD matrix. This observation is validated using synthetic 25k-bus and 70k-bus cases, showing a speedup of up to 38% when using natural ordering without permutation. Additionally, the impact of the number of partitions is studied, and the result shows that computational performance improves with more, smaller partitions in the BBD matrices.
- Research Organization:
- National Renewable Energy Laboratory (NREL), Golden, CO (United States)
- Sponsoring Organization:
- National Science Foundation (NSF)
- DOE Contract Number:
- AC36-08GO28308
- OSTI ID:
- 2500374
- Report Number(s):
- NREL/CP-2C00-92728; MainId:94509; UUID:e46ffbb7-c356-414d-ad38-8e6b11d2d34f; MainAdminId:75776
- Country of Publication:
- United States
- Language:
- English
Similar Records
Block-bordered diagonalization and parallel iterative solvers
Threshold partitioning of sparse matrices and applications to Markov chains