Author:
Demmel James,Dumitriu Ioana,Holtz Olga
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Reference51 articles.
1. Anderson, E., Bai, Z., Bischof, C., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Blackford, S., Sorensen, D.: LAPACK Users’ Guide, 3rd edn. SIAM, Philadelphia (1999)
2. Anderson T.W., Olkin I. and Underhill L.G. (1987). Generation of random orthogonal matrices. SIAM J. Sci. Stat. Comput. 8: 625–629
3. Bai, Z., Demmel, J.: Design of a parallel nonsymmetric eigenroutine toolbox, Part I. In: Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing. SIAM. Long version available as UC Berkeley Computer Science report all.ps.Z via anonymous ftp from tr-ftp.cs.berkeley.edu, directory (1993) pub/tech-reports/csd/csd-92-718
4. Bai, Z., Demmel, J.: Using the matrix sign function to compute invariant subspaces. SIAM J. Mat. Anal. Appl. 19 (1), 1998. Technical report title “Design of a Parallel Nonsymmetric Eigenroutine Toolbox, Part II”
5. Bai, Z., Demmel, J., Gu, M.: Inverse free parallel spectral divide and conquer algorithms for nonsymmetric eigenproblems. Numer. Math. 76, 279–308, (1997). UC Berkeley CS Division Report UCB//CSD-94-793, Feb 94
Cited by
105 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Efficient classical algorithms for simulating symmetric quantum systems;Quantum;2023-11-28
2. Pebbling Game and Alternative Basis for High Performance Matrix Multiplication;SIAM Journal on Scientific Computing;2023-11-15
3. On Symmetric Factorizations of Hankel Matrices;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. The Bit Complexity of Efficient Continuous Optimization;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
5. The Complexity of Diagonalization;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24