Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal (Articolo in rivista)

Type
Label
  • Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal (Articolo in rivista) (literal)
Anno
  • 2006-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1007/s00211-005-0665-7 (literal)
Alternative label
  • Raf Vandebril; Ellen Van Camp; Marc Van Barel; Nicola Mastronardi (2006)
    Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal
    in Numerische Mathematik
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Raf Vandebril; Ellen Van Camp; Marc Van Barel; Nicola Mastronardi (literal)
Pagina inizio
  • 709 (literal)
Pagina fine
  • 726 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 102 (literal)
Rivista
Note
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A B-3001 Leuven-Heverlee, Belgio; Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A B-3001 Leuven-Heverlee, Belgio; Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A B-3001 Leuven-Heverlee, Belgio; Istituto per le Applicazioni del Calcolo, CNR, via Amendola 122/D, 70126, Bari, Italy (literal)
Titolo
  • Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal (literal)
Abstract
  • In this paper we describe an orthogonal similarity transformation for transforming arbitrary symmetric matrices into a diagonal-plus-semiseparable matrix, where we can freely choose the diagonal. Very recently an algorithm was proposed for transforming arbitrary symmetric matrices into similar semiseparable ones. This reduction is strongly connected to the reduction to tridiagonal form. The class of semiseparable matrices can be considered as a subclass of the diagonalplus- semiseparable matrices. Therefore we can interpret the proposed algorithm here as an extension of the reduction to semiseparable form. A numerical experiment is performed comparing thereby the accuracy of this reduction algorithm with respect to the accuracy of the traditional reduction to tridiagonal form, and the reduction to semiseparable form. The experiment indicates that all three reduction algorithms are equally accurate. Moreover it is shown in the experiments that asymptotically all the three approaches have the same complexity, i.e. that they have the same factor preceding the nxnxn term in the computational complexity. Finally we illustrate that special choices of the diagonal create a specific convergence behavior. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Autore CNR di
Prodotto
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Insieme di parole chiave di
data.CNR.it