Efficient Multiscale Lanczos Eigenpair Extraction
Theo Braune, Jérémie Dumas, Jean-Marc Thiery
2026Year
Abstract
Eigenpair extractions are crucial for various applications in geometry processing and graphics. State of the Art libraries like ARPACK or Spectra rely on the implicitly restarted Lanczos iteration to extract eigenpairs efficiently. However for some large scale problems they lack convergence speed and robustness. In this paper we present a simple multigrid extension to accelerate the convergence and robustness of the implicitly restarted Lanczos method, and we demonstrate the efficiency of our method on a variety of problems commonly found in geometry processing and graphics.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Related papers
- Multiscale cholesky preconditioning for ill-conditioned problemsJiong Chen, Florian Schäfer, Jin Huang, Mathieu DesbrunSIGGRAPH 2021 · 29 citations
- Surface multigrid via intrinsic prolongationHsueh-Ti Derek Liu, Jiayi Eris Zhang, Mirela Ben-Chen, Alec JacobsonSIGGRAPH 2021 · 51 citations
- Numerical Performance of the Implicitly Restarted Arnoldi Method in OFP8, Bfloat16, Posit, and Takum ArithmeticsLaslo Hunhold, James Quinlan, Stefan WesnerSC 2025 · 2 citations
- CPU- and GPU-initiated Communication Strategies for Conjugate Gradient Methods on Large GPU ClustersJames D. Trotter, Sinan Ekmekçibasi, Dogan Sagbili, Johannes Langguth et al.SC 2025 · 2 citations
- Sparsified Preconditioned Conjugate Gradient Solver on GPUsDa Ma, Khalid Ahmad, Kazem Cheshmi, Hari Sundar et al.SC 2025 · 1 citation
