全文获取类型
收费全文 | 5447篇 |
免费 | 202篇 |
国内免费 | 250篇 |
专业分类
化学 | 1900篇 |
晶体学 | 59篇 |
力学 | 93篇 |
综合类 | 109篇 |
数学 | 3182篇 |
物理学 | 556篇 |
出版年
2024年 | 20篇 |
2023年 | 38篇 |
2022年 | 159篇 |
2021年 | 125篇 |
2020年 | 98篇 |
2019年 | 150篇 |
2018年 | 170篇 |
2017年 | 105篇 |
2016年 | 113篇 |
2015年 | 121篇 |
2014年 | 166篇 |
2013年 | 298篇 |
2012年 | 260篇 |
2011年 | 285篇 |
2010年 | 275篇 |
2009年 | 347篇 |
2008年 | 342篇 |
2007年 | 351篇 |
2006年 | 309篇 |
2005年 | 226篇 |
2004年 | 244篇 |
2003年 | 185篇 |
2002年 | 148篇 |
2001年 | 123篇 |
2000年 | 148篇 |
1999年 | 145篇 |
1998年 | 114篇 |
1997年 | 107篇 |
1996年 | 71篇 |
1995年 | 74篇 |
1994年 | 59篇 |
1993年 | 80篇 |
1992年 | 52篇 |
1991年 | 45篇 |
1990年 | 43篇 |
1989年 | 39篇 |
1988年 | 34篇 |
1987年 | 35篇 |
1986年 | 29篇 |
1985年 | 18篇 |
1984年 | 23篇 |
1983年 | 11篇 |
1982年 | 20篇 |
1981年 | 16篇 |
1980年 | 19篇 |
1979年 | 20篇 |
1978年 | 21篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1975年 | 3篇 |
排序方式: 共有5899条查询结果,搜索用时 15 毫秒
121.
A control-theoretic approach is used to design a new automatic stepsize control algorithm for the numerical integration of ODE's. The new control algorithm is more robust at little extra expense. Its improved performance is particularly evident when the stepsize is limited by numerical stability. Comparative numerical tests are presented. 相似文献
122.
123.
We show that weakly closed Jordan ideals in nest algebras on Banach spaces are associative ideals. The decomposability of
finite-rank operators in Jordan ideals and the commutants of bimodules are also investigated.
Author’s address: J. Li and F. Lu, Department of Mathematics, Suzhou University, Suzhou 215006, People’s Republic of China
This research was supported by NNSFC (No. 10771154) and PNSFJ (NO. BK2007049). 相似文献
124.
Let k be an algebraically closed field, t∈Z?1, and let B be the Borel subgroup of GLt(k) consisting of upper-triangular matrices. Let Q be a parabolic subgroup of GLt(k) that contains B and such that the Lie algebra qu of the unipotent radical of Q is metabelian, i.e. the derived subalgebra of qu is abelian. For a dimension vector L source" title="View the MathML source" src="http://ars.sciencedirect.com/content/image/1-s2.0-S0007449708000523-si6.gif"> with L source" title="View the MathML source" src="http://ars.sciencedirect.com/content/image/1-s2.0-S0007449708000523-si7.gif">, we obtain a parabolic subgroup P(d) of GLn(k) from B by taking upper-triangular block matrices with (i,j) block of size di×dj. In a similar manner we obtain a parabolic subgroup Q(d) of GLn(k) from Q. We determine all instances when P(d) acts on qu(d) with a finite number of orbits for all dimension vectors d. Our methods use a translation of the problem into the representation theory of certain quasi-hereditary algebras. In the finite cases, we use Auslander-Reiten theory to explicitly determine the P(d)-orbits; this also allows us to determine the degenerations of P(d)-orbits. 相似文献
125.
Kaisa Matomäki 《Journal of Number Theory》2009,129(9):2214-2225
We prove a Bombieri-Vinogradov type result for linear exponential sums over primes. Then we apply it to show that, for any irrational α and some θ>0, there are infinitely many primes p such that p+2 has at most two prime factors and ‖αp+β‖<p−θ. 相似文献
126.
We study the existence and uniqueness of the solution for a telegraph equation with integral condition. We apply the Rothe time discretization method, then we prove its convergence. 相似文献
127.
Numerical methods for ordinary initial value problems that do not depend on special properties of the system are usually found in the class of linear multistage multivalue methods, first formulated by J.C. Butcher. Among these the explicit methods are easiest to implement. For these reasons there has been considerable research activity devoted to generating methods of this class which utilize independent function evaluations that can be performed in parallel. Each such group of concurrent function evaluations can be regarded as a stage of the method. However, it turns out that parallelism affords only limited opportunity for reducing the computing time with such methods. This is most evident for the simple linear homogeneous constant-coefficient test problem, whose solution is essentially a matter of approximating the exponential by an algebraic function. For a given number of stages and a given number of saved values, parallelism offers a somewhat enlarged set of algebraic functions from which to choose. However, there is absolutely no benefit in having the degree of parallelism (number of processors) exceed the number of saved values of the method. Thus, in particular, parallel one-step methods offer no speedup over serial one-step methods for the standard linear test problem. Although the implication of this result for general nonlinear problems is unclear, there are indications that dramatic speedups are not possible in general. Also given are some results relevant to the construction of methods.Work supported in part by National Science Foundation grants DMS 89 11410 and DMS 90 15533 and by US Department of Energy grant DOE DEFG02-87ER25026. Work of the second author was completed while at the University of Illinois. 相似文献
128.
129.
S. K. Upadhyay 《Applicable analysis》2013,92(4):381-397
In this article we improve the characterisation of [R.S. Pathak and S.K. Upadhyay (1994). W p -space and Fourier transformation. Proc. Amer. Math Soc ., 121 (3), 733-738.] and study the properties of pseudo-differential operator on the space , where z 1 , M 1 are convex functions and a, b are positive constants. 相似文献
130.