CSpace
New bounds and an efficient algorithm for sparse difference resultants
Yuan, Chun-Ming1,2; Zhang, Zhi-Yong3
2021-11-01
Source PublicationJOURNAL OF SYMBOLIC COMPUTATION
ISSN0747-7171
Volume107Pages:279-298
AbstractThe sparse difference resultant introduced in Li et al. (2015b) is a basic concept in difference elimination theory. In this paper, we show that the sparse difference resultant of a generic Laurent transformally essential system can be computed via the sparse resultant of a simple algebraic system arising from the difference system. Moreover, new order bounds of sparse difference resultant are found. Then we propose an efficient algorithm to compute sparse difference resultant which is the quotient of two determinants whose elements are the coefficients of the polynomials in the algebraic system. The complexity of the algorithm is analyzed and experimental results show the efficiency of the algorithm. (C) 2021 Elsevier Ltd. All rights reserved.
KeywordSparse difference resultant Laurent transformally essential system Sparse resultant Complexity
DOI10.1016/j.jsc.2021.04.002
Indexed BySCI
Language英语
Funding ProjectNational Natural Science Foundation of China[11688101] ; National Natural Science Foundation of China[11671014] ; Beijing Natural Science Foundation[Z190004]
WOS Research AreaComputer Science ; Mathematics
WOS SubjectComputer Science, Theory & Methods ; Mathematics, Applied
WOS IDWOS:000653658500013
PublisherACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/58696
Collection中国科学院数学与系统科学研究院
Corresponding AuthorZhang, Zhi-Yong
Affiliation1.Chinese Acad Sci, Acad Math & Syst Sci, KLMM, Beijing 100190, Peoples R China
2.Univ Chinese Acad Sci, Sch Math Sci, Beijing 100049, Peoples R China
3.Minzu Univ China, Coll Sci, Beijing 100081, Peoples R China
Recommended Citation
GB/T 7714
Yuan, Chun-Ming,Zhang, Zhi-Yong. New bounds and an efficient algorithm for sparse difference resultants[J]. JOURNAL OF SYMBOLIC COMPUTATION,2021,107:279-298.
APA Yuan, Chun-Ming,&Zhang, Zhi-Yong.(2021).New bounds and an efficient algorithm for sparse difference resultants.JOURNAL OF SYMBOLIC COMPUTATION,107,279-298.
MLA Yuan, Chun-Ming,et al."New bounds and an efficient algorithm for sparse difference resultants".JOURNAL OF SYMBOLIC COMPUTATION 107(2021):279-298.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yuan, Chun-Ming]'s Articles
[Zhang, Zhi-Yong]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yuan, Chun-Ming]'s Articles
[Zhang, Zhi-Yong]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yuan, Chun-Ming]'s Articles
[Zhang, Zhi-Yong]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.