首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   599篇
  免费   54篇
  国内免费   77篇
化学   26篇
力学   7篇
综合类   13篇
数学   449篇
物理学   235篇
  2023年   6篇
  2022年   8篇
  2021年   9篇
  2020年   18篇
  2019年   13篇
  2018年   16篇
  2017年   9篇
  2016年   12篇
  2015年   11篇
  2014年   24篇
  2013年   47篇
  2012年   18篇
  2011年   27篇
  2010年   20篇
  2009年   48篇
  2008年   53篇
  2007年   59篇
  2006年   48篇
  2005年   37篇
  2004年   34篇
  2003年   40篇
  2002年   24篇
  2001年   27篇
  2000年   27篇
  1999年   15篇
  1998年   13篇
  1997年   16篇
  1996年   10篇
  1995年   5篇
  1994年   8篇
  1993年   6篇
  1992年   2篇
  1991年   6篇
  1990年   1篇
  1989年   1篇
  1987年   1篇
  1986年   1篇
  1985年   2篇
  1982年   1篇
  1981年   2篇
  1979年   1篇
  1977年   3篇
  1973年   1篇
排序方式: 共有730条查询结果,搜索用时 0 毫秒
91.
Let G be a locally compact group with a fixed right Haar measure andX a separable Banach space. LetL p (G, X) be the space of X-valued measurable functions whose norm-functions are in the usualL p . A left multiplier ofL p (G, X) is a bounded linear operator onB p (G, X) which commutes with all left translations. We use the characterization of isometries ofL p (G, X) onto itself to characterize the isometric, invertible, left multipliers ofL p (G, X) for 1 ≤p ∞,p ≠ 2, under the assumption thatX is not thel p -direct sum of two non-zero subspaces. In fact we prove that ifT is an isometric left multiplier ofL p (G, X) onto itself then there existsa y ∃ G and an isometryU ofX onto itself such thatTf(x) = U (R y f)(x). As an application, we determine the isometric left multipliers of L1L p (G, X) and L1C 0 (G, X) whereG is non-compact andX is not the lp-direct sum of two non-zero subspaces. If G is a locally compact abelian group andH is a separable Hubert space, we define where г is the dual group of G. We characterize the isometric, invertible, left multipliers ofA p (G, H), provided G is non-compact. Finally, we use the characterization of isometries ofC(G, X) for G compact to determine the isometric left multipliers ofC(G, X) providedX * is strictly convex.  相似文献   
92.
Let Um be an m×m Haar unitary matrix and U[m,n] be its n×n truncation. In this paper the large deviation is proven for the empirical eigenvalue density of U[m,n] as m/nλ and n→∞. The rate function and the limit distribution are given explicitly. U[m,n] is the random matrix model of quq, where u is a Haar unitary in a finite von Neumann algebra, q is a certain projection and they are free. The limit distribution coincides with the Brown measure of the operator quq.  相似文献   
93.
Let Hn be an n-dimensional Haar subspace of and let Hn−1 be a Haar subspace of Hn of dimension n−1. In this note we show (Theorem 6) that if the norm of a minimal projection from Hn onto Hn−1 is greater than 1, then this projection is an interpolating projection. This is a surprising result in comparison with Cheney and Morris (J. Reine Angew. Math. 270 (1974) 61 (see also (Lecture Notes in Mathematics, Vol. 1449, Springer, Berlin, Heilderberg, New York, 1990, Corollary III.2.12, p. 104) which shows that there is no interpolating minimal projection from C[a,b] onto the space of polynomials of degree n, (n2). Moreover, this minimal projection is unique (Theorem 9). In particular, Theorem 6 holds for polynomial spaces, generalizing a result of Prophet [(J. Approx. Theory 85 (1996) 27), Theorem 2.1].  相似文献   
94.
In this paper we consider two von Neumann subalgebras and of a type II1 factor . For a map φ on , we define
  相似文献   
95.
Fast, efficient and reliable algorithms for discrete least-squares approximation of a real-valued function given at arbitrary distinct nodes in by trigonometric polynomials are presented. The algorithms are based on schemes for the solution of inverse unitary eigenproblems and require only arithmetic operations as compared to operations needed for algorithms that ignore the structure of the problem. An algorithm which solves this problem with real-valued data and real-valued solution using only real arithmetic is given. Numerical examples are presented that show that the proposed algorithms produce consistently accurate results that are often better than those obtained by general QR decomposition methods for the least-squares problem.

  相似文献   

96.
It is shown that for every closed, convex and nowhere dense subset of a superreflexive Banach space there exists a Radon probability measure on so that for all . In particular, closed, convex, nowhere dense sets in separable superreflexive Banach spaces are Haar null. This is unlike the situation in separable nonreflexive Banach spaces, where there always exists a closed convex nowhere dense set which is not Haar null.

  相似文献   

97.
98.
When G is a finite dimensional Haar subspace of C(X,Rk), the vector-valued continuous functions (including complex-valued functions when k is 2) from a finite set X to Euclidean k-dimensional space, it is well-known that at any function f in C(X,Rk) the best approximation operator satisfies the strong unicity condition of order 2 and a Lipschitz (Hőlder) condition of order . This note shows that in fact the best approximation operator satisfies the usual Lipschitz condition of order 1.  相似文献   
99.
Given a complex matrix , we consider the decomposition , where is upper triangular and and have orthonormal columns. Special instances of this decomposition include the singular value decomposition (SVD) and the Schur decomposition where is an upper triangular matrix with the eigenvalues of on the diagonal. We show that any diagonal for can be achieved that satisfies Weyl's multiplicative majorization conditions:

where is the rank of , is the -th largest singular value of , and is the -th largest (in magnitude) diagonal element of . Given a vector which satisfies Weyl's conditions, we call the decomposition , where is upper triangular with prescribed diagonal , the generalized triangular decomposition (GTD). A direct (nonrecursive) algorithm is developed for computing the GTD. This algorithm starts with the SVD and applies a series of permutations and Givens rotations to obtain the GTD. The numerical stability of the GTD update step is established. The GTD can be used to optimize the power utilization of a communication channel, while taking into account quality of service requirements for subchannels. Another application of the GTD is to inverse eigenvalue problems where the goal is to construct matrices with prescribed eigenvalues and singular values.

  相似文献   

100.
Klaus Thomsen 《K-Theory》1991,4(3):245-267
We show that the homotopy groups of the group of quasi-unitaries inC *-algebras form a homology theory on the category of allC *-algebras which becomes topologicalK-theory when stabilized. We then show how this functorial setting, in particular the half-exactness of the involved functors, helps to calculate the homotopy groups of the group of unitaries in a series ofC *-algebras. The calculations include the case of all AbelianC *-algebras and allC *-algebras of the formAB, whereA is one of the Cuntz algebras On n=2, 3, ..., an infinite dimensional simpleAF-algebra, the stable multiplier or corona algebra of a-unitalC *-algebra, a properly infinite von Neumann algebra, or one of the projectionless simpleC *-algebras constructed by Blackadar.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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