Computer Algebra in Scientific Computing

DOI10.1007/11555964MaRDI QIDQ5479260zbMATH OpenOpenAlexFDO

Authors Akira Terui

Publication date 7 July 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0806.0488

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Abstract: We give two new expressions of subresultants, nested subresultant and reduced nested subresultant, for the recursive polynomial remainder sequence (PRS) which has been introduced by the author. The reduced nested subresultant reduces the size of the subresultant matrix drastically compared with the recursive subresultant proposed by the authors before, hence it is much more useful for investigation of the recursive PRS. Finally, we discuss usage of the reduced nested subresultant in approximate algebraic computation, which motivates the present work.

Recommendations

• Recursive polynomial remainder sequence and its subresultants
• scientific article; zbMATH DE number 6868541
• scientific article; zbMATH DE number 3913669
• scientific article; zbMATH DE number 1512700
• scientific article; zbMATH DE number 1273655

Cited in

(2)

• Recursive polynomial remainder sequence and its subresultants
• scientific article; zbMATH DE number 3913669 (Why is no real title available?)

This page was built for publication: Computer Algebra in Scientific Computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5479260)