FGLM algorithm

FGLM is one of the main algorithms in computer algebra, named after its designers, Faugère, Gianni, Lazard and Mora. They introduced their algorithm in 1993. The input of the algorithm is a Gröbner basis of a zero-dimensional ideal in the ring of polynomials over a field with respect to a monomial order and a second monomial order. As its output, it returns a Gröbner basis of the ideal with respect to the second ordering. The algorithm is a fundamental tool in computer algebra and has been implemented in most of the computer algebra systems. The complexity of FGLM is O(nD3), where n is the number of variables of the polynomials and D is the degree of the ideal.[1] There are several generalization and various applications for FGLM.[2][3][4][5][6]

References

  1. ^ J.C. Faugère; P. Gianni; D. Lazard; T. Mora (1993). "Efficient Computation of Zero-dimensional Gröbner Bases by Change of Ordering". Journal of Symbolic Computation. 16 (4): 329–344. doi:10.1006/jsco.1993.1051.
  2. ^ Middeke, Johannes (2012-01-01). "A Computational View on Normal Forms of Matrices of Ore Polynomials". ACM Commun. Comput. Algebra. 45 (3/4): 190–191. doi:10.1145/2110170.2110182. ISSN 1932-2240. S2CID 14396484.
  3. ^ Gerdt, V. P.; Yanovich, D. A. (2003-03-01). "Implementation of the FGLM Algorithm and Finding Roots of Polynomial Involutive Systems". Programming and Computer Software. 29 (2): 72–74. doi:10.1023/A:1022992514981. ISSN 0361-7688. S2CID 17851647.
  4. ^ Faugère, Jean-Charles; Mou, Chenqi (2017-05-01). "Sparse FGLM algorithms". Journal of Symbolic Computation. 80, Part 3: 538–569. arXiv:1304.1238. doi:10.1016/j.jsc.2016.07.025. S2CID 149627.
  5. ^ Licciardi, Sandra; Mora, Teo (1994-01-01). "Implicitization of hypersurfaces and curves by the Primbasissatz and basis conversion". Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '94. New York, NY, USA: ACM. pp. 191–196. doi:10.1145/190347.190416. ISBN 978-0897916387. S2CID 14584685.
  6. ^ Borges-Quintana, M.; Borges-Trenard, M. A.; Martínez-Moro, E. (2006-02-20). "A General Framework for Applying FGLM Techniques to Linear Codes". Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Lecture Notes in Computer Science. Vol. 3857. pp. 76–86. arXiv:math/0509186. doi:10.1007/11617983_7. ISBN 978-3-540-31423-3. S2CID 13427304.


Stub icon

This polynomial-related article is a stub. You can help Wikipedia by adding missing information.

Stub icon

This commutative algebra-related article is a stub. You can help Wikipedia by adding missing information.

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.