全文获取类型
收费全文 | 77516篇 |
免费 | 8532篇 |
国内免费 | 7792篇 |
专业分类
化学 | 37092篇 |
晶体学 | 1397篇 |
力学 | 11033篇 |
综合类 | 846篇 |
数学 | 23355篇 |
物理学 | 20117篇 |
出版年
2024年 | 131篇 |
2023年 | 787篇 |
2022年 | 1509篇 |
2021年 | 1827篇 |
2020年 | 2225篇 |
2019年 | 2152篇 |
2018年 | 2051篇 |
2017年 | 2560篇 |
2016年 | 2848篇 |
2015年 | 2425篇 |
2014年 | 3888篇 |
2013年 | 5519篇 |
2012年 | 4474篇 |
2011年 | 5362篇 |
2010年 | 4483篇 |
2009年 | 5206篇 |
2008年 | 4888篇 |
2007年 | 4782篇 |
2006年 | 4296篇 |
2005年 | 3880篇 |
2004年 | 3602篇 |
2003年 | 3010篇 |
2002年 | 3100篇 |
2001年 | 2233篇 |
2000年 | 1988篇 |
1999年 | 1811篇 |
1998年 | 1611篇 |
1997年 | 1370篇 |
1996年 | 1253篇 |
1995年 | 1142篇 |
1994年 | 1082篇 |
1993年 | 855篇 |
1992年 | 836篇 |
1991年 | 587篇 |
1990年 | 553篇 |
1989年 | 509篇 |
1988年 | 416篇 |
1987年 | 333篇 |
1986年 | 295篇 |
1985年 | 301篇 |
1984年 | 268篇 |
1983年 | 118篇 |
1982年 | 173篇 |
1981年 | 183篇 |
1980年 | 173篇 |
1979年 | 185篇 |
1978年 | 151篇 |
1977年 | 132篇 |
1976年 | 96篇 |
1973年 | 42篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
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.
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. 相似文献
93.
94.
最速下降规则不失为一可用规则 总被引:5,自引:4,他引:1
本从统计意义上平均迭代次数的观点出发,指出求解线性规划的最速下降规则是可取的,好用的。 相似文献
95.
关于AOR迭代法的研究 总被引:5,自引:0,他引:5
陈恒新 《应用数学与计算数学学报》2002,16(1):40-46
本文论证了严格对角占优矩阵之AOR法的误差估计式中的误差估计常数hγ,ω(0≤γ≤ω0)的最小值是h1,1. 相似文献
96.
线性分式规划最优解集的求法 总被引:5,自引:0,他引:5
薛声家 《应用数学与计算数学学报》2002,16(1):90-96
本文使用多面集的表示定理,导出了线性分式规划最优解集的结构,并给出确定全部最优解的计算步骤。 相似文献
97.
A simple simulation scheme that simultaneously describes the growth kinetics of SiO2 films at the nanometer scale and the SiOx/Si interface dynamics (its extent, and spatial/temporal evolution) is presented. The simulation successfully applies to experimental data in the region above and below 10 nm, reproduces the Deal and Grove linear-parabolic law and the oxide growth rate enhancement in the very thin film regime (the so-called anomalous region). According to the simulation, the oxidation is governed mainly by two processes: (a) the formation of a transition suboxide layer and (b) its subsequent drift towards the silicon bulk. We found that it is the superposition of these two processes that produces the crossover from the anomalous oxidation region behavior to the linear-parabolic law. 相似文献
98.
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. 相似文献
99.
100.
关于康托集类光栅的实验探究 总被引:1,自引:1,他引:0
设计制作了康托集分形衍射光栅,通过对康托集分形光栅3个阶段的夫琅禾费衍射现象的观察,根据惠更斯-菲涅耳原理,得到了一维康托集分形光栅的夫琅禾费衍射光强分布特性. 相似文献