全文获取类型
收费全文 | 18887篇 |
免费 | 1932篇 |
国内免费 | 1346篇 |
专业分类
化学 | 3343篇 |
晶体学 | 33篇 |
力学 | 1604篇 |
综合类 | 371篇 |
数学 | 11361篇 |
物理学 | 5453篇 |
出版年
2024年 | 33篇 |
2023年 | 201篇 |
2022年 | 319篇 |
2021年 | 398篇 |
2020年 | 484篇 |
2019年 | 485篇 |
2018年 | 459篇 |
2017年 | 609篇 |
2016年 | 749篇 |
2015年 | 502篇 |
2014年 | 966篇 |
2013年 | 1540篇 |
2012年 | 973篇 |
2011年 | 1090篇 |
2010年 | 953篇 |
2009年 | 1160篇 |
2008年 | 1180篇 |
2007年 | 1257篇 |
2006年 | 1046篇 |
2005年 | 970篇 |
2004年 | 846篇 |
2003年 | 824篇 |
2002年 | 754篇 |
2001年 | 609篇 |
2000年 | 542篇 |
1999年 | 495篇 |
1998年 | 451篇 |
1997年 | 360篇 |
1996年 | 344篇 |
1995年 | 267篇 |
1994年 | 169篇 |
1993年 | 153篇 |
1992年 | 139篇 |
1991年 | 127篇 |
1990年 | 85篇 |
1989年 | 78篇 |
1988年 | 66篇 |
1987年 | 52篇 |
1986年 | 60篇 |
1985年 | 68篇 |
1984年 | 53篇 |
1983年 | 27篇 |
1982年 | 35篇 |
1981年 | 27篇 |
1980年 | 28篇 |
1979年 | 39篇 |
1978年 | 23篇 |
1977年 | 17篇 |
1976年 | 16篇 |
1973年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
21.
Blaise Faugeras Jé rô me Pousin Franck Fontvieille. 《Mathematics of Computation》2006,75(253):209-222
A numerical scheme based on an operator splitting method and a dense output event location algorithm is proposed to integrate a diffusion-dissolution/precipitation chemical initial-boundary value problem with jumping nonlinearities. The numerical analysis of the scheme is carried out and it is proved to be of order 2 in time. This global order estimate is illustrated numerically on a test case.
22.
This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method. 相似文献
23.
Venansius Baryamureeba 《Numerical Linear Algebra with Applications》2002,9(2):93-106
A sequence of least‐squares problems of the form miny∥G1/2(AT y?h)∥2, where G is an n×n positive‐definite diagonal weight matrix, and A an m×n (m?n) sparse matrix with some dense columns; has many applications in linear programming, electrical networks, elliptic boundary value problems, and structural analysis. We suggest low‐rank correction preconditioners for such problems, and a mixed solver (a combination of a direct solver and an iterative solver). The numerical results show that our technique for selecting the low‐rank correction matrix is very effective. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
24.
关于AOR迭代法的研究 总被引:5,自引:0,他引:5
陈恒新 《应用数学与计算数学学报》2002,16(1):40-46
本文论证了严格对角占优矩阵之AOR法的误差估计式中的误差估计常数hγ,ω(0≤γ≤ω0)的最小值是h1,1. 相似文献
25.
26.
R. S. Martynov Yu. M. Nechepurenko 《Computational Mathematics and Mathematical Physics》2006,46(7):1155-1167
For a discrete linear stochastic dynamical system, computation of the response matrix to the external action from a subspace using given observational data is examined. An algorithm is proposed and substantiated that makes it possible to improve the numerical accuracy and to reduce the amount of observational data compared to the general case where an arbitrary external action is allowed. As an illustration, a discrete system arising in the analysis of a linear stochastic dynamical continuous-time system is considered more thoroughly. Some numerical results are presented. 相似文献
27.
本文对任意正整数n界定了矩阵方程X A*X-nA=I的正定解的特征值的范围,给出了它的极大正定解一个充分条件. 相似文献
28.
29.
E. A. Bailov N. Temirgaliev 《Computational Mathematics and Mathematical Physics》2006,46(9):1515-1525
Sharp estimates (in the power scale) are obtained for the discretization error in the solutions to Poisson’s equation whose right-hand side belongs to a Korobov class. Compared to the well-known Korobov estimate, the order is almost doubled and has an ultimate value in the power scale. 相似文献
30.
Several new families of c‐Bhaskar Rao designs with block size 4 are constructed. The necessary conditions for the existence of a c‐BRD (υ,4,λ) are that: (1)λmin=?λ/3 ≤ c ≤ λ and (2a) c≡λ (mod 2), if υ > 4 or (2b) c≡ λ (mod 4), if υ = 4 or (2c) c≠ λ ? 2, if υ = 5. It is proved that these conditions are necessary, and are sufficient for most pairs of c and λ; in particular, they are sufficient whenever λ?c ≠ 2 for c > 0 and whenever c ? λmin≠ 2 for c < 0. For c < 0, the necessary conditions are sufficient for υ> 101; for the classic Bhaskar Rao designs, i.e., c = 0, we show the necessary conditions are sufficient with the possible exception of 0‐BRD (υ,4,2)'s for υ≡ 4 (mod 6). © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 361–386, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10009 相似文献