Constructing symmetric nonnegative matrices via the fast Fourier transform (Q1827252)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Constructing symmetric nonnegative matrices via the fast Fourier transform
scientific article

    Statements

    Constructing symmetric nonnegative matrices via the fast Fourier transform (English)
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    Given a set of real numbers \(\sigma = \{\lambda_1, \lambda_2, \dots, \lambda_n\}\), the authors propose a new method for constructing a real \(n\times n\) symmetric matrix \(S\) with eigenvalues \(\sigma\). The proposed method proceeds by constructing a real and symmetric circulant matrix \(C\) of double dimension so that its (double) eigenvalues are given by \(\tilde \sigma = \{\mu, \lambda_2, \dots, \lambda_n\}\), where \(\mu = - (\lambda_2 + \cdots + \lambda_n)\). Then, after a simple block diagonalization of \(C\), a symmetric \(n \times n\) matrix \(\tilde S\) having eigenvalues \(\tilde \sigma\) is obtained as one of the diagonal blocks. Finally, the matrix \(S\) is constructed from a certain rank-one correction of \(\tilde S\). In the second part of the paper, the authors prove several sufficient conditions under which their method produces an irreducible nonnegative matrix \(S\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    nonnegative matrix
    0 references
    fast Fourier transform
    0 references
    inverse eigenvalue problem
    0 references
    circulant matrix
    0 references
    stochastic
    0 references
    matrix
    0 references
    symmetric matrix
    0 references
    persymmetric matrix
    0 references