首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3701篇
  免费   223篇
  国内免费   405篇
化学   257篇
晶体学   6篇
力学   217篇
综合类   70篇
数学   3250篇
物理学   529篇
  2023年   41篇
  2022年   39篇
  2021年   32篇
  2020年   63篇
  2019年   88篇
  2018年   67篇
  2017年   102篇
  2016年   101篇
  2015年   70篇
  2014年   144篇
  2013年   296篇
  2012年   184篇
  2011年   186篇
  2010年   175篇
  2009年   209篇
  2008年   217篇
  2007年   257篇
  2006年   223篇
  2005年   179篇
  2004年   156篇
  2003年   185篇
  2002年   156篇
  2001年   128篇
  2000年   149篇
  1999年   120篇
  1998年   133篇
  1997年   107篇
  1996年   70篇
  1995年   43篇
  1994年   50篇
  1993年   30篇
  1992年   28篇
  1991年   35篇
  1990年   23篇
  1989年   12篇
  1988年   18篇
  1987年   17篇
  1986年   17篇
  1985年   33篇
  1984年   23篇
  1983年   6篇
  1982年   23篇
  1981年   17篇
  1980年   14篇
  1979年   19篇
  1978年   17篇
  1977年   10篇
  1976年   7篇
  1974年   4篇
  1973年   2篇
排序方式: 共有4329条查询结果,搜索用时 15 毫秒
141.
白中治等提出了解非埃尔米特正定线性方程组的埃尔米特和反埃尔米特分裂(HSS)迭代方法(Bai Z Z,Golub G H,Ng M K.Hermitian and skew-Hermitian splitting methodsfor non-Hermitian positive definite linear systems.SIAM J.Matrix Anal.Appl.,2003,24:603-626).本文精确地估计了用HSS迭代方法求解广义鞍点问题时在加权2-范数和2-范数下的收缩因子.在实际的计算中,正是这些收缩因子而不是迭代矩阵的谱半径,本质上控制着HSS迭代方法的实际收敛速度.根据文中的分析,求解广义鞍点问题的HSS迭代方法的收缩因子在加权2-范数下等于1,在2-范数下它会大于等于1,而在某种适当选取的范数之下,它则会小于1.最后,用数值算例说明了理论结果的正确性.  相似文献   
142.
王绍文 《光子学报》1998,27(2):173-179
本文对非平面无向简单图的点着色问题进行分析研究后,提出了一个点色数算法.该算法不仅给出了非平面图求点色数的方法,同时也解决了着色方法.并且对算法所涉及的有关性质定理给出了证明.  相似文献   
143.
We present a generalization of a family of points on S2, the Diamond ensemble, containing collections of N points on S2 with very small logarithmic energy for all NN. We extend this construction to the real projective plane RP2 and we obtain upper and lower bounds with explicit constants for the Green and logarithmic energy on this last space.  相似文献   
144.
李步扬 《计算数学》2022,44(2):145-162
许多物理现象可以在数学上描述为受曲率驱动的自由界面运动,例如薄膜和泡沫的演变、晶体生长,等等.这些薄膜和界面的运动常依赖于其表面曲率,从而可以用相应的曲率流来描述,其相关自由界面问题的数值计算和误差分析一直是计算数学领域中的难点.参数化有限元法是曲率流的一类有效计算方法,已经能够成功模拟一些曲面在几类基本的曲率流下的演化过程.本文重点讨论曲率流的参数化有限元逼近,它的产生、发展和当前的一些挑战.  相似文献   
145.
We improve over a sufficient condition given in [8] for uniqueness of a nondegenerate critical point in best rational approximation of prescribed degree over the conjugate-symmetric Hardy space of the complement of the disk. The improved condition connects to error estimates in AAK approximation, and is necessary and sufficient when the function to be approximated is of Markov type. For Markov functions whose defining measure satisfies the Szego condition, we combine what precedes with sharp asymptotics in multipoint Padé approximation from [43], [40] in order to prove uniqueness of a critical point when the degree of the approximant goes large. This lends perspective to the uniqueness issue for more general classes of functions defined through Cauchy integrals.  相似文献   
146.

Integral representations are considered of solutions of the inhomogeneous Airy differential equation . The solutions of these equations are also known as Scorer functions. Certain functional relations for these functions are used to confine the discussion to one function and to a certain sector in the complex plane. By using steepest descent methods from asymptotics, the standard integral representations of the Scorer functions are modified in order to obtain nonoscillating integrals for complex values of . In this way stable representations for numerical evaluations of the functions are obtained. The methods are illustrated with numerical results.

  相似文献   

147.
Aliprantis  C.D.  Cornet  B.  Tourky  R. 《Positivity》2002,6(3):205-241
Mathematical economics has a long history and covers many interdisciplinary areas between mathematics and economics. At its center lies the theory of market equilibrium. The purpose of this expository article is to introduce mathematicians to price decentralization in general equilibrium theory. In particular, it concentrates on the role of positivity in the theory of convex economic analysis and the role of normal cones in the theory of non-convex economies.  相似文献   
148.
Well-Posedness by Perturbations of Variational Problems   总被引:3,自引:0,他引:3  
In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented.  相似文献   
149.
Let E\subset \Bbb R s be compact and let d n E denote the dimension of the space of polynomials of degree at most n in s variables restricted to E . We introduce the notion of an asymptotic interpolation measure (AIM). Such a measure, if it exists , describes the asymptotic behavior of any scheme τ n ={ \bf x k,n } k=1 dnE , n=1,2,\ldots , of nodes for multivariate polynomial interpolation for which the norms of the corresponding interpolation operators do not grow geometrically large with n . We demonstrate the existence of AIMs for the finite union of compact subsets of certain algebraic curves in R 2 . It turns out that the theory of logarithmic potentials with external fields plays a useful role in the investigation. Furthermore, for the sets mentioned above, we give a computationally simple construction for ``good' interpolation schemes. November 9, 2000. Date revised: August 4, 2001. Date accepted: September 14, 2001.  相似文献   
150.
Integral representations are considered of solutions of the Airy differential equation w zw=0 for computing Airy functions for complex values of z. In a first method contour integral representations of the Airy functions are written as non-oscillating integrals for obtaining stable representations, which are evaluated by the trapezoidal rule. In a second method an integral representation is evaluated by using generalized Gauss–Laguerre quadrature; this approach provides a fast method for computing Airy functions to a predetermined accuracy. Comparisons are made with well-known algorithms of Amos, designed for computing Bessel functions of complex argument. Several discrepancies with Amos' code are detected, and it is pointed out for which regions of the complex plane Amos' code is less accurate than the quadrature algorithms. Hints are given in order to build reliable software for complex Airy functions.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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