Explicit construction of hyperdominant symmetric matrices with assigned spectrum

DOI10.1016/S0024-3795(96)00161-9MaRDI QIDQ1359175zbMATH OpenFDO

Authors Dragan B. Kandić, Branimir D. Reljin, Petar M. Vasić, Beresford N. Parlett

Publication date 8 January 1998

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0024-3795(96)00161-9

zbMATH Keywords

hyperdominant symmetric matricesinverse eigenvalue problem

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

Review text

A matrix \(A=(a_{ij})\) is upper (lower) Hessenberg if \(a_{ij}=0\) whenever \(i>j+1\) \((j>i+1)\). Orthogonal Hessenberg matrices have a unique representation in the form \(\prod_{i=1}^n P_i\), where the \(P_i\) are plane rotators (Lemma 2). A real matrix is called hyperdominant if it has nonnegative diagonals and nonpositive off diagonals and all row sums are nonnegative. It is shown (Theorem 2) that for any set of \(n>1\) numbers \(0\leq \lambda_1\leq \lambda_2\leq\dots \leq \lambda_n\) there exists a nontrivial hyperdominant matrix with spectrum \(\{\lambda_1,\dots, \lambda_n\}\).

Recommendations

• Possible spectra of totally positive matrices
• REALIZABILITY BY SYMMETRIC NONNEGATIVE MATRICES<A HREF="#tit">*</A>
• scientific article; zbMATH DE number 2155041
• Fast construction of a symmetric nonnegative matrix with a prescribed spectrum

Cites work

• A class of non‐canonic, driving‐point immittance realizations of passive, common‐ground, transformerless, two‐element‐kind RLC networks
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• Construction of a Jacobi matrix from spectral data
• Ein inverses Eigenwertproblem
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3472240 (Why is no real title available?)
• Inverse eigenvalue problems
• Matrices with prescribed characteristic polynomial and a prescribed submatrix. III
• Matrices with prescribed characteristic polynomial and principal blocks. II
• Matrices with Prescribed Characteristic Roots and Diagonal Elements
• Matrices with prescribed eigenvalues and principal submatrices
• Matrices with Prescribed Entries and Characteristic Polynomial
• Matrices with prescribed rows and invariant factors
• Multiplikative inverse Eigenwertprobleme
• On some inverse problems in matrix theory
• The numerically stable reconstruction of Jacobi matrices from spectral data
• The reconstruction of bordered-diagonal and Jacobi matrices from spectral data

Cited in

(2)

• The application of polynomial matrix factorization in active network synthesis
• Explicit solution of the inverse eigenvalue problem of real symmetric matrices and its application to electrical network synthesis

This page was built for publication: Explicit construction of hyperdominant symmetric matrices with assigned spectrum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1359175)