We study the extreme singular values of incidence graph matrices, obtaining lower and upper estimates that are asymptotically tight. This analysis is then used for obtaining estimates on the spectral condition number of some weighted graph matrices. A short discussion on possible preconditioning strategies within interior-point methods for network flow problems is also included.
Spectral Analysis of (Sequences of) Graph Matrices
FRANGIONI, ANTONIO;
2001-01-01
Abstract
We study the extreme singular values of incidence graph matrices, obtaining lower and upper estimates that are asymptotically tight. This analysis is then used for obtaining estimates on the spectral condition number of some weighted graph matrices. A short discussion on possible preconditioning strategies within interior-point methods for network flow problems is also included.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
GrphMtrx.pdf
accesso aperto
Descrizione: Versione finale
Tipologia:
Versione finale editoriale
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
147.78 kB
Formato
Adobe PDF
|
147.78 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
