|
Zapiski Nauchnykh Seminarov POMI, 2009, Volume 373, Pages 189–193
(Mi znsl3582)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Root-squaring with DPR1 matrices
V. Y. Pan Department of Mathematics and Computer Science Lehman College of the City University of New York Bronx, USA
Abstract:
Recent progress in polynomial root-finding relies on employing the associated companion and generalized companion DPR1 matrices. (“DPR1” stands for “diagonal plus rank-one.”) We propose an algorithm that uses nearly linear arithmetic time to square a DPR1 matrix. Consequently the algorithm squares the roots of the associated characteristic polynomial. This incorporates the classical techniques of polynomial root-finding by means of root-squaring into new effective framework. Our approach is distinct from the earlier fast methods for squaring companion matrices. Bibl. – 13 titles.
Key words and phrases:
polynomial root-squaring, DPR1 matrices.
Received: 11.09.2009
Citation:
V. Y. Pan, “Root-squaring with DPR1 matrices”, Representation theory, dynamical systems, combinatorial methods. Part XVII, Zap. Nauchn. Sem. POMI, 373, POMI, St. Petersburg, 2009, 189–193; J. Math. Sci. (N. Y.), 168:3 (2010), 417–419
Linking options:
https://www.mathnet.ru/eng/znsl3582 https://www.mathnet.ru/eng/znsl/v373/p189
|
Statistics & downloads: |
Abstract page: | 168 | Full-text PDF : | 53 | References: | 31 |
|