 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   最大公因式 的翻译结果: 查询用时：0.032秒 在分类学科中查询 所有学科 数学 计算机软件及计算机应用 中等教育 更多类别查询 历史查询  最大公因式   greatest common factor
 In this paper, we use the matrix elementary transform method to solve the greatest common factor of the polynomial. At the same time, we get n functions u i(x) i=1,2,…,n , which satisfy: f 1(x)u 1(x)+f 2(x)u 2(x)+…+f n(x)u n(x)=d(x) . 数域 F上任意 n个多项式的最大公因式是存在的但很难求得 ,因此 ,采用矩阵初等变换的方法来求多项式的最大公因式 ,同时可以得到 ui( x) i=1 ,2 ,… ,n使得 :f1 ( x) u1 ( x) +f2 ( x) u2 ( x) +… +fn( x) un( x) =d( x)成立 短句来源 Matrix Method of Getting Polynomial Greatest Common Factor 多项式最大公因式的矩阵求法 短句来源 The purpose of this paper is to use properties of elementary transformation of matrix to solve some problems of finite dimensional vector space and to get the greatest common factor of two polynomials. 应用矩阵初等变换的一些性质解决有限维向量空间中若干问题和求两个多项式的最大公因式. 短句来源 This method is simple, practical and easily understood. This method may moredex tend. Therefore, we can apply this way to working out the greatest common factor of multinomial with one unknown and studying the relativeiy prime of multinomial with one unknown. 着重介绍一种由两个一元多项式的系数变换进行多项式整除性的研究方法 ,在进行多项式整除性的研究时 ,这种方法简单、实用、易懂 ,这种方法还可进一步推广用之于求一元多项式的最大公因式以及一元多项式互素等方面的研究 . 短句来源 A Matrix Method For Solving of The Greatest Common Factor 最大公因式的矩阵解法 短句来源 更多 the greatest common factor
 In this paper, we use the matrix elementary transform method to solve the greatest common factor of the polynomial. At the same time, we get n functions u i(x) i=1,2,…,n , which satisfy: f 1(x)u 1(x)+f 2(x)u 2(x)+…+f n(x)u n(x)=d(x) . 数域 F上任意 n个多项式的最大公因式是存在的但很难求得 ,因此 ,采用矩阵初等变换的方法来求多项式的最大公因式 ,同时可以得到 ui( x) i=1 ,2 ,… ,n使得 :f1 ( x) u1 ( x) +f2 ( x) u2 ( x) +… +fn( x) un( x) =d( x)成立 短句来源 The purpose of this paper is to use properties of elementary transformation of matrix to solve some problems of finite dimensional vector space and to get the greatest common factor of two polynomials. 应用矩阵初等变换的一些性质解决有限维向量空间中若干问题和求两个多项式的最大公因式. 短句来源 This method is simple, practical and easily understood. This method may moredex tend. Therefore, we can apply this way to working out the greatest common factor of multinomial with one unknown and studying the relativeiy prime of multinomial with one unknown. 着重介绍一种由两个一元多项式的系数变换进行多项式整除性的研究方法 ,在进行多项式整除性的研究时 ,这种方法简单、实用、易懂 ,这种方法还可进一步推广用之于求一元多项式的最大公因式以及一元多项式互素等方面的研究 . 短句来源 A Matrix Method For Solving of The Greatest Common Factor 最大公因式的矩阵解法 短句来源 The Resultant Matrix Algorithm for Solving the Greatest Common Factor of Two variable Polynomials 求解二元多项式最大公因式的结矩阵算法 短句来源 更多 greatest common divisor
 Method and Algorithm of Solving the Greatest Common Divisor of Polynomials by Matrix Transformation 求多项式组最大公因式的矩阵变换及算法 短句来源 Calculating Greatest Common Divisor of n Polynomials and Judging Stability of Linear System with Constant Complex Coefficients Through Matrix Transformation 利用矩阵变换求n个多项式的最大公因式及判断复常系数线性系统的稳定性 短句来源 THE MATRIX METHOD OF CALCULATING THE GREATEST COMMON DIVISOR 最大公因式的矩阵求法 短句来源 A solution to the greatest common divisor for a class of polynomial with one un-known is derived by using the elementary row transformation of matrix in digital domain. 介绍了一种利用数域上矩阵的初等行变换求一组一元n次多项式的最大公因式的方法. 短句来源 In this paper,we obtain several solutions to the greatest common divisor of polynomial of one indeterminate by using the division algorithm and elementary transformation and oblique elementary transformation of matrix. 文章从辗转相除、矩阵的初等变换以及矩阵的斜消变换等不同角度给出了一元多项式的最大公因式的不同求法。 短句来源 更多 maximum common factor
 The C Language Programing for Extracting the Maximum Common Factor of A polynomial 求多项式最大公因式的C语言编程处理 短句来源 The Discussion About Integral Division for Polynomials of Two Elements and Maximum Common Factor 关于二元多项式的整除与最大公因式的讨论 短句来源 Further Study about Maximum Common Factor of Multinomial 关于多项式最大公因式的进一步探讨 短句来源 查询“最大公因式”译词为其他词的双语例句 查询“最大公因式”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句  greatest common factor
 Intuitively, the greatest common factor and residue represent the subtypes within session s that are good and bad with respect to the type G. the greatest common factor
 Intuitively, the greatest common factor and residue represent the subtypes within session s that are good and bad with respect to the type G. greatest common divisor
 The ballot number of each candidate gets is counted by computing the degrees of two polynomials' greatest common divisor. A new method is presented for the computation of a greatest common divisor (gcd) of two polynomials, along with their polynomial remainder sequence (prs). The criterion involves finding out if the greatest common divisor of few polynomials belongs to the ideal generated by these polynomials. In particular, I consider , the set of elements of Z2 with greatest common divisor equal to 1, where two sites are connected if they are at distance 1. Knuth for the computation of the greatest common divisor of two integers u, v and of the continued fraction for u/v is modified in such a way that only O(n(lg n)2(lglg n)) elementary steps are used for u,v>amp;lt;.2n. 更多 其他 点击这里查询相关文摘 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索 2008 CNKI－中国知网 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社