Library

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Linear Algebra with Applications 2 (1995), S. 95-113 
    ISSN: 1070-5325
    Keywords: arrowhead matrix ; band matrix ; inverse eigenvalue problem ; givens rotations ; singular value decomposition ; updating ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: Various plane rotation patterns are presented, which provide stable algorithms for reducing a b-band matrix bordered by p rows and/or columns to (b + p)-band form. These schemes generalize previously presented O(N2) reduction algorithms for matrices of order N, b = 1, and p = 1 to the reduction of more general b-band, p-bordered matrices where b ≥ 1 and p ≥ 1. Moreover, by splitting the matrix into two similarly structured submatrices and chasing nonzeros to the corners in two directions, the newly proposed patterns reduce the number of required rotations and hence the computational cost by one half compared to the other existing one-way chasing algorithms. Symmetric, as well as more general matrices, are considered. An example of the first type is the symmetric arrowhead matrix that arises in solving inverse eigenvalue problems. Examples of the second type are found in updating the singular value decomposition (SVD) and the partial SVD.
    Additional Material: 7 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...