共查询到20条相似文献,搜索用时 31 毫秒
1.
《European Journal of Operational Research》1997,97(1):53-62
The problem of derivation of the weights of alternatives from pairwise comparison matrices is long standing. In this paper, Lexicographic Goal Programming (LGP) has been used to find out weights from pairwise inconsistent interval judgment matrices. A number of properties and advantages of LGP as a weight determination technique have been explored. An algorithm for identification and modification of inconsistent bounds is also provided. The proposed technique has been illustrated by means of numerical examples. 相似文献
2.
Viswanath Ramakrishna Yassmin Ansari Fred M. Costa 《Advances in Applied Clifford Algebras》2012,22(1):159-183
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured 4 ×
4 matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete determination
of the Jordan structure of skew-Hamiltonian matrices and the computation of the Cayley transform are given. Some new classes
of matrices are uncovered, whose behaviour insofar as minimal polynomials are concerned, is remarkably similar to those of
skew-Hamiltonian and Hamiltonian matrices. The main technique is the invocation of the associative algebra isomorphism between
the tensor product of the quaternions with themselves and the algebra of real 4 × 4 matrices. Extensions to higher dimensions
via Clifford Algebras are discussed. 相似文献
3.
Oleg Safronov 《Arkiv f?r Matematik》2004,42(2):363-377
We study the spectral properties of Jacobi matrices. By combining Killip's technique [12] with the technique of Killip and
Simon [13] we obtain a result relating the properties of the elements of Jacobi matrices and the corresponding spectral measures.
This theorem is a natural extension of a recent result of Laptev-Naboko-Safronov [17].
The author thanks Sergei Naboko for useful discussions and Barry Simon for pointing out the conjecture. 相似文献
4.
Giorgio Mantica 《Numerische Mathematik》2013,125(4):705-731
We introduce a new set of algorithms to compute the Jacobi matrices associated with invariant measures of infinite iterated function systems, composed of one–dimensional, homogeneous affine maps. We demonstrate their utility in the study of theoretical problems, like the conjectured almost periodicity of such Jacobi matrices, the singularity of the measures, and the logarithmic capacity of their support. Since our technique is based on a reversible transformation between pairs of Jacobi matrices, it can also be applied to solve an inverse/approximation problem. The proposed algorithms are tested in significant, highly sensitive cases: they perform in a stable fashion, and can reliably compute Jacobi matrices of large order. 相似文献
5.
Censoring,Factorizations, and Spectral Analysis for Transition Matrices with Block-Repeating Entries
Zhao Yiqiang Q. Li Wei Braun W. John 《Methodology and Computing in Applied Probability》2003,5(1):35-58
In this paper, we use the Markov chain censoring technique to study infinite state Markov chains whose transition matrices possess block-repeating entries. We demonstrate that a number of important probabilistic measures are invariant under censoring. Informally speaking, these measures involve first passage times or expected numbers of visits to certain levels where other levels are taboo; they are closely related to the so-called fundamental matrix of the Markov chain which is also studied here. Factorization theorems for the characteristic equation of the blocks of the transition matrix are obtained. Necessary and sufficient conditions are derived for such a Markov chain to be positive recurrent, null recurrent, or transient based either on spectral analysis, or on a property of the fundamental matrix. Explicit expressions are obtained for key probabilistic measures, including the stationary probability vector and the fundamental matrix, which could be potentially used to develop various recursive algorithms for computing these measures. 相似文献
6.
The topic of this paper is the typical behavior of the spectral measures of large random matrices drawn from several ensembles of interest, including in particular matrices drawn from Haar measure on the classical Lie groups, random compressions of random Hermitian matrices, and the so-called random sum of two independent random matrices. In each case, we estimate the expected Wasserstein distance from the empirical spectral measure to a deterministic reference measure, and prove a concentration result for that distance. As a consequence we obtain almost sure convergence of the empirical spectral measures in all cases. 相似文献
7.
We introduce in this paper a method to calculate the Hessenberg matrix of a sum of measures from the Hessenberg matrices of the component measures. Our method extends the spectral techniques used by G. Mantica to calculate the Jacobi matrix associated with a sum of measures from the Jacobi matrices of each of the measures.We apply this method to approximate the Hessenberg matrix associated with a self-similar measure and compare it with the result obtained by a former method for self-similar measures which uses a fixed point theorem for moment matrices. Results are given for a series of classical examples of self-similar measures.Finally, we also apply the method introduced in this paper to some examples of sums of (not self-similar) measures obtaining the exact value of the sections of the Hessenberg matrix. 相似文献
8.
Consider the ensemble of real symmetric Toeplitz matrices, each independent entry an i.i.d. random variable chosen from a
fixed probability distribution p of mean 0, variance 1, and finite higher moments. Previous investigations showed that the limiting spectral measure (the
density of normalized eigenvalues) converges weakly and almost surely, independent of p, to a distribution which is almost the standard Gaussian. The deviations from Gaussian behavior can be interpreted as arising
from obstructions to solutions of Diophantine equations. We show that these obstructions vanish if instead one considers real
symmetric palindromic Toeplitz matrices, matrices where the first row is a palindrome. A similar result was previously proved
for a related circulant ensemble through an analysis of the explicit formulas for eigenvalues. By Cauchy’s interlacing property
and the rank inequality, this ensemble has the same limiting spectral distribution as the palindromic Toeplitz matrices; a
consequence of combining the two approaches is a version of the almost sure Central Limit Theorem. Thus our analysis of these
Diophantine equations provides an alternate technique for proving limiting spectral measures for certain ensembles of circulant
matrices.
A. Massey’s current address: Department of Mathematics, UCLA, Los Angeles, CA 90095, USA. e-mail: amassey3102@math.ucla.edu. 相似文献
9.
Yu. N. Belyayev 《Mathematical Notes》2013,94(1-2):177-184
The representation of entire functions of matrices via symmetric polynomials of nth order is obtained. A method of deriving analytic formulas for functions of matrices of second, third, and fourth orders is obtained. Symmetric polynomials are used to construct algorithms for the numerical calculations of entire functions of matrices, in particular, of matrix exponentials, not requiring the determination of the eigenvalues of the matrices. The efficiency of the proposed numerical methods is estimated. 相似文献
10.
We present the unique normal form of a class of 3 dimensional vector fields (BT-zero singularity) with symmetries. The main technique applied to the computation is the combination of a linear grading function and the method of multiple Lie brackets. We introduce new notations for block matrices to simplify the expression of block matrices. The new notations help to prove the non-degeneracy of huge size matrices by an induction technique. 相似文献
11.
C. Escribano A. Giraldo M.A. Sastre E. Torrano 《Journal of Computational and Applied Mathematics》2011,236(1):98-106
In this work, we introduce an algebraic operation between bounded Hessenberg matrices and we analyze some of its properties. We call this operation m-sum and we obtain an expression for it that involves the Cholesky factorization of the corresponding Hermitian positive definite matrices associated with the Hessenberg components.This work extends a method to obtain the Hessenberg matrix of the sum of measures from the Hessenberg matrices of the individual measures, introduced recently by the authors for subnormal matrices, to matrices which are not necessarily subnormal.Moreover, we give some examples and we obtain the explicit formula for the m-sum of a weighted shift. In particular, we construct an interesting example: a subnormal Hessenberg matrix obtained as the m-sum of two not subnormal Hessenberg matrices. 相似文献
12.
A technique for maintaining the positive definiteness of the matrices in the quasi-Newton version of the SQP algorithm is proposed. In our algorithm, matrices approximating the Hessian of the augmented Lagrangian are updated. The positive definiteness of these matrices in the space tangent to the constraint manifold is ensured by a so-called piecewise line-search technique, while their positive definiteness in a complementary subspace is obtained by setting the augmentation parameter. In our experiment, the combination of these two ideas leads to a new algorithm that turns out to be more robust and often improves the results obtained with other approaches. 相似文献
13.
Jeffrey S. Geronimo Evans M. Harrell II Walter Van Assche 《Constructive Approximation》1988,4(1):403-417
We consider the abstract measures, known as thedensity- of- states measures, associated with the asymptotic distribution of eigenvalues of infinite banded Hermitian matrices. Two widely used definitions of these measures are shown to be equivalent, even in the unbounded case, and we prove that the density of states is invariant under certain, possibly unbounded, perturbations. Also considered are measures associated with the asymptotic distribution of eigenvalues of rescaled unbounded matrices. These measures are associated with the so-called contracted spectrum when the matrices are tridiagonal. Finally, we produce several examples clarifying the nature of the density of states.Communicated by Paul Nevai. 相似文献
14.
Theo K. Dijkstra 《Central European Journal of Operations Research》2013,21(1):103-123
We study properties of weight extraction methods for pairwise comparison matrices that minimize suitable measures of inconsistency, ‘average error gravity’ measures, including one that leads to the geometric row means. The measures share essential global properties with the AHP inconsistency measure. By embedding the geometric mean in a larger class of methods we shed light on the choice between it and its traditional AHP competitor, the principal right eigenvector. We also suggest how to assess the extent of inconsistency by developing an alternative to the Random Consistency Index, which is not based on random comparison matrices, but based on judgemental error distributions. We define and discuss natural invariance requirements and show that the minimizers of average error gravity generally satisfy them, except a requirement regarding the order in which matrices and weights are synthesized. Only the geometric row mean satisfies this requirement also. For weight extraction we recommend the geometric mean. 相似文献
15.
16.
线性时不变系统两种描述的等价性 总被引:1,自引:0,他引:1
自从Kalman提出了用状态空间方法描述系统后,Rosenbrock与Wolovich等又提出了用微分算子描述系统的方法。这两种描述方法,利用各自表示方法的特点,在多变量系统理论的研究上,都取得了很大的进展。 本文利用Yokoyama标准形与多项式矩阵之间的关系,把上述两种描述联系起来,给出了它们之间等价的转换形式。这样就可以把在一种描述方法上得到的结果,等价地搬到另一种描述方法的系统上去。 相似文献
17.
Multilinear techniques are used to characterize unitary matrices in terms of a generalized numerical range. This characterization is then applied to analyze the structure of all linear operators on matrices which preserve this numerical range. The results generalize V. J. Pellegrini's determination of all linear operators preserving the classical numerical range. 相似文献
18.
Neng-Pin Lu 《The Journal of mathematical sociology》2019,43(3):164-178
Principal eigenvectors of adjacency matrices are often adopted as measures of centrality for a graph or digraph. However, previous principal-eigenvector-like measures for a digraph usually consider only the strongly connected component whose adjacency submatrix has the largest eigenvalue. In this paper, for each and every strongly connected component in a digraph, we add weights to diagonal elements of its member nodes in the adjacency matrix such that the modified matrix will have the new unique largest eigenvalue and corresponding principal eigenvectors. Consequently, we use the new principal eigenvectors of the modified matrices, based on different strongly connected components, not only to compose centrality measures but also to identify bowtie structures for a digraph. 相似文献
19.
In the general case of multilevel Toeplitz matrices, we recently proved that any multilevel circulant preconditioner is not superlinear (a cluster it may provide cannot be proper). The proof was based on the concept of quasi-equimodular matrices, although this concept does not apply, for example, to the sine-transform matrices. In this paper, with a new concept of partially equimodular matrices, we cover all trigonometric matrix algebras widely used in the literature. We propose a technique for proving the non-superlinearity of certain frequently used preconditioners for some representative sample multilevel matrices. At the same time, we show that these preconditioners are, in a certain sense, the best among the sublinear preconditioners (with only a general cluster) for multilevel Toeplitz matrices.
20.
We study limit distributions of independent random matrices as well as limit joint distributions of their blocks under normalized partial traces composed with classical expectation. In particular, we are concerned with the ensemble of symmetric blocks of independent Hermitian random matrices which are asymptotically free, asymptotically free from diagonal deterministic matrices, and whose norms are uniformly bounded almost surely. This class contains symmetric blocks of unitarily invariant Hermitian random matrices whose asymptotic distributions are compactly supported probability measures on the real line. Our approach is based on the concept of matricial freeness which is a generalization of freeness in free probability. We show that the associated matricially free Gaussian operators provide a unified framework for studying the limit distributions of sums and products of independent rectangular random matrices, including non-Hermitian Gaussian matrices and matrices of Wishart type. 相似文献