View in EDS

A multiple shift -step for structured rank matrices

Saved in:
Bibliographic Details
Title: A multiple shift -step for structured rank matrices
Authors: Vandebril, Raf1, Van Barel, Marc1, Mastronardi, Nicola2
Source: Journal of Computational & Applied Mathematics. Jan2010, Vol. 233 Issue 5, p1326-1344. 19p.
Subjects: Semiseparable matrices, Eigenvalues, Mathematical transformations, Algorithms, Nonsymmetric matrices, Numerical analysis
Abstract: Abstract: Eigenvalue computations for structured rank matrices are the subject of many investigations nowadays. There exist methods for transforming matrices into structured rank form, -algorithms for semiseparable and semiseparable plus diagonal form, methods for reducing structured rank matrices efficiently to Hessenberg form and so forth. Eigenvalue computations for the symmetric case, involving semiseparable and semiseparable plus diagonal matrices have been thoroughly explored. A first attempt for computing the eigenvalues of nonsymmetric matrices via intermediate Hessenberg-like matrices (i.e. a matrix having all subblocks in the lower triangular part of rank at most one) was restricted to the single shift strategy. Unfortunately this leads in general to the use of complex shifts switching thereby from real to complex operations. This paper will explain a general multishift implementation for Hessenberg-like matrices (semiseparable matrices are a special case and hence also admit this approach). Besides a general multishift -step, this will also admit restriction to real computations when computing the eigenvalues of arbitrary real matrices. Details on the implementation are provided as well as numerical experiments proving the viability of the presented approach. [Copyright &y& Elsevier]
Copyright of Journal of Computational & Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 45069460
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A multiple shift -step for structured rank matrices
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Vandebril%2C+Raf%22">Vandebril, Raf</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Van+Barel%2C+Marc%22">Van Barel, Marc</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Mastronardi%2C+Nicola%22">Mastronardi, Nicola</searchLink><relatesTo>2</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Computational+%26+Applied+Mathematics%22">Journal of Computational & Applied Mathematics</searchLink>. Jan2010, Vol. 233 Issue 5, p1326-1344. 19p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Semiseparable+matrices%22">Semiseparable matrices</searchLink><br /><searchLink fieldCode="DE" term="%22Eigenvalues%22">Eigenvalues</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+transformations%22">Mathematical transformations</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Nonsymmetric+matrices%22">Nonsymmetric matrices</searchLink><br /><searchLink fieldCode="DE" term="%22Numerical+analysis%22">Numerical analysis</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract: Eigenvalue computations for structured rank matrices are the subject of many investigations nowadays. There exist methods for transforming matrices into structured rank form, -algorithms for semiseparable and semiseparable plus diagonal form, methods for reducing structured rank matrices efficiently to Hessenberg form and so forth. Eigenvalue computations for the symmetric case, involving semiseparable and semiseparable plus diagonal matrices have been thoroughly explored. A first attempt for computing the eigenvalues of nonsymmetric matrices via intermediate Hessenberg-like matrices (i.e. a matrix having all subblocks in the lower triangular part of rank at most one) was restricted to the single shift strategy. Unfortunately this leads in general to the use of complex shifts switching thereby from real to complex operations. This paper will explain a general multishift implementation for Hessenberg-like matrices (semiseparable matrices are a special case and hence also admit this approach). Besides a general multishift -step, this will also admit restriction to real computations when computing the eigenvalues of arbitrary real matrices. Details on the implementation are provided as well as numerical experiments proving the viability of the presented approach. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Computational & Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=45069460
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.cam.2008.11.017
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 19
        StartPage: 1326
    Subjects:
      – SubjectFull: Semiseparable matrices
        Type: general
      – SubjectFull: Eigenvalues
        Type: general
      – SubjectFull: Mathematical transformations
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Nonsymmetric matrices
        Type: general
      – SubjectFull: Numerical analysis
        Type: general
    Titles:
      – TitleFull: A multiple shift -step for structured rank matrices
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Vandebril, Raf
      – PersonEntity:
          Name:
            NameFull: Van Barel, Marc
      – PersonEntity:
          Name:
            NameFull: Mastronardi, Nicola
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Text: Jan2010
              Type: published
              Y: 2010
          Identifiers:
            – Type: issn-print
              Value: 03770427
          Numbering:
            – Type: volume
              Value: 233
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: Journal of Computational & Applied Mathematics
              Type: main
ResultId 1