Parsing Economic Technology Matrices by Triangular Decomposition
نویسندگان
چکیده
منابع مشابه
Triangular Decomposition of Matrices in a Domain
Deterministic recursive algorithms for the computation of matrix triangular decompositions with permutations like LU and Bruhat decomposition are presented for the case of commutative domains. This decomposition can be considered as a generalization of LU and Bruhat decompositions, because they both may be easily obtained from this triangular decomposition. Algorithms have the same complexity a...
متن کاملTRIANGULAR FUZZY MATRICES
In this paper, some elementary operations on triangular fuzzynumbers (TFNs) are defined. We also define some operations on triangularfuzzy matrices (TFMs) such as trace and triangular fuzzy determinant(TFD). Using elementary operations, some important properties of TFMs arepresented. The concept of adjoints on TFM is discussed and some of theirproperties are. Some special types of TFMs (e.g. pu...
متن کاملDiscovery of factors in binary data triangular decomposition of matrices
We present new methods of decomposition of an n ×m binary matrix I into a product A ∗ B of an n × k binary matrix A and a k×m binary matrix B. These decompositions are alternative to the usual one which is sought in Boolean factor analysis (BFA), where ∗ is a Boolean product of matrices. In the new decompositions, ∗ are the left and the right triangular products of Boolean matrices. In BFA, I i...
متن کاملtriangular fuzzy matrices
in this paper, some elementary operations on triangular fuzzynumbers (tfns) are defined. we also define some operations on triangularfuzzy matrices (tfms) such as trace and triangular fuzzy determinant(tfd). using elementary operations, some important properties of tfms arepresented. the concept of adjoints on tfm is discussed and some of theirproperties are. some special types of tfms (e.g. pu...
متن کاملHierarchical Comprehensive Triangular Decomposition
The concept of comprehensive triangular decomposition (CTD) was first introduced by Chen et al. in their CASC’2007 paper and could be viewed as an analogue of comprehensive Gröbner systems for parametric polynomial systems. The first complete algorithm for computing CTD was also proposed in that paper and implemented in the RegularChains library in Maple. Following our previous work on generic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Economics
سال: 2005
ISSN: 0927-7099,1572-9974
DOI: 10.1007/s10614-005-2973-5