A note on an inverse eigenproblem for band matrices
Loading...
Authors
Gragg, William B.
Ammar, Gregory S.
Subjects
Band matrix, inverse eigenvalue problem, Givens rotations
Advisors
Date of Issue
1988-11
Date
1988-11
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
An efficient rotation pattern is presented that can be used in the construction of a band matrix from spectral data. The procedure allows for the stable O (n-sq) construction of a real symmetric band matrix having specified eigenvalues and first p components of its normalized eigenvectors. The procedure can also be used in the second phase of the construction of a band matrix from the interlacing eigenvalues. Previously presented algorithms for these reductions using elementary orthogonal similarity transformations require O (n- cubed) arithmetic operations. Keywords: Band matrix, Inverse eigenvalue problem, Givens rotations. (jhd
Type
Technical Report
Description
Series/Report No
Department
Mathematics
Identifiers
NPS Report Number
NPS-53-89-004
Sponsors
Naval Postgraduate School and the
National Science Foundation, Washington, D.C.
Funder
O&MN, direct funding
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.