We consider the following inverse spectrum problem for nonnegative matrices: given a set of real numbers ฯ = {ฮป 1 , ฮป 2 , . . . , ฮป n }, find necessary and sufficient conditions for the existence of an n ร n nonnegative matrix A with spectrum ฯ . In particular, by the use of a relevant theorem of Br
Fast construction of a symmetric nonnegative matrix with a prescribed spectrum
โ Scribed by O. Rojo; R. Soto; H. Rojo
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 578 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
โฆ Synopsis
In
this paper, for a prescribed real spectrum, using properties of the circulant matrices and of the symmetric persymmetric matrices, we derive a fast and stable algorithm to construct a symmetric nonnegative matrix which realizes the spectrum. The algorithm is based on the fast Fourier transform.
๐ SIMILAR VOLUMES
A necessary and sufficient condition for an n-tuple of real numbers (~1, ~2 .... , An) to be the spectrum of an oscillatory matrix is that Some methods of constructing a positive symmetric oscillatory matrix with spectrum a ----{A1, A2, ..., An} are suggested for theorems concerning oscillatory mat