We present a new algorithm for computing a SAGBI basis up to an arbitrary degree for a subalgebra generated by a set of homogeneous polynomials. Our idea is based on linear algebra methods which cause a low level of complexity and computational cost. We then use it to solve the membership problem in subalgebras.
Fakouri,S , Basiri,A and Rahmani,S . (2018). A new algorithm for computing SAGBI bases up to an arbitrary degree. International Journal of Nonlinear Analysis and Applications, 9(2), 215-221. doi: 10.22075/ijnaa.2017.1718.1640
MLA
Fakouri,S , , Basiri,A , and Rahmani,S . "A new algorithm for computing SAGBI bases up to an arbitrary degree", International Journal of Nonlinear Analysis and Applications, 9, 2, 2018, 215-221. doi: 10.22075/ijnaa.2017.1718.1640
HARVARD
Fakouri S, Basiri A, Rahmani S. (2018). 'A new algorithm for computing SAGBI bases up to an arbitrary degree', International Journal of Nonlinear Analysis and Applications, 9(2), pp. 215-221. doi: 10.22075/ijnaa.2017.1718.1640
CHICAGO
S Fakouri, A Basiri and S Rahmani, "A new algorithm for computing SAGBI bases up to an arbitrary degree," International Journal of Nonlinear Analysis and Applications, 9 2 (2018): 215-221, doi: 10.22075/ijnaa.2017.1718.1640
VANCOUVER
Fakouri S, Basiri A, Rahmani S. A new algorithm for computing SAGBI bases up to an arbitrary degree. IJNAA. 2018;9(2):215-221. doi: 10.22075/ijnaa.2017.1718.1640
International Journal of Nonlinear Analysis and Applications