Reductions and Triangularizations of Sets of Matrices
نویسنده
چکیده
Families of operators that are triangularizable must necessarily satisfy a number of spectral mapping properties. These necessary conditions are often sufficient as well. This thesis investigates such properties in finite dimensional and infinite dimensional Banach spaces. In addition, we investigate whether approximate spectral mapping conditions (being “close” in some sense) is similarly a sufficient condition.
منابع مشابه
پاسخ ویسفاتین و شاخص مقاومت به انسولین به پروتکلهای مختلف فعالیت مقاومتی
Background: The aim of this study was to compare responses of Visfatin and insulin resistance index to various resistance exercise protocols. Methods: Ten healthy male subjects performed three resistance exercise protocols including maximal strength (three sets of 5 repetition at 85% of 1-RM with 3-min rest between sets), hyperthrophy (three sets of 10 repetition at 70% of 1-RM with 2-min rest...
متن کاملAn Efficient Algorithm for Graph Bisection of Triangularizations
Graph bisection is an elementary problem in graph theory. We consider the best known experimental algorithms and introduce a new algorithm called Longest-Path-Algorithm. Applying this algorithm to the cluster tree generation of hierarchical matrices, arising for example in discretizations of partial equations, we show that this algorithm outperforms previous algorithms. Mathematics Subject Clas...
متن کاملAnalytical aspects of the interval unilateral quadratic matrix equations and their united solution sets
This paper introduces the emph{interval unilateral quadratic matrix equation}, $IUQe$ and attempts to find various analytical results on its AE-solution sets in which $A,B$ and $CCC$ are known real interval matrices, while $X$ is an unknown matrix. These results are derived from a generalization of some results of Shary. We also give sufficient conditions for non-emptiness of some quasi-solutio...
متن کاملA note on approximation conditions, standard triangularizability and a power set topology
The main result of this article is that for collections of entry-wise non-negative matrices the property of possessing a standard triangularization is stable under approximation. The methodology introduced to prove this result allows us to offer quick proofs of the corresponding results of [B. R. Yahaghi, Near triangularizability implies triangularizability, Canad. Math. Bull. 47, (2004), no. 2...
متن کاملFUZZY SOFT MATRIX THEORY AND ITS APPLICATION IN DECISION MAKING
In this work, we define fuzzy soft ($fs$) matrices and theiroperations which are more functional to make theoretical studies inthe $fs$-set theory. We then define products of $fs$-matrices andstudy their properties. We finally construct a $fs$-$max$-$min$decision making method which can be successfully applied to theproblems that contain uncertainties.
متن کامل