首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 82 毫秒
1.
LetB,B be bases of a matroid, withX B, X B. SetsX,X are asymmetric exchange if(B – X) X and(B – X) X are bases. SetsX,X are astrong serial B-exchange if there is a bijectionf: X X, where for any ordering of the elements ofX, sayx i ,i = 1, , m, bases are formed by the sets B0 = B, Bi = (Bi–1 – xi) f(x i), fori = 1, , m. Any symmetric exchangeX,X can be decomposed by partitioning X = i=1 m Yi, X = i=1 m Yi, X, where (1) bases are formed by the setsB 0 =B, B i = (B i–1 Y i ) Y i ; (2) setsY i ,Y i are a strong serialB i–1 -exchange; (3) properties analogous to (1) and (2) hold for baseB and setsY i ,Y i .  相似文献   

2.
If P and P are finite partially ordered sets such that P=P–e for some maximal element e P, all geometric closure operators on P are determined whose restriction to P equals a given closure operator on P.The classes Q(P) and Q(P*) of all geometric closure operators on P and on its order dual P* are shown to be anti-isomorphic partially ordered sets.  相似文献   

3.
In this note we prove some results on the m-accretivity of sums and products of linear operators. In particular we obtain the following theorem: LetA, B be two m-accretive operators on a reflexive Banach space. IfA is invertible and (A)–1 B is accretive thenBA –1 andA+B are m-accretive.  相似文献   

4.
The interpolation problem at uniform mesh points of a quadratic splines(x i)=f i,i=0, 1,...,N ands(x 0)=f0 is considered. It is known that s–f=O(h 3) and s–f=O(h 2), whereh is the step size, and that these orders cannot be improved. Contrary to recently published results we prove that superconvergence cannot occur for any particular point independent off other than mesh points wheres=f by assumption. Best error bounds for some compound formulae approximatingf i andf i (3) are also derived.  相似文献   

5.
Using the quadratic spline interpolates(x) fitting the data (x i,y i), 0in and satisfying the end conditionso=yo, we give formulae approximatingy andy at selected knots by orders up toO(h 4).  相似文献   

6.
Matrices and operators of the formA –1 A * have received a certain amount of attention in recent years. Here some of the literature is surveyed and the caseA –1 A is studied for complex matrices withA denoting the transpose ofA. A generalization ofA –1 A is introduced.
Zusammenfassung Matrizen und Operatoren, die in der FormA –1 A * ausgedrückt werden können, sind in den letzten Jahren häufig studiert worden. Hier wird ein Ueberblick über Teil der relevanten Literatur gegeben und auch der FallA –1 A für komplexe Matrizen studiert, wobeiA die Transponierte vonA ist. Es wird auch eine Verallgemeinerung vonA –1 A eingeführt.


Dedicated to Eduard Stiefel by a long time admirer  相似文献   

7.
Theorem.Let the sequences {e i (n) },i=1, 2, 3,n=0, 1, 2, ...be defined by where the e (0) s satisfy and where all square roots are taken positive. Then where the convergence is quadratic and monotone and where The discussions of convergence are entirely elementary. However, although the determination of the limits can be made in an elementary way, an acquaintance with elliptic objects is desirable for real understanding.  相似文献   

8.
Let S be the set of scalings {n –1:n=1,2,3,...} and let L z =z Z 2, zS, be the corresponding set of scaled lattices in R 2. In this paper averaging operators are defined for plaquette functions on L z to plaquette functions on L z for all z, zS, z=dz, d{2,3,4,...}, and their coherence is proved. This generalizes the averaging operators introduced by Balaban and Federbush. There are such coherent families of averaging operators for any dimension D=1,2,3,... and not only for D=2. Finally there are uniqueness theorems saying that in a sense, besides a form of straightforward averaging, the weights used are the only ones that give coherent families of averaging operators.  相似文献   

