[PDF] Top 20 vol11_pp01-15. 186KB Jun 04 2011 12:05:51 AM

... The Kre˘ın-Langer integral representation of a matrix-valued generalized Nevanlinna function arises in problems of spectral theory and interpolation.. A version of this formula which is [r] ... Lihat dokumen lengkap

... In [5], the problem of finding the rational invariants of bilinear maps from a complex vector spaceV of dimensionnto a complex vector spaceW of dimensionk, on which the groupGLn,C×GLk,[r] ... Lihat dokumen lengkap

... From this result a formula is derived to the number of spanning trees in a nested interval graph; this is a generalization of the Cayley formula.. Spectrum, Interval graph, Number of spa[r] ... Lihat dokumen lengkap

... One of the keys to our proof of the main theorem is Lemma 2.2 which implies that no 3×3 submatrix of a 5×5, full ray-nonsingular matrix is strongly balanceable.. In this section, we give[r] ... Lihat dokumen lengkap

... The first result on linear preservers is due to Frobenius [1] who studied linear transformations on matrix algebras preserving the determinant.. Let MnFbe the vector space of n×n matrice[r] ... Lihat dokumen lengkap

... It is well known that several classes of matrices X in indefinite inner product spaces allow extensions of invariant H-nonnegative subspaces to invariant maximal H-nonnegative subspace[r] ... Lihat dokumen lengkap

... Ifthe regular problem does have a solution, we can maximize each ofthe variables xj in turn for the regular problem.. Ifthere is a variablexjfor which maxxj = 0, then the strict probl[r] ... Lihat dokumen lengkap

... LetT be an irreducible stochastic matrix of ordern, and suppose that g is the length of the shortest cycle in∆Tthat goes through vertex j and has at least two vertices.. Digraphs for wh[r] ... Lihat dokumen lengkap

... We shall now consider the structured condition numbers when the underlying scalar product is a bilinear form in section 3.1, and when the scalar product is a sesquilinear form in section[r] ... Lihat dokumen lengkap

... 1. Introduction. For several decades, matrix inversion has been described in terms of digraph properties; see for example [4, 6, 12, 13] and references therein. This paper focuses on a special class of matrices, ... Lihat dokumen lengkap

... The problem of determining the multiplicities of an eigenvalue of a product of companion matrices appears in the study of Random Walks in a Periodic Environment RWPE, a type of Markov Ch[r] ... Lihat dokumen lengkap

... Using methods of higher algebraicK-theory, van der Kallen proved thatSLnF[x] does not have bounded word length with respect to elementary matrices if the fieldF has infinite transcenden[r] ... Lihat dokumen lengkap

... [11] E. Kaltofen and B.D. Saunders. On Wiedemann’s method of solving sparse linear systems. In Proceedings of Applied Algebraic Algorithms and Error Correcting Codes (New Orleans, LA), 29–38. Lecture Notes in Computer ... Lihat dokumen lengkap

... For such matrices this improves on a bound found in the work of Doerr [Linear discrepancy of basic totally unimodular matrices, The Electronic Journal of Combinatorics, 7:Research Paper [r] ... Lihat dokumen lengkap

... In simple linear regression on [ − 1 , 1] with uncorrelated observations, the D-optimal design can be achieved by taking 50% of observations at 1 and − 1, re- spectively, in any order.For example, if there are 10 ... Lihat dokumen lengkap

... The spectral version of the Nevanlinna-Pick problem asks for equivalent conditions to the existence of a bounded analytic functionF :D→MNC which interpolates the data, with spectral radi[r] ... Lihat dokumen lengkap

... In Section 3 it is shown that the same situation holds for the nonnegative P0-matrix completion problem, that is, a pattern for n×n matrices that includes all diagonal positions whose pa[r] ... Lihat dokumen lengkap

... Nonnegative matrices, Diagonal similarity scaling, Diagonal equivalence scaling, Digraph of a matrix, Cyclic product, Cycle mean, Lattice ordered commutative groups.. AMS subject classif[r] ... Lihat dokumen lengkap

... (e.g. random k-cycles), a combinatorial treatment analogous to the classical analysis of the Erd˝ os- Renyi random graph is possible, leading to exact formulae. In cases where the conjugacy class is arbitrary, our method ... Lihat dokumen lengkap

... It is natural to ask what the connection is between symmetries in geometry and for differential equations. After all, differential equations “live” on manifolds. More precisely, we would like to relate the symmetry ... Lihat dokumen lengkap