全文获取类型
收费全文 | 19486篇 |
免费 | 2420篇 |
国内免费 | 1014篇 |
专业分类
化学 | 7539篇 |
晶体学 | 53篇 |
力学 | 3755篇 |
综合类 | 218篇 |
数学 | 6958篇 |
物理学 | 4397篇 |
出版年
2024年 | 31篇 |
2023年 | 217篇 |
2022年 | 402篇 |
2021年 | 439篇 |
2020年 | 706篇 |
2019年 | 503篇 |
2018年 | 490篇 |
2017年 | 540篇 |
2016年 | 836篇 |
2015年 | 774篇 |
2014年 | 931篇 |
2013年 | 1573篇 |
2012年 | 1054篇 |
2011年 | 1098篇 |
2010年 | 775篇 |
2009年 | 1095篇 |
2008年 | 1071篇 |
2007年 | 1118篇 |
2006年 | 1054篇 |
2005年 | 858篇 |
2004年 | 786篇 |
2003年 | 778篇 |
2002年 | 638篇 |
2001年 | 623篇 |
2000年 | 593篇 |
1999年 | 495篇 |
1998年 | 492篇 |
1997年 | 384篇 |
1996年 | 410篇 |
1995年 | 307篇 |
1994年 | 234篇 |
1993年 | 215篇 |
1992年 | 169篇 |
1991年 | 143篇 |
1990年 | 132篇 |
1989年 | 92篇 |
1988年 | 111篇 |
1987年 | 82篇 |
1986年 | 80篇 |
1985年 | 72篇 |
1984年 | 84篇 |
1983年 | 36篇 |
1982年 | 68篇 |
1981年 | 43篇 |
1980年 | 26篇 |
1979年 | 30篇 |
1978年 | 51篇 |
1977年 | 48篇 |
1976年 | 45篇 |
1975年 | 19篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
晶体微观结构是晶体材料在特定物理条件下其多个能量极小平衔态在空间形成的某种微尺度的规则分布.几何非线性的连续介质力学理论可以用能量极小化原理来解释晶体微观结构的形成,并用Young测度来刻画平衡态各变体在空间的概率分布.定性的理解与定量地分析和计算晶体材料的微观结构对于发展和改进高级晶体功能材料,如形状记忆合金、铁电体、磁至伸缩材料等,有重要的意义.本文回顾了近年来晶体微观结构数值计算方面的最新进展.介绍了计算晶体微观结构的几种数值方法及有关的数值分析结果。 相似文献
72.
美式期权定价中非局部问题的有限元方法 总被引:2,自引:1,他引:1
在本文中 ,我们关心的是美式期权的有限元方法 .首先 ,根据 [4 ]我们对所讨论的问题引进一个新奇的实用的方法 ,它涉及到对原问题重新形成准确的数学公式 ,使得数值解的计算可以在非常小的区域上进行 ,从而该算法计算速度快精度高 .进而 ,我们利用超逼近分析技术得到了有限元解关于 L2 -模的最优估计 . 相似文献
73.
Gerald Moore. 《Mathematics of Computation》2004,73(245):211-242
We present an algorithm, based on approximation by Laguerre polynomials, for computing a point on the stable manifold of a stationary solution of an autonomous system. A superconvergence phenomenon means that the accuracy of our results is much higher than the usual spectral accuracy. Both the theory and the implementation of the method are considered. Finally, as an application of the algorithm, we describe a fully spectral approximation of homo- and heteroclinic orbits.
74.
内部审核在计量体系中的作用 总被引:1,自引:0,他引:1
介绍内部审核制度在计量测试工作中的目的和作用,提出了内部审核工作应注意的事项,如内部审核工作计划的完整性,内部审核工作的有效性,管理者工作内容的全面性,以及后续工作的完善性。 相似文献
75.
An efficient way of obtaining travelling waves in a periodic fluid system is described and tested. We search for steady states in a reference frame travelling at the wave phase velocity using a first‐order pseudospectral semi‐implicit time scheme adapted to carry out the Newton's iterations. The method is compared to a standard Newton–Raphson solver and is shown to be highly efficient in performing this task, even when high‐resolution grids are used. This method is well suited to three‐dimensional calculations in cylindrical or spherical geometries. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
76.
77.
The projective method for solving linear matrix inequalities 总被引:2,自引:0,他引:2
Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving
an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest
in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs
with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical
arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is
provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed. 相似文献
78.
We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1. 相似文献
79.
We develop a production policy that controls work-in-process (WIP) levels and satisfies demand in a multistage manufacturing system with significant uncertainty in yield, rework, and demand. The problem addressed in this paper is more general than those in the literature in three aspects: (i) multiple products are processed at multiple workstations, and the capacity of each workstation is limited and shared by multiple operations; (ii) the behavior of a production policy is investigated over an infinite-time horizon, and thus the system stability can be evaluated; (iii) the representation of yield and rework uncertainty is generalized. Generalizing both the system structure and the nature of uncertainty requires a new mathematical development in the theory of infinite-horizon stochastic dynamic programming. The theoretical contributions of this paper are the existence proofs of the optimal stationary control for a stochastic dynamic programming problem and the finite covariances of WIP and production levels under the general expression of uncertainty. We develop a simple and explicit sufficient condition that guarantees the existence of both the optimal stationary control and the system stability. We describe how a production policy can be constructed for the manufacturing system based on the propositions derived. 相似文献
80.
Efficient Sequential Quadratic Programming Implementations for Equality-Constrained Discrete-Time Optimal Control 总被引:1,自引:0,他引:1
Efficient sequential quadratic programming (SQP) implementations are presented for equality-constrained, discrete-time, optimal control problems. The algorithm developed calculates the search direction for the equality-based variant of SQP and is applicable to problems with either fixed or free final time. Problem solutions are obtained by solving iteratively a series of constrained quadratic programs. The number of mathematical operations required for each iteration is proportional to the number of discrete times N. This is contrasted by conventional methods in which this number is proportional to N
3. The algorithm results in quadratic convergence of the iterates under the same conditions as those for SQP and simplifies to an existing dynamic programming approach when there are no constraints and the final time is fixed. A simple test problem and two application problems are presented. The application examples include a satellite dynamics problem and a set of brachistochrone problems involving viscous friction. 相似文献