Score: 0
Stable Computation of Laplacian Eigenfunctions Corresponding to Clustered Eigenvalues
Published: June 9, 2025 |
arXiv ID: 2506.07340v1
By: Ryoki Endo, Xuefeng Liu
Potential Business Impact:
Finds shapes of things when they are very close together.
Business Areas:
Quantum Computing
Science and Engineering
The accurate computation of eigenfunctions corresponding to tightly clustered Laplacian eigenvalues remains an extremely difficult problem. In this paper, using the shape difference quotient of eigenvalues, we propose a stable computation method for the eigenfunctions of clustered eigenvalues caused by domain perturbation.
Similar Papers
87%
Cluster Synchronization via Graph Laplacian Eigenvectors
Social and Information Networks
Helps groups of things sync up better.
23 Mar 2025
0
86%
On empirical Hodge Laplacians under the manifold hypothesis
Statistics Theory
Improves how computers understand shapes in data.
4 Apr 2025
0
86%
Matrix nearness problems and eigenvalue optimization
Numerical Analysis
Makes computer math problems easier to solve.
18 Mar 2025
0
Country of Origin
🇯🇵
Japan
Page Count
9 pages
Category
Mathematics:
Spectral Theory