首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2819篇
  免费   139篇
  国内免费   179篇
化学   68篇
晶体学   2篇
力学   198篇
综合类   43篇
数学   2569篇
物理学   257篇
  2024年   2篇
  2023年   19篇
  2022年   19篇
  2021年   32篇
  2020年   42篇
  2019年   38篇
  2018年   39篇
  2017年   51篇
  2016年   57篇
  2015年   46篇
  2014年   90篇
  2013年   112篇
  2012年   47篇
  2011年   71篇
  2010年   86篇
  2009年   102篇
  2008年   137篇
  2007年   153篇
  2006年   132篇
  2005年   122篇
  2004年   89篇
  2003年   104篇
  2002年   87篇
  2001年   74篇
  2000年   81篇
  1999年   67篇
  1998年   75篇
  1997年   54篇
  1996年   30篇
  1995年   30篇
  1994年   24篇
  1993年   20篇
  1992年   22篇
  1991年   33篇
  1990年   113篇
  1989年   127篇
  1988年   66篇
  1987年   70篇
  1986年   99篇
  1985年   74篇
  1984年   83篇
  1983年   14篇
  1982年   66篇
  1981年   40篇
  1980年   72篇
  1979年   48篇
  1978年   60篇
  1977年   15篇
  1974年   1篇
  1971年   1篇
排序方式: 共有3137条查询结果,搜索用时 15 毫秒
1.
对由一类非线性抛物型变分不等方程所描述的无穷维动力系统,给出了存在全局吸引子及弱近似惯性流形的充分条件.  相似文献   
2.
Numerical integration of ordinary differential equations on manifolds   总被引:4,自引:0,他引:4  
Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.  相似文献   
3.
Summary In the analysis of discretization methods for stiff intial value problems, stability questions have received most part of the attention in the past.B-stability and the equivalent criterion algebraic stability are well known concepts for Runge-Kutta methods applied to dissipative problems. However, for the derivation ofB-convergence results — error bounds which are not affected by stiffness — it is not sufficient in many cases to requireB-stability alone. In this paper, necessary and sufficient conditions forB-convergence are determined.This paper was written while J. Schneid was visiting the Centre for Mathematics and Computer Science with an Erwin-Schrödinger stipend from the Fonds zur Förderung der wissenschaftlichen Forschung  相似文献   
4.
Summary We present an approximation method of a space-homogeneous transport equation which we prove is convergent. The method is very promising for numerical computation. Comparison of a numerical computation with an exact solution is given for the Master equation.  相似文献   
5.
Summary In 1980 Dahmen-DeVore-Scherer introduced a modulus of continuity which turns out to reflect invariance properties of compound cubature rules effectively. Accordingly, sharp error bounds are derived, the existence of relevant counterexamples being a consequence of a quantitative resonance principle, established previously.  相似文献   
6.
Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.  相似文献   
7.
Malcev–Poisson structure on a manifold is analogous to a Poisson structure with the Lie identity replaced by a slightly more general Malcev identity. Examples of such structures arise naturally. In the second part of the paper we study Malcev bialgebras. A theorem of characterization is proved.  相似文献   
8.
Admissible slopes for monotone and convex interpolation   总被引:1,自引:0,他引:1  
Summary In many applications, interpolation of experimental data exhibiting some geometric property such as nonnegativity, monotonicity or convexity is unacceptable unless the interpolant reflects these characteristics. This paper identifies admissible slopes at data points of variousC 1 interpolants which ensure a desirable shape. We discuss this question, in turn for the following function classes commonly used for shape preserving interpolations: monotone polynomials,C 1 monotone piecewise polynomials, convex polynomials, parametric cubic curves and rational functions.  相似文献   
9.
ACOMPLETEMETRICOFPOSITIVECURVATUREONR~nANDEXISTENCEOFCLOSEDGEODESICS¥ZHUDAXIN(DepartmentofMathematics,TianjinUniversitylTianj?..  相似文献   
10.
Summary In the present paper we study truncated projections for the fanbeam geometry in computerized tomography. First we derive consistency conditions for the divergent beam transform. Then we study a singular value decomposition for the case where only the interior rays in the fan are provided, as for example in region-of-interest tomography. We show that the high angular frequency components of the searched-for densities are well determined and we present reconstructions from real data where the missing information is approximated based on the singular value decomposition.The work of the authors was supported by the Deutsche Forschungsgemeinschaft under grant Lo 310/2-4  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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