共查询到20条相似文献,搜索用时 46 毫秒
1.
《Nonlinear Analysis: Theory, Methods & Applications》2004,57(2):311-322
This paper is about a monotone approximation scheme for extremal (least or greatest) solutions of the following variational inequality:in the interval between some appropriately defined sub- and supersolutions. The variational inequality is approximated by a sequence of penalty equations. The extremal solutions of the penalty equations, constructed iteratively and forming a monotone sequence, are proved to converge to the corresponding solutions of the original inequality. We note that no monotoneity assumption on the lower-order term F is imposed. 相似文献
2.
Chandler Davis 《Linear algebra and its applications》1977,18(1):33-43
Problem: Given operators Aj ? O on Hilbert space , with ΣAj = 1, to find commuting projectors Ej on a Hilbert space ? such that (for all j) x1Ajy = x1Ejy for, x, y ∈ . This paper gives an explicit construction, quite different from the familiar solution. 相似文献
3.
David Chillingworth 《Journal of Functional Analysis》1980,35(2):251-278
Let C be a Banach space, H a Hilbert space, and let F(C,H) be the space of C∞ functions f: C × H → R having Fredholm second derivative with respect to x at each (c, x) ?C × H for which ; here we write for . Say ? is of standard type if at all critical points of ?c it is locally equivalent (as an unfolding) to a quadratic form Q plus an elementary catastrophe on the kernel of Q. It is proved that if f?F (A × B, H) satisfies a certain ‘general position’ condition, and dim B ? 5, then for most a?A the function fo?F(B,H) is of standard type. Using this it is shown that those f?F(B,H) of standard type form an open dense set in F(B,H) with the Whitney topology. Thus both results are Hilbert-space versions of Thom's theorem for catastrophes in n. 相似文献
4.
Let Fn denote the ring of n×n matrices over the finite field F=GF(q) and let A(x)=ANxN+ ?+ A1x+A0?Fn[x]. A function is called a right polynomial function iff there exists an A(x)?Fn[x] such that for every B?Fn. This paper obtains unique representations for and determines the number of right polynomial functions. 相似文献
5.
Let be field, and let A and B be n × n matrices with elements in . Suppose that A is completely reducible and that B is symmetric. If the principal minors of A determined by the 1- and 2-circuits of the graph of B and by the chordless circuits of the graph of A are equal to the corresponding principal minors of B, then A is diagonally similar to B; and conversely. 相似文献
6.
Let A be a subalgebra of the full matrix algebra Mn(F), and suppose J∈A, where J is the Jordan block corresponding to xn. Let be a set of generators of A. It is shown that the graph of determines whether A is the full matrix algebra Mn(F). 相似文献
7.
If A and B are self-adjoint operators, this paper shows that A and B have order isomorphic invariant subspace lattices if and only if there are Borel subsets E and F of σ(A) and σ(B), respectively, whose complements have spectral measure zero, and there is a bijective function φ: E → F such that (i) Δ is a Borel subset of E if and only if φ(Δ) is a Borel subset of F; (ii) a Borel subset Δ of E has A-spectral measure zero if and only if φ(Δ) has B-spectral measure zero; (iii) B is unitarily equivalent to φ(A). If A is any self-adjoint operator, there is an associated function κA : ∪ {∞} → ( ∪ {0, ∞}) × {0,1} defined in this paper. If denotes the collection of all functions from ∪ {∞} into ( ∪ {0,∞}) × {0,1}, then is a parameter space for the isomorphism classes of the invariant subspace lattices of self-adjoint operators. That is, two self-adjoint operators A and B have isomorphic invariant subspace lattices if and only if κA = κB. The paper ends with some comments on the corresponding problem for normal operators. 相似文献
8.
Let be a family of subsets of S and let G be a graph with vertex set such that: (xA, xB) is an edge iff . The family is called a set representation of the graph G.It is proved that the problem of finding minimum k such that G can be represented by a family of sets of cardinality at most k is NP-complete. Moreover, it is NP-complete to decide whether a graph can be represented by a family of distinct 3-element sets.The set representations of random graphs are also considered. 相似文献
9.
10.
This paper investigates the structure of the -classes in the semigroup Nn of nonnegative matrices. We obtain two sets of equivalent conditions for any two matrices A,B to satisfy . We establish a one-to-one and onto correspondence between the -class A and the group WA0 of the greatest cone independent submatrix A0 of A. We find WA0 can be made up from the groups of the connective submatrices of A0. 相似文献
11.
A Lyapunov transformation is a linear transformation on the set n of hermitian matrices H ? n,n of the form A(H) = A1H + HA, where A ?n,n. Given a positive stable A ?n,n, the Stein-Pfeffer Theorem characterizes those K ? n for which K = B(H), where B is similar to A and H is positive definite. We give a new proof of this result, and extend it in several directions. The proofs involve the idea of a controllability subspace, employed previously in this context by Snyders and Zakai. 相似文献
12.
Richard C MacCamy 《Journal of Differential Equations》1974,16(2):373-393
We consider equations of the form, u(t) = ? ∝0tA(t ? τ)g(u(τ)) dτ + ?(t) (I) on a Hubert space . A(t) is a family of bounded, linear operators on while g is a transformation on g ? which can be nonlinear and unbounded. We give conditions on A and g which yield stability and asymptotic stability of solutions of (I). It is shown, in particular, that linear combinations with positive coefficients of the operators eMt and ?eMtsin Mt where M is a bounded, negative self-adjoint operator on satisfy these conditions. This is shown to yield stability results for differential equations of the form, , on . 相似文献
13.
S.M. Gersten 《Journal of Pure and Applied Algebra》1984,33(3):269-279
A presentation is given for SAn, the group of automorphisms of determinant 1 of a free group Fn of rank n. The canonical isomorphisms are established for n ≥ 5, where An is the full group of automorphisms of Fn. 相似文献
14.
For a class of subsets of a set X, let V() be the smallest n such that no n-element set F?X has all its subsets of the form A ∩ F, A ∈ . The condition V() <+∞ has probabilistic implications. If any two-element subset A of X satisfies both A ∩ C = Ø and A ? D for some C, D∈, then if and only if is linearly ordered by inclusion. If is of the form , i=1,2,…,n}, where each is linearly ordered by inclusion, then . If H is an (n-1)-dimensional affine hyperplane in an n-dimensional vector space of real functions on X, and is the collection of all sets {x: f(x)>0} for f in H, then . 相似文献
15.
A.L Carey 《Journal of Functional Analysis》1984,55(3):277-296
The group (H)2 of unitary operators (on a Hilbert space H) which differ from the identity by a Hilbert-Schmidt operator may be imbedded in the group of Bogoliubov automorphisms of the CAR algebra over H in such a way as to be weakly inner in any gauge-invariant quasifree representation. Consequently each such quasifree representation determines a projective representation of (H)2. If 0 ? A ? I is the operator on H determining the quasifree representation πA and ?A denotes the cyclic projective representation of (H)2 generated from the G.N.S. cyclic vector , then the 2-cocycle in (H)2 determined by ?A can be given explicitly. We prove that this 2-cocycle is a coboundary if any only if A or 1 ? A is Hilbert-Schmidt. The representations ?A, on restriction to the group (H)1 consisting of unitaries which differ from the identity by a trace class operator, always determine 2-cocycles which are coboundaries. These representations of (H)1 have already been investigated by 21., 22., 87–110). Thus the Stratila-Voiculescu representations of (H)1 always extend to projective representations of (H)2 and to ordinary representations when A or 1 ? A is Hilbert-Schmidt. This fact enables exploitation of the type analysis of Stratila and Voiculescu to determine the type of the von Neumann algebra ρA((H)2)″. In the special case where 0 and 1 are not eigenvalues of is cyclic and separating for ρA((H)2)″ and hence determines a K.M.S. state on this algebra. It is shown that for special choices of A, type IIIλ (0 < λ ? 1) factors ρA((H)2)″ may be constructed. 相似文献
16.
A forest is a finite partially ordered set F such that for x, y, z?F with x ? z, y ? z one has x ? y or y ? x. In this paper we give a complete characterization of all separable C1-algebras with a finite dual , for which Prim is a forest with inclusion as partial order. These results are extended to certain separable C1-algebras with a countable dual. As an example these results are used to characterize completely all separable C1-algebras with a three point dual. 相似文献
17.
The permanent function is used to determine geometrical properties of the set of all n × n nonnegative doubly stochastic matrices. If is a face of , then corresponds to an n × n (0, 1)-matrix A, where the permanent of A is the number of vertices of . If A is fully indecomposable, then the dimension of equals σ(A) ? 2n + 1, where σ(A) is the number of 1's in A. The only two-dimensional faces of are triangles and rectangles. For n ? 6, has four types of three-dimensional faces. The facets of the faces of are characterized. Faces of which are simplices are determined. If is a face of which is two-neighborly but not a simplex, then has dimension 4 and six vertices. All k-dimensional faces with k + 2 vertices are determined. The maximum number of vertices of a k-dimensional face is 2k. All k-dimensional faces with at least 2k?1 + 1 vertices are determined. 相似文献
19.
Thomas I Seidman 《Journal of Mathematical Analysis and Applications》1983,94(2):470-478
Consider the minimization of a possibly noncoercive Gâteaux differentiable functional . A modified notion of coercivity is introduced which may be usable to show existence of a minimum. Alternatively, has a minimum at ( not differentiable but the restriction F of to ? differentiable), one may be able to show is actually in . The latter case is related to justification of formally calculated “necessary conditions” for optimal controls. The arguments are applications of Ekeland's “approximate variational principle” (J. Math. Anal. Appl.47 (1974), 324–353). 相似文献
20.
Let Mm,n(F) denote the space of all mXn matrices over the algebraically closed field F. A subspace of Mm,n(F), all of whose nonzero elements have rank k, is said to be essentially decomposable if there exist nonsingular mXn matrices U and V respectively such that for any element A, UAV has the form where A1 is iX(k–i) for some i?k. Theorem: If is a space of rank k matrices, then either is essentially decomposable or dim ?k+1. An example shows that the above bound on non-essentially-decomposable spaces of rank k matrices is sharp whenever n?2k–1. 相似文献