[PDF] Top 20 vol17_pp508-517. 140KB Jun 04 2011 12:06:01 AM
Has 10000 "vol17_pp508-517. 140KB Jun 04 2011 12:06:01 AM" found on our website. Below are the top 20 most common "vol17_pp508-517. 140KB Jun 04 2011 12:06:01 AM".
vol17_pp508-517. 140KB Jun 04 2011 12:06:01 AM
... . Then the right hand side of (1.3) is 1, but the only real (A, B)-neutral subspace is the zero subspace. Of course, in accordance with [12] there exist complex, as well as quater- nionic, 1-dimensional (A, ... Lihat dokumen lengkap
10
vol17_pp54-61. 116KB Jun 04 2011 12:06:01 AM
... Letλ1 be the largest eigenvalue of the adjacency matrix of a graph Gon nvertices with maximum degree ∆.. Spectral radius, Non-regular graph,λ1-extremal graph, Maximum degree.[r] ... Lihat dokumen lengkap
8
vol17_pp651-698. 705KB Jun 04 2011 12:06:01 AM
... For the first of two main parts of the proof, suppose K has rank 1. Since the rank is invariant under real equivalence, we onlyneed to inspect the list of canonical forms to find pairs (E, F) so that E + iF is a rank 1 ... Lihat dokumen lengkap
48
vol17_pp597-615. 171KB Jun 04 2011 12:06:01 AM
... Multiplicative maps, Jordan maps, Jordan triple maps, Elementary maps, Trian-gular algebras, Standard operator algebras, Additivity.. Introduction and Preliminaries.[r] ... Lihat dokumen lengkap
19
vol17_pp577-596. 177KB Jun 04 2011 12:06:01 AM
... has a long history. In the antic Greece, Archimedes (287BC − 212BC) obtained expressions for n = 1 and n = 2, andduring the apex of Arab mathematical sci- ence, in the eleven century, Al-Haytham (965-1038), known in the ... Lihat dokumen lengkap
20
vol17_pp543-576. 274KB Jun 04 2011 12:06:01 AM
... Furthermore, when one is faced with matrices whose entries obey a recursive relation, inversion can be complicated. Such matrices have been studied e.g., in [1], [6], [8], [10], [11], [12] and [14]. The research ... Lihat dokumen lengkap
34
vol17_pp532-542. 113KB Jun 04 2011 12:06:01 AM
... A nonsingular triangular n×n totally positive matrices can be regarded as a strictly n−1,0- or 0, n−1-banded matrix except that the strictness is applied only to the 0-band.. We state th[r] ... Lihat dokumen lengkap
11
vol17_pp518-531. 167KB Jun 04 2011 12:06:01 AM
... Linearizations of regular matrix polynomials have been widely used in contexts like the Polynomial Eigenvalue Problem (see [1, 9, 10, 12, 13, 15] and the references therein) or the solution of Linear Differential ... Lihat dokumen lengkap
14
vol17_pp493-507. 191KB Jun 04 2011 12:06:01 AM
... By Proposition 4.8 case s = 1, strong FC rings are precisely those rings for which any system of residual rank ≥ r satisfies the decomposition weak K1 r, which simply says that we can e[r] ... Lihat dokumen lengkap
15
vol17_pp487-492. 104KB Jun 04 2011 12:06:01 AM
... Two of them are In this paper, after introducing a new inclusion region for eigenvalues of a matrix in Section 2, we present a parameterized lower bound for the smallest singular value [r] ... Lihat dokumen lengkap
6
vol17_pp473-486. 164KB Jun 04 2011 12:06:01 AM
... 1. Introduction. It is well-known that Toeplitz and block Toeplitz matrices are closely related to a discrete system of equations, namely to Szeg¨o recurrence. This connection have been actively studied during the last ... Lihat dokumen lengkap
14
vol17_pp458-472. 175KB Jun 04 2011 12:06:01 AM
... in addition, every diagonal entry ofU∗PλU is a polynomial with exactlymdistinct zeros, or equivalently, all the eigenvalues ofPλ are semisimple, thenPλ is called normal.. Clearly, the [r] ... Lihat dokumen lengkap
15
vol17_pp62-87. 254KB Jun 04 2011 12:06:01 AM
... Abstract. Using the technique from [12], sharp quadratic convergence bounds for scaled Jacobi iterates are derived. The iterates are generated by any serial Jacobi method when applied to a general complex ... Lihat dokumen lengkap
26
vol17_pp48-53. 100KB Jun 04 2011 12:06:01 AM
... This is a remarkable result, since it transforms a nonconvex quadratic integer problem equivalently into a linear problem over a convex cone, i.e., a convex optimization problem which ha[r] ... Lihat dokumen lengkap
6
vol8_pp115-127. 140KB Jun 04 2011 12:06:16 AM
... We may find the determinant, rank, inverse, eigenvalues and eigenvectors, and so on, for the matrix M from (4.7). Some other applications of (4.1) to quaternion matrices were presented in Tian [12]. From (3.8) we ... Lihat dokumen lengkap
13
vol18_pp108-116. 140KB Jun 04 2011 12:06:02 AM
... Motivated by this situation, in this paper we consider the generalized eigenvalue problem both for rectangular and for square constant coefficient matrices associated with autonomous sin[r] ... Lihat dokumen lengkap
9
vol21p142-153. 140KB Jun 04 2011 12:06:11 AM
... By transforming the original system through the computation of Gr¨obner bases of appropriate elimination ideals, we are able to classify all solutions of 1.1 whenn= 2.. Similar computa[r] ... Lihat dokumen lengkap
12
getdoc7850. 140KB Jun 04 2011 12:04:32 AM
... The process of random point measures on the reduced trees Mn,i ⌊t n+spn⌋,Rn,is∈R converges weakly in the sense of finite dimensional distributions as n→ ∞towards the mixed process of [r] ... Lihat dokumen lengkap
10
getdoc11c3. 134KB Jun 04 2011 12:04:06 AM
... Fermat, 45 Avenue des Etats Unis, 78035 Versailles Cedex France email: [email protected] SubmittedSeptember 22, 2010, accepted in final formDecember 20, 2011 AMS 2000 Subject classifica[r] ... Lihat dokumen lengkap
8
getdoc10cd. 254KB Jun 04 2011 12:04:06 AM
... gradient. It is represented as a sum of Wiener chaos of order at most two. Widely known Wiener functionals of second order are the square of the L 2 -norm on an interval of the Wiener process, L´evy’s stochastic area, ... Lihat dokumen lengkap
30
Related subjects