The High Relative Accuracy of Computations with Laplacian Matrices
Year: 2024
Type: article
Abstract: This paper provides an efficient method to compute an LDU decomposition of the Laplacian matrix of a connected graph with high relative accuracy. Several applications of this method are presented. In particular, it can be applied to efficiently compute the eigenvalues of the mentioned Laplacian matrix. Moreover, the method can be extended to graphs with weighted edges.
Source: Mathematics
DOI: 10.3390/math12223491
Authors: Héctor Orera, Juan Manuel Peña
Institution: Universidad de Zaragoza
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,955
OpenAlex ID: W4404163355
