全文获取类型
收费全文 | 78754篇 |
免费 | 6939篇 |
国内免费 | 6254篇 |
专业分类
化学 | 11104篇 |
晶体学 | 968篇 |
力学 | 9825篇 |
综合类 | 609篇 |
数学 | 16764篇 |
物理学 | 13943篇 |
综合类 | 38734篇 |
出版年
2024年 | 186篇 |
2023年 | 702篇 |
2022年 | 1189篇 |
2021年 | 1379篇 |
2020年 | 1660篇 |
2019年 | 1499篇 |
2018年 | 1511篇 |
2017年 | 2047篇 |
2016年 | 2349篇 |
2015年 | 2265篇 |
2014年 | 3832篇 |
2013年 | 4330篇 |
2012年 | 4645篇 |
2011年 | 5152篇 |
2010年 | 4172篇 |
2009年 | 4719篇 |
2008年 | 4493篇 |
2007年 | 5338篇 |
2006年 | 4603篇 |
2005年 | 4313篇 |
2004年 | 3838篇 |
2003年 | 3525篇 |
2002年 | 3072篇 |
2001年 | 2593篇 |
2000年 | 2361篇 |
1999年 | 2173篇 |
1998年 | 1899篇 |
1997年 | 1726篇 |
1996年 | 1517篇 |
1995年 | 1321篇 |
1994年 | 1202篇 |
1993年 | 1057篇 |
1992年 | 1006篇 |
1991年 | 848篇 |
1990年 | 781篇 |
1989年 | 657篇 |
1988年 | 597篇 |
1987年 | 423篇 |
1986年 | 217篇 |
1985年 | 164篇 |
1984年 | 131篇 |
1983年 | 64篇 |
1982年 | 77篇 |
1981年 | 59篇 |
1980年 | 35篇 |
1979年 | 52篇 |
1978年 | 37篇 |
1977年 | 44篇 |
1976年 | 18篇 |
1957年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 257 毫秒
91.
Rakhim Aitbayev 《Numerical Methods for Partial Differential Equations》2006,22(4):847-866
Efficient multilevel preconditioners are developed and analyzed for the quadrature finite element Galerkin approximation of the biharmonic Dirichlet problem. The quadrature scheme is formulated using the Bogner–Fox–Schmit rectangular element and the product two‐point Gaussian quadrature. The proposed additive and multiplicative preconditioners are uniformly spectrally equivalent to the operator of the quadrature scheme. The preconditioners are implemented by optimal algorithms, and they are used to accelerate convergence of the preconditioned conjugate gradient method. Numerical results are presented demonstrating efficiency of the preconditioners. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006 相似文献
92.
在假定股票价格服从Ito过程条件下,讨论了采用组合期权交易策略的投资者获益的概率及损益的数学期望,得到了具体计算式,只要投资者获得相应数据,通过具体计算式加以计算,便可以为期权投资者提供数量上的重要参考依据,对期权投资者具有实用价值。 相似文献
93.
柴国庆 《湖北师范学院学报(自然科学版)》2002,22(3):5-10
用Tonelli方法研究了Banach空间中n阶非线性积分—微分方程初值问题,在非线性增长条件下,获得了初值问题解的存在性及其Tonelli迭代逼近。 相似文献
94.
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. 相似文献
95.
96.
最速下降规则不失为一可用规则 总被引:5,自引:4,他引:1
本从统计意义上平均迭代次数的观点出发,指出求解线性规划的最速下降规则是可取的,好用的。 相似文献
97.
Shunlong Luo 《Foundations of Physics》2002,32(11):1757-1772
We formulate an elementary statistical game which captures the essence of some fundamental quantum experiments such as photon polarization and spin measurement. We explore and compare the significance of the principle of maximum Shannon entropy and the principle of minimum Fisher information in solving such a game. The solution based on the principle of minimum Fisher information coincides with the solution based on an invariance principle, and provides an informational explanation of Malus' law for photon polarization. There is no solution based on the principle of maximum Shannon entropy. The result demonstrates the merits of Fisher information, and the demerits of Shannon entropy, in treating some fundamental quantum problems. It also provides a quantitative example in support of a general philosophy: Nature intends to hide Fisher information, while obeying some simple rules. 相似文献
98.
关于AOR迭代法的研究 总被引:5,自引:0,他引:5
陈恒新 《应用数学与计算数学学报》2002,16(1):40-46
本文论证了严格对角占优矩阵之AOR法的误差估计式中的误差估计常数hγ,ω(0≤γ≤ω0)的最小值是h1,1. 相似文献
99.
线性分式规划最优解集的求法 总被引:5,自引:0,他引:5
薛声家 《应用数学与计算数学学报》2002,16(1):90-96
本文使用多面集的表示定理,导出了线性分式规划最优解集的结构,并给出确定全部最优解的计算步骤。 相似文献
100.
When solving large complex optimization problems, the user is faced with three major problems. These are (i) the cost in human time in obtaining accurate expressions for the derivatives involved; (ii) the need to store second derivative information; and (iii), of lessening importance, the time taken to solve the problem on the computer. For many problems, a significant part of the latter can be attributed to solving Newton-like equations. In the algorithm described, the equations are solved using a conjugate direction method that only needs the Hessian at the current point when it is multiplied by a trial vector. In this paper, we present a method that finds this product using automatic differentiation while only requiring vector storage. The method takes advantage of any sparsity in the Hessian matrix and computes exact derivatives. It avoids the complexity of symbolic differentiation, the inaccuracy of numerical differentiation, the labor of finding analytic derivatives, and the need for matrix store. When far from a minimum, an accurate solution to the Newton equations is not justified, so an approximate solution is obtained by using a version of Dembo and Steihaug's truncated Newton algorithm (Ref. 1).This paper was presented at the SIAM National Meeting, Boston, Massachusetts, 1986. 相似文献