Factorization of analytic functions by means of Koenig's theorem and Toeplitz computations

Numerische Mathematik

Volumn 89, Issue 1, 2001, Pages 49-82

  Bini, Dario Andrea ^a   Gemignani, Luca ^a   Meini, Beatrice ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035597738     PISSN: 0029599X     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00005463     Document Type: Article

References (36)

1. D. Bini, L. Gemignani, B. Meini, Factorization of Analytic Functions by means of Koenig's Theorem and Toeplitz Computations. Tech. Rep. n.98-08, Computer Science Dep., University of Pisa, Pisa, 1998
2. D. Bini, B. Meini, Effective Methods for Solving Banded Toeplitz Systems. SIAM J. Matrix Anal. Appl. 20 (1999), 700-719
3. D. Bini, B. Meini, Improved Cyclic Reduction for Solving Queueing Problems. Numerical Algorithms 15 (1997), 57-74
4. D. Bini, B. Meini, Using Displacement Structure for Solving Non-Skip-Free M/G/1 Type Markov Chains . Advances in Matrix Analytic Methods for Stochastic Models, A. Alfa and S. Chakravarthy Eds., 1998, Notable Publications Inc., NJ, pp. 17-37
5. D. Bini, B. Meini, Approximate Displacement Rank and Applications. Proceedings AMS Conference on Structured Matrices, Boulder, 1999
6. D. Bini, V. Y. Pan, Matrix and Polynomial Computations, Vol. 1, Fundamental Algorithms. Birkhäuser, Boston 1994
7. D. Bini, V. Y. Pan, Graeffe's, Chebyshev-like and Cardinal's Processes for Splitting a Polynomial into Factors. J. Complexity 12 (1996), 492-511
8. R. R. Bitmead and B. D. O. Anderson, Asymptotically Fast Solution of Toeplitz and Related Systems of Linear Equation. Linear Algebra Appl. 34, (1980), 103-116
9. B. L. Buzbee, G. H. Golub, C. W. Nielson, On Direct Methods for Solving Poisson's Equations. SIAM J. Num. Anal. 7 (1970), 627-656
10. J. P. Cardinal, On Two Iterative Methods for Approximating the Roots of a Polynomial. Proc. of Workshop: Mathematics of Numerical Analysis: Real Numbers Algorithms, Park City, Utah, (1995) (J. Renegar, M. Shub and S. Smale Eds.), Lect. in Appl. Math., Amer. Math. Soc., Providence, RI
11. J. P. Cardinal, On Two Iterative Methods for Approximating the Roots of a Polynomial. Proc. of Workshop: Mathematics of Numerical Analysis: Real Numbers Algorithms, Park City, Utah, (1995) (J. Renegar, M. Shub and S. Smale Eds.), Lect. in Appl. Math., Amer. Math. Soc., Providence, RI
12. R. H. Chan, M. K. Ng, Conjugate Gradient Methods for Toeplitz Systems. SIAM Review 38 (1996), 427-482
13. H. R. Gail, S.L. Hantler, B. A. Taylor, Non-Skip-Free M/G/1 and G/M/1 type Markov Chains. Adv. in Appl. Probab. 29 (1997), 733-758
14. L. Gemignani, Computing a Factor of a Polynomial by means of Multishift LR Algorithms. SIAM J. Matrix Anal. Appl. 19 (1998), 161-181
15. L. Gemignani, Polynomial Root Computation by means of the LR Algorithm. BIT 37 (1997), 333-345
16. L. Gemignani, Computing a Hurwitz Factorization of a Polynomial. J. Comput. Appl. Math. (to appear)
17. G. H. Golub, C. F. Van Loan, Matrix Computations. The Johns Hopkins University Press, Baltimore, Maryland, 1989
18. T.N.T. Goodman, C.A. Micchelli, G. Rodriguez, S. Seatzu, Spectral Factorization of Laurent Polynomials. Adv. Comp. Math. 7 (1997) 429-454
19. G. Heinig, K. Rost, Algebraic Methods for Toeplitz-like Matrices and Operators. Oper. Theory 13, Birkhäuser, Boston, MA, 1984
20. P. Henrici, Applied and Computational Complex Analysis, Vol. 1 , John Wiley and Sons, New York, NY, 1974
21. A. S. Householder, The Numerical Treatment of a Single Nonlinear Equation. International Series in Pure and Applied Mathematics, McGraw-Hill Inc., New York, NY, 1970
22. T. Kailath, A. H. Sayed, Displacement Structure: Theory and Applications. SIAM Rev. 37 (1995), 297-386
23. P. Kirrinnis, Partial Fraction Decomposition in C(z) and Simultaneous Newton Iteration for Factorization in C[z]. J. Complexity 14 (1998), 378-144
24. G. Latouche, Newton's Iteration for Nonlinear Equations in Markov Chains. IMA J. Numerical Anal. 14 (1994), 583-598
25. D. P. Laurie, Efficient Implementation of Wilson's Algorithm for Factorizing a Self-Reciprocal Polynomial. BIT 20 (1980), 257-259
26. B. Meini, New Convergence Results on Functional Iteration Techniques for the Numerical Solution of M/G/1 Type Markov Chains. Numer. Math. 78 (1997), 39-58
27. M. F. Neuts, Structured Stochastic Matrices of M/G/1 Type and Their Application. Marcel Dekk., New York, 1989
28. V. Y. Pan, Optimal and Nearly Optimal Algorithms for Approximating Polynomial Zeros. Comput. Math. Appl. 31 (1996), 97-138
29. V. Y. Pan, Deterministic Improvement of Complex Polynomial Factorization Based on the Properties of Associated Resultant. Comput. Math. Appl. 30 (1995), 237-250
30. V. Pták, Lyapunov, Bézout and Hankel. Linear Algebra Appl. 58 (1984), 363-390
31. A. Schoenhage, The Fundamental Theorem of Algebra in Terms of Computational Complexity (manuscript) 1982
32. G. W. Stewart, On a Companion Operator for Analytic Functions. Numer. Math. 18 (1971), 26-43
33. M. Van Barel, P. Kravanja, A Stabilized Superfast Solver for Indefinite Hankel Systems. Linear Algebra Appl. 284 (1998), 275-295
34. P. Van Dooren, Some Numerical Challenges in Control Theory. Linear Algebra for Control Theory, IMA Vol. Math. Appl. 62, Springer, NY, 1994
35. J. Verschelde, Homotopy Continuation Methods for Solving Polynomial Systems, PhD Dissertation, Katholieke Universiteit Leuven, 1996
36. M. Vidyasagar, Control System Synthesis: A Factorization Approach. MIT Press, Cambridge MA, 1985