首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   96348篇
  免费   5592篇
  国内免费   12172篇
化学   71733篇
晶体学   1154篇
力学   2902篇
综合类   1065篇
数学   16212篇
物理学   21046篇
  2024年   97篇
  2023年   714篇
  2022年   1754篇
  2021年   2062篇
  2020年   2363篇
  2019年   2328篇
  2018年   1972篇
  2017年   2944篇
  2016年   3141篇
  2015年   2586篇
  2014年   3644篇
  2013年   6988篇
  2012年   6592篇
  2011年   5308篇
  2010年   4474篇
  2009年   6150篇
  2008年   6354篇
  2007年   6568篇
  2006年   5955篇
  2005年   5027篇
  2004年   4631篇
  2003年   3867篇
  2002年   5099篇
  2001年   2988篇
  2000年   2779篇
  1999年   2566篇
  1998年   2257篇
  1997年   1782篇
  1996年   1512篇
  1995年   1423篇
  1994年   1262篇
  1993年   1041篇
  1992年   991篇
  1991年   663篇
  1990年   561篇
  1989年   546篇
  1988年   395篇
  1987年   313篇
  1986年   294篇
  1985年   251篇
  1984年   258篇
  1983年   147篇
  1982年   222篇
  1981年   183篇
  1980年   209篇
  1979年   187篇
  1978年   174篇
  1977年   128篇
  1976年   115篇
  1973年   68篇
排序方式: 共有10000条查询结果,搜索用时 742 毫秒
991.
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  相似文献   
992.
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).  相似文献   
993.
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.  相似文献   
994.
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.  相似文献   
995.
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.  相似文献   
996.
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.  相似文献   
997.
Summary The problem of the construction of an equilibrium surface taking the surface tension into account leads to Laplace-Young equation which is a nonlinear elliptic free-boundary problem. In contrast to Orr et al. where an iterative technique is used for direct solution of the equation for problems with simple geometry, we propose here an alternative approach based on shape optimization techniques. The shape of the domain of the liquid is varied to attain the optimality condition. Using optimal control theory to derive expressions for the gradient, a numerical scheme is proposed and simple model problems are solved to validate the scheme.  相似文献   
998.
Summary We propose and analyse a method of estimating the poles near the unit circleT of a functionG whose values are given at a grid of points onT: we give an algorithm for performing this estimation and prove a convergence theorem. The method is to identify the phase for an estimate by considering the peaks of the absolute value ofG onT, and then to estimate the modulus by seeking a bestL 2 fit toG over a small arc by a first order rational function. These pole estimates lead to the construction of a basis ofL 2 which is well suited to the numerical representation of the Hankel operator with symbolG and thereby to the numerical solution of the Nehari problem (computing the bestH , analytic, approximation toG relative to theL norm), as analysed in [HY]. We present the results of numerical tests of these algorithms.Partially supported by grants from the AFOSR and NSF  相似文献   
999.
研究了采用低场脉冲核磁共振(NMR)测定二醋酸纤维素丝束油剂的新方法,给出NMR法测定二醋酸纤维素丝束油荆含量的标准曲线。同时对NMR法测量二醋酸纤维素丝束油荆不确定度进行了评估。结果表明,NMR法具有分析速度快、无污染、无损伤和准确度高的优点,适合于二醋酸纤维素丝束油荆的分析。  相似文献   
1000.
Optimality for set functions with values in ordered vector spaces   总被引:3,自引:0,他引:3  
Let (X, , ) be a finite atomless measure space,L a convex subfamily of , andY andZ locally convex Hausdorff topological vector spaces which are ordered by the conesC andD, respectively. LetF:LY beC-convex andG:LZ beD-convex set functions. Consider the following optimization problem (P): minimizeF(), subject to L andG() D . The paper generalizes the Moreau-Rockafellar theorem with set functions. By applying this theorem, a Kuhn-Tucker type optimality condition and a Fritz John type optimality condition for problem (P) are established. The duality theorem for problem (P) is also studied.This work was partially supported by National Science Council, Taipei, Taiwan. This paper was written while the first author was visiting at the University of Iowa, 1987-88.The authors would like to express their gratitude to the two anonymous referees for their valuable comments. Also, they would like to thank Professor P. L. Yu for his encouragement and suggestions which improved the material presented here considerably.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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