关键词： 工程数学   学科:高等学校   学科:教材   算法语言   计算方法  

ISBN: (纸本)704001260X

摘要： 高等学校试用教材

关键词： 列向量   列矢量   编译系统   矩阵相乘   算法   定理   机器语言   乘法运算   原根   下界   定义   杂凑函数   计算机科学   数学  

摘要： 近几年来,在计算机科学的研究领域中出现了称之为算法复杂性(Algorithms Comple-xity)的研究,此类工作吸引了许多科学家、学者的注意,也获得了不少成果.为了在短短的文字中谈及它和它与数学的关系,主要还是举例.

关键词： Operating System   Artificial Intelligence   System Theory  

关键词： Feasible Solution   Mathematical Method   Programming Problem   Computational Result   Mathematical Programming  

摘要： Large practical linear and integer programming problems are not always presented in a form which is the most compact representation of the problem. Such problems are likely to posses generalized upper bound(GUB) and related structures which may be exploited by algorithms designed to solve them *** steps of an algorithm which by repeated application reduces the rows, columns, and bounds in a problem matrix and leads to the freeing of some variables are first presented. The ‘unbounded solution’ and ‘no feasible solution’ conditions may also be detected by this. Computational results of applying this algorithm are presented and *** algorithm to detect structure is then described. This algorithm identifies sets of variables and the corresponding constraint relationships so that the total number of GUB-type constraints is maximized. Comparisons of computational results of applying different heuristics in this algorithm are presented and discussed.

关键词： Operating System   Artificial Intelligence   System Theory   Homogeneous Structure   Algorithmic Algebra  

关键词： Number Theory   Algebraic Geometry   Topological Group   Number Field   Algebraic Number  

关键词： Algorithms   Mathematical vectors   Trial de novo   Objective functions   Linearization   Approximation   Directional derivatives   Lagrange multipliers   Optimal solutions  

摘要： Part I of this paper presented a method for primal decomposition of large convex separable programs into a sequence of smaller subproblems. In this part, additional theory and development of a parametric subproblem-solution and step-size-determination technique completes the algorithm. A previously unsolved problem in the operations-research literature, the generalized modular design problem of Evans [Opns. Res. 18, 562–4 (1970)] is solved by the algorithm and numerical results provided.

关键词： Conjugate Gradient   Constraint Violation   Previous Algorithm   Nonlinear Constraint   Mathematical Programming Problem  

摘要： In this paper, the problem of minimizing a function f(x) subject to a constraint φ{symbol}(x)=0 is considered, where f is a scalar, x an n-vector, and φ{symbol} a q-vector, with q s is such that φ{symbol}(x_s)=0, and at most N*=1+n -q if the starting point

摘要： Cids is an information storage and retrieval that performs on-line chemical structural searches. Among its retrieval screens are the atom-population of individual rings. This paper defines a class of rings for which screens are assigned and described briefly the algorithms by which computer programs analyze the structures for automatic screen assignment. The class of rings is independent of structure orientation, and may be defined equivalently as either the rings that are not the envelope of shorter rings or the rings that can be a member of a smaller set of smallest rings.

关键词： Algorithms   Management science   Simplex method   Nonlinear programming   Mathematical vectors   Optimal solutions   Working papers  

摘要： The problem manipulations and solution strategies of Part I of this paper are now further illustrated by combining them in various ways to yield several known algorithms. The main object is not an exposition of these algorithms, although this is certainly important; rather, we wish to focus on the principal patterns in which manipulations and strategies can be assembled. These patterns constitute the real common denominators in the literature on large-scale programming. See Table 2 in Part I.