首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   92349篇
  免费   5075篇
  国内免费   12009篇
化学   70253篇
晶体学   1161篇
力学   2552篇
综合类   871篇
数学   14706篇
物理学   19890篇
  2024年   84篇
  2023年   676篇
  2022年   1210篇
  2021年   1830篇
  2020年   2240篇
  2019年   2235篇
  2018年   1929篇
  2017年   2784篇
  2016年   2928篇
  2015年   2445篇
  2014年   3468篇
  2013年   6831篇
  2012年   6374篇
  2011年   5146篇
  2010年   4385篇
  2009年   5967篇
  2008年   6189篇
  2007年   6353篇
  2006年   5750篇
  2005年   4882篇
  2004年   4514篇
  2003年   3726篇
  2002年   4954篇
  2001年   2870篇
  2000年   2657篇
  1999年   2503篇
  1998年   2176篇
  1997年   1726篇
  1996年   1445篇
  1995年   1379篇
  1994年   1224篇
  1993年   1014篇
  1992年   973篇
  1991年   644篇
  1990年   534篇
  1989年   509篇
  1988年   367篇
  1987年   289篇
  1986年   272篇
  1985年   231篇
  1984年   244篇
  1983年   138篇
  1982年   219篇
  1981年   190篇
  1980年   209篇
  1979年   184篇
  1978年   161篇
  1977年   101篇
  1976年   88篇
  1973年   49篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
971.
The purpose of this paper is to solve the following Pythagorean functional equation:(e p(x,y) ) 2 ) = q(x,y) 2 + r(x, y) 2, where each ofp(x,y), q(x, y) andr(x, y) is a real-valued unknown harmonic function of the real variablesx, y on the wholexy-planeR 2.The result is as follows.  相似文献   
972.
We solve the functional equation
  相似文献   
973.
LetC m be a compound quadrature formula, i.e.C m is obtained by dividing the interval of integration [a, b] intom subintervals of equal length, and applying the same quadrature formulaQ n to every subinterval. LetR m be the corresponding error functional. Iff (r) > 0 impliesR m [f] > 0 (orR m [f] < 0),=" then=" we=" say=">C m is positive definite (or negative definite, respectively) of orderr. This is the case for most of the well-known quadrature formulas. The assumption thatf (r) > 0 may be weakened to the requirement that all divided differences of orderr off are non-negative. Thenf is calledr-convex. Now letC m be positive definite or negative definite of orderr, and letf be continuous andr-convex. We prove the following direct and inverse theorems for the errorR m [f], where , denotes the modulus of continuity of orderr:
  相似文献   
974.
Summary Comparison theorems for weak splittings of bounded operators are presented. These theorems extend the classical comparison theorem for regular splittings of matrices by Varga, the less known result by Wonicki, and the recent results for regular and weak regular splittings of matrices by Neumann and Plemmons, Elsner, and Lanzkron, Rose and Szyld. The hypotheses of the theorems presented here are weaker and the theorems hold for general Banach spaces and rather general cones. Hypotheses are given which provide strict inequalities for the comparisons. It is also shown that the comparison theorem by Alefeld and Volkmann applies exclusively to monotone sequences of iterates and is not equivalent to the comparison of the spectral radius of the iteration operators.This work was supported by the National Science Foundation grants DMS-8807338 and INT-8918502  相似文献   
975.
Summary We prove that the error inn-point Gaussian quadrature, with respect to the standard weight functionw1, is of best possible orderO(n –2) for every bounded convex function. This result solves an open problem proposed by H. Braß and published in the problem section of the proceedings of the 2. Conference on Numerical Integration held in 1981 at the Mathematisches Forschungsinstitut Oberwolfach (Hämmerlin 1982; Problem 2). Furthermore, we investigate this problem for positive quadrature rules and for general product quadrature. In particular, for the special class of Jacobian weight functionsw , (x)=(1–x)(1+x), we show that the above result for Gaussian quadrature is not valid precisely ifw , is unbounded.Dedicated to Prof. H. Braß on the occasion of his 55th birthday  相似文献   
976.
Summary Utilizing kernel structure properties a unified construction of Hankel matrix inversion algorithms is presented. Three types of algorithms are obtained: 1)O(n 2) complexity Levinson type, 2)O (n) parallel complexity Schur-type, and 3)O(n log2 n) complexity asymptotically fast ones. All algorithms work without additional assumption (like strong nonsingularity).  相似文献   
977.
Summary The good Boussinesq equationu tt =–u xxxx +u xx +(u 2) xx has recently been found to possess an interesting soliton-interaction mechanism. In this paper we study the nonlinear stability and the convergence of some simple finite-difference schemes for the numerical solution of problems involving the good Boussinesq equation. Numerical experimentas are also reported.  相似文献   
978.
Summary In this paper we study the convergence properties of a fully discrete Galerkin approximation with a backwark Euler time discretization scheme. An approach based on semigroup theory is used to deal with the nonsmooth Dirichlet boundary data which cannot be handled by standard techniques. This approach gives rise to optimal rates of convergence inL p[O,T;L 2()] norms for boundary conditions inL p[O,T;L 2()], 1p.  相似文献   
979.
Summary For the numerical integration of boundary value problems for first order ordinary differential systems, collocation on Gaussian points is known to provide a powerful method. In this paper we introduce a defect correction method for the iterative solution of such high order collocation equations. The method uses the trapezoidal scheme as the basic discretization and an adapted form of the collocation equations for defect evaluation. The error analysis is based on estimates of the contractive power of the defect correction iteration. It is shown that the iteration producesO(h 2), convergence rates for smooth starting vectors. A new result is that the iteration damps all kind of errors, so that it can also handle non-smooth starting vectors successfully.  相似文献   
980.
Theorem.Let the sequences {e i (n) },i=1, 2, 3,n=0, 1, 2, ...be defined by where the e (0) s satisfy and where all square roots are taken positive. Then where the convergence is quadratic and monotone and where The discussions of convergence are entirely elementary. However, although the determination of the limits can be made in an elementary way, an acquaintance with elliptic objects is desirable for real understanding.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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