AI & ML
Real-Arithmetic Sketched Eigensolvers for Symmetric Matrices
arXiv cs.NA0 views
arXiv:2610.22261v1 Announce Type: new Abstract: In this work, we develop sketched variants of subspace iteration and TraceMIN, called sSI and sTraceMIN, for real symmetric eigenvalue problems by combining basis whitening with the sketched Rayleigh-Ritz (sRR) procedure. The nonsymmetric projected matrix in sRR may have nonreal eigenpairs, leading to complex arithmetic and additional computational costs. We overcome this difficulty using a real Schur formulation of sRR that keeps the iterations in real arithmetic. We further develop procedures for characteristic subspace selection and convergence monitoring within this formulation. On the theoretical side, we discuss suitable subspace embedding assumptions for sketched eigensolvers that use a fixed sketching matrix throughout the iterations. Under a mild embedding assumption, we establish local convergence results for sSI and sTraceMIN. Numerical experiments demonstrate runtime savings of up to 39% for sSI and 21% for sTraceMIN relative to their standard counterparts on the test problems.
Source:https://arxiv.org/abs/2610.22261PreviousThe ReLU Matrix Decomposition: NP-Hardness, Ill-Posedness, and ReLU-RankNextAn implicit multiscale solver for steady kinetic equations based on wave-particle decomposition
Related posts
Hybrid retrieval with reciprocal rank fusion: notes from a RAG prototype
0dev.to
It is in co-creating, together. As humans do.
0dev.to
C64 Basic Dungeon Crawler: Stairs, Levels and Levelling Up (Part 11)
0Hacker News
Anthropic's internal AI use, at retail prices, now exceeds its employee pay
0Hacker News
Launch HN: Momentic (YC W24) – Agents that catch bugs by using your app
0Hacker News

Behavioral Design Unpacked: Nudges, Funnels & Persuasion | UX Unpacked #3
0dev.to UX