PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
July 5, 2026ACM Transactions on Graphics0 citationsOpen Access

Efficient Multiscale Lanczos Eigenpair Extraction

View Full Paper
TBTheo BrauneJDJérémie DumasJTJean‐Marc Thiery

Key Points

  • The aim is to enhance the convergence speed and robustness of eigenpair extractions using an improved Lanczos method.
  • Introduced a multigrid extension to the implicitly restarted Lanczos method.
  • Applied the method to various large-scale problems in geometry processing and graphics.
  • Demonstrated significant improvements in convergence speed compared to traditional methods.
  • Showed enhanced robustness in eigenpair extraction across tested problems.

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 AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Braune et al. (2026) studied this question.

synapsesocial.com/papers/6a49f411f5d1d45b287ffd53https://doi.org/10.1145/3811367
Ask AI
Helpful
Bookmark
Share
View Full Paper