全文获取类型
收费全文 | 22985篇 |
免费 | 2482篇 |
国内免费 | 1182篇 |
专业分类
化学 | 6885篇 |
晶体学 | 88篇 |
力学 | 5293篇 |
综合类 | 170篇 |
数学 | 9997篇 |
物理学 | 4216篇 |
出版年
2023年 | 252篇 |
2022年 | 274篇 |
2021年 | 405篇 |
2020年 | 711篇 |
2019年 | 528篇 |
2018年 | 545篇 |
2017年 | 561篇 |
2016年 | 834篇 |
2015年 | 745篇 |
2014年 | 1020篇 |
2013年 | 1781篇 |
2012年 | 1211篇 |
2011年 | 1288篇 |
2010年 | 1004篇 |
2009年 | 1336篇 |
2008年 | 1248篇 |
2007年 | 1390篇 |
2006年 | 1250篇 |
2005年 | 1119篇 |
2004年 | 999篇 |
2003年 | 951篇 |
2002年 | 838篇 |
2001年 | 768篇 |
2000年 | 733篇 |
1999年 | 656篇 |
1998年 | 661篇 |
1997年 | 537篇 |
1996年 | 476篇 |
1995年 | 361篇 |
1994年 | 279篇 |
1993年 | 258篇 |
1992年 | 228篇 |
1991年 | 188篇 |
1990年 | 158篇 |
1989年 | 118篇 |
1988年 | 102篇 |
1987年 | 95篇 |
1986年 | 95篇 |
1985年 | 78篇 |
1984年 | 88篇 |
1983年 | 41篇 |
1982年 | 56篇 |
1981年 | 55篇 |
1980年 | 35篇 |
1979年 | 39篇 |
1978年 | 55篇 |
1977年 | 50篇 |
1976年 | 48篇 |
1975年 | 18篇 |
1974年 | 18篇 |
排序方式: 共有10000条查询结果,搜索用时 125 毫秒
141.
142.
Adam B. Levy 《Mathematical Programming》2007,110(3):615-639
Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies
essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex
enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies
a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations)
cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods,
barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework
relies on addition and chain rules for constraint incorporation which we develop here. 相似文献
143.
本文首先对回报率与交易量之间的关系进行了研究,发现并不存在非对称的数量关系,但存在双向的葛兰杰因果关系;同时将交易量对波动率的解释能力进行了研究,发现在沪市交易量对波动率具有解释力,而在深市交易量对波动率没有解释力。 相似文献
144.
Florence Newberger 《Geometriae Dedicata》2003,97(1):215-249
The goal of this paper is to provide a tool, the Global Measure Formula, that will facilitate the study of the limit set of discrete geometrically finite groups of isometries of the rank one symmetric spaces. We consider the shadow of a ball from a fixed reference point onto the boundary, and prove a formula that describes the measure of the shadow in terms of the center of the shadowed ball, generalizing a result from real hyperbolic geometry. 相似文献
145.
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 相似文献
146.
We extend an earlier method for solving kinetic boundary layer problems to the case of particles moving in aspatially inhomogeneous background. The method is developed for a gas mixture containing a supersaturated vapor and a light carrier gas from which a small droplet condenses. The release of heat of condensation causes a temperature difference between droplet and gas in the quasistationary state; the kinetic equation describing the vapor is the stationary Klein-Kramers equation for Brownian particles diffusing in a temperature gradient. By means of an expansion in Burnett functions, this equation is transformed into a set of coupled algebrodifferential equations. By numerical integration we construct fundamental solutions of this equation that are subsequently combined linearly to fulfill appropriate mesoscopic boundary conditions for particles leaving the droplet surface. In view of the intrinsic numerical instability of the system of equations, a novel procedure is developed to remove the admixture of fast growing solutions to the solutions of interest. The procedure is tested for a few model problems and then applied to a slightly simplified condensation problem with parameters corresponding to the condensation of mercury in a background of neon. The effects of thermal gradients and thermodiffusion on the growth rate of the droplet are small (of the order of 1%), but well outside of the margin of error of the method. 相似文献
147.
148.
P. W. Hemker 《Advances in Computational Mathematics》1995,4(1):83-110
We introduce a multigrid algorithm for the solution of a second order elliptic equation in three dimensions. For the approximation of the solution we use a partially ordered hierarchy of finite-volume discretisations. We show that there is a relation with semicoarsening and approximation by more-dimensional Haar wavelets. By taking a proper subset of all possible meshes in the hierarchy, a sparse grid finite-volume discretisation can be constructed.The multigrid algorithm consists of a simple damped point-Jacobi relaxation as the smoothing procedure, while the coarse grid correction is made by interpolation from several coarser grid levels.The combination of sparse grids and multigrid with semi-coarsening leads to a relatively small number of degrees of freedom,N, to obtain an accurate approximation, together with anO(N) method for the solution. The algorithm is symmetric with respect to the three coordinate directions and it is fit for combination with adaptive techniques.To analyse the convergence of the multigrid algorithm we develop the necessary Fourier analysis tools. All techniques, designed for 3D-problems, can also be applied for the 2D case, and — for simplicity — we apply the tools to study the convergence behaviour for the anisotropic Poisson equation for this 2D case. 相似文献
149.
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 相似文献
150.
The concept of rigid sphericalt-designs was introduced by Bannai. He conjectured that there is a functionf(t, d) such that ifX is a sphericalt design in thed-dimensional Euclidean space so that |X|>f(t, d), theX is non-rigid. Furthermore, he asked to find examples of rigid but not tight sperical designs. In the present article we shall investigate the case whenX is an orbit of a finite reflection group and prove thatX is rigid iff tight for the groupsA
n
,B
n
,C
n
,D
n
,E
6,E
7,F
4,I
3.Research was partially supported by Hungarian National Research fund Grant No. 4267. 相似文献