首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7428篇
  免费   215篇
  国内免费   195篇
化学   1376篇
晶体学   70篇
力学   40篇
综合类   26篇
数学   5687篇
物理学   639篇
  2023年   38篇
  2022年   89篇
  2021年   84篇
  2020年   44篇
  2019年   188篇
  2018年   170篇
  2017年   105篇
  2016年   82篇
  2015年   131篇
  2014年   234篇
  2013年   415篇
  2012年   296篇
  2011年   475篇
  2010年   376篇
  2009年   484篇
  2008年   506篇
  2007年   471篇
  2006年   390篇
  2005年   260篇
  2004年   226篇
  2003年   198篇
  2002年   149篇
  2001年   139篇
  2000年   128篇
  1999年   203篇
  1998年   140篇
  1997年   116篇
  1996年   92篇
  1995年   126篇
  1994年   123篇
  1993年   123篇
  1992年   87篇
  1991年   66篇
  1990年   142篇
  1989年   159篇
  1988年   91篇
  1987年   97篇
  1986年   119篇
  1985年   112篇
  1984年   81篇
  1983年   36篇
  1982年   33篇
  1981年   32篇
  1980年   36篇
  1979年   28篇
  1978年   28篇
  1977年   30篇
  1976年   21篇
  1975年   10篇
  1973年   11篇
排序方式: 共有7838条查询结果,搜索用时 609 毫秒
91.
A posteriori error estimators for the Stokes equations   总被引:5,自引:0,他引:5  
Summary We present two a posteriori error estimators for the mini-element discretization of the Stokes equations. One is based on a suitable evaluation of the residual of the finite element solution. The other one is based on the solution of suitable local Stokes problems involving the residual of the finite element solution. Both estimators are globally upper and locally lower bounds for the error of the finite element discretization. Numerical examples show their efficiency both in estimating the error and in controlling an automatic, self-adaptive mesh-refinement process. The methods presented here can easily be generalized to the Navier-Stokes equations and to other discretization schemes.This work was accomplished at the Universität Heidelberg with the support of the Deutsche Forschungsgemeinschaft  相似文献   
92.
Summary We study the augmented system approach for the solution of sparse linear least-squares problems. It is well known that this method has better numerical properties than the method based on the normal equations. We use recent work by Arioli et al. (1988) to introduce error bounds and estimates for the components of the solution of the augmented system. In particular, we find that, using iterative refinement, we obtain a very robust algorithm and our estimates of the error are accurate and cheap to compute. The final error and all our error estimates are much better than the classical or Skeel's error analysis (1979) indicates. Moreover, we prove that our error estimates are independent of the row scaling of the augmented system and we analyze the influence of the Björck scaling (1967) on these estimates. We illustrate this with runs both on large-scale practical problems and contrived examples, comparing the numerical behaviour of the augmented systems approach with a code using the normal equations. These experiments show that while the augmented system approach with iterative refinement can sometimes be less efficient than the normal equations approach, it is comparable or better when the least-squares matrix has a full row, and is, in any case, much more stable and robust.This author was visiting Harwell and was funded by a grant from the Italian National Council of Research (CNR), Istituto di Elaborazione dell'Informazione-CNR, via S. Maria 46, I-56100 Pisa, ItalyThis author was visiting Harwell from Faculty of Mathematics and Computer Science of the University of Amsterdam  相似文献   
93.
Under some general continuous and compact conditions, the existence problems of fiked points andd coupled fixed points for increasing operators are studied. an application, we utilize the results obtained to study the existence of solutions for differential inclusions in Banach spaces.  相似文献   
94.
Numerical methods for ordinary initial value problems that do not depend on special properties of the system are usually found in the class of linear multistage multivalue methods, first formulated by J.C. Butcher. Among these the explicit methods are easiest to implement. For these reasons there has been considerable research activity devoted to generating methods of this class which utilize independent function evaluations that can be performed in parallel. Each such group of concurrent function evaluations can be regarded as a stage of the method. However, it turns out that parallelism affords only limited opportunity for reducing the computing time with such methods. This is most evident for the simple linear homogeneous constant-coefficient test problem, whose solution is essentially a matter of approximating the exponential by an algebraic function. For a given number of stages and a given number of saved values, parallelism offers a somewhat enlarged set of algebraic functions from which to choose. However, there is absolutely no benefit in having the degree of parallelism (number of processors) exceed the number of saved values of the method. Thus, in particular, parallel one-step methods offer no speedup over serial one-step methods for the standard linear test problem. Although the implication of this result for general nonlinear problems is unclear, there are indications that dramatic speedups are not possible in general. Also given are some results relevant to the construction of methods.Work supported in part by National Science Foundation grants DMS 89 11410 and DMS 90 15533 and by US Department of Energy grant DOE DEFG02-87ER25026. Work of the second author was completed while at the University of Illinois.  相似文献   
95.
In this paper, we consider the 2-dimensional local Calabi flow on a complete noncompact surface . Then, based on the Harnack-type estimate, we show the long-time existence and asymptotic convergence of a subsequence of solutions of such a flow on with and bounded from above by a negative constant on a ball. For its applications, this will lead to the existence of extremal metrics on a complete noncompact surface of finite topological type. In particular, there exists an extremal metric of nonconstant Gaussian curvature on or Received: 21 June 2001 / 18 January 2002 / Published online: 27 June 2002 Research supported in part by NSC and NCTS.  相似文献   
96.
Summary We show that each holomorphic Wiener function has a skeleton which is intrinsic from several viewpoints. In particular, we study the topological aspects of the skeletons by using the local Taylor expansion for holomorphic Wiener functions.Supported in part by the Grant-in-Aid for Science Research 03740120 Min. Education  相似文献   
97.
Here we prove that every compact differential manifold has a smooth algebraic model defined over Q. In dimension 2 we find an algebraic model (may be singular) defined over Q and birational over Q to the projective plane.  相似文献   
98.
It is shown that every separable Banach space admits an equivalent norm that is uniformly Gâteaux smooth and yet lacks asymptotic normal structure.

  相似文献   

99.
Crossed modules have longstanding uses in homotopy theory and the cohomology of groups. The corresponding notion in the setting of categorical groups, that is, categorical crosses modules, allowed the development of a low-dimensional categorical group cohomology. Now, its relevance is also shown here to homotopy types by associating, to any pointed CW-complex (X,∗), a categorical crossed module that algebraically represents the homotopy 3-type of X.  相似文献   
100.
We give a small functorial algebraic model for the 2-stage Postnikov section of the K-theory spectrum of a Waldhausen category and use our presentation to describe the multiplicative structure with respect to biexact functors.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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