全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 algorithm 在 数学 分类中 的翻译结果: 查询用时：0.024秒
 历史查询

 algorithm 算法(172193)
 算法
 A QR-like Algorithm and a Symplectic Lanczos Algorithm for Hamiltonian Matrix Eigenproblems and the Error Analysis of Symplectic Lanczos Algorithm 求解Hamilton矩阵特征问题的一个QR型算法及关于辛Lanczos算法的误差分析 短句来源 Optimal Control Model, Algorithm and Its Application for Well Trajectory in Non-Straight Wells 非直井迹最优控制模型、算法及应用 短句来源 Identification and Optimal Control of Distributed Parameter System: Theory Algorithm and Application 分布参数系统辨识与最优控制理论算法及应用 短句来源 The Restricted EM Algorithm under Linear Inequality Restrictions 线性不等式约束下的EM算法 短句来源 Theory and Algorithm of Layout Optimization Characterized by Topological Structure 具有拓扑结构布局优化的理论及算法 短句来源 更多
 “algorithm”译为未确定词的双语例句
 An Iteration Algorithm for Fredholm Integral Equation of the First Kind, AX = Y, with Quickest Convergence Fredholm第一种积分方程Ax=y的最速迭代解法 短句来源 The Analogue Static β-θNumerical Algorithm for Nonlinear Structural Dynamic Analysis and Its Application 非线性结构动力分析的拟静力β-θ数值计算法及其应用 短句来源 ALGORITHM FOR DETERMINING THE HYPERFINE FIELD DISTRIBUTION OF Fe-Ni ALLOYS Fe-Ni合金超精细场分布的计算机算法 短句来源 THE CONVERGENCE OF A RANDOM SEARCH ALGORITHM FOR UNCONSTRAINED OPTIMIZATION PROBLEMS 无约束最优化问题随机搜索算法的收敛性 短句来源 AN ALGORITHM FOR M_4 IN PARTICULAR CASE ON FROBENIUS PROBLEM 关于Frobenius问题M_4之一 短句来源 更多

