Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference13 articles.
1. Ben-Or, M., Tiwari, P.: Simple algorithm for approximating all roots of a polynomial with real roots. J. Complexity6(4), 417–442 (1990).
2. Bini, D., Gemignani, L.: An iteration scheme for the divide-and-conquer eigenvalue solvers. Manuscript, Dipartimento di Matematica, Università di Pisa, Pisa, 1991.
3. Bini, D., Pan, V.: Parallel complexity of tridiagonal symmetric eigenvalue problem. Proc. 2nd Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 384–393, 1991.
4. Bunch, J. R., Nielsen C. P., Sorensen, D. C.: Rank-one modificationof the symmetric eigenproblem. Numer. Math.31, 31–48 (1978).
5. Cuppen, J. J. M.: A divide and conquer method for the symmetric tridiagonal eigenproblem. Numer. Math.36, 177–195 (1981).
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献