2. 您的位置
3. 首页
4. 会议论文
5. On the Complexity of constructing the Dixon resultant matrix

On the Complexity of constructing the Dixon resultant matrix

来源 :第七届全国计算机数学会议(CM2015) | 被引量 : 0次 | 上传用户：roger_wen

【摘 要】

：

Dixon resultant is a fundamental tool of elimination theory.It has provided the efficient and practical solutions to some benchmark problems in a variety of app

【作 者】

：

Qin Xiaolin 

【机 构】

：

ChengduInstituteofComputerApplications,ChineseAcademyofSciences

【出 处】

：

第七届全国计算机数学会议(CM2015)

【发表日期】

：

2015年10期

下载到本地 , 更方便阅读

下载此文 赞助VIP

声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架

论文部分内容阅读

Dixon resultant is a fundamental tool of elimination theory.It has provided the efficient and practical solutions to some benchmark problems in a variety of applications domains,such as automated reasoning,automatic control,robotics and solid modeling.

其他文献

有限维复对称算子及UET矩阵的机械化判别算法

复对称算子是算子代数中的热点问题.已经证明许多特殊且较为重要的算子类如Hankel 算子,截断Toeplitz 算子,经典的Volterra 积分算子等均是复对称的.但对任意给定的算子,判断

会议

Approximation of conic section by quartic Bézier curve with endpoints continuity condition

In this paper,a new method for approximation of conic section by quartic Bézier curve is presented,based on the quartic Bézier approximation of circular arcs.

会议

Three new infinite families of bent functions

　　Bent functions are maximally nonlinear Boolean functions with an even number of variables.Not only for their own sake as interesting combinatorial objects,b

会议

Bent functionKasami functionGold-like functionNiho exponentWalsh transform

A Low-rank Surface Reconstruction Algorithm Based on Hierarchical Implicit Tensor-Product B-Spline S

会议

Some properties of a class of polynomial minimal surface with n degree

Parametric polynomial representation is a standard form widely used in Computer-Aided Design.

会议

Unsupervised 3D shape segmentation and co-segmentation via deep learning

In this paper,we propose a novel unsupervised algorithm for automatically segmenting a 3D shape or co-segmenting a set of 3D shapes of the same family by using

会议

NUAHT-IGAisogeometric analysis using non-uniform algebraic hyperbolic trigonometric B-splines

Generalized B-splines in non-polynomial space has been employed as analysis tools for IGA.However,the previous models used in IGA are not the unified mathematic

会议

Adaptive Weighted Extended PHT-splines in Isogeometric Analysis

In isogeometric analysis(IGA),parametrization is a challenging work that greatly influences the numerical accuracy and efficiency of the numerical solution.

会议

An Algorithm for computing Gr(o)bner basic of polynomial ideal over Euclidean domain

Signature-based algorithm including F5,GVW are efficient algorithm for computing Gr(o)bner in commutative polynomial rings.

会议

Sparse FGLM algorithms

Groebner basis is an important tool in computational ideal theory,and the term ordering plays an important role in the theory of Groebner bases.

会议