default search action
Beresford N. Parlett
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j36]Carla Ferreira, Beresford N. Parlett:
A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem. Numerische Mathematik 150(2): 373-422 (2022) - 2020
- [j35]Carla Ferreira, Beresford N. Parlett:
Eigenpairs of Wilkinson Matrices. SIAM J. Matrix Anal. Appl. 41(3): 1388-1415 (2020)
2010 – 2019
- 2016
- [j34]Beresford N. Parlett, Froilán M. Dopico, Carla Ferreira:
The Inverse Eigenvector Problem for Real Tridiagonal Matrices. SIAM J. Matrix Anal. Appl. 37(2): 577-597 (2016) - 2014
- [j33]Shengguo Li, Ming Gu, Beresford N. Parlett:
An Improved DQDS Algorithm. SIAM J. Sci. Comput. 36(3) (2014) - [c8]Si Si, Donghyuk Shin, Inderjit S. Dhillon, Beresford N. Parlett:
Multi-Scale Spectral Decomposition of Massive Graphs. NIPS 2014: 2798-2806 - 2012
- [j32]Carla Ferreira, Beresford N. Parlett, Froilán M. Dopico:
Sensitivity of eigenvalues of an unsymmetric tridiagonal matrix. Numerische Mathematik 122(3): 527-555 (2012) - 2011
- [j31]Matthias Morzfeld, Fai Ma, Beresford N. Parlett:
The Transformation of Second-Order Linear Systems into Independent Equations. SIAM J. Appl. Math. 71(4): 1026-1043 (2011) - [j30]Christof Vömel, Beresford N. Parlett:
Detecting Localization in an Invariant Subspace. SIAM J. Sci. Comput. 33(6): 3447-3467 (2011) - 2010
- [j29]Augustin A. Dubrulle, Beresford N. Parlett:
Revelations of a transposition matrix. J. Comput. Appl. Math. 233(5): 1217-1219 (2010)
2000 – 2009
- 2009
- [j28]Carla Ferreira, Beresford N. Parlett:
Convergence of LR algorithm for a one-point spectrum tridiagonal matrix. Numerische Mathematik 113(3): 417-431 (2009) - [j27]Beresford N. Parlett, Christof Vömel:
The Spectrum of a Glued Matrix. SIAM J. Matrix Anal. Appl. 31(1): 114-132 (2009) - 2008
- [j26]Jörg Liesen, Beresford N. Parlett:
On nonsymmetric saddle point matrices that allow conjugate gradient iterations. Numerische Mathematik 108(4): 605-624 (2008) - [j25]James Demmel, Osni Marques, Beresford N. Parlett, Christof Vömel:
Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers. SIAM J. Sci. Comput. 30(3): 1508-1526 (2008) - [j24]Osni Marques, Christof Vömel, James Demmel, Beresford N. Parlett:
Algorithm 880: A testing infrastructure for symmetric tridiagonal eigensolvers. ACM Trans. Math. Softw. 35(1): 8:1-8:13 (2008) - 2007
- [r1]Yozo Hida, James Demmel, Julien Langou, Jakub Kurzak, Ming Gu, Alfredo Buttari, Stanimire Tomov, Piotr Luszczek, Julie Langou, Osni Marques, Christof Vömel, Xiaoye S. Li, E. Jason Riedy, Jack J. Dongarra, William Kahan, Beresford N. Parlett, David Bindel:
Prospectus for a Dense Linear Algebra Software Library. Handbook of Parallel Computing 2007 - 2006
- [j23]Osni A. Marques, Beresford N. Parlett, Christof Vömel:
Computations of eigenpair subsets with the MRRR algorithm. Numer. Linear Algebra Appl. 13(8): 643-653 (2006) - [j22]Inderjit S. Dhillon, Beresford N. Parlett, Christof Vömel:
The design and implementation of the MRRR algorithm. ACM Trans. Math. Softw. 32(4): 533-560 (2006) - [c7]James Demmel, Jack J. Dongarra, Beresford N. Parlett, William Kahan, Ming Gu, David Bindel, Yozo Hida, Xiaoye S. Li, Osni Marques, E. Jason Riedy, Christof Vömel, Julien Langou, Piotr Luszczek, Jakub Kurzak, Alfredo Buttari, Julie Langou, Stanimire Tomov:
Prospectus for the Next LAPACK and ScaLAPACK Libraries. PARA 2006: 11-23 - 2005
- [j21]Zhong-Zhi Bai, Beresford N. Parlett, Zeng-Qi Wang:
On generalized successive overrelaxation methods for augmented linear systems. Numerische Mathematik 102(1): 1-38 (2005) - [j20]Beresford N. Parlett:
A Bidiagonal Matrix Determines Its Hyperbolic SVD to Varied Relative Accuracy. SIAM J. Matrix Anal. Appl. 26(4): 1022-1057 (2005) - [j19]Inderjit S. Dhillon, Beresford N. Parlett, Christof Vömel:
Glued Matrices and the MRRR Algorithm. SIAM J. Sci. Comput. 27(2): 496-510 (2005) - [j18]Xiaoqiang Zheng, Beresford N. Parlett, Alex Pang:
Topological Lines in 3D Tensor Fields and Discriminant Hessian Factorization. IEEE Trans. Vis. Comput. Graph. 11(4): 395-407 (2005) - [c6]Xiaoqiang Zheng, Beresford N. Parlett, Alex Pang:
Topological Structures of 3D Tensor Fields. IEEE Visualization 2005: 551-558 - 2003
- [j17]Beresford N. Parlett:
Perturbation of Eigenpairs of Factored Symmetric Tridiagonal Matrices. Found. Comput. Math. 3(2): 207-223 (2003) - [j16]Beresford N. Parlett:
The spectral diameter as a function of the diagonal entries. Numer. Linear Algebra Appl. 10(7): 595-602 (2003) - [j15]Inderjit S. Dhillon, Beresford N. Parlett:
Orthogonal Eigenvectors and Relative Gaps. SIAM J. Matrix Anal. Appl. 25(3): 858-899 (2003) - 2002
- [j14]Beresford N. Parlett, Olaf Krafft, Martin Schaefer:
The Largest Eigenvalue of a Positive Definite Symmetric Matrix: 10839. Am. Math. Mon. 109(10): 922-923 (2002) - 2000
- [j13]Beresford N. Parlett:
The QR algorithm. Comput. Sci. Eng. 2(1): 38-42 (2000) - [j12]Beresford N. Parlett:
Problem 10839. Am. Math. Mon. 107(10): 950 (2000)
1990 – 1999
- 1997
- [c5]Inderjit S. Dhillon, George Fann, Beresford N. Parlett:
Application of a New Algorithm for the Symmetric Eigenproblem to Computational Quantum Chemistry. PP 1997 - 1995
- [j11]Chris C. Paige, Beresford N. Parlett, Henk A. van der Vorst:
Approximate solutions and eigenvalue bounds from Krylov subspaces. Numer. Linear Algebra Appl. 2(2): 115-133 (1995) - [j10]K. Vince Fernando, Beresford N. Parlett:
Implicit Cholesky algorithms for singular values and vectors of triangular matrices. Numer. Linear Algebra Appl. 2(6): 507-531 (1995) - [c4]Beresford N. Parlett, K. Vince Fernando:
Singular Vectors via Differential qd. PP 1995: 564-568 - 1994
- [j9]Michael W. Berry, Beresford N. Parlett, Ahmed H. Sameh:
Computing Extremal Singular Triplets of Sparse Matrices on a Shared-Memory Multiprocessor. Int. J. High Speed Comput. 6(2): 239-275 (1994) - 1993
- [j8]Beresford N. Parlett, Jian Le:
Forward Instability of Tridiagonal QR. SIAM J. Matrix Anal. Appl. 14(1): 279-316 (1993) - 1992
- [j7]R. O. Hill Jr., Beresford N. Parlett:
Refined Interlacing Properties. SIAM J. Matrix Anal. Appl. 13(1): 239-247 (1992) - [j6]Beresford N. Parlett:
Reduction to Tridiagonal Form and Minimal Realizations. SIAM J. Matrix Anal. Appl. 13(2): 567-593 (1992) - 1990
- [j5]Feng Gao, Beresford N. Parlett:
A note on communication analysis of parallel sparse Cholesky factorization on a hypercube. Parallel Comput. 16(1): 59-60 (1990)
1980 – 1989
- 1987
- [c3]Beresford N. Parlett:
J. H. Wilkinson's work and influence on matrix computations. HSNC 1987: 133-138
1970 – 1979
- 1977
- [j4]S. P. Chan, R. Feldman, Beresford N. Parlett:
Algorithm 517: A Program for Computing the Condition Numbers of Matrix Eigenvalues Without Computing Eigenvectors [F2]. ACM Trans. Math. Softw. 3(2): 186-203 (1977) - 1975
- [j3]Beresford N. Parlett, Y. Wang:
The Influence of the Compiler on the Cost of Mathematical Software - In Particular on the Cost of Triangular Factorization. ACM Trans. Math. Softw. 1(1): 35-46 (1975)
1960 – 1969
- 1968
- [c2]Beresford N. Parlett, William Kahan:
On the convergence of a practical QR algorithm. IFIP Congress (1) 1968: 114-118 - 1967
- [j2]Beresford N. Parlett:
Correspondence. Comput. J. 9(4): 344-345 (1967) - 1966
- [j1]Beresford N. Parlett:
Convergence of the Q-R algorithm for Hessenberg matrices. Commun. ACM 9(7): 475 (1966) - [c1]Beresford N. Parlett:
Necessary and sufficient conditions for convergence of the QR algorithm on Hessenberg matrix. ACM National Conference 1966: 13-19
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint