Algorithms for intersecting parametric and algebraic curves I: simple intersections
ACM Transactions on Graphics (TOG)
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Solving Systems of Polynomial Equations
IEEE Computer Graphics and Applications
Finite and Infinite QBD Chains: A Simple and Unifying Algorithmic Approach
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A new paradigm in teletraffic analysis of communication networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
| Hi-index | 0.00 |
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solve effectively on massively parallel machines. Rather than trying to design a ``black box'''' eigenroutine in the spirit of EISPACK or LAPACK, we propose building a toolbox for this problem. The tools are meant to be used in different combinations on different problems and architectures. In this paper, we will describe these tools which include basic block matrix computations, the matrix sign function, 2-dimensional bisection, and spectral divide and conquer using the matrix sign function to find selected eigenvalues. We also outline how we deal with ill-conditioning and potential instability. Numerical examples are included. A future paper will discuss error analysis in detail and extensions to the generalized eigenproblem.