On the sparse matrix computation of critical frequencies
- 1 February 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 23 (2) , 92-95
- https://doi.org/10.1109/tcs.1976.1084185
Abstract
An algorithm for finding the eigenvalues of the generalized eigenvalue problem for sparse and matrices is discussed. Its performance is compared to that of the algorithm for some test matrices.Keywords
This publication has 11 references indexed in Scilit:
- An Algorithm for Generalized Matrix Eigenvalue ProblemsSIAM Journal on Numerical Analysis, 1973
- On poles and zeros of linear systemsIEEE Transactions on Circuit Theory, 1973
- A probabilistic approach to optimal pivoting and prediction of fill-in for random sparse matricesIEEE Transactions on Circuit Theory, 1972
- A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONSPublished by Elsevier ,1972
- Some Basic Techniques for Solving Sparse Systems of Linear EquationsPublished by Springer Nature ,1972
- Eigenvalue Methods for Sparse MatricesPublished by Springer Nature ,1972
- An Optimal Ordering of Electronic Circuit Equations for a Sparse Matrix SolutionIEEE Transactions on Circuit Theory, 1971
- Direct solutions of sparse network equations by optimally ordered triangular factorizationProceedings of the IEEE, 1967
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1The Computer Journal, 1961
- A Method for Solving Algebraic Equations Using an Automatic ComputerMathematical Tables and Other Aids to Computation, 1956