A geometric algorithm for the factorization of rational motions in conformal three space

IF 0.6 4区 数学 Q4 COMPUTER SCIENCE, THEORY & METHODS
Zijia Li , Hans-Peter Schröcker , Johannes Siegele
{"title":"A geometric algorithm for the factorization of rational motions in conformal three space","authors":"Zijia Li ,&nbsp;Hans-Peter Schröcker ,&nbsp;Johannes Siegele","doi":"10.1016/j.jsc.2024.102388","DOIUrl":null,"url":null,"abstract":"<div><div>Rational motions in conformal three space can be parametrized by polynomials with coefficients in a suitable Clifford algebra. We call them “spinor polynomials.” In this text we present a new algorithm to decompose generic spinor polynomials into linear factors. The factorization algorithm is based on the “kinematics at infinity”. Factorizations exist generically but not generally and are typically not unique. We prove that generic multiples of non-factorizable spinor polynomials admit factorizations and we demonstrate at hand of an example how our ideas can be used to tackle the hitherto unsolved problem of “factorizing” algebraic motions.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Symbolic Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0747717124000920","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Rational motions in conformal three space can be parametrized by polynomials with coefficients in a suitable Clifford algebra. We call them “spinor polynomials.” In this text we present a new algorithm to decompose generic spinor polynomials into linear factors. The factorization algorithm is based on the “kinematics at infinity”. Factorizations exist generically but not generally and are typically not unique. We prove that generic multiples of non-factorizable spinor polynomials admit factorizations and we demonstrate at hand of an example how our ideas can be used to tackle the hitherto unsolved problem of “factorizing” algebraic motions.
共形三空间有理运动因式分解的几何算法
共形三空间中的有理运动可以用多项式参数化,多项式的系数在合适的克利福德代数中。我们称之为 "自旋多项式"。在这篇文章中,我们提出了一种新算法,可将一般旋量多项式分解为线性因子。因式分解算法基于 "无限运动学"。因式分解一般存在,但并不普遍,而且通常不是唯一的。我们证明了不可因式分解的旋量多项式的一般倍数允许因式分解,并通过实例演示了如何利用我们的想法来解决代数运动的 "因式分解 "这一迄今尚未解决的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Symbolic Computation
Journal of Symbolic Computation 工程技术-计算机:理论方法
CiteScore
2.10
自引率
14.30%
发文量
75
审稿时长
142 days
期刊介绍: An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects. It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信