全文获取类型
收费全文 | 580篇 |
免费 | 44篇 |
国内免费 | 30篇 |
专业分类
化学 | 15篇 |
力学 | 17篇 |
综合类 | 8篇 |
数学 | 529篇 |
物理学 | 85篇 |
出版年
2024年 | 2篇 |
2023年 | 9篇 |
2022年 | 14篇 |
2021年 | 17篇 |
2020年 | 9篇 |
2019年 | 14篇 |
2018年 | 16篇 |
2017年 | 15篇 |
2016年 | 11篇 |
2015年 | 7篇 |
2014年 | 24篇 |
2013年 | 40篇 |
2012年 | 23篇 |
2011年 | 26篇 |
2010年 | 28篇 |
2009年 | 27篇 |
2008年 | 30篇 |
2007年 | 28篇 |
2006年 | 27篇 |
2005年 | 19篇 |
2004年 | 17篇 |
2003年 | 25篇 |
2002年 | 27篇 |
2001年 | 18篇 |
2000年 | 15篇 |
1999年 | 13篇 |
1998年 | 12篇 |
1997年 | 17篇 |
1996年 | 16篇 |
1995年 | 9篇 |
1994年 | 6篇 |
1993年 | 9篇 |
1992年 | 7篇 |
1991年 | 5篇 |
1990年 | 6篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1987年 | 5篇 |
1986年 | 5篇 |
1985年 | 3篇 |
1984年 | 8篇 |
1983年 | 6篇 |
1982年 | 3篇 |
1981年 | 6篇 |
1980年 | 2篇 |
1979年 | 4篇 |
1978年 | 7篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1974年 | 1篇 |
排序方式: 共有654条查询结果,搜索用时 0 毫秒
31.
Integral representations are considered of solutions of the inhomogeneous Airy differential equation . The solutions of these equations are also known as Scorer functions. Certain functional relations for these functions are used to confine the discussion to one function and to a certain sector in the complex plane. By using steepest descent methods from asymptotics, the standard integral representations of the Scorer functions are modified in order to obtain nonoscillating integrals for complex values of . In this way stable representations for numerical evaluations of the functions are obtained. The methods are illustrated with numerical results.
32.
Stavros Tsalidis 《K-Theory》2000,21(2):151-199
We investigate étale descent properties of topological Hochschild and cyclic homology. Using these properties we deduce a general injectivity result for the descent map in algebraic K-theory, and show that algebraic K-theory has étale descent for rings of integers in unramified and tamely ramified p-adic fields. 相似文献
33.
34.
We investigated the propagation and transformation of laser beams and the formation of caustics in particular directions,
including optical axes of crystals. We found a direct connection between the particular directions and the curvature of wave
surfaces that is determined by the symmetry and optical properties of the crystals. We demonstrated that caustics in particular
directions are characterized by a degree of the curvature degeneracy and are described by particular solutions of the corresponding
nonlinear equations.
__________
Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 74, No. 4, pp. 491–498, July–August, 2007. 相似文献
35.
B. S. Goh 《Journal of Optimization Theory and Applications》2009,142(2):275-289
We show that, for an unconstrained optimization problem, the long-term optimal trajectory consists of a sequence of greatest
descent directions and a Newton method in the final iteration. The greatest descent direction can be computed approximately
by using a Levenberg-Marquardt like formula. This implies the view that the Newton method approximates a Levenberg-Marquardt
like formula at a finite distance from the minimum point, instead of the standard view that the Levenberg-Marquadt formula
is a way to approximate the Newton method. With the insight gained from this analysis, we develop a two-dimensional version
of a Levenberg-Marquardt like formula. We make use of the two numerically largest components of the gradient vector to define
here new search directions. In this way, we avoid the need of inverting a high-dimensional matrix. This reduces also the storage
requirements for the full Hessian matrix in problems with a large number of variables.
The author thanks Mark Wu, Professors Sanyang Liu, Junmin Li, Shuisheng Zhou and Feng Ye for support and help in this research
as well as the referees for helpful comments. 相似文献
36.
Josef Bukac 《逼近论及其应用》2008,(4):330-335
Minimization of the weighted nonlinear sum of squares of differences may be converted to the minimization of sum of squares. The Gauss-Newton method is recalled and the length of the step of the steepest descent method is determined by substituting the steepest descent direction in the Gauss-Newton formula. The existence of minimum is shown. 相似文献
37.
In this paper, a kind of optimization problems with nonlinear inequality constraints is discussed. Combined the ideas of norm-relaxed SQP method and strongly sub-feasible direction method as well as a pivoting operation, a new fast algorithm with arbitrary initial point for the discussed problem is presented. At each iteration of the algorithm, an improved direction is obtained by solving only one direction finding subproblem which possesses small scale and always has an optimal solution, and to avoid the Maratos effect, another correction direction is yielded by a simple explicit formula. Since the line search technique can automatically combine the initialization and optimization processes, after finite iterations, the iteration points always get into the feasible set. The proposed algorithm is proved to be globally convergent and superlinearly convergent under mild conditions without the strict complementarity. Finally, some numerical tests are reported. 相似文献
38.
P. P. J. Van Den Bosch F. A. Lootsma 《Journal of Optimization Theory and Applications》1987,55(2):313-326
We investigate methods for solving high-dimensional nonlinear optimization problems which typically occur in the daily scheduling of electricity production: problems with a nonlinear, separable cost function, lower and upper bounds on the variables, and an equality constraint to satisfy the demand. If the cost function is quadratic, we use a modified Lagrange multiplier technique. For a nonquadratic cost function (a penalty function combining the original cost function and certain fuel constraints, so that it is generally not separable), we compare the performance of the gradient-projection method and the reduced-gradient method, both with conjugate search directions within facets of the feasible set. Numerical examples at the end of the paper demonstrate the effectiveness of the gradient-projection method to solve problems with hundreds of variables by exploitation of the special structure. 相似文献
39.
Gauss—Seidel type relaxation techniques are applied in the context of strictly convex pure networks with separable cost functions. The algorithm is an extension of the Bertsekas—Tseng approach for solving the linear network problem and its dual as a pair of monotropic programming problems. The method is extended to cover the class of generalized network problems. Alternative internal tactics for the dual problem are examined. Computational experiments — aimed at the improved efficiency of the algorithm — are presented.This research was supported in part by National Science Foundation Grant No. DCR-8401098-A01. 相似文献
40.
K. C. Kiwiel 《Journal of Optimization Theory and Applications》1986,48(3):437-449
This paper presents a method for minimizing the sum of a possibly nonsmooth convex function and a continuously differentiable function. As in the convex case developed by the author, the algorithm is a descent method which generates successive search directions by solving quadratic programming subproblems. An inexact line search ensures global convergence of the method to stationary points. 相似文献