全文获取类型
收费全文 | 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条查询结果,搜索用时 31 毫秒
1.
《Indagationes Mathematicae》2021,32(6):1229-1239
2.
3.
The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large. 相似文献
4.
The exponential functional of simple, symmetric random walks with negative
drift is an infinite polynomial Y = 1 + ξ1 + ξ1ξ2 + ξ1ξ2ξ3 + ⋯ of independent
and identically distributed non-negative random variables. It has moments that are
rational functions of the variables μ
k
= E(ξ
k
) < 1 with universal coefficients. It
turns out that such a coefficient is equal to the number of permutations with descent
set defined by the multiindex of the coefficient. A recursion enumerates all numbers
of permutations with given descent sets in the form of a Pascal-type triangle.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
5.
N. H. Al-Assady 《Journal of Optimization Theory and Applications》1997,94(3):747-755
We present a method which generates conjugate search directions and maintains the quadratic convergence property, when applied to a quadratic function, even when the line searches are not exact. The method is similar to that given by Dixon, but needs one less vector store. When the method is applied to a number of general functions of different dimensionality, results show the efficiency of the method. 相似文献
6.
This article proves the existence of singular directions of value distribution theory for some transcendental holomorphic curves in the n-dimensional complex projective space Pn(C). An example is given to complement these results. 相似文献
7.
共轭下降法的全局收敛性 总被引:3,自引:0,他引:3
本文提出了一种Armijo型的线搜索,并在这种线搜索下讨论了共轭下降法的全局收敛性,且可得方法在每次迭代均产生一个下降搜索方向. 相似文献
8.
The state of the art iterative method for solving large linear systems is the conjugate gradient (CG) algorithm. Theoretical convergence analysis suggests that CG converges more rapidly than steepest descent. This paper argues that steepest descent may be an attractive alternative to CG when solving linear systems arising from the discretization of ill-posed problems. Specifically, it is shown that, for ill-posed problems, steepest descent has a more stable convergence behavior than CG, which may be explained by the fact that the filter factors for steepest descent behave much less erratically than those for CG. Moreover, it is shown that, with proper preconditioning, the convergence rate of steepest descent is competitive with that of CG.This revised version was published online in October 2005 with corrections to the Cover Date. 相似文献
9.
Discrete global descent method for discrete global optimization and nonlinear integer programming 总被引:2,自引:0,他引:2
A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization
problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function
f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function.
The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers
of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer
variables and up to 1.38 × 10104 feasible points have demonstrated the applicability and efficiency of the proposed method. 相似文献
10.
In this paper, we introduce a phenomenological measure of ordering in statistical systems. Using this characteristic, we construct a formal model of a system evolving according to the law of steepest ascent as the control parameter increases. 相似文献