A Reexamination of the COnfLUX 25D LU Factorization Algorithm
<|reference_start|>A Reexamination of the COnfLUX 25D LU Factorization Algorithm: This article conducts a reexamination of the research conducted by Kwasniewski et al., focusing on their adaptation of the 2.5D LU factorization algorithm with tournament pivoting, known as \func{COnfLUX}. Our reexamination reveals potential concerns regarding the upper bound, empirical investigation methods, and lower bound, despite the original study providing a theoretical foundation and an instantiation of the proposed algorithm. This paper offers a reexamination of these matters, highlighting probable shortcomings in the original investigation. Our observations are intended to enhance the development and comprehension of parallel matrix factorization algorithms.<|reference_end|>
@article{tang2024a,
    title={A Reexamination of the COnfLUX 2.5D LU Factorization Algorithm},
    author={Yuan Tang},
    journal={arXiv preprint arXiv:2404.06713},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.06713},
    primaryClass={cs.DC cs.DS cs.NA math.NA}
}