我想查看译文中含有：的双语例句

 algorithm
 This paper gives an algorithm for computing invariant rings of reductive groups in arbitrary characteristic. The algorithm presented here computes a geometric characteristic of this action in the case where G is connected and reductive, and $\rho$ is a morphism of algebraic groups: The algorithm takes as input the We present an algorithm for computing the invariant field k(X)G. More precisely, we give an algorithm for computing a nonempty open subset of X with a geometric quotient. We show that the rate of convergence for this reconstruction algorithm is geometric and computable in advance. 更多
 In this paper a new divided difference algorithm has been given. It has better properties than salzer's ortho—triple algorithm (of [1]). Let (*) {(x_(3v), y_(3v)), (x_(3v+1), y_(3v)), (x_(3v), y_(3v+1)), (x_(3v+2), y_(3v)), (x_(3v), y_(3v+2))} (v=0, 1, …, r) be r+1 five—point groups in the plane, where x_(3v+1) (y_(3v+1)) differ from x_0, x_3, …, x_(3v) (y_0, y_1, …, y_(3v)), and x_(3v+2) (y_(3v+2)) differ from x_0, x_3, …, x_(3v), x_(3v+1) (Y_0, y_3, …, y_(3v), y_(3v+1)). Assume that the values... In this paper a new divided difference algorithm has been given. It has better properties than salzer's ortho—triple algorithm (of [1]). Let (*) {(x_(3v), y_(3v)), (x_(3v+1), y_(3v)), (x_(3v), y_(3v+1)), (x_(3v+2), y_(3v)), (x_(3v), y_(3v+2))} (v=0, 1, …, r) be r+1 five—point groups in the plane, where x_(3v+1) (y_(3v+1)) differ from x_0, x_3, …, x_(3v) (y_0, y_1, …, y_(3v)), and x_(3v+2) (y_(3v+2)) differ from x_0, x_3, …, x_(3v), x_(3v+1) (Y_0, y_3, …, y_(3v), y_(3v+1)). Assume that the values of f(x, y) at all the points of (*) have been given In this paper we have constructed the following class of interpolation polynomials: P(x, y)=(x_0|y_0)+(x_1x_0|y_0) (x-x_0)+(x_2x_1x_0|y_0) (x-x_0) (x-x_1)+(x_0|y_1y_0) (y-y_0)+(x_0|y_2y_1y_0) (y-y_0) (y-y_1)+…+(x-x_0)(y-y_0)…(x-x_(3r-3))(y-y_(3r-3))··{(x_(3r)…|y_(3r)…)+(x_(3r+1)…|y_(3r)…)(x-x_(3r))+(x_(3r+2)…|y_(3r)…)(x-x_(3r)) (x-x_(3r+1))+(x_(3r)…|y_(3r+1)…) (y-y_(3r))+(x_(3r)…|y_(3r+2)…) (y-y_(3r)) (y-y_(3r+1))} where the generalized divided difference coefficients are determined by (1)—(5). In our paper have been proved the following theorems: Theorem3. For every point of (*) we have P(x_i, y_j)=f (x_i, y_j) Theorem5. If f (x, y) has continuous partial derivatives of second order, then the confluent form P~(k)(x, y) of the interpolation polynomial P(x, y) at each point (x_(3k), y_(3k)) satisfies the following osculatory interpolation conditions P_(x_(3k,3k)~n)~(k) =f_(x_(3k,3k)~n), P_(y_(3k,3k)~n)~(k)=f_(y_(3k,3k)~n) (n=1,2; k=0,1,…,r) Finally we have give three concrete formulas to indicate an application of this algorithm. H.E.Salzer曾給出了平面区域上直角三点組上的二元插值公式。它的最主要的优点是:1)插值結点組可以相当任意的选擇,2)差商系数可以用遞推公式来計算。但它的一个缺点是造出的插值多項式次数要比在同样个数的适定結点組上造出的插值多項式次数(二元混合次数)来的高(見[2])。亦就是說缺項较多。本文提出了一种所謂“十字型五点組”上的二元插值公式,它不仅保留了H.E.Salzer直角三点組插值法的上述优点,而且它的汇合形式还具有二阶偏微商的切触条件。 On the relations between calculi, Moh Shaw-kwei modified concepts of homomorphism and isomorphism between associate calculi defind by Mapkab to the following four relations between general calculi mutual embedding, mutually strong embeding, similarity and strong similarity, in 1963. Evidently, by the following figure, it may be shown which is stronger or weaker (from left to right): Strong similarity Similarity mutually strong embedding mutual embedding But whether the inverses hold or not is unsolvable. In... On the relations between calculi, Moh Shaw-kwei modified concepts of homomorphism and isomorphism between associate calculi defind by Mapkab to the following four relations between general calculi mutual embedding, mutually strong embeding, similarity and strong similarity, in 1963. Evidently, by the following figure, it may be shown which is stronger or weaker (from left to right): Strong similarity Similarity mutually strong embedding mutual embedding But whether the inverses hold or not is unsolvable. In this paper, we prove that the inverses are not hold by means of two contra-examyles: the one is the two colculi which have the ralation of mutually strong embedding but no relation of similarity, as following: the corresponding embedding algorithms are: respectively; the another is the two colculi which have the relation ot similarity but no relation of mutually strong embedding, as following: Besides, we introduce two kinds of colculi: pseudo-unitary-string calculus and unitary-string calculus, the particular case of latter is associate calculus, and prove that mutual embedding and similarity, for two calculi introduced and finite calculus, are the same thing. 本文解决一般演算之间的四个关系:强相似、相似、互相强嵌入、互相嵌入的相互联系。证明了一对演算之间可以只具有相似关系,而不具有互相强嵌入关系,或者相反,从而四个关系的互相联系完全明白。同时证明,对某些种类的演算而言,互相嵌入和相似是同一回事。 The algorithm due to Warshall is a very simple and effective too1, which computes the transitive closure of a binary relation on finite set as we1l as the reach ability matrix of a simple digraph. The aim of this Faper is to try to extend the algorithm due to Warshall so that it rnay compute the Fath matrix of a multigraph. Several varieties of the Warshall algorithm are given, by which other properties of multigraph are computed. Finally, an application of the algorithm to the compiler... The algorithm due to Warshall is a very simple and effective too1, which computes the transitive closure of a binary relation on finite set as we1l as the reach ability matrix of a simple digraph. The aim of this Faper is to try to extend the algorithm due to Warshall so that it rnay compute the Fath matrix of a multigraph. Several varieties of the Warshall algorithm are given, by which other properties of multigraph are computed. Finally, an application of the algorithm to the compiler is concerned in this paper. ＷＡＲＳＨＡＬＬ算法是一个非常简单而有效的工具，它可以计算有穷集合上的二元关系的传递闭包和简单方向图的可到达矩阵。本文的目的是试图将ＷＡＲＳＨＡＬＬ算法加以推广，使之能够计算多重图的路径矩阵。文中还给出了几个 ＷＡＲＳＨＡＬＬ算法的变种，它们能计算出多重图的其它性质。最后讨论了这些算法在编译程序中的一个应用。 << 更多相关文摘
 相关查询

 CNKI小工具 在英文学术搜索中查有关algorithm的内容 在知识搜索中查有关algorithm的内容 在数字搜索中查有关algorithm的内容 在概念知识元中查有关algorithm的内容 在学术趋势中查有关algorithm的内容

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社