【摘 要】
：
In this paper,we introduce a fast algorithm for computing the univariate GCD of several polynomials(not pairwise)based on the generalized Bezout matrix by using Barnetts method.
【机 构】
：
Manouba Univ.(ISAMM) Univ.of Murcia
论文部分内容阅读
In this paper,we introduce a fast algorithm for computing the univariate GCD of several polynomials(not pairwise)based on the generalized Bezout matrix by using Barnetts method.
其他文献
We will address the theory,numerical methods,and applications of stochastic partial differential equations(SPDEs),queueing systems,and optimizations.
We study the well-posedness of adapted strong solution and design an algorithm with numerics for a unified backward stochastic partial differential equation(B-SPDE)with Levy jumps.We also study the ap
We establish mean-field limits for a class of large-scale stochastic networks with load balancing in the presence of general service distributions.We introduce a state representation in terms of inter
We discuss a family of algorithms for analyzing various new and classical problems in the analysis of high-dimensional data sets.These methods rely on the idea of performing suitable multiscale geomet
Recently developed low-dimensional quantized representations,such as universal embeddings have proven very powerful in coding signals for cloud computing and big-data applications.
Iminosugars or azasugars,which exhibit effective inhibition against carbohydrate-processing enzymes,have attracted great interest for their potential clinical applications as anti-HIV,anti-diabetic,an
Coumarins are a wide group of naturally occurring compounds and have a variety of biological activities such as anti-cancer,anti-HIV,antimicrobial,and anti-inflammatory.1 As the anti-tumor agents,they
Hajós conjectured that every simple even graph on n vertices can be decomposed into at most n/2 cycles(see L.Lovasz,On covering of graphs,in: P.Erdos,G.O.H.Katona(Eds.),Theory of Graphs,Academic Press
For a graph G=(V(G),E(G)),an edge labeling function φ:E(G)→ {0,1,...,k-1} where k is an integer,2≤k≤ |E(G)|,induces a vertex labeling function φ* : V(G)→{0,1,...,k-1} such that φ* is the product of th
In this article,we introduce the concept of intuitionistic L-fuzzy automata,where L is a lattice ordered monoid.The given concept is a generalization of Fuzzy automata,L-fuzzy automata and intuitionis