The High Relative Accuracy of Computations with Laplacian Matrices
Resumen: 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.
Idioma: Inglés
DOI: 10.3390/math12223491
Año: 2024
Publicado en: Mathematics 12, 22 (2024), 3491 [10 pp.]
ISSN: 2227-7390

Financiación: info:eu-repo/grantAgreement/ES/DGA/E41-23R
Financiación: info:eu-repo/grantAgreement/ES/MCIU/PID2022-138569NB-I00
Financiación: info:eu-repo/grantAgreement/ES/MCIU/RED2022-134176-T
Tipo y forma: Article (Published version)
Área (Departamento): Área Matemática Aplicada (Dpto. Matemática Aplicada)

Creative Commons You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.


Exportado de SIDERAL (2024-11-22-11:52:43)


Visitas y descargas

Este artículo se encuentra en las siguientes colecciones:
Articles > Artículos por área > Matemática Aplicada



 Record created 2024-11-22, last modified 2024-11-22


Versión publicada:
 PDF
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)