O(n2) reduction algorithms for the construction of a band matrix from spectral data

Thumbnail Image
Files
amman_1991.pdf (528.89 KB)
Authors
Ammar, Gregory S.
Gragg, William B.
Subjects
band matrix
inverse eigenvalue problem
Given rotations
Advisors
Date of Issue
1991
Date
1991
Publisher
Monterey, California. Naval Postgraduate School
Language
Abstract
Efficient rotation patterns are presented that provide stable O(n2) algorithms for the construction Of a real symmetric band matrix having specified eigenvalues and first p components of its normalized eigenvectors. These methods can also be used in the second phase of the construction of a band matrix from the interlacing eigenvalues as described in Linear Algebra Appl., 40 1981 ), pp. 79-87 ]. Previously presented algorithms for these reductions that use elementary orthogonal similarity transformations require O(n3) arithmetic operations.
Type
Article
Description
URI
https://hdl.handle.net/10945/41066
Series/Report No
Department
Mathematics
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
SIAM J. MATRIX ANAL. APPL. Voi. 12, No. 3, pp. 426-431, July 1991
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections
Publications