A generalized Bairstow algorithm

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A generalized Bairstow algorithm

Full text

Pdf (535 KB)

Source

Communications of the ACM archive
Volume 10 , Issue 6 (June 1967) table of contents

Pages: 371 - 373

Year of Publication: 1967

ISSN:0001-0782

Authors

G. H. Golub	Stanford Univ., Stanford, CA
T. N. Robertson	Stanford Univ., Stanford, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 39, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/363332.363376 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BAIRSTOW, L. Investigations relating to the stability of the aeroplane. R and M 154 of Advisory Committee for Aeronautics, 1914.
	2	LIN, SHIH-NGE. A method for finding roots of algebraic equations. J. Math. Phys. 22 (1943), 60-77.
	3	FRIEDMAN, B. Note on approximating complex zeros of a polynomial. Comm. Pure Appl. Math. 2 (1949), 195-208.
	4	LUKE, Y. L., AND UFFORD, D. OIl the roots of algebraic equations. J. Math. Phys. 30 (1951), 94-101.
	5	KANTOROVICH, L.V. Functional analysis and applied mathematics. Nat. Bur. Standards Report 1509, Transl. by C. D. Benster and edited by G. E. Forsythe.
	6	HENRICI, PETER. Elements of Numerical Analysis. John Wiley, New York, 1964.
	7	FORSYTHE, G. E. Generation and the use of orthogonal polynomials for data fitting with a digital computer. J . Soc. Indust. Appl. Math. 5 (1957), 74-88.
	8	WALTMANN, W. L., AND LAMBERT, R. J. T-algorithm for tridiagonalization. J. Indust. Appl. Math. 13 (1965), 1069- 1078.
	9	J. H. Wilkinson, The algebraic eigenvalue problem, Oxford University Press, Inc., New York, NY, 1988
	10	HANDSCOMB, D. C. Cmnputation of the latent roots of a Hessenberg matrix by Bairstow's method. Comput. J. 5 (1962), 139-141.

CITED BY 2

	T. N. L. Patterson, Algorithm 672: generation of interpolatory quadrature rules of the highest degree of precision with preassigned nodes for general weight functions, ACM Transactions on Mathematical Software (TOMS), v.15 n.2, p.137-143, June 1989
	T. N. L. Patterson, An algorithm for generating interpolatory quadrature rules of the highest degree of precision with preassigned nodes for general weight functions, ACM Transactions on Mathematical Software (TOMS), v.15 n.2, p.123-136, June 1989