default search action
Christopher C. Paige
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j29]Christopher C. Paige
:
Analyzing Vector Orthogonalization Algorithms. SIAM J. Matrix Anal. Appl. 45(2): 829-846 (2024)
2010 – 2019
- 2019
- [j28]Christopher C. Paige
Accuracy of the Lanczos Process for the Eigenproblem and Solution of Equations. SIAM J. Matrix Anal. Appl. 40(4): 1371-1398 (2019) - 2018
- [c1]Christopher C. Paige
The Effects of Loss of Orthogonality on Large Scale Numerical Computations. ICCSA (3) 2018: 429-439 - 2016
- [j27]Chen Greif, Christopher C. Paige, David Titley-Péloquin, James M. Varah:
Numerical Equivalences among Krylov Subspace Algorithms for Skew-Symmetric Matrices. SIAM J. Matrix Anal. Appl. 37(3): 1071-1087 (2016) - 2014
- [j26]Christopher C. Paige, Wolfgang Wülling:
Properties of a Unitary Matrix Obtained from a Sequence of Normalized Vectors. SIAM J. Matrix Anal. Appl. 35(2): 526-545 (2014) - 2011
- [j25]Christopher C. Paige, Ivo Panayotov:
Hessenberg Matrix Properties and Ritz Vectors in the Finite-Precision Lanczos Tridiagonalization Process. SIAM J. Matrix Anal. Appl. 32(4): 1079-1094 (2011) - [j24]Sou-Cheng T. Choi, Christopher C. Paige, Michael A. Saunders
MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems. SIAM J. Sci. Comput. 33(4): 1810-1836 (2011) - 2010
- [j23]Christopher C. Paige:
An Augmented Stability Result for the Lanczos Hermitian Matrix Tridiagonalization Process. SIAM J. Matrix Anal. Appl. 31(5): 2347-2359 (2010) - [i1]Sou-Cheng T. Choi, Christopher C. Paige, Michael A. Saunders:
MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems. CoRR abs/1003.4042 (2010)
2000 – 2009
- 2009
- [j22]Christopher C. Paige:
A Useful Form of Unitary Matrix Obtained from Any Sequence of Unit 2-Norm n-Vectors. SIAM J. Matrix Anal. Appl. 31(2): 565-583 (2009) - [j21]Xiao-Wen Chang, Christopher C. Paige, David Titley-Péloquin:
Stopping Criteria for the Iterative Solution of Linear Least Squares Problems. SIAM J. Matrix Anal. Appl. 31(2): 831-852 (2009) - 2008
- [j20]Merico E. Argentati, Andrew V. Knyazev
Bounds on Changes in Ritz Values for a Perturbed Invariant Subspace of a Hermitian Matrix. SIAM J. Matrix Anal. Appl. 30(2): 548-559 (2008) - [j19]Xiao-Wen Chang, Gene H. Golub, Christopher C. Paige:
Towards A Backward Perturbation Analysis For Data Least Squares Problems. SIAM J. Matrix Anal. Appl. 30(4): 1281-1301 (2008) - [j18]Xiao-Wen Chang, Christopher C. Paige, David Titley-Péloquin:
Characterizing Matrices That Are Consistent with Given Solutions. SIAM J. Matrix Anal. Appl. 30(4): 1406-1420 (2008) - 2006
- [j17]Christopher C. Paige, Miroslav Rozlozník
Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES. SIAM J. Matrix Anal. Appl. 28(1): 264-284 (2006) - 2005
- [j16]Christopher C. Paige, Zdenek Strakos
Core Problems in Linear Algebraic Systems. SIAM J. Matrix Anal. Appl. 27(3): 861-875 (2005) - [j15]Xiao-Wen Chang, Christopher C. Paige, Christian C. J. M. Tiberius:
Computation of a Test Statistic in Data Quality Control. SIAM J. Sci. Comput. 26(6): 1916-1931 (2005) - 2003
- [j14]Pierre Montagnier, Christopher C. Paige, Raymond J. Spiteri
Real Floquet factors of linear time-periodic systems. Syst. Control. Lett. 50(4): 251-262 (2003) - [j13]Xiao-Wen Chang, Christopher C. Paige:
An Orthogonal Transformation Algorithm for GPS Positioning. SIAM J. Sci. Comput. 24(5): 1710-1732 (2003) - 2002
- [j12]Xiao-Wen Chang, Christopher C. Paige:
Numerical linear algebra in the integrity theory of the Global Positioning System. Comput. Stat. Data Anal. 41(1): 123-142 (2002) - [j11]Christopher C. Paige, Zdenek Strakos
Bounds for the least squares distance using scaled total least squares. Numerische Mathematik 91(1): 93-115 (2002) - [j10]Christopher C. Paige, Zdenek Strakos
Scaled total least squares fundamentals. Numerische Mathematik 91(1): 117-146 (2002) - [j9]Christopher C. Paige, Zdenek Strakos
Residual and Backward Error Bounds in Minimum Residual Krylov Subspace Methods. SIAM J. Sci. Comput. 23(6): 1898-1923 (2002) - 2001
- [j8]Xiao-Wen Chang, Christopher C. Paige:
Componentwise perturbation analyses for the QR factorization. Numerische Mathematik 88(2): 319-345 (2001)
1990 – 1999
- 1999
- [j7]Christopher C. Paige, Paul Van Dooren:
Sensitivity analysis of the Lanczos reduction. Numer. Linear Algebra Appl. 6(1): 29-50 (1999) - 1998
- [j6]Xiao-Wen Chang, Christopher C. Paige:
Perturbation Analyses for the Cholesky Downdating Problem. SIAM J. Matrix Anal. Appl. 19(2): 429-443 (1998) - 1997
- [j5]Xiao-Wen Chang, Christopher C. Paige, G. W. Stewart:
Perturbation Analyses for the QR Factorization. SIAM J. Matrix Anal. Appl. 18(3): 775-791 (1997) - 1993
- [j4]Joël M. Malard, Christopher C. Paige:
Data Replication in Dense Matrix Factorization. Parallel Process. Lett. 3: 419-430 (1993) - 1992
- [j3]Åke Björck, Christopher C. Paige:
Loss and Recapture of Orthogonality in the Modified Gram-Schmidt Algorithm. SIAM J. Matrix Anal. Appl. 13(1): 176-190 (1992)
1980 – 1989
- 1982
- [j2]Christopher C. Paige, Michael A. Saunders:
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares. ACM Trans. Math. Softw. 8(1): 43-71 (1982) - [j1]Christopher C. Paige, Michael A. Saunders:
Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems. ACM Trans. Math. Softw. 8(2): 195-209 (1982)
1970 – 1979
- 1971
- [b1]Christopher C. Paige:
The computation of eigenvalues and eigenvectors of very large sparse matrices. University of London, UK, 1971
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-05-19 00:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: