全文获取类型
收费全文 | 13207篇 |
免费 | 1345篇 |
国内免费 | 477篇 |
专业分类
化学 | 5399篇 |
晶体学 | 27篇 |
力学 | 1299篇 |
综合类 | 61篇 |
数学 | 5689篇 |
物理学 | 2554篇 |
出版年
2023年 | 163篇 |
2022年 | 177篇 |
2021年 | 246篇 |
2020年 | 442篇 |
2019年 | 334篇 |
2018年 | 305篇 |
2017年 | 270篇 |
2016年 | 505篇 |
2015年 | 484篇 |
2014年 | 640篇 |
2013年 | 1011篇 |
2012年 | 702篇 |
2011年 | 729篇 |
2010年 | 502篇 |
2009年 | 800篇 |
2008年 | 762篇 |
2007年 | 774篇 |
2006年 | 711篇 |
2005年 | 528篇 |
2004年 | 513篇 |
2003年 | 500篇 |
2002年 | 534篇 |
2001年 | 399篇 |
2000年 | 399篇 |
1999年 | 320篇 |
1998年 | 341篇 |
1997年 | 258篇 |
1996年 | 253篇 |
1995年 | 178篇 |
1994年 | 141篇 |
1993年 | 130篇 |
1992年 | 104篇 |
1991年 | 106篇 |
1990年 | 84篇 |
1989年 | 69篇 |
1988年 | 61篇 |
1987年 | 44篇 |
1986年 | 59篇 |
1985年 | 40篇 |
1984年 | 52篇 |
1983年 | 17篇 |
1982年 | 31篇 |
1981年 | 34篇 |
1980年 | 23篇 |
1979年 | 28篇 |
1978年 | 45篇 |
1977年 | 46篇 |
1976年 | 43篇 |
1975年 | 20篇 |
1974年 | 19篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
Some previous works show that symmetric fixed- and variable-stepsize linear multistep methods for second-order systems which do not have any parasitic root in their first characteristic polynomial give rise to a slow error growth with time when integrating reversible systems. In this paper, we give a technique to construct variable-stepsize symmetric methods from their fixed-stepsize counterparts, in such a way that the former have the same order as the latter. The order and symmetry of the integrators obtained is proved independently of the order of the underlying fixed-stepsize integrators. As this technique looks for efficiency, we concentrate on explicit linear multistep methods, which just make one function evaluation per step, and we offer some numerical comparisons with other one-step adaptive methods which also show a good long-term behaviour.
32.
Jean-Pierre Dedieu Gregorio Malajovich Mike Shub 《Foundations of Computational Mathematics》2005,5(2):145-171
We prove a linear bound on the average total curvature of the
central path of linear programming theory in terms of the number
of independent variables of the primal problem, and independent of
the number of constraints. 相似文献
33.
Numerical schemes for systems with multiple spatio-temporal scales are investigated. The multiscale schemes use asymptotic results for this type of systems which guarantee the existence of an effective dynamics for some suitably defined modes varying slowly on the largest scales. The multiscale schemes are analyzed in general, then illustrated on a specific example of a moderately large deterministic system displaying chaotic behavior due to Lorenz. Issues like consistency, accuracy, and efficiency are discussed in detail. The role of possible hidden slow variables as well as additional effects arising on the diffusive time-scale are also investigated. As a byproduct we obtain a rather complete characterization of the effective dynamics in Lorenz model. 相似文献
34.
We extend the previously found accelerated Kerr-Schild metrics for Einstein-Maxwell-null dust and Einstein-Born-Infeld-null dust equations to the cases including the cosmological constant. This way we obtain the generalization of the charged de Sitter metrics in static space-times. We also give a generalization of the zero acceleration limit of our previous Einstein-Maxwell and Einstein-Born-Infeld solutions. 相似文献
35.
Asymptotic methods for contact problems are expounded. Some typical integral equations are considered 相似文献
36.
A formulation of an implicit characteristic-flux-averaging method for the unsteady Euler equations with real gas effects is presented. Incorporation of a real gas into a general equation of state is achieved by considering the pressure as a function of density and specific internal energy. The Ricmann solver as well as the flux-split algorithm are modified by introducing the pressure derivatives with respect to density and internal energy. Expressions for calculating the values of the flow variables for a real gas at the cell faces are derived. The Jacobian matrices and the eigenvectors are defined for a general equation of state. The solution of the system of equations is obtained by using a mesh-sequencing method for acceleration of the convergence. Finally, a test case for a simple form of equation of state displays the differences from the corresponding solution for an ideal gas. 相似文献
37.
The theoretical investigation of the image states in front of an ultrathin iron film grown on copper has been performed by means of the embedding method and a recently developed procedure for the inclusion of the image potential tail in a first principle calculation. From the electronic response to an applied electric field, the image plane position has been evaluated. This also allows one to obtain useful information about the spin dependent screening properties of the system. Exchange splitting, effective mass, and lifetime of such surface states result in good agreement with recently performed two-photon photoemission experiments [see A.B. Schmidt, M. Pickel, M. Wiemhöfer, M. Donath, M. Weinelt, Phys. Rev. Lett. 95 (2005) 107402]. 相似文献
38.
C. Bogani M. G. Gasparo A. Papini 《Journal of Optimization Theory and Applications》2007,134(1):47-59
We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search
methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that
it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to
ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical
experiments seem to be encouraging.
This work was supported by M.U.R.S.T., Rome, Italy. 相似文献
39.
Gerhard Starke 《Numerische Mathematik》1997,78(1):103-117
Summary. The convergence rate of Krylov subspace methods for the solution of nonsymmetric systems of linear equations, such as GMRES
or FOM, is studied. Bounds on the convergence rate are presented which are based on the smallest real part of the field of
values of the coefficient matrix and of its inverse. Estimates for these quantities are available during the iteration from
the underlying Arnoldi process. It is shown how these bounds can be used to study the convergence properties, in particular,
the dependence on the mesh-size and on the size of the skew-symmetric part, for preconditioners for finite element discretizations
of nonsymmetric elliptic boundary value problems. This is illustrated for the hierarchical basis and multilevel preconditioners
which constitute popular preconditioning strategies for such problems.
Received May 3, 1996 相似文献
40.
The many facets of linear programming 总被引:1,自引:0,他引:1
Michael J. Todd 《Mathematical Programming》2002,91(3):417-436
We examine the history of linear programming from computational, geometric, and complexity points of view, looking at simplex,
ellipsoid, interior-point, and other methods.
Received: June 22, 2000 / Accepted: April 4, 2001?Published online October 2, 2001 相似文献