全文获取类型
收费全文 | 5785篇 |
免费 | 475篇 |
国内免费 | 467篇 |
专业分类
化学 | 709篇 |
晶体学 | 14篇 |
力学 | 362篇 |
综合类 | 148篇 |
数学 | 4623篇 |
物理学 | 871篇 |
出版年
2024年 | 12篇 |
2023年 | 70篇 |
2022年 | 64篇 |
2021年 | 94篇 |
2020年 | 143篇 |
2019年 | 158篇 |
2018年 | 168篇 |
2017年 | 161篇 |
2016年 | 199篇 |
2015年 | 138篇 |
2014年 | 240篇 |
2013年 | 534篇 |
2012年 | 201篇 |
2011年 | 273篇 |
2010年 | 217篇 |
2009年 | 341篇 |
2008年 | 364篇 |
2007年 | 359篇 |
2006年 | 369篇 |
2005年 | 329篇 |
2004年 | 274篇 |
2003年 | 243篇 |
2002年 | 254篇 |
2001年 | 196篇 |
2000年 | 215篇 |
1999年 | 193篇 |
1998年 | 164篇 |
1997年 | 151篇 |
1996年 | 106篇 |
1995年 | 64篇 |
1994年 | 58篇 |
1993年 | 57篇 |
1992年 | 45篇 |
1991年 | 17篇 |
1990年 | 29篇 |
1989年 | 26篇 |
1988年 | 20篇 |
1987年 | 26篇 |
1986年 | 20篇 |
1985年 | 24篇 |
1984年 | 18篇 |
1983年 | 9篇 |
1982年 | 10篇 |
1981年 | 12篇 |
1980年 | 11篇 |
1979年 | 12篇 |
1978年 | 10篇 |
1977年 | 11篇 |
1976年 | 5篇 |
1974年 | 4篇 |
排序方式: 共有6727条查询结果,搜索用时 31 毫秒
71.
王登银 《数学物理学报(B辑英文版)》2007,27(2):317-328
All parabolic subgroups and Borel subgroups of PΩ(2m 1, F) over a linear-able field F of characteristic 0 are shown to be complete groups, provided m > 3. 相似文献
72.
73.
In this paper we consider certain matrix equations in the field of Mikusiński operators, and construct a method for obtaining an approximate solution which allows working with numerical constants instead of operators. The theory of diagonally dominant matrices is applied for the analysis, existence and character of the obtained solutions. We introduce a method for determining approximate solutions of a discrete analogue for operational differential equations and give conditions for their existence. The error of the approximation is estimated. 相似文献
74.
Arne Barinka Stephan Dahlke Wolfgang Dahmen 《Advances in Computational Mathematics》2006,24(1-4):5-34
Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work
balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations
as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the
approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could
be shown under the assumption that the entries in properly compressed standard representations are known or computable in
average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption
is justified in the context of elliptic boundary value problems.
Dedicated to Charles A. Micchelli on the occasion of his 60th birthday
Mathematics subject classifications (2000) 41A25, 41A46, 65F99, 65N12, 65N55.
This work has been supported in part by the Deutsche Forschungsgemeinschaft SFB 401, the first and third author are supported
in part by the European Community's Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY). The
second author acknowledges the financial support provided through the European Union's Human Potential Programme, under contract
HPRN-CT-2002-00285 (HASSIP) and through DFG grant DA 360/4–1. 相似文献
75.
介绍了19世纪存在于澳大利亚土著中的一种婚姻形式—级别婚,从群论的角度说明级别婚的三种主要形式都对应于一个对称群,从而可以用几何方法形象的表示这种婚姻形式;进而,从对称的观点说明婚姻形式从简单到复杂的演化过程,代数上对应于对称群阶数的增加,几何上则对应于对称性的加强. 相似文献
76.
环上矩阵的广义Moore-Penrose逆 总被引:14,自引:0,他引:14
本文给出带有对合的有1的结合环上一类矩阵的广义Moore-Penrose逆存在的充要条件,而这类矩阵概括了左右主理想整环,单Artin环上所有矩阵。 相似文献
77.
The purpose of this paper is two-fold. First, we introduce a new asymptotic expansion in the exponent for the compound binomial
approximation of the generalized Poisson binomial distribution. The dependence of its accuracy on the symmetry and shifting
of distributions is investigated. Second, for compound binomial and compound Poisson distributions, we present new smoothness
estimates, some of which contain explicit constants. Finally, the ideas used in this paper enable us to prove new precise
bounds in the compound Poisson approximation.
Published in Lietuvos Matematikos Rinkinys, Vol. 46, No. 1, pp. 67–110, January–March, 2006. 相似文献
78.
The adaptive cross approximation (ACA) algorithm (Numer. Math. 2000; 86 :565–589; Computing 2003; 70 (1):1–24) provides a means to compute data‐sparse approximants of discrete integral formulations of elliptic boundary value problems with almost linear complexity. ACA uses only few of the original entries for the approximation of the whole matrix and is therefore well‐suited to speed up existing computer codes. In this article we extend the convergence proof of ACA to Galerkin discretizations. Additionally, we prove that ACA can be applied to integral formulations of systems of second‐order elliptic operators without adaptation to the respective problem. The results of applying ACA to boundary integral formulations of linear elasticity are reported. Furthermore, we comment on recent implementation issues of ACA for non‐smooth boundaries. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
79.
Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with
respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization
of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case
of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods
and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank
approximants. Properties of Gander methods are investigated in details.
AMS subject classification (2000) 65F30, 15A18 相似文献
80.