Sciweavers

171 search results - page 11 / 35
» On Chebyshev Polynomials of Matrices
Sort
View
CORR
2011
Springer
213views Education» more  CORR 2011»
12 years 11 months ago
Symbolic computation of weighted Moore-Penrose inverse using partitioning method
We propose a method and algorithm for computing the weighted MoorePenrose inverse of one-variable rational matrices. Also, we develop an algorithm for computing the weighted Moore...
Milan B. Tasic, Predrag S. Stanimirovic, Marko D. ...
APPML
2007
76views more  APPML 2007»
13 years 7 months ago
A distance bound for pseudospectra of matrix polynomials
In this note, we obtain a lower bound for the distance between the pseudospectrum of a matrix polynomial and a given point that lies out of it, generalizing a known result on pseu...
Panayiotis Psarrakos
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
14 years 1 months ago
Probe Matrix Problems: Totally Balanced Matrices
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
David B. Chandler, Jiong Guo, Ton Kloks, Rolf Nied...
AUTOMATICA
2006
70views more  AUTOMATICA 2006»
13 years 7 months ago
A Toeplitz algorithm for polynomial J-spectral factorization
A block Toeplitz algorithm is proposed to perform the J-spectral factorization of a para-Hermitian polynomial matrix. The input matrix can be singular or indefinite, and it can ha...
Juan Carlos Zúñiga, Didier Henrion
AUTOMATICA
2011
12 years 11 months ago
A hierarchy of LMI inner approximations of the set of stable polynomials
Exploiting spectral properties of symmetric banded Toeplitz matrices, we describe simple sufficient conditions for positivity of a trigonometric polynomial formulated as linear ma...
Mustapha Ait Rami, Didier Henrion