Blocked Jacobi attains the communication lower bound for classical O(n^3) matrix multiplication while a recursive version reaches near-optimal arithmetic and communication cost using fast Strassen-like multiplication; analogous bounds hold for one-sided Jacobi SVD.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Minimizing the Arithmetic and Communication Complexity of Jacobi's Method for Eigenvalues and Singular Values: Part One -- Serial Algorithms
Blocked Jacobi attains the communication lower bound for classical O(n^3) matrix multiplication while a recursive version reaches near-optimal arithmetic and communication cost using fast Strassen-like multiplication; analogous bounds hold for one-sided Jacobi SVD.