Faculty Publications - Beresford N. Parlett

Books

B. N. Parlett, The Symmetric Eigenvalue Problem, 2nd ed., Classics in Applied Mathematics, Vol. 20, Philadelphia: Society for Industrial and Applied Mathematics (SIAM), 1998. [abstract]

J. Demmel, J. Dongarra, B. N. Parlett, W. M. Kahan, M. Gu, D. Bindel, Y. Hida, X. Li, O. Marques, E. J. Riedy, C. Vomel, J. Langou, P. Luszczek, J. Kurzak, A. Buttari, J. Langou, and S. Tomov, "Prospectus for the next LAPACK and ScaLAPACK libraries," in Applied Parallel Computing: State of the Art in Scientific Computing. Proc. 8th Intl. Workshop (PARA 2006). Revised Selected Papers, B. Kagstrom, E. Elmroth, J. Dongarra, and J. Wasniewski, Eds., Lecture Notes in Computer Science, Vol. 4699, Berlin, Germany: Springer-Verlag, 2007, pp. 11-23.
W. M. Kahan and B. N. Parlett, "How far should you go with the Lanczos process?," in Sparse Matrix Computations: Proc. Symp. on Sparse Matrix Computations, J. R. Bunch and D. J. Rose, Eds., New York, NY: Academic Press, 1976, pp. 131-144.

O. A. Marques, C. Vomel, J. Demmel, and B. N. Parlett, "Algorithm 880: A testing infrastructure for symmetric tridiagonal eigensolvers," ACM Trans. Mathematical Software, vol. 35, no. 1, pp. 8:1-13, July 2008.
J. Demmel, O. A. Marques, B. N. Parlett, and C. Vomel, "Performance and accuracy of LAPACK's symmetric tridiagonal eigensolvers," SIAM J. Scientific Computing, vol. 30, no. 3, pp. 1508-1526, April 2008.
W. M. Kahan, B. N. Parlett, and E. Jiang, "Residual bounds on approximate eigensystems of nonnormal matrices," SIAM J. Numerical Analysis, vol. 19, no. 3, pp. 470-484, June 1982.
W. M. Kahan and B. N. Parlett, "How reliable is your calculator?," Funkschau, vol. 51, no. 1, pp. 29-32, Jan. 1979. [abstract]
W. M. Kahan and B. N. Parlett, "Are there errors in pocket calculators? II.," Funkschau, vol. 51, no. 2, pp. 87-90, Jan. 1979. [abstract]

B. N. Parlett and W. M. Kahan, "On the convergence of a practical QR algorithm," in Proc. 4th IFIP Congress 1968, A. J. H. Morrell, Ed., Vol. 1, Amsterdam, The Netherlands: North-Holland Publishing Co., 1968, pp. 114-118. [abstract]

B. N. Parlett and C. Voemel, "LAPACK Working Note 163: How the MRRR Algorithm Can Fail on Tight Eigenvalue Clusters," EECS Department, University of California, Berkeley, Tech. Rep. UCB/CSD-04-1367, March 2005. [abstract]
I. Dhillon, B. N. Parlett, and C. Voemel, "LAPACK Working Note 162: The Design and Implementation of the MRRR Algorithm," EECS Department, University of California, Berkeley, Tech. Rep. UCB/CSD-04-1346, 2004. [abstract]
W. M. Kahan and B. N. Parlett, "How Far Should You Go with the Lanczos Process?," University of California, Berkeley, Electronics Research Lab, Tech. Rep. UCB/ERL M-78-48, July 1978. [abstract]
W. M. Kahan and B. N. Parlett, "Can You Count on Your Calculator?," University of California, Berkeley, Electronics Research Lab, Tech. Rep. UCB/ERL M-77-21, April 1977. [abstract]
W. M. Kahan and B. N. Parlett, "An Analysis of Lanczos Algorithms for Symmetric Matrices," University of California, Electronics Research Laboratory, Tech. Rep. UCB/ERL M-74-467, Sep. 1974. [abstract]

J. Demmel, W. M. Kahan, and B. N. Parlett, "Forsythe, Golub, and the Future of Matrix Computations," presented at Matrix Computations & Scientific Computing Seminar, 380 Soda Hall, March 2007.