arXiv · 1304.4691
Efficient Calculation of Determinants of Symbolic Matrices with Many Variables
Abstract
Efficient matrix determinant calculations have been studied since the 19th century. Computers expand the range of determinants that are practically calculable to include matrices with symbolic entries. However, the fastest determinant algorithms for numerical matrices are often not the fastest for symbolic matrices with many variables. We compare the performance of two algorithms, fraction-free Gaussian elimination and minor expansion, on symbolic matrices with many variables. We show that, under a simplified theoretical model, minor expansion is faster in most situations. We then propose optimizations for minor expansion and demonstrate their effectiveness with empirical data.
Explore related subjects
Keep this discovery
Tanya Khovanova, Ziv Scully. 2013-04-17. Efficient Calculation of Determinants of Symbolic Matrices with Many Variables. https://arxiv.org/abs/1304.4691
Cite the original work for its findings. Save a collection to share your selection of sources.