Eigenanalysis and polynomial root finding primitive functions

Authors:
S. Schmidt;J. A. Brown;M. A. Jenkins
Affiliations:
IBM E61/915, P.O. Box 390, Poughkeepsie, New York;IBM M75/E42, 555 Bailey Avenue, San Jose, California;Computing and Information Sciences, Queens University, Kingston, Ontario, Canada K7L3N6
Venue:
APL '82 Proceedings of the international conference on APL
Year:
1982

Citing 5
Cited 0

The algebraic eigenvalue problem

The algebraic eigenvalue problem
Principles for Testing Polynomial Zerofinding Programs

ACM Transactions on Mathematical Software (TOMS)
Algorithm 493: Zeros of a Real Polynomial [C2]

ACM Transactions on Mathematical Software (TOMS)
Algorithm 419: zeros of a complex polynomial [C2]

Communications of the ACM
The design of an APL primitive function for the eigenproblem

APL '75 Proceedings of seventh international conference on APL

Quantified Score

Hi-index	0.00

Visualization

Abstract

Working in conjunction with complex arithmetic extensions to APL, two new experimental primitive functions have been defined. They are an eigenanalysis primitive function and one for polynomial root finding. This paper traces our procedures of defining and testing the new functions, as well as an outline of the algorithms themselves. A few sample problems are given.