全文获取类型
收费全文 | 42574篇 |
免费 | 5398篇 |
国内免费 | 4768篇 |
专业分类
化学 | 13590篇 |
晶体学 | 982篇 |
力学 | 9633篇 |
综合类 | 587篇 |
数学 | 14722篇 |
物理学 | 13226篇 |
出版年
2024年 | 89篇 |
2023年 | 447篇 |
2022年 | 822篇 |
2021年 | 1002篇 |
2020年 | 1250篇 |
2019年 | 1062篇 |
2018年 | 1086篇 |
2017年 | 1485篇 |
2016年 | 1743篇 |
2015年 | 1335篇 |
2014年 | 2156篇 |
2013年 | 3082篇 |
2012年 | 2628篇 |
2011年 | 2966篇 |
2010年 | 2549篇 |
2009年 | 2793篇 |
2008年 | 2687篇 |
2007年 | 2692篇 |
2006年 | 2456篇 |
2005年 | 2286篇 |
2004年 | 1991篇 |
2003年 | 1793篇 |
2002年 | 1590篇 |
2001年 | 1334篇 |
2000年 | 1240篇 |
1999年 | 1139篇 |
1998年 | 1063篇 |
1997年 | 891篇 |
1996年 | 756篇 |
1995年 | 654篇 |
1994年 | 622篇 |
1993年 | 532篇 |
1992年 | 539篇 |
1991年 | 398篇 |
1990年 | 293篇 |
1989年 | 224篇 |
1988年 | 184篇 |
1987年 | 134篇 |
1986年 | 98篇 |
1985年 | 118篇 |
1984年 | 118篇 |
1983年 | 62篇 |
1982年 | 82篇 |
1981年 | 58篇 |
1980年 | 31篇 |
1979年 | 49篇 |
1978年 | 35篇 |
1977年 | 37篇 |
1976年 | 13篇 |
1957年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
121.
单调优化是指目标函数与约束函数均为单调函数的全局优化问题.本文提出一种新的凸化变换方法把单调函数化为凸函数,进而把单调优化问题化为等价的凸极大或凹极小问题,然后采用Hoffman的外逼近方法来求得问题的全局最优解.我们把这种凸化方法同Tuy的Polyblock外逼近方法作了比较,通过数值比较可以看出本文提出的凸化的方法在收敛速度上明显优于Polyblock方法. 相似文献
122.
B. Szafran P. S
p J. Adamowski S. Bednarek 《Physica E: Low-dimensional Systems and Nanostructures》2003,18(4):523-529
We present a theoretical study of the charging spectra in natural and artificial atoms. We apply a model electrostatic potential created by a homogenously charged sphere. This model potential allows for a continuous passage from the Coulomb potential of the nucleus to parabolic confinement potential of quantum dots. We consider electron systems with N=1,…,10 electrons with the use of the Hartree–Fock method. We discuss the qualitative similarities and differences between the chemical potential spectrum of electron systems bound to nucleus and confined in quantum dots. 相似文献
123.
We consider a splitting finite-difference scheme for an initial-boundary value problem for a two-dimensional nonlinear evolutionary
equation. The problem is split into nonlinear and linear parts. The linear part is also split into locally one-dimensional
equations. We prove the convergence and stability of the scheme in L
2 and C norms.
Printed in Lietuvos Matematikos Rinkinys, Vol. 45, No. 3, pp. 413–434, July–September, 2005. 相似文献
124.
125.
126.
127.
映象方程多解问题的某些研究 总被引:1,自引:0,他引:1
本文用fp-同伦方法,在一定的技巧和变换的配合下,在紧性条件支持下,研究了赋范线性空间中一类集值映象方程的多解问题。还给出所得理论结果的一个应用。 相似文献
128.
Efficient Sequential Quadratic Programming Implementations for Equality-Constrained Discrete-Time Optimal Control 总被引:1,自引:0,他引:1
Efficient sequential quadratic programming (SQP) implementations are presented for equality-constrained, discrete-time, optimal control problems. The algorithm developed calculates the search direction for the equality-based variant of SQP and is applicable to problems with either fixed or free final time. Problem solutions are obtained by solving iteratively a series of constrained quadratic programs. The number of mathematical operations required for each iteration is proportional to the number of discrete times N. This is contrasted by conventional methods in which this number is proportional to N
3. The algorithm results in quadratic convergence of the iterates under the same conditions as those for SQP and simplifies to an existing dynamic programming approach when there are no constraints and the final time is fixed. A simple test problem and two application problems are presented. The application examples include a satellite dynamics problem and a set of brachistochrone problems involving viscous friction. 相似文献
129.
A Modified SQP Method and Its Global Convergence 总被引:6,自引:0,他引:6
Guanglu Zhou 《Journal of Global Optimization》1997,11(2):193-205
The sequential quadratic programming method developed by Wilson, Han andPowell may fail if the quadratic programming subproblems become infeasibleor if the associated sequence of search directions is unbounded. In [1], Hanand Burke give a modification to this method wherein the QP subproblem isaltered in a way which guarantees that the associated constraint region isnonempty and for which a robust convergence theory is established. In thispaper, we give a modification to the QP subproblem and provide a modifiedSQP method. Under some conditions, we prove that the algorithm eitherterminates at a Kuhn–Tucker point within finite steps or generates aninfinite sequence whose every cluster is a Kuhn–Tucker point.Finally, we give some numerical examples. 相似文献
130.
对一类变形的变分不等式:求,使得提出了一类投影收缩算法,并得到了该算法的收敛性及相关性质. 相似文献