On zero-pattern invariant properties of structured matrices

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

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

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

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

منابع مشابه

Numerical radius and zero pattern of matrices

Let A be an n n complex matrix and r be the maximum size of its principal submatrices with no o¤-diagonal zero entries. Suppose A has zero main diagonal and x is a unit n-vector. Then, letting kAk be the Frobenius norm of A; we show that jhAx;xij (1 1=2r 1=2n) kAk : This inequality is tight within an additive term O n 2 : If the matrix A is Hermitian, then jhAx;xij (1 1=r) kAk : This inequality...

متن کامل

Properties of Zero-Free Transfer Function Matrices

Transfer functions of linear, time-invariant finite-dimensional systems with more outputs than inputs, as arise in factor analysis (for example in econometrics), have, for state-variable descriptions with generic entries in the relevant matrices, no finite zeros. This paper gives a number of characterizations of such systems (and indeed square discrete-time systems with no zeros), using state-v...

متن کامل

Factoring matrices with a tree-structured sparsity pattern

Article history: Received 12 May 2010 Accepted 15 March 2011 Available online xxxx Submitted by V. Mehrmann AMS classification: 65F50 65F05 15A23

متن کامل

Parallelization of Structured Invariant Neural Networks for Shift andRotation Invariant Pattern

In this paper is presented an algorithm for the parallel implementation and data distribution of struc-tured invariant neural networks (SINN) for invariant pattern recognition. Structured invariant neural networks have shown convincing results for the task of shift and rotation invariant pattern recognition. They perform the invariant feature extraction and adaptive classiication simultaneously...

متن کامل

SOLUTION-SET INVARIANT MATRICES AND VECTORS IN FUZZY RELATION INEQUALITIES BASED ON MAX-AGGREGATION FUNCTION COMPOSITION

Fuzzy relation inequalities based on max-F composition are discussed, where F is a binary aggregation on [0,1]. For a fixed fuzzy relation inequalities system $ A circ^{F}textbf{x}leqtextbf{b}$, we characterize all matrices $ A^{'} $ For which the solution set of the system $ A^{' } circ^{F}textbf{x}leqtextbf{b}$ is the same as the original solution set. Similarly, for a fixed matrix $ A $, the...

متن کامل

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


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

ژورنال

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

سال: 2011

ISSN: 0024-3795

DOI: 10.1016/j.laa.2011.02.013