Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)

<Previous Article In Volume
Next Article In Volume>

Some Improvement upon Algorithm IrrCharSer

Authors
Fangjian Huang
Corresponding Author
Fangjian Huang
Available Online August 2012.
DOI
10.2991/iccasm.2012.222How to use a DOI?
Keywords
polynomial set, U-set,zero decomposition, algorithm IrrCharSer
Abstract

Li presents the U-set to improve the algorithm CharSer that can compute a characteristic series from any given polynomial set. We modify the definition of U-set and present a new version of the algorithm IrrCharSer. Examples are given to show that the improvement can avoid the redundant branches of the decomposition tree.

Copyright
© 2012, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
Series
Advances in Intelligent Systems Research
Publication Date
August 2012
ISBN
10.2991/iccasm.2012.222
ISSN
1951-6851
DOI
10.2991/iccasm.2012.222How to use a DOI?
Copyright
© 2012, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

risenwbib
TY  - CONF
AU  - Fangjian Huang
PY  - 2012/08
DA  - 2012/08
TI  - Some Improvement upon Algorithm IrrCharSer
BT  - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
PB  - Atlantis Press
SP  - 870
EP  - 873
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccasm.2012.222
DO  - 10.2991/iccasm.2012.222
ID  - Huang2012/08
ER  -