Can I read CR2 A Bit-Complexity Lower Bound on EtoBox?

CR2 A Bit-Complexity Lower Bound by clementemaben2 is a document available to read on EtoBox.

What is CR2 A Bit-Complexity Lower Bound about?

CR2 establishes a bit-complexity lower bound for Class-R algorithms, requiring Ω(n) bits of precision to extract n Jacobi coefficients, regardless of hardware. It formalizes an oracle access model that distinguishes between Class R and Class L, showing that Class R requires exponentially more precision than Lanczos, which operates at constant machine precision. The computational cost of Class R exceeds that of Lanczos for n ≥ 20, with significant implications for numerical methods in spectral extraction.

Author

clementemaben2

Language

EN