Abstract
In this paper, we present new mathematical results and several new algorithm for solving a system of algebraic equations algebraically. We find that many ideal-theoretical arguments for the problem can be translated into their counterparts in the theory of linear maps. And by this translation, we succeed in giving a new description for the U-resultant and forms of solutions of systems straightforwardly. New algorithms proposed here apply algorithms of linear algebra to avoid repeated computations of Gröbner bases under lexicographic order, and they require computation of a Gröbner basis, under arbitrary order, only once in principle. The new algorithms improve the efficiency of computation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
