 首页 | 本学科首页 官方微博 | 高级检索

 按 中文标题 英文标题 中文关键词 英文关键词 中文摘要 英文摘要 作者中文名 作者英文名 单位中文名 单位英文名 基金中文名 基金英文名 杂志中文名 杂志英文名 栏目英文名 栏目英文名 DOI 责任编辑 分类号 杂志ISSN号 检索 检索词:

 收费全文 3166篇 国内免费 310篇 完全免费 234篇
 数学 3710篇
 2023年 3篇 2022年 27篇 2021年 37篇 2020年 16篇 2019年 21篇 2018年 117篇 2017年 91篇 2016年 42篇 2015年 76篇 2014年 144篇 2013年 226篇 2012年 174篇 2011年 221篇 2010年 207篇 2009年 236篇 2008年 191篇 2007年 197篇 2006年 181篇 2005年 85篇 2004年 87篇 2003年 84篇 2002年 73篇 2001年 104篇 2000年 97篇 1999年 81篇 1998年 66篇 1997年 79篇 1996年 60篇 1995年 77篇 1994年 59篇 1993年 78篇 1992年 70篇 1991年 37篇 1990年 55篇 1989年 32篇 1988年 29篇 1987年 21篇 1986年 27篇 1985年 25篇 1984年 26篇 1983年 20篇 1982年 16篇 1981年 10篇 1980年 14篇 1979年 5篇 1978年 3篇 1977年 7篇 1976年 11篇 1975年 8篇 1974年 7篇 1973年 9篇 1972年 10篇 1971年 4篇 1970年 3篇 1969年 6篇 1968年 1篇 1967年 5篇 1962年 1篇 1960年 2篇 1955年 3篇 1953年 2篇 1952年 2篇 1951年 2篇

1.
On adjacent-vertex-distinguishing total coloring of graphs   总被引：40，自引：0，他引：40
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.

3.
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.  相似文献
4.
5.
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.  相似文献
6.
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.  相似文献
7.
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.  相似文献
8.
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.  相似文献
9.
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.  相似文献
10.
A Note on Adjacent Strong Edge Coloring of K（n,m）   总被引：11，自引：0，他引：11
In this paper, we prove that the adjacent strong edge chromatic number of a graph K（n,m） is n ＋ 1, with n ≥ 2, m ≥ 1.  相似文献