共查询到20条相似文献,搜索用时 31 毫秒
1.
M. Neumann 《Linear algebra and its applications》1976,14(1):41-51
In this paper iterative schemes for approximating a solution to a rectangular but consistent linear system Ax = b are studied. Let A?Cm × nr. The splitting A = M ? N is called subproper if R(A) ? R(M) and . Consider the iteration . We characterize the convergence of this scheme to a solution of the linear system. When A?Rm×nr, monotonicity and the concept of subproper regular splitting are used to determine a necessary and a sufficient condition for the scheme to converge to a solution. 相似文献
2.
For a given pair such that A is cyclic and b is a cyclic generator (with respect to A) of , it is shown that for every nonnegative integer m we can find a nonnegative integer t and a sequence ,so that a the zeros of the rational function det P(z), where f, lie in the open unit disc in the complex plane. The result is directly applicable to a stabilizability problem for linear systems with a time delay in control action. 相似文献
3.
Rudolf Wegmann 《Journal of Mathematical Analysis and Applications》1976,56(1):113-132
For an n × n Hermitean matrix A with eigenvalues λ1, …, λn the eigenvalue-distribution is defined by · number {λi: λi ? x} for all real x. Let An for n = 1, 2, … be an n × n matrix, whose entries aik are for i, k = 1, …, n independent complex random variables on a probability space (Ω, , p) with the same distribution Fa. Suppose that all moments | a | k, k = 1, 2, … are finite, a=0 and | a | 2. Let with complex numbers θσ and finite products Pσ of factors A and (= Hermitean conjugate) be a function which assigns to each matrix A an Hermitean matrix M(A). The following limit theorem is proved: There exists a distribution function G0(x) = G1x) + G2(x), where G1 is a step function and G2 is absolutely continuous, such that with probability converges to G0(x) as n → ∞ for all continuity points x of G0. The density g of G2 vanishes outside a finite interval. There are only finitely many jumps of G1. Both, G1 and G2, can explicitly be expressed by means of a certain algebraic function f, which is determined by equations, which can easily be derived from the special form of M(A). This result is analogous to Wigner's semicircle theorem for symmetric random matrices (E. P. Wigner, Random matrices in physics, SIAM Review9 (1967), 1–23). The examples , , , r = 1, 2, …, are discussed in more detail. Some inequalities for random matrices are derived. It turns out that with probability 1 the sharpened form of Schur's inequality for the eigenvalues λi(n) of An holds. Consequently random matrices do not tend to be normal matrices for large n. 相似文献
4.
Let and denote respectively the space of n×n complex matrices and the real space of n×n hermitian matrices. Let p,q,n be positive integers such that p?q?n. For , the (p,q)-numerical range of A is the set , where Cp(X) is the pth compound matrix of X, and Jq is the matrix Iq?On-q. Let denote n or . The problem of determining all linear operators T: → such that is treated in this paper. 相似文献
5.
Let be the Clifford algebra constructed over a quadratic n-dimensional real vector space with orthogonal basis {e1,…, en}, and e0 be the identity of . Furthermore, let Mk(Ω;) be the set of -valued functions defined in an open subset Ω of Rm+1 (1 ? m ? n) which satisfy Dkf = 0 in Ω, where D is the generalized Cauchy-Riemann operator and k? N. The aim of this paper is to characterize the dual and bidual of Mk(Ω;). It is proved that, if Mk(Ω;) is provided with the topology of uniform compact convergence, then its strong dual is topologically isomorphic to an inductive limit space of Fréchet modules, which in its turn admits Mk(Ω;) as its dual. In this way, classical results about the spaces of holomorphic functions and analytic functionals are generalized. 相似文献
6.
Let (m?n) denote the linear space of all m × n complex or real matrices according as = or . Let c=(c1,…,cm)≠0 be such that c1???cm?0. The c-spectral norm of a matrix A?m×n is the quantity . where σ1(A)???σm(A) are the singular values of A. Let d=(d1,…,dm)≠0, where d1???dm?0. We consider the linear isometries between the normed spaces and , and prove that they are dual transformations of the linear operators which map (d) onto (c), where . 相似文献
7.
If θ is a norm on Cn, then the mapping from Mn(C) (=Cn × n) into R is called the logarithmic derivative induced by the vector norm θ. In this paper we generalize this concept to a mapping γ from Mn(C) into Mk(R), where k ? n. Denoting by α(B) the spectral abscissa of a square matrix B (the largest of the real parts of the eigenvalues), we show, in particular, that α(A) ?α(γ(A)). As a byproduct we obtain simple sufficient conditions for the stability of a matrix. 相似文献
8.
Kevin S. McCurley 《Journal of Number Theory》1984,19(1):7-32
Let k(S) be the product of the ?(k) Dirichlet L-functions formed with characters modulo k. We prove the existence of explicit numerical zero-free regions for k(S). The first result is that k(S) has at most a single zero in the region {, where R = 9.645908801 and M = max {k, k |t|, 10}. The only possible zero in this region is a simple real zero arising from an L-function formed with a real non-principal character. The second result is that if χ1 and χ2 are distinct real primitive characters modulo k1 and k2, respectively, and if β1 is a zero of L(s, χi), i = 1, 2, then min , where , and . 相似文献
9.
P. Révész 《Stochastic Processes and their Applications》1983,15(2):169-179
Let U1, U2,… be a sequence of independent, uniform (0, 1) r.v.'s and let R1, R2,… be the lengths of increasing runs of {Ui}, i.e., X1=R1=inf{i:Ui+1<Ui},…, Xn=R1+R2+?+Rn=inf{i:i>Xn?1,Ui+1<Ui}. The first theorem states that the sequence can be approximated by a Wiener process in strong sense.Let τ(n) be the largest integer for which R1+R2+?+Rτ(n)?n, and . Here Mn is the length of the longest increasing block. A strong theorem is given to characterize the limit behaviour of Mn.The limit distribution of the lengths of increasing runs is our third problem. 相似文献
10.
Raul Cordovil 《Journal of Combinatorial Theory, Series A》1985,38(1):38-47
Let E be a finite set of points in d. Then {A, E ? A} is a non-Radon partition of E iff there is a hyperplane H separating A strictly from E?A. Or equivalently iff is an acyclic reorientation of (MAff(E), O), the oriented matroid canonically determined by E. If (M(E), O) is an oriented matroid without loops then the set determines (M(E), O). In particular the matroidal properties of a finite set of points in d are precisely the properties which can be formulated in non-Radon partitions terms. The Möbius function of the poset and in a special case its homotopy type are computed. This paper generalizes recent results of P. Edelman (A partial order on the regions of n dissected by hyperplanes 相似文献
11.
Let A be an arbitrary n×n matrix, partitioned so that if A=[Aij], then all submatrices Aii are square. If x is a positive vector, it is well-known that , where , contains all the eigenvalues of A. The purpose of this paper is to give a new definition of the concept of an isolated subregion of G(x). An algorithm is given for obtaining the best such isolated subregion in a certain sense, and examples are given to show that tighter bounds for some eigenvalues of A may be obtained than with previous algorithms. For ease of computation, each subregion Gi(x) is replaced by the union of circular disks centered at the eigenvalues of Aii. 相似文献
12.
13.
Let A be an n×n integral matrix with determinant D>0, and let P(A) be the n-parallelepiped determined by the columns {Ai}ni=1 of A, Let L be the set of integral vectors in P(A), and let G(A) be the subset of L consisting of vectors whose coefficients xi satisfy 0?xi<1. We show that G(A), equipped with addition modulo 1 on the coefficients xi, is an Abelian group of order D, whose invariant factors are the invariant factors of the integral matrix A. We give a formula for |L|, and show that |L| is not a similarity invariant. 相似文献
14.
The following results are proved: Let A = (aij) be an n × n complex matrix, n ? 2, and let k be a fixed integer, 1 ? k ? n ? 1.(1) If there exists a monotonic G-function f = (f1,…,fn) such that for every subset of S of {1,…,n} consisting of k + 1 elements we have then the rank of A is ? n ? k + 1. (2) If A is irreducible and if there exists a G-function f = (f1,…,fn) such that for every subset of S of {1,…,n} consisting of k + 1 elements we have then the rank of A is ? n ? k + 1 if k ? 2, n ? 3; it is ? n ? 1 if k = 1. 相似文献
15.
Let A be an n×n complex matrix. For a suitable subspace of Cn the Schur compression A and the (generalized) Schur complement A/ are defined. If A is written in the form according to the decomposition and if B is invertible, then and The commutativity rule for Schur complements is proved: This unifies Crabtree and Haynsworth's quotient formula for (classical) Schur complements and Anderson's commutativity rule for shorted operators. Further, the absorption rule for Schur compressions is proved: . 相似文献
16.
J.F. Colombeau 《Journal of Mathematical Analysis and Applications》1983,94(1):96-115
If Ω denotes an open subset of n (n = 1, 2,…), we define an algebra (Ω) which contains the space ′(Ω) of all distributions on Ω and such that is a subalgebra of (Ω). The elements of (Ω) may be considered as “generalized functions” on Ω and they admit partial derivatives at any order that generalize exactly the derivation of distributions. The multiplication in (Ω) gives therefore a natural meaning to any product of distributions, and we explain how these results agree with remarks of Schwartz on difficulties concerning a multiplication of distributions. More generally if q = 1, 2,…, and —a classical Schwartz notation—for any G1,…,Gq∈G(σ), we define naturally an element . These results are applied to some differential equations and extended to the vector valued case, which allows the multiplication of vector valued distributions of physics. 相似文献
17.
For fixed p (0 ≤ p ≤ 1), let {L0, R0} = {0, 1} and X1 be a uniform random variable over {L0, R0}. With probability p let {L1, R1} = {L0, X1} or = {X1, R0} according as ; with probability 1 ? p let {L1, R1} = {X1, R0} or = {L0, X1} according as , and let X2 be a uniform random variable over {L1, R1}. For n ≥ 2, with probability p let {Ln, Rn} = {Ln ? 1, Xn} or = {Xn, Rn ? 1} according as , with probability 1 ? p let {Ln, Rn} = {Xn, Rn ? 1} or = {Ln ? 1, Xn} according as , and let Xn + 1 be a uniform random variable over {Ln, Rn}. By this iterated procedure, a random sequence {Xn}n ≥ 1 is constructed, and it is easy to see that Xn converges to a random variable Yp (say) almost surely as n → ∞. Then what is the distribution of Yp? It is shown that the Beta, (2, 2) distribution is the distribution of Y1; that is, the probability density function of Y1 is g(y) = 6y(1 ? y) I0,1(y). It is also shown that the distribution of Y0 is not a known distribution but has some interesting properties (convexity and differentiability). 相似文献
18.
Let B(H) be the bounded operators on a Hilbert space H. A linear subspace R ? B(H) is said to be an operator system if 1 ?R and R is self-adjoint. Consider the category of operator systems and completely positive linear maps. R ∈ is said to be injective if given A ? B, A, B ∈ , each map A → R extends to B. Then each injective operator system is isomorphic to a conditionally complete C1-algebra. Injective von Neumann algebras R are characterized by any one of the following: (1) a relative interpolation property, (2) a finite “projectivity” property, (3) letting Mm = B(Cm), each map R → N ? Mm has approximate factorizations R → Mn → N, (4) letting K be the orthogonal complement of an operator system N ? Mm, each map has approximate factorizations . Analogous characterizations are found for certain classes of C1-algebras. 相似文献
19.
20.
Properties of the graph of the polytope of all n × n nonnegative doubly stochastic matrices are studied. If is a face of which is not a k-dimensional rectangular parallelotope for k ≥ 2, then G() is Hamilton connected. Prime factor decompositions of the graphs of faces of relative to Cartesian product are investigated. In particular, if is a face of , then the number of prime graphs in any prime factor decomposition of G() equals the number of connected components of the neighborhood of any vertex of G(). Distance properties of the graphs of faces of are obtained. Faces of for which G() is a clique of are investigated. 相似文献