An orthogonal similarity reduction of a matrix into semiseparable form (Articolo in rivista)

Type
Label
  • An orthogonal similarity reduction of a matrix into semiseparable form (Articolo in rivista) (literal)
Anno
  • 2005-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1137/S0895479803428229 (literal)
Alternative label
  • Marc Van Barel; Raf Vandebril; Nicola Mastronardi (2005)
    An orthogonal similarity reduction of a matrix into semiseparable form
    in SIAM journal on matrix analysis and applications (Print)
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Marc Van Barel; Raf Vandebril; Nicola Mastronardi (literal)
Pagina inizio
  • 176 (literal)
Pagina fine
  • 197 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 27 (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; Istituto per le Applicazioni del Calcolo \"M. Picone,\" sede di Bari, Consiglio Nazionale delle Ricerche,Via G. Amendola, 122/I, I-70126 Bari, Italia (literal)
Titolo
  • An orthogonal similarity reduction of a matrix into semiseparable form (literal)
Abstract
  • An algorithm to reduce a symmetric matrix to a similar semiseparable one of semiseparability rank 1, using orthogonal similarity transformations, is proposed in this paper. It is shown that, while running to completion, the proposed algorithm gives information on the spectrum of the similar initial matrix. In fact, the proposed algorithm shares the same properties of the Lanczos method and the Householder reduction to tridiagonal form. Furthermore, at each iteration, the proposed algorithm performs a step of the QR method without shift to a principal submatrix to retrieve the semiseparable structure. The latter step can be considered a kind of subspace-like iteration method, where the size of the subspace increases by one dimension at each step of the algorithm. Hence, when during the execution of the algorithm the Ritz values approximate the dominant eigenvalues closely enough, diagonal blocks will appear in the semiseparable part where the norm of the corresponding subdiagonal blocks goes to zero in the subsequent iteration steps, depending on the corresponding gap between the eigenvalues. A numerical experiment is included, illustrating the properties of the new algorithm. (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