Bernstein-Bezoutian matrices

Theoretical Computer Science

Volumn 315, Issue 2-3, 2004, Pages 319-333

  Bini, D A ^a   Gemignani, L ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Bernstein polynomial basis; Bezoutian matrices; Displacement structure; Fast algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER AIDED DESIGN; LINEAR SYSTEMS; PERTURBATION TECHNIQUES; POLYNOMIALS;

BERNSTEIN POLYNOMIAL BASIS; BEZOUTIAN MATRICES; DISPLACEMENT STRUCTURE; FAST ALGORITHMS;

MATRIX ALGEBRA;

EID: 2042482733     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.01.016     Document Type: Article

References (27)

1. S. Barnett, A Bezoutian matrix for Chebyshev polynomials, in: Applications of Matrix Theory (Bradford, 1988), Vol. 22, Institute of Mathematics and its Application Conference Series New Series, Oxford University Press, 1988, Oxford, pp. 137-149.
2. Bini D., Gemignani L. Fast parallel computation of the polynomial remainder sequence via Bézout and Hankel matrices. SIAM J. Comput. 24(1):1995;63-77.
3. Bini D.A., Gemignani L. Fast fraction-free triangularization of Bezoutians with applications to sub-resultant chain computation. Linear Algebra Appl. 284:1998;19-39.
4. D.A. Bini, V. Pan, Matrix and Polynomial Computations: Fundamental Algorithms, Vol. 1, Birkhäuser, Boston, 1994.
5. Brown W.S., Traub J.F. On Euclid's algorithm and the theory of subresultants. J. Assoc. Comput. Mach. 18:1971;505-514.
6. Chan T.F., Hansen P.C. A look-ahead Levinson algorithm for indefinite Toeplitz systems. SIAM J. Matrix Anal. Appl. 13(2):1992;490-506.
7. Collins G.E. Sub-resultants and reduced polynomial remainder sequences. J. Assoc. Comput. Mach. 14:1967;128-142.
8. R.M. Corless, P.M. Gianni, B.M. Trager, S.M. Watt, The singular value decomposition for polynomial systems, in Proc. ACM Internat. Symp. Symbolic and Algebraic Computation, Montreal, Quebec, Canada, 1995, pp. 195-207.
9. Emiris I.Z., Galligo A., Lombardi H. Certified approximate univariate GCDs. J. Pure Appl. Algebra. 117/118:1997;229-251.
10. G. Farin, Curves and surfaces for computer-aided geometric design, Computer Science and Scientific Computing, 4th Edition, Academic Press, San Diego, CA, 1997 (A practical guide, Chapter 1 by P. Bézier; Chapters 11 and 22 by W. Boehm, With 1 IBM-PC floppy disk (3.5 inch; HD)).
11. Farin G.E., Hamann B. Current trends in geometric modeling and selected computational applications. J. Comput. Phys. 138(1):1997;1-15.
12. Farin G.E., Hansford D. For graphics and modeling, The Geometry Toolbox. 1998;A K Peters Ltd. Natick, MA.
13. Farouki R.T., Rajan V.T. On the numerical condition of polynomials in Bernstein form. Comput. Aided Geom. Design. 5:1988;1-26.
14. Forrest A.R. Interactive interpolation and approximation by Bézier polynomials. Comput. J. 15:1972;71-79.
15. Freund R.W., Zha H.Y. A look-ahead algorithm for the solution of general Hankel systems. Numer. Math. 64(3):1993;295-321.
16. Gemignani L. Fast and stable computation of the barycentric representation of rational interpolants. Calcolo. 33(3-4):1998;371-388. (Toeplitz matrices: structures, algorithms and applications, Cortona, 1996).
17. Gemignani L. Schur complements of Bezoutians and the inversion of block Hankel and block Toeplitz matrices. Linear Algebra Appl. 253:1997;39-59.
18. Gohberg I., Olshevsky V. Fast inversion of Chebyshev-Vandermonde matrices. Numer. Math. 67(1):1994;71-92.
19. Kailath T., Olshevsky V. Displacement-structure approach to polynomial Vandermonde and related matrices. Linear Algebra Appl. 261:1997;49-90.
20. Kailath T., Sayed A.H. Displacement structure. theory and applications SIAM Rev. 37(3):1995;297-386.
21. T. Kailath, A.H. Sayed (Eds.), Fast Reliable Algorithms for Matrices with Structure, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1999.
22. Pan V.Y. Computation of approximate polynomial GCDs and an extension. Inform. and Comput. 167(2):2001;71-85.
23. Rost K. Generalized companion matrices and matrix representations for generalized Bezoutians. Linear Algebra Appl. 193:1993;151-172.
24. Winkler J.R. A resultant matrix for scaled Bernstein polynomials. Linear Algebra Appl. 319(1-3):2000;179-191.
25. Winkler J.R. A comparison of the average case numerical condition of the power and Bernstein polynomial bases. Internat. J. Comput. Math. 77(4):2001;583-602.
26. J.R. Winkler, A companion matrix resultant for Bernstein polynomials, Linear Algebra Appl. 362 (2003) 153-175.
27. Wolters H.J., Farin G.E. Geometric curve approximation. Comput. Aided Geom. Design. 14(6):1997;499-513.