Fast numerical improvement of factors of polynomials and of partial fractions

Authors:
Peter Kirrinnis
Affiliations:
Universität Bonn, Institut für Informatik II, Römerstr. 164, D-53117 Bonn, Germany
Venue:
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Year:
1998

Citing 8
Cited 0

On the worst-case arithmetic complexity of approximating zeros of polynomials

Journal of Complexity
Combinatorial search

Combinatorial search
On Grau's method for simultaneous factorization of polynomials

SIAM Journal on Numerical Analysis
Fast computation of numerical partial fraction decompositions and contour integrals of rational functions

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
An optimal bound for path weights in Huffman trees

Information Processing Letters
An efficient algorithm for the complex roots problem

Journal of Complexity
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Asymptotically Fast Algorithms for the Numerical Multiplication and Division of Polynomials with Complex Coeficients

EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract