全文获取类型
收费全文 | 24395篇 |
免费 | 1651篇 |
国内免费 | 1238篇 |
专业分类
化学 | 3696篇 |
晶体学 | 41篇 |
力学 | 2092篇 |
综合类 | 228篇 |
数学 | 17808篇 |
物理学 | 3419篇 |
出版年
2024年 | 51篇 |
2023年 | 317篇 |
2022年 | 478篇 |
2021年 | 542篇 |
2020年 | 724篇 |
2019年 | 680篇 |
2018年 | 727篇 |
2017年 | 782篇 |
2016年 | 719篇 |
2015年 | 592篇 |
2014年 | 1165篇 |
2013年 | 2360篇 |
2012年 | 1227篇 |
2011年 | 1324篇 |
2010年 | 1106篇 |
2009年 | 1606篇 |
2008年 | 1664篇 |
2007年 | 1533篇 |
2006年 | 1320篇 |
2005年 | 1100篇 |
2004年 | 910篇 |
2003年 | 873篇 |
2002年 | 747篇 |
2001年 | 544篇 |
2000年 | 582篇 |
1999年 | 541篇 |
1998年 | 479篇 |
1997年 | 441篇 |
1996年 | 364篇 |
1995年 | 274篇 |
1994年 | 202篇 |
1993年 | 173篇 |
1992年 | 165篇 |
1991年 | 129篇 |
1990年 | 98篇 |
1989年 | 61篇 |
1988年 | 60篇 |
1987年 | 58篇 |
1986年 | 57篇 |
1985年 | 98篇 |
1984年 | 99篇 |
1983年 | 48篇 |
1982年 | 51篇 |
1981年 | 51篇 |
1980年 | 34篇 |
1979年 | 37篇 |
1978年 | 26篇 |
1977年 | 22篇 |
1976年 | 15篇 |
1974年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
131.
Ch. Tsitouras 《Numerical Algorithms》2007,44(3):291-307
Runge–Kutta (RK) pairs furnish approximations of the solution of an initial value problem at discrete points in the interval
of integration. Many techniques for enriching these methods with continuous approximations have been proposed. Here we construct
C
1 continuous, eighth and ninth order interpolation methods for a recently appeared RK pair of orders 9(8). These interpolants
share a very small leading truncation error making them suitable for use at quadruple precision, i.e. 32–33 decimal digits
of accuracy. Extended numerical results justify our effort. 相似文献
132.
Andreas Fischer 《Mathematical Programming》1997,76(3):513-532
The paper deals with complementarity problems CP(F), where the underlying functionF is assumed to be locally Lipschitzian. Based on a special equivalent reformulation of CP(F) as a system of equationsφ(x)=0 or as the problem of minimizing the merit functionΘ=1/2∥Φ∥
2
2
, we extend results which hold for sufficiently smooth functionsF to the nonsmooth case.
In particular, ifF is monotone in a neighbourhood ofx, it is proved that 0 εδθ(x) is necessary and sufficient forx to be a solution of CP(F). Moreover, for monotone functionsF, a simple derivative-free algorithm that reducesΘ is shown to possess global convergence properties. Finally, the local behaviour of a generalized Newton method is analyzed.
To this end, the result by Mifflin that the composition of semismooth functions is again semismooth is extended top-order semismooth functions. Under a suitable regularity condition and ifF isp-order semismooth the generalized Newton method is shown to be locally well defined and superlinearly convergent with the
order of 1+p. 相似文献
133.
The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems. 相似文献
134.
无穷区间上二阶微分方程的边值问题 总被引:5,自引:0,他引:5
刘衍胜 《应用泛函分析学报》2002,4(3):211-216
利用Schauder不动点定理讨论了一类非线性二阶微分方程在无穷区间上的边值问题无界解的存在性,部分改进了郭大钧教授最近得到的结果。 相似文献
135.
A multidimensional version of the first Darboux problem is considered for a model second-order degenerating hyperbolic equation. Using the technique of functional spaces with a negative norm, the correct formulation of this problem in the Sobolev weighted space is proved. 相似文献
136.
G. A. Watson 《Advances in Computational Mathematics》1994,2(4):393-405
The orthogonal Procrustes problem involves finding an orthogonal matrix which transforms one given matrix into another in
the least-squares sense, and thus it requires the minimization of the Frobenius matrix norm. We consider, the solution of
this problem for a family of orthogonally invariant norms which includes the Frobenius norm as a special case. 相似文献
137.
We show by general considerations that it is not possible to test violation of the existing versions of Bell’s inequality
in entangled neutral kaons system using experimentally accessible thin regenerators. We point out the loophole in the recent
argument (A Bramon and M Nowakowski, Phys. Rev. Lett.
83, 1 (1999)) that claimed such a test to be possible. 相似文献
138.
Using the appropriate harmonic oscillator states and reasonable approximations, we construct coherent wavepackets corresponding
to the solutions of the Klein-Gordon equation for the attractive potentialV(r)=−k/r, k>0, in two and three space dimensions. We deduce the corresponding classical limit in two dimension by requiring that the
expectation value 〈r〉 of the radial variable is large. In the case of three dimensions, besides the condition of large 〈r〉, we make the uncertainty Δr=[〈r
2〉 − 〈r〉2]1/2 a minimum with respect to certain parameter of the wavepacket. We then investigate the trajectory traversed by the wavepacket
in the classical limit. We find that the classical limit of this relativistic quantal problem gives, in the leading order,
the same expression for the rate of motion of the perihelion as that given by the solution of the corresponding special relativistic
classical dynamical problem. We also briefly discuss some of the subtle aspects of the classical limit of the relativistic
quantal system, in general. 相似文献
139.
Lin Zhengyan 《数学年刊B辑(英文版)》1998,19(3):281-292
§1.IntroductionandResultsLet{Xn,n1}beasequenceofrandomvariableswithacommondistributionfunctionF(x)andletXn1Xn2…Xnnbetheor... 相似文献
140.
W. Brüggemann K. Fischer H. Jahnke 《Journal of Mathematical Modelling and Algorithms》2003,2(2):153-169
In Part I of this study, we suggest to identify an operations research (OR) problem with the equivalence class of models describing the problem and enhance the standard computer-science theory of computational complexity to be applicable to this situation of an often model-based OR context. The Discrete Lot-sizing and Scheduling Problem (DLSP) is analysed here in detail to demonstrate the difficulties which can arise if these aspects are neglected and to illustrate the new theoretical concept. In addition, a new minimal model is introduced for the DLSP which makes this problem eventually amenable to a rigorous analysis of its computational complexity. 相似文献