首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2574篇
  国内免费   308篇
  完全免费   181篇
  数学   3063篇
  2019年   5篇
  2018年   97篇
  2017年   69篇
  2016年   31篇
  2015年   74篇
  2014年   137篇
  2013年   146篇
  2012年   116篇
  2011年   134篇
  2010年   129篇
  2009年   178篇
  2008年   182篇
  2007年   164篇
  2006年   173篇
  2005年   83篇
  2004年   86篇
  2003年   84篇
  2002年   73篇
  2001年   104篇
  2000年   97篇
  1999年   81篇
  1998年   65篇
  1997年   79篇
  1996年   60篇
  1995年   76篇
  1994年   58篇
  1993年   76篇
  1992年   70篇
  1991年   36篇
  1990年   51篇
  1989年   34篇
  1988年   27篇
  1987年   18篇
  1986年   20篇
  1985年   15篇
  1984年   17篇
  1983年   8篇
  1982年   12篇
  1981年   5篇
  1980年   14篇
  1979年   3篇
  1978年   1篇
  1977年   5篇
  1976年   11篇
  1975年   1篇
  1974年   2篇
  1973年   13篇
  1972年   12篇
  1971年   6篇
  1970年   3篇
  1969年   6篇
  1968年   1篇
  1967年   5篇
  1962年   1篇
  1960年   1篇
  1955年   3篇
  1953年   1篇
  1952年   2篇
  1951年   2篇
排序方式: 共有3063条查询结果,搜索用时 156 毫秒
1.
On adjacent-vertex-distinguishing total coloring of graphs   总被引:32,自引:0,他引:32  
In this paper, we present a new concept of the adjacent-vertex-distinguishing total coloring of graphs (briefly, AVDTC of graphs) and, meanwhile, have obtained the adjacent-vertex-distinguishing total chromatic number of some graphs such as cycle, complete graph, complete bipartite graph, fan, wheel and tree.  相似文献
2.
In this paper we present a new algorithm for the solution of nonlinear complementarity problems. The algorithm is based on a semismooth equation reformulation of the complementarity problem. We exploit the recent extension of Newton's method to semismooth systems of equations and the fact that the natural merit function associated to the equation reformulation is continuously differentiable to develop an algorithm whose global and quadratic convergence properties can be established under very mild assumptions. Other interesting features of the new algorithm are an extreme simplicity along with a low computational burden per iteration. We include numerical tests which show the viability of the approach.  相似文献
3.
4.
A new algorithm for the solation of large-scale nonlinear complementarity problems is introduced. The algorithm is based on a nonsmooth equation reformulation of the complementarity problem and on an inexact Levenberg-Marquardt-type algorithm for its solution. Under mild assumptions, and requiring only the approximate solution of a linear system at each iteration, the algorithm is shown to be both globally and superlinearly convergent, even on degenerate problems. Numerical results for problems with up to 10 000 variables are presented. Partially supported by Agenzia Spaziale Italiana, Roma, Italy.  相似文献
5.
Newton-Thiele's rational interpolants   总被引:13,自引:0,他引:13  
It is well known that Newton's interpolation polynomial is based on divided differences which produce useful intermediate results and allow one to compute the polynomial recursively. Thiele's interpolating continued fraction is aimed at building a rational function which interpolates the given support points. It is interesting to notice that Newton's interpolation polynomials and Thiele's interpolating continued fractions can be incorporated in tensor‐product‐like manner to yield four kinds of bivariate interpolation schemes. Among them are classical bivariate Newton's interpolation polynomials which are purely linear interpolants, branched continued fractions which are purely nonlinear interpolants and have been studied by Chaffy, Cuyt and Verdonk, Kuchminska, Siemaszko and many other authors, and Thiele-Newton's bivariate interpolating continued fractions which are investigated in another paper by one of the authors. In this paper, emphasis is put on the study of Newton-Thiele's bivariate rational interpolants. By introducing so‐called blending differences which look partially like divided differences and partially like inverse differences, we give a recursive algorithm accompanied with a numerical example. Moreover, we bring out the error estimation and discuss the limiting case. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献
6.
Integration and approximation in arbitrary dimensions   总被引:13,自引:0,他引:13  
We study multivariate integration and approximation for various classes of functions of d variables with arbitrary d. We consider algorithms that use function evaluations as the information about the function. We are mainly interested in verifying when integration and approximation are tractable and strongly tractable. Tractability means that the minimal number of function evaluations needed to reduce the initial error by a factor of ɛ is bounded by C(dp for some exponent p independent of d and some function C(d). Strong tractability means that C(d) can be made independent of d. The ‐exponents of tractability and strong tractability are defined as the smallest powers of ɛ{-1} in these bounds. We prove that integration is strongly tractable for some weighted Korobov and Sobolev spaces as well as for the Hilbert space whose reproducing kernel corresponds to the covariance function of the isotropic Wiener measure. We obtain bounds on the ‐exponents, and for some cases we find their exact values. For some weighted Korobov and Sobolev spaces, the strong ‐exponent is the same as the ‐exponent for d=1, whereas for the third space it is 2. For approximation we also consider algorithms that use general evaluations given by arbitrary continuous linear functionals as the information about the function. Our main result is that the ‐exponents are the same for general and function evaluations. This holds under the assumption that the orthonormal eigenfunctions of the covariance operator have uniformly bounded L∞ norms. This assumption holds for spaces with shift-invariant kernels. Examples of such spaces include weighted Korobov spaces. For a space with non‐shift‐invariant kernel, we construct the corresponding space with shift-invariant kernel and show that integration and approximation for the non-shift-invariant kernel are no harder than the corresponding problems with the shift-invariant kernel. If we apply this construction to a weighted Sobolev space, whose kernel is non-shift-invariant, then we obtain the corresponding Korobov space. This enables us to derive the results for weighted Sobolev spaces. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献
7.
Dissipativity of Runge-Kutta methods for dynamical systems with delays   总被引:12,自引:0,他引:12  
This paper is concerned with the numerical solution of dissipativeinitial value problems with delays by Runge-Kutta methods. Asufficient condition for the dissipativity of the systems isgiven. The concepts of D(l)-dissipativity and GD(l)-dissipativityare introduced. We investigate the dissipativity propertiesof (k,l)-algebraically stable Runge-Kutta methods with piecewiseconstant or linear interpolation procedures for finite-dimensionaland infinite-dimensional dynamical systems with delays.  相似文献
8.
BIVARIATE BLENDING RATIONAL INTERPOLANTS   总被引:12,自引:0,他引:12  
Both the Newton interpolating polynomials and the Thiele-type interpolating continued fractions based on inverse differences are used to construct a kind of bivariate blending rational interpolants and an error estimation is given.  相似文献
9.
Let be a bounded domain such that . Let be a (P.S.) sequence of the functional . We study the limit behaviour of and obtain a global compactness result.

  相似文献

10.
复合广义齐次Poisson过程的多险种破产概率   总被引:11,自引:0,他引:11  
本文推广了经典的复合泊松风险模型,建立了两类复合广义齐次poisson过程的多险种破产模型.对于新模型,我们得到了初始资本为u的破产概率φ(u)的精确表达式以及特殊情况下φ(0)的表达式,并且导出了调节系数方程和调节系数R的上下界.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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