首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   86684篇
  免费   14239篇
  国内免费   3775篇
化学   62001篇
晶体学   1002篇
力学   5998篇
综合类   313篇
数学   23497篇
物理学   11887篇
  2024年   59篇
  2023年   282篇
  2022年   378篇
  2021年   645篇
  2020年   1305篇
  2019年   2994篇
  2018年   2861篇
  2017年   3389篇
  2016年   3694篇
  2015年   5867篇
  2014年   6089篇
  2013年   9310篇
  2012年   6569篇
  2011年   6543篇
  2010年   5426篇
  2009年   5556篇
  2008年   5927篇
  2007年   5278篇
  2006年   4895篇
  2005年   4553篇
  2004年   3844篇
  2003年   3681篇
  2002年   4209篇
  2001年   2506篇
  2000年   2357篇
  1999年   1445篇
  1998年   775篇
  1997年   724篇
  1996年   513篇
  1995年   386篇
  1994年   334篇
  1993年   296篇
  1992年   233篇
  1991年   207篇
  1990年   165篇
  1989年   117篇
  1988年   103篇
  1987年   98篇
  1986年   85篇
  1985年   125篇
  1984年   153篇
  1983年   73篇
  1982年   99篇
  1981年   112篇
  1980年   83篇
  1979年   87篇
  1978年   89篇
  1977年   61篇
  1976年   42篇
  1974年   15篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
82.
83.
84.
非线性互补问题的一种全局收敛的显式光滑Newton方法   总被引:2,自引:0,他引:2  
本针对Po函数非线性互补问题,给出了一种显式光滑Newton方法,该方法将光滑参数μ进行显式迭代而不依赖于Newton方向的搜索过程,并在适当的假设条件下,证明了算法的全局收敛性。  相似文献   
85.
Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, minM∈??AM?IF and matrix M0∈?? corresponding to this minimum (?? being any vectorial subspace of ??n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.  相似文献   
86.
We discuss an error estimation procedure for the global error of collocation schemes applied to solve singular boundary value problems with a singularity of the first kind. This a posteriori estimate of the global error was proposed by Stetter in 1978 and is based on the idea of Defect Correction, originally due to Zadunaisky. Here, we present a new, carefully designed modification of this error estimate which not only results in less computational work but also appears to perform satisfactorily for singular problems. We give a full analytical justification for the asymptotical correctness of the error estimate when it is applied to a general nonlinear regular problem. For the singular case, we are presently only able to provide computational evidence for the full convergence order, the related analysis is still work in progress. This global estimate is the basis for a grid selection routine in which the grid is modified with the aim to equidistribute the global error. This procedure yields meshes suitable for an efficient numerical solution. Most importantly, we observe that the grid is refined in a way reflecting only the behavior of the solution and remains unaffected by the unsmooth direction field close to the singular point.  相似文献   
87.
对由一类非线性抛物型变分不等方程所描述的无穷维动力系统,给出了存在全局吸引子及弱近似惯性流形的充分条件.  相似文献   
88.
In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.  相似文献   
89.
90.
Abstract In this note, we consider a Frémond model of shape memory alloys. Let us imagine a piece of a shape memory alloy which is fixed on one part of its boundary, and assume that forcing terms, e.g., heat sources and external stress on the remaining part of its boundary, converge to some time-independent functions, in appropriate senses, as time goes to infinity. Under the above assumption, we shall discuss the asymptotic stability for the dynamical system from the viewpoint of the global attractor. More precisely, we generalize the paper [12] dealing with the one-dimensional case. First, we show the existence of the global attractor for the limiting autonomous dynamical system; then we characterize the asymptotic stability for the non-autonomous case by the limiting global attractor. * Project supported by the MIUR-COFIN 2004 research program on “Mathematical Modelling and Analysis of Free Boundary Problems”.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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