Abstract
An algorithm for computing the determinant of a matrix whose entries are multivariate polynomials is presented. It is based on classical multivariate Lagrange polynomial interpolation, and it exploits the Kronecker product structure of the coefficient matrix of the linear system associated with the interpolation problem. From this approach, the parallelization of the algorithm arises naturally. The reduction of the intermediate expression swell is also a remarkable feature of the algorithm.
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.
