Approximate GCD and its application to ill-conditioned equations
Authors:
- Matu-Tarow NodaMNMatu-Tarow Noda
- Tateaki SasakiTSTateaki Sasaki
- 1 December 1991
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 38 (1-3) , 335-351
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An Existence Test for Root Clusters and Multiple RootsZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1988
- A tutorial introduction to MapleJournal of Symbolic Computation, 1986
- Quasi-GCD computationsJournal of Complexity, 1985
- A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomialBIT Numerical Mathematics, 1975
- On Euclid's Algorithm and the Theory of SubresultantsJournal of the ACM, 1971
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967