17 citations · 22 across the 3 of their papers we have counts for
3 papers
math.NA2023
Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm
Lars Eldén
The problem of multiway partitioning of an undirected graph is considered. A spectral method is used, where the k > 2 largest eigenvalues of the normalized adjacency matrix (equiva…
math.NA2010★ 5 cited
Krylov-Type Methods for Tensor Computations
Berkant Savas, Lars Eldén
Several Krylov-type procedures are introduced that generalize matrix Krylov methods for tensor computations. They are denoted minimal Krylov recursion, maximal Krylov recursion, co…
math.RA2004★ 17 cited
A Note on the Eigenvalues of the Google Matrix
Lars Eldén
The Google matrix is a positive, column-stochastic matrix that is used to compute the pagerank of all the web pages on the Internet: the eigenvector corresponding to the eigenvalue…