Sign In

Communications of the ACM

Communications of the ACM

Algorithm 405: roots of matrix pencils: the generalized eigenvalue problem [F2]

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share: Send by email Share on reddit Share on StumbleUpon Share on Hacker News Share on Tweeter Share on Facebook
* This work was supported by the US National Aeronautics and Space Administration, by the National Science Foundation under Grant GS-2703 to the University of Chicago, and by the US Office of Naval Research under Grant NONR 760(24) NR 047-048 to Carnegie-Mellon University. Computations were done on the University of Chicago's Maniac III computer and were supported by the US Atomic Energy Commission under grants AT (11-1)-614 and AT (11-1)-2094.

The full text of this article is premium content


No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account
ACM Resources