全文获取类型
收费全文 | 5888篇 |
免费 | 610篇 |
国内免费 | 533篇 |
专业分类
化学 | 432篇 |
晶体学 | 5篇 |
力学 | 424篇 |
综合类 | 109篇 |
数学 | 4240篇 |
物理学 | 1821篇 |
出版年
2023年 | 46篇 |
2022年 | 71篇 |
2021年 | 74篇 |
2020年 | 111篇 |
2019年 | 118篇 |
2018年 | 108篇 |
2017年 | 130篇 |
2016年 | 160篇 |
2015年 | 128篇 |
2014年 | 219篇 |
2013年 | 484篇 |
2012年 | 290篇 |
2011年 | 348篇 |
2010年 | 300篇 |
2009年 | 390篇 |
2008年 | 416篇 |
2007年 | 396篇 |
2006年 | 403篇 |
2005年 | 313篇 |
2004年 | 277篇 |
2003年 | 261篇 |
2002年 | 251篇 |
2001年 | 226篇 |
2000年 | 203篇 |
1999年 | 207篇 |
1998年 | 170篇 |
1997年 | 126篇 |
1996年 | 132篇 |
1995年 | 74篇 |
1994年 | 77篇 |
1993年 | 64篇 |
1992年 | 44篇 |
1991年 | 39篇 |
1990年 | 42篇 |
1989年 | 24篇 |
1988年 | 42篇 |
1987年 | 25篇 |
1986年 | 21篇 |
1985年 | 33篇 |
1984年 | 34篇 |
1983年 | 16篇 |
1982年 | 27篇 |
1981年 | 17篇 |
1980年 | 17篇 |
1979年 | 21篇 |
1978年 | 10篇 |
1977年 | 14篇 |
1976年 | 8篇 |
1974年 | 7篇 |
1970年 | 3篇 |
排序方式: 共有7031条查询结果,搜索用时 15 毫秒
71.
Z. Ditzian 《Proceedings of the American Mathematical Society》1996,124(6):1773-1781
We show that the -functional
where , is equivalent to the rate of convergence of a certain linear polynomial operator. This operator stems from a Riesz-type summability process of expansion by Legendre polynomials. We use the operator above to obtain a linear polynomial approximation operator with a rate comparable to that of the best polynomial approximation.
72.
A good preconditioner is extremely important in order for the conjugate gradients method to converge quickly. In the case of Toeplitz matrices, a number of recent studies were made to relate approximation of functions to good preconditioners. In this paper, we present a new result relating the quality of the Toeplitz preconditionerC for the Toeplitz matrixT to the Chebyshev norm (f– g)/f, wheref and g are the generating functions forT andC, respectively. In particular, the construction of band-Toeplitz preconditioners becomes a linear minimax approximation problem. The case whenf has zeros (but is nonnegative) is especially interesting and the corresponding approximation problem becomes constrained. We show how the Remez algorithm can be modified to handle the constraints. Numerical experiments confirming the theoretical results are presented. 相似文献
73.
L. Brutman 《Numerical Algorithms》1993,5(9):437-442
Generalized alternating polynomials have been introduced by the author earlier. In the present paper their indirect analogue is constructed for numerical solution of the Fredholm linear integral equations. Although the proposed method is a particular case of the general projection scheme, its valuable feature is the presence of a sequence of parameters, which, for sufficiently smooth kernels and inhomogeneous terms, serves as an indicator of the quality of approximation. 相似文献
74.
The probability of first return to the initial intervalx and the diffusion tensorD
x are calculated exactly for a ballistic Lorentz gas on a Bethe lattice or Cayley tree. It consists of a moving particle and a fixed array of scatterers, located at the nodes, and the lengths of the intervals between scatterers are determined by a geometric distribution. The same values forx andD
x apply also to a regular space lattice with a fraction of sites occupied by a scatterer in the limit of a small concentration of scatterers. If backscattering occurs, the results are very different from the Boltzmann approximation. The theory is applied to different types of lattices and different types of scatterers having rotational or mirror symmetries. 相似文献
75.
We are dealing with a numerical method for solving the problem of minimizing a difference of two convex functions (a d.c. function) over a closed convex set in
n
. This algorithm combines a new prismatic branch and bound technique with polyhedral outer approximation in such a way that only linear programming problems have to be solved.Parts of this research were accomplished while the third author was visiting the University of Trier, Germany, as a fellow of the Alexander von Humboldt foundation. 相似文献
76.
In this paper we study constraint qualifications and duality results for infinite convex programs (P) = inf{f(x): g(x) – S, x C}, whereg = (g
1,g
2) andS = S
1 ×S
2,S
i
are convex cones,i = 1, 2,C is a convex subset of a vector spaceX, andf andg
i
are, respectively, convex andS
i
-convex,i = 1, 2. In particular, we consider the special case whenS
2 is in afinite dimensional space,g
2 is affine andS
2 is polyhedral. We show that a recently introduced simple constraint qualification, and the so-called quasi relative interior constraint qualification both extend to (P), from the special case thatg = g
2 is affine andS = S
2 is polyhedral in a finite dimensional space (the so-called partially finite program). This provides generalized Slater type conditions for (P) which are much weaker than the standard Slater condition. We exhibit the relationship between these two constraint qualifications and show how to replace the affine assumption ong
2 and the finite dimensionality assumption onS
2, by a local compactness assumption. We then introduce the notion of strong quasi relative interior to get parallel results for more general infinite dimensional programs without the local compactness assumption. Our basic tool reduces to guaranteeing the closure of the sum of two closed convex cones. 相似文献
77.
Chu-In Charles Lee 《Annals of the Institute of Statistical Mathematics》1992,44(1):107-120
The Laplace continued fraction is derived through a power series. It provides both upper bounds and lower bounds of the normal tail probability % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiqbfA6agzaaraaaaa!3DC0!\[\bar \Phi\](x), it is simple, it converges for x>0, and it is by far the best approximation for x3. The Laplace continued fraction is rederived as an extreme case of admissible bounds of the Mills' ratio, % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiqbfA6agzaaraaaaa!3DC0!\[\bar \Phi\](x)/(x), in the family of ratios of two polynomials subject to a monotone decreasing absolute error. However, it is not optimal at any finite x. Convergence at the origin and local optimality of a subclass of admissible bounds are investigated. A modified continued fraction is proposed. It is the sharpest tail bound of the Mills' ratio, it has a satisfactory convergence rate for x1 and it is recommended for the entire range of x if a maximum absolute error of 10-4 is required.The efforts of the author were supported by the NSERC of Canada. 相似文献
78.
为加快张量积型Said-Ball曲面渐近迭代逼近法的收敛速度,探讨了张量积型Said-Ball曲面渐近迭代逼近法的预处理技术。首先利用对角补偿约化技术构造了预处理子,然后结合矩阵Kronecker积性质,采取预处理渐近迭代逼近法求解张量积型Said-Ball曲面。为进一步降低计算量并提高算法的稳定性,利用广义极小残差法求解预处理方程,得到预处理渐近迭代逼近法的非精确求解方法。分析了预处理渐近迭代逼近法及非精确求解方法的收敛性。最后用数值实例说明预处理子能大大减小迭代矩阵的谱半径,令预处理技术及其非精确求解方法的计算效率明显提高。此外,由于对角补偿预处理子能改善配置矩阵的谱分布,因此也可用于对广义极小残差法的预处理,以改善其收敛性。 相似文献
79.
本文提出一种用于海洋温跃层边界提取的组合算法,该算法基于调整判定阈值后的垂直梯度法和一种改进函数模型几何形态后的拟阶梯函数逼近法。为验证该算法对于温跃层边界提取的适应性、客观性,利用中国Argo实时资料中心发布的全球海洋Argo网格资料集(BOA_Argo),选取2018年夏季0°~30°N,135°E~165°E所在的太平洋区域的温度剖面数据进行处理,结果表明,该算法对低纬度海区温度剖面拟合质量较好,拟合均方根误差普遍低于1.3℃,而且提取到的温跃层上下边界在纬向更加平缓,然而对于中高纬度海区的温度剖面,组合算法的处理效果不佳,更适合直接通过垂直梯度法进行温跃层的提取。 相似文献
80.
The Pauli master equation describes the statistical equilibration of a closed quantum system. Simplifying and generalizing an approach developed in two previous papers, we present a derivation of that equation using concepts developed in quantum chaos and random-matrix theory. We assume that the system consists of subsystems with strong internal mixing. We can then model the system as an ensemble of random matrices. Equilibration results from averaging over the ensemble. The direction of the arrow of time is determined by an (ever-so-small) coupling to the outside world. The master equation holds for sufficiently large times if the average level densities in all subsystems are sufficiently smooth. These conditions are quantified in the text, and leading-order correction terms are given. 相似文献