A framework maps Boltzmann-weighted lattice configurations to correlated random matrix ensembles via real-space to momentum-space variance profiles, deriving spectral moments and resolvent densities benchmarked on Ising and Edwards-Anderson models.
Sobczyk, Deterministic complexity analysis of hermi- tian eigenproblems (2025), arXiv:2410.21550 [cs.DS]
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
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.
citing papers explorer
-
Random Matrix Spectra from Boltzmann-Weighted Lattice Ensembles
A framework maps Boltzmann-weighted lattice configurations to correlated random matrix ensembles via real-space to momentum-space variance profiles, deriving spectral moments and resolvent densities benchmarked on Ising and Edwards-Anderson models.
-
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.