全文获取类型
收费全文 | 17676篇 |
免费 | 1933篇 |
国内免费 | 1201篇 |
专业分类
化学 | 2071篇 |
晶体学 | 55篇 |
力学 | 1688篇 |
综合类 | 510篇 |
数学 | 12109篇 |
物理学 | 4377篇 |
出版年
2024年 | 39篇 |
2023年 | 150篇 |
2022年 | 402篇 |
2021年 | 385篇 |
2020年 | 344篇 |
2019年 | 397篇 |
2018年 | 422篇 |
2017年 | 608篇 |
2016年 | 750篇 |
2015年 | 507篇 |
2014年 | 921篇 |
2013年 | 1317篇 |
2012年 | 938篇 |
2011年 | 1033篇 |
2010年 | 896篇 |
2009年 | 1196篇 |
2008年 | 1198篇 |
2007年 | 1216篇 |
2006年 | 994篇 |
2005年 | 879篇 |
2004年 | 804篇 |
2003年 | 750篇 |
2002年 | 644篇 |
2001年 | 512篇 |
2000年 | 497篇 |
1999年 | 449篇 |
1998年 | 415篇 |
1997年 | 368篇 |
1996年 | 304篇 |
1995年 | 219篇 |
1994年 | 186篇 |
1993年 | 160篇 |
1992年 | 146篇 |
1991年 | 100篇 |
1990年 | 102篇 |
1989年 | 68篇 |
1988年 | 60篇 |
1987年 | 50篇 |
1986年 | 46篇 |
1985年 | 66篇 |
1984年 | 47篇 |
1983年 | 29篇 |
1982年 | 45篇 |
1981年 | 34篇 |
1980年 | 22篇 |
1979年 | 20篇 |
1978年 | 22篇 |
1977年 | 17篇 |
1976年 | 9篇 |
1959年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
杨晓光 《应用数学学报(英文版)》1997,13(4):337-341
1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv… 相似文献
12.
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. 相似文献
13.
Jinchao Xu 《应用数学学报(英文版)》2002,18(2):185-200
Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids. 相似文献
14.
M. M. Kostreva 《Journal of Optimization Theory and Applications》1989,62(1):63-76
Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments. 相似文献
15.
本文定义了二阶微分方程的弱 Carathéodory解 ,在不涉及紧型条件的情形下 ,直接用迭代法证明了 Banach空间二阶非线性常微分方程两点边值问题存在唯一解 ,并给出逼近解迭代序列的误差估计 ,对周期边值问题得到类似的结果 相似文献
16.
Filippo Bracci Roberto Tauraso Fabio Vlacci 《Journal of Mathematical Analysis and Applications》2002,270(2):1131-473
Let f,g be two commuting holomorphic self-maps of the unit disc. If f and g agree at the common Wolff point up to a certain order of derivatives (no more than 3 if the Wolff point is on the unit circle), then f≡g. 相似文献
17.
R. J. Vanderbei 《Mathematical Programming》1989,43(1-3):31-44
The affine-scaling modification of Karmarkar's algorithm is extended to solve problems with free variables. This extended primal algorithm is used to prove two important results. First the geometrically elegant feasibility algorithm proposed by Chandru and Kochar is the same algorithm as the one obtained by appending a single column of residuals to the constraint matrix. Second the dual algorithm as first described by Adler et al., is the same as the extended primal algorithm applied to the dual. 相似文献
18.
19.
L. Aggoun 《Mathematical and Computer Modelling》2002,36(11-13)
In this paper, finite-dimensional recursive filters for space-time Markov random fields are derived. These filters can be used with the expectation maximization (EM) algorithm to yield maximum likelihood estimates of the parameters of the model. 相似文献
20.
This paper solves the problem of the duration of the total eclipseof a satellite of a body, provided that (a) the body is sphericalin shape and the mass distribution inside the body is sphericallysymmetrical; (b) the satellite is a very small object; (c) thesatellite's orbit around a body is circular and the satellitecan pass through the centre of its shadow; (d) a source of lightis the source of the conical body's shadow (umbra) and it doesnot change its apparent position in the sky; (e) there are noperturbations on the satellite's orbit. The solution presentedrepresents the general discussion of the problem based on utilizationof some parts of the theory of contraction mappings. 相似文献