Matrices with prescribed eigenvalues and blocks

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Construction of matrices with prescribed singular values and eigenvalues

Two issues concerning the construction of square matrices with prescribed singular values and eigenvalues are addressed. First, a necessary and sufficient condition for the existence of an n × n complex matrix with n given nonnegative numbers as singular values and m(≤ n) given complex numbers to be m of the eigenvalues is determined. This extends the classical result of Weyl and Horn treating ...

متن کامل

A Fast Recursive Algorithm for Constructing Matrices with Prescribed Eigenvalues and Singular Values

The Weyl Horn theorem characterizes a relationship between the eigenvalues and the singular values of an arbitrary matrix Based on that charac terization a fast recursive algorithm is developed to construct numerically a matrix with prescribed eigenvalues and singular values Beside being theoretically interest ing the technique could be employed to create test matrices with desired spectral fea...

متن کامل

A. Horn's result on matrices with prescribed singular values and eigenvalues

We give a new proof of a classical result of A. Horn on the existence of a matrix with prescribed singular values and eigenvalues.

متن کامل

Constructing Symmetric Nonnegative Matrices with Prescribed Eigenvalues by Di erential Equations

We propose solving the inverse eigenvalue problem for symmetric nonnegative matrices by means of a di erential equation. If the given spectrum is feasible, then a symmetric nonnegative matrix can be constructed simply by following the solution curve of the di erential system. The choice of the vector eld is based on the idea of minimizing the distance between the cone of symmetric nonnegative m...

متن کامل

On robust matrix completion with prescribed eigenvalues

Matrix completion with prescribed eigenvalues is a special kind of inverse eigenvalue problems. Thus far, only a handful of specific cases concerning its existence and construction have been studied in the literature. The general problem where the prescribed entries are at arbitrary locations with arbitrary cardinalities proves to be challenging both theoretically and computationally. This pape...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1991

ISSN: 0024-3795

DOI: 10.1016/0024-3795(91)90086-c