全文获取类型
收费全文 | 19894篇 |
免费 | 1360篇 |
国内免费 | 1455篇 |
专业分类
化学 | 2499篇 |
晶体学 | 28篇 |
力学 | 807篇 |
综合类 | 225篇 |
数学 | 6996篇 |
物理学 | 2881篇 |
综合类 | 9273篇 |
出版年
2024年 | 29篇 |
2023年 | 171篇 |
2022年 | 250篇 |
2021年 | 313篇 |
2020年 | 377篇 |
2019年 | 399篇 |
2018年 | 366篇 |
2017年 | 457篇 |
2016年 | 551篇 |
2015年 | 465篇 |
2014年 | 854篇 |
2013年 | 1266篇 |
2012年 | 955篇 |
2011年 | 1123篇 |
2010年 | 949篇 |
2009年 | 1153篇 |
2008年 | 1149篇 |
2007年 | 1369篇 |
2006年 | 1206篇 |
2005年 | 1087篇 |
2004年 | 965篇 |
2003年 | 905篇 |
2002年 | 801篇 |
2001年 | 696篇 |
2000年 | 634篇 |
1999年 | 580篇 |
1998年 | 524篇 |
1997年 | 455篇 |
1996年 | 419篇 |
1995年 | 356篇 |
1994年 | 282篇 |
1993年 | 267篇 |
1992年 | 246篇 |
1991年 | 219篇 |
1990年 | 175篇 |
1989年 | 168篇 |
1988年 | 138篇 |
1987年 | 96篇 |
1986年 | 64篇 |
1985年 | 46篇 |
1984年 | 31篇 |
1983年 | 18篇 |
1982年 | 23篇 |
1981年 | 20篇 |
1980年 | 16篇 |
1979年 | 18篇 |
1978年 | 12篇 |
1977年 | 15篇 |
1976年 | 7篇 |
1973年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
V. A. Morozov E. M. Mukhamadiev A. B. Nazimov 《Computational Mathematics and Mathematical Physics》2007,47(12):1885-1892
Regularization of singular systems of linear algebraic equations by shifts is examined. New equivalent conditions for the shift regularizability of such systems are derived. 相似文献
62.
对广泛应用的Lagrange方程的动力学本质做了探讨,指出在引入速度变换矩阵后,Lagrange方程实际上是牛顿第二定律的一种表示方式;由于引入了速度变换矩阵,Lagrange方程可以方便地在任意的坐标系中建立,对动力学问题的求解提供了一个途径。 相似文献
63.
给出了 n元函数极值的一个充分条件 ,并结合矩阵的初等变换建立了 n元函数极值的一种快速判别法 ,最后给出了一个例子 相似文献
64.
This note outlines an algorithm for solving the complex ‘matrix Procrustes problem’. This is a least‐squares approximation over the cone of positive semi‐definite Hermitian matrices, which has a number of applications in the areas of Optimization, Signal Processing and Control. The work generalizes the method of Allwright (SIAM J. Control Optim. 1988; 26 (3):537–556), who obtained a numerical solution to the real‐valued version of the problem. It is shown that, subject to an appropriate rank assumption, the complex problem can be formulated in a real setting using a matrix‐dilation technique, for which the method of Allwright is applicable. However, this transformation results in an over‐parametrization of the problem and, therefore, convergence to the optimal solution is slow. Here, an alternative algorithm is developed for solving the complex problem, which exploits fully the special structure of the dilated matrix. The advantages of the modified algorithm are demonstrated via a numerical example. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
65.
Jerzy Cioslowski 《Theoretical chemistry accounts》1992,81(4-5):319-327
Summary A new index, called the differential density matrix overlap (DDMO), is proposed for assessment of the electron correlation effects in atoms and molecules. DDMO can be easily calculated as the negative value of the correlation energy derivative with respect to the relative position of the occupied and virtual orbitals. DDMO is transparent to physical interpretation. It can serve as a tool for analyzing the accuracy of approximate electron correlation methods and the validity of the Hartree-Fock wavefunction as the zeroth-order approximation. The properties of DDMO are discussed using test calculations on 11 atoms and molecules as an example. 相似文献
66.
蒋忠樟 《数学的实践与认识》2007,37(15):174-179
实对称正定矩阵的复合矩阵正定性的研究已有结论,但对于一般意义下的正定矩阵的复合矩阵是否仍然是正定的研究需要利用一般的正定矩阵的标准形的复合矩阵进行讨论,给出了一般公式及具体算法,为讨论其复合矩阵的正定性提供了基础条件. 相似文献
67.
68.
We study a variation of the knapsack problem in which each item has a profit, a weight and a penalty; the sum of profits of the selected items minus the largest penalty associated with the selected items must be maximized. We present an ILP formulation and an exact optimization algorithm. 相似文献
69.
70.
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. 相似文献