9.
Generalized perfect arrays and menon difference sets   总被引:1,自引:0,他引:1  
Given an s 1 × ... × s rinteger-valued array A and a (0, 1) vector z = (z 1, ..., z r), form the array A from A by recursively adjoining a negative copy of the current array for each dimension i where z i = 1. A is a generalized perfect array type z if all periodic autocorrelation coefficients of A are zero, except for shifts (u 1, ..., u r) where u i, - 0 (mod s i) for all i. The array is perfect if z = (0, ..., 0) and binary if the array elements are all ±1. A nontrivial perfect binary array (PBA) is equivalent to a Menon difference set in an abelian group.Using only elementary techniques, we prove various construction theorems for generalized perfect arrays and establish conditions on their existence. We show that a generalized PBA whose type is not (0, ..., 0) is equivalent to a relative difference set in an abelian factor group. We recursively construct several infinite families of generalized PBAs, and deduce nonexistence results for generalized PBAs whose type is not (0, ..., 0) from well-known nonexistence results for PBAs. A central result is that a PBA with 22y 32u elements and no dimension divisible by 9 exists if and only if no dimension is divisible by 2 y+2. The results presented here include and enlarge the set of sizes of all previously known generalized PBAs.  相似文献   

10.
Summary Let a regular open set of R n, a measure with compact support and L a second order elliptic operator in divergence form. If L is coercive we prove a theorem of existence and uniqueness for the solution of Lu=, uH 0 1+H0 1,p()where p is the conjugate of p[n, ].  相似文献   

11.
A construction of a pair of strongly regular graphs n and n of type L 2n–1(4n–1) from a pair of skew-symmetric association schemes W, W of order 4n–1 is presented. Examples of graphs with the same parameters as n and n, i.e., of type L 2n–1(4n–1), were known only if 4n–1=p 3, where p is a prime. The first new graph appearing in the series has parameters (v, k, )=(225, 98, 45). A 4-vertex condition for relations of a skew-symmetric association scheme (very similar to one for the strongly regular graphs) is introduced and is proved to hold in any case. This has allowed us to check the 4-vertex condition for n and n, thus to prove that n and n are not rank three graphs if n>2.  相似文献   

12.
A standard way to approximate the model problem –u =f, with u(±1)=0, is to collocate the differential equation at the zeros of T n : x i , i=1,...,n–1, having denoted by T n the nth Chebyshev polynomial. We introduce an alternative set of collocation nodes z i , i=1,...,n–1, which will provide better numerical performances. The approximated solution is still computed at the nodes {x i }, but the equation is required to be satisfied at the new nodes {z i }, which are determined by asking an extra degree of consistency in the discretization of the differential operator.  相似文献   

13.
Consider a set ofp equations Yi = Xii + i,i=1,...,p, where the rows of the random error matrix (1,..., p):n × p are mutually independent and identically distributed with ap-variate distribution functionF(x) having null mean and finite positive definite variance-covariance matrix . We are mainly interested in an improvement upon a feasible generalized least squares estimator (FGLSE) for = ( 1 ,..., p ) when it is a priori suspected thatC=co may hold. For this problem, Saleh and Shiraishi (1992,Nonparametric Statistics and Related Topics (ed. A. K. Md. E. Saleh), 269–279, North-Holland, Amsterdam) investigated the property of estimators such as the shrinkage estimator (SE), the positive-rule shrinkage estimator (PSE) in the light of their asymptotic distributional risks associated with the Mahalanobis loss function. We consider a general form of estimators and give a sufficient condition for proposed estimators to improve on FGLSE with respect to their asymptotic distributional quadratic risks (ADQR). The relative merits of these estimators are studied in the light of the ADQR under local alternatives. It is shown that the SE, the PSE and the Kubokawa-type shrinkage estimator (KSE) outperform the FGLSE and that the PSE is the most effective among the four estimators considered underC=co. It is also observed that the PSE and the KSE fairly improve over the FGLSE. Lastly, the construction of estimators improved on a generalized least squares estimator is studied, assuming normality when is known.  相似文献   

14.
In a real Hilbert space H we consider the nonlinear operator equation P(x)=0 and the continuous gradient methodx (t)= –P (x)* P (x), x (0) = x0. Two theorems on the convergence of the process (*) to the solution of the equation P(x)=0 are proved.Translated from Matematicheskie Zametki, Vol. 3, No. 4, pp. 421–426, April, 1968.  相似文献   

15.
Nonparametric Estimation of a Conditional Quantile for α-Mixing Processes   总被引:1,自引:0,他引:1  
Let (Xi,Y i) be a set of observations form a stationary -mixing process and (x) be the conditional -th quantile of Y given X = x. Several authors considered nonparametric estimation of (x) in the i.i.d. setting. Assuming the smoothness of FF(x), we estimate it by local polynomial fitting and prove the asymptotic normality and the uniform convergence.  相似文献   

16.
In this note, we prove that, for Robins boundary value problem, a unique solution exists if fx(t, x, x), fx(t, x, x), (t), and (t) are continuous, and fx -(t), fx -(t), 4(t) 2 + 2(t) ++ 2(t), and 4(t) 2 + 2(t) + 2(t).AMS Subject Classification (2000) 34B15  相似文献   

17.
A study of the convergence of the differentiation formula (f(A))=f (A)A+f m(A)/21[AA]+f m(A)/3l[[AA]A]'+... where [XY]=XY–YX, and A=A(t) is a function of the real variable t with values in a Banach algebra.Translated from Matematicheskie Zametki, Vol. 10, No. 2, pp. 207–218, August, 1971.The author wishes to thank A. G. Aslanyan for his comments concerning this work.  相似文献   

18.
This paper is a survey on the existence and non-existence of ovoids and spreads in the known finite generalized quadrangles. It also contains the following new results. We prove that translation generalized quadrangles of order (s,s 2), satisfying certain properties, have a spread. This applies to three known infinite classes of translation generalized quadrangles. Further a new class of ovoids in the classical generalized quadranglesQ(4, 3 e ),e3, is constructed. Then, by the duality betweenQ(4, 3 e ) and the classical generalized quadrangleW (3 e ), we get line spreads of PG(3, 3 e ) and hence translation planes of order 32e . These planes appear to be new. Note also that only a few classes of ovoids ofQ(4,q) are known. Next we prove that each generalized quadrangle of order (q 2,q) arising from a flock of a quadratic cone has an ovoid. Finally, we give the following characterization of the classical generalized quadranglesQ(5,q): IfS is a generalized quadrangle of order (q,q 2),q even, having a subquadrangleS isomorphic toQ(4,q) and if inS each ovoid consisting of all points collinear with a given pointx ofS\S is an elliptic quadric, thenS is isomorphic toQ(5,q).  相似文献   

19.
Let E be a linear space, let K E and f:K . We formulate in terms of the lower Dini directional derivative problem GMVI (f ,K ), which can be considered as a generalization of MVI (f ,K ), the Minty variational inequality of differential type. We investigate, in the case of K star-shaped (SS), the existence of a solution x * of GMVI (f K ) and the property of f to increase-along-rays starting at x *, fIAR (K,x *). We prove that the GMVI (f ,K ) with radially l.s.c. function f has a solution x * ker K if and only if fIAR (K,x *). Further, we prove that the solution set of the GMVI (f ,K ) is a convex and radially closed subset of ker K. We show also that, if the GMVI (f ,K ) has a solution x *K, then x * is a global minimizer of the problem min f(x), xK. Moreover, we observe that the set of the global minimizers of the related optimization problem, its kernel, and the solution set of the variational inequality can be different. Finally, we prove that, in the case of a quasiconvex function f, these sets coincide.  相似文献   

20.
LetA, M, N ben ×n real matrices, letA = M– N, letA andM be nonsingular, letM y 0 implyN y 0, and letA y 0 implyN y 0 (where the prime denotes the transpose). Then the spectral radius(M –1 N) ofM –1 N is less than one, and the iterative processx i+1 =M –1 N x i +M –1 b converges to the solution ofA x = b starting from anyx 0.Sponsored by the Mathematics Research Center, United States Army, Madison, Wisconsin, under Contract No. DA-31-124-ARO-D-462, and in part by the National Science Foundation under Grant NSF GP-6070.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号