The Non-negative Inverse Eigenvalue Problem for Tridiagonal Matrix, Circulant Matrix and Symmetric Matrix

نویسندگان
چکیده

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

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

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

منابع مشابه

Inverse Matrix of Symmetric Circulant Matrix on Skew Field

Introduced the notion of symmetric circulant matrix on skew field, an easy method is given to determine the inverse of symmetric circulant matrix on skew field , with this method , we derived the formula of determine inverse about several special type of symmetric circulant matrix. Mathematics Subject Classification: 05A19, 15A15

متن کامل

An Eigenvalue Symmetric Matrix Contractor

We propose an eigenvalue contractor for symmetric matrices. Given a symmetric interval matrix A and an interval approximation of its eigenvalue sets λ1, . . . ,λn the contractor reduces the entries of A S such that no matrix with eigenvalues in λ1, . . . ,λn is omitted. Our contractor is based on sequentially reducing the entries of A. We discuss properties of the method and demonstrate its per...

متن کامل

A Test Matrix for an Inverse Eigenvalue Problem

We present a real symmetric tridiagonalmatrix of order nwhose eigenvalues are {2k}n−1 k=0 which also satisfies the additional condition that its leading principle submatrix has a uniformly interlaced spectrum, {2l + 1}n−2 l=0 . Thematrix entries are explicit functions of the size n, and so the matrix can be used as a test matrix for eigenproblems, both forward and inverse. An explicit solution ...

متن کامل

Symmetric Eigenvalue Problem: Tridiagonal Reduction

Our ultimate goal in this project is to solve the symmetric eigenvalue problem on symmetric multiprocessor machines more quickly than existing implementations. In order to achieve this goal, we have chosen to implement an improved multithreaded version of a specific phase of the current best algorithmic approach, namely the reduction of a full symmetric matrix to banded form using two-sided ort...

متن کامل

AN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX

The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Physics: Conference Series

سال: 2021

ISSN: 1742-6588,1742-6596

DOI: 10.1088/1742-6596/1848/1/012011