Scalability of k-Tridiagonal Matrix Singular Value Decomposition
Keyword(s):
Speed Up
◽
Singular value decomposition has recently seen a great theoretical improvement for k-tridiagonal matrices, obtaining a considerable speed up over all previous implementations, but at the cost of not ordering the singular values. We provide here a refinement of this method, proving that reordering singular values does not affect performance. We complement our refinement with a scalability study on a real physical cluster setup, offering surprising results. Thus, this method provides a major step up over standard industry implementations.
2012 ◽
Vol 2012
◽
pp. 1-20
◽
2019 ◽
Vol 22
(12)
◽
pp. 2687-2698
◽
2009 ◽
Vol 09
(03)
◽
pp. 449-477
◽
2008 ◽
Vol 2008
◽
pp. 1-17
◽
2020 ◽
Vol 28
(1)
◽
pp. 105-118
◽