default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJennifer A. Scott
Person information
- affiliation: University of Reading, UK
- affiliation (former): Computational Science and Engineering Department, Rutherford Appleton Laboratory, Chilton, Oxfordshire, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j58]Jaroslav M. Fowkes
, Nicholas I. M. Gould, Jennifer A. Scott:
Approximating sparse Hessian matrices using large-scale linear least squares. Numer. Algorithms 96(4): 1675-1698 (2024)- [j57]Jennifer A. Scott, Miroslav Tuma:
Avoiding Breakdown in Incomplete Factorizations in Low Precision Arithmetic. ACM Trans. Math. Softw. 50(2): 9:1-9:25 (2024) - [i10]Jennifer A. Scott, Miroslav Tuma:
Avoiding breakdown in incomplete factorizations in low precision arithmetic. CoRR abs/2401.17957 (2024) - [i9]Jennifer A. Scott, Miroslav Tuma:
A note on incomplete Cholesky factorizations in half precision arithmetic. CoRR abs/2403.13123 (2024) - 2022
- [j56]Jennifer A. Scott, Miroslav Tuma:
A null-space approach for large-scale symmetric saddle point systems with a small and non zero (2, 2) block. Numer. Algorithms 90(4): 1639-1667 (2022) - [j55]Hussam Al Daas, Pierre Jolivet, Jennifer A. Scott:
A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations. SIAM J. Sci. Comput. 44(3): 1047- (2022) - [j54]Jennifer A. Scott, Miroslav Tuma:
A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems. ACM Trans. Math. Softw. 48(1): 5:1-5:24 (2022) - 2021
- [j53]Hussam Al Daas, Tyrone Rees, Jennifer A. Scott:
Two-Level Nyström-Schur Preconditioner for Sparse Symmetric Positive Definite Matrices. SIAM J. Sci. Comput. 43(6): A3837-A3861 (2021) - [j52]Jennifer A. Scott, Miroslav Tuma:
Strengths and Limitations of Stretching for Least-squares Problems with Some Dense Rows. ACM Trans. Math. Softw. 47(1): 1:1-1:25 (2021) - [i8]Ieva Dauzickaite, Amos S. Lawless, Jennifer A. Scott, Peter Jan van Leeuwen:
Randomised preconditioning for the forcing formulation of weak constraint 4D-Var. CoRR abs/2101.07249 (2021) - [i7]Hussam Al Daas, Tyrone Rees, Jennifer A. Scott:
Two-level Nyström-Schur preconditioner for sparse symmetric positive definite matrices. CoRR abs/2101.12164 (2021) - [i6]Ieva Dauzickaite, Amos S. Lawless, Jennifer A. Scott, Peter Jan van Leeuwen:
On preconditioning the state formulation of incremental weak constraint 4D-Var. CoRR abs/2105.09802 (2021) - [i5]Jennifer A. Scott, Miroslav Tuma:
Solving large linear least squares with linear equality constraints. CoRR abs/2106.13142 (2021) - [i4]Hussam Al Daas, Pierre Jolivet, Jennifer A. Scott:
A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations. CoRR abs/2107.09006 (2021) - 2020
- [j51]Ieva Dauzickaite, Amos S. Lawless, Jennifer A. Scott, Peter Jan van Leeuwen:
Spectral estimates for saddle point matrices arising in weak constraint four-dimensional variational data assimilation. Numer. Linear Algebra Appl. 27(5) (2020)
2010 – 2019
- 2019
- [j50]Nicholas I. M. Gould, Tyrone Rees, Jennifer A. Scott:
Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems. Comput. Optim. Appl. 73(1): 1-35 (2019) - [j49]Jennifer A. Scott, Miroslav Tuma:
Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems. SIAM J. Sci. Comput. 41(3): A1604-A1625 (2019) - [i3]Ieva Dauzickaite, Amos S. Lawless, Jennifer A. Scott, Peter Jan van Leeuwen:
Spectral estimates for saddle point matrices arising in weak constraint four-dimensional variational data assimilation. CoRR abs/1908.07949 (2019) - 2018
- [j48]Edmond Chow, Hartwig Anzt, Jennifer A. Scott, Jack J. Dongarra:
Using Jacobi iterations and blocking for solving sparse triangular systems in incomplete factorization preconditioning. J. Parallel Distributed Comput. 119: 219-230 (2018) - [j47]Jennifer A. Scott, Miroslav Tuma:
A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows. Numer. Algorithms 79(4): 1147-1168 (2018) - [j46]Tyrone Rees, Jennifer A. Scott:
A comparative study of null-space factorizations for sparse symmetric saddle point systems. Numer. Linear Algebra Appl. 25(1) (2018) - [j45]Sangye Lungten, Wil H. A. Schilders, Jennifer A. Scott:
Preordering saddle-point systems for sparse LDLT factorization without pivoting. Numer. Linear Algebra Appl. 25(5) (2018) - [j44]James L. Hook, Jennifer A. Scott, Françoise Tisseur, Jonathan D. Hogg:
A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners. SIAM J. Sci. Comput. 40(4): A1987-A2004 (2018) - 2017
- [j43]Jennifer A. Scott, Miroslav Tuma:
Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners. Numer. Linear Algebra Appl. 24(5) (2017) - [j42]Jennifer A. Scott:
On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems. SIAM J. Sci. Comput. 39(4) (2017) - [j41]Jennifer A. Scott, Miroslav Tuma:
Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods. SIAM J. Sci. Comput. 39(6) (2017) - [j40]Nicholas I. M. Gould, Jennifer A. Scott:
The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems. ACM Trans. Math. Softw. 43(4): 36:1-36:35 (2017) - [j39]Jonathan D. Hogg, Jennifer A. Scott, Sue Thorne:
Numerically Aware Orderings for Sparse Symmetric Indefinite Linear Systems. ACM Trans. Math. Softw. 44(2): 13:1-13:22 (2017) - 2016
- [j38]Jennifer A. Scott, Miroslav Tuma:
Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations. SIAM J. Sci. Comput. 38(6) (2016) - [j37]Jonathan D. Hogg, Evgueni E. Ovtchinnikov, Jennifer A. Scott:
A Sparse Symmetric Indefinite Direct Solver for GPU Architectures. ACM Trans. Math. Softw. 42(1): 1:1-1:25 (2016) - [j36]Nicholas I. M. Gould, Jennifer A. Scott:
A Note on Performance Profiles for Benchmarking Software. ACM Trans. Math. Softw. 43(2): 15:1-15:5 (2016) - 2015
- [j35]Jonathan D. Hogg, Jennifer A. Scott:
On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices. Numer. Linear Algebra Appl. 22(4): 648-663 (2015) - 2014
- [j34]Mario Arioli, Jennifer A. Scott:
Chebyshev acceleration of iterative refinement. Numer. Algorithms 66(3): 591-608 (2014) - [j33]Jennifer A. Scott, Yifan Hu:
Level-based heuristics and hill climbing for the antibandwidth maximization problem. Numer. Linear Algebra Appl. 21(1): 51-67 (2014) - [j32]Jonathan D. Hogg, Jennifer A. Scott:
Compressed Threshold Pivoting for Sparse Symmetric Indefinite Systems. SIAM J. Matrix Anal. Appl. 35(2): 783-817 (2014) - [j31]Jennifer A. Scott, Miroslav Tuma:
On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization. SIAM J. Sci. Comput. 36(2) (2014) - [j30]Jennifer A. Scott, Miroslav Tuma:
On Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems. SIAM J. Sci. Comput. 36(6) (2014) - [j29]Jennifer A. Scott, Miroslav Tuma:
HSL_MI28: An Efficient and Robust Limited-Memory Incomplete Cholesky Factorization Code. ACM Trans. Math. Softw. 40(4): 24:1-24:19 (2014) - 2013
- [j28]Jonathan D. Hogg, Jennifer A. Scott:
New Parallel Sparse Direct Solvers for Multicore Architectures. Algorithms 6(4): 702-725 (2013) - [j27]Jonathan D. Hogg, Jennifer A. Scott:
An efficient analyse phase for element problems. Numer. Linear Algebra Appl. 20(3): 397-412 (2013) - [j26]Jonathan D. Hogg, Jennifer A. Scott:
Optimal Weighted Matchings for Rank-Deficient Sparse Matrices. SIAM J. Matrix Anal. Appl. 34(4): 1431-1447 (2013) - [j25]Jonathan D. Hogg, Jennifer A. Scott:
Pivoting strategies for tough sparse indefinite systems. ACM Trans. Math. Softw. 40(1): 4:1-4:19 (2013) - [i2]Jonathan D. Hogg, Jennifer A. Scott:
On the effects of scaling on the performance of Ipopt. CoRR abs/1301.7283 (2013) - [i1]Jonathan D. Hogg, Jennifer A. Scott:
Compressed threshold pivoting for sparse symmetric indefinite systems. CoRR abs/1305.2353 (2013) - 2011
- [j24]John K. Reid, Jennifer A. Scott:
Partial factorization of a dense symmetric indefinite matrix. ACM Trans. Math. Softw. 38(2): 10:1-10:19 (2011) - 2010
- [j23]H. Sue Dollar, Jennifer A. Scott:
A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows. Numer. Linear Algebra Appl. 17(1): 43-55 (2010) - [j22]Jonathan D. Hogg, John K. Reid, Jennifer A. Scott:
Design of a Multicore Sparse Cholesky Factorization Using DAGs. SIAM J. Sci. Comput. 32(6): 3627-3649 (2010) - [j21]Jonathan D. Hogg, Jennifer A. Scott:
A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems. ACM Trans. Math. Softw. 37(2): 17:1-17:24 (2010) - [j20]Jennifer A. Scott:
Scaling and pivoting in an out-of-core sparse direct solver. ACM Trans. Math. Softw. 37(2): 19:1-19:23 (2010)
2000 – 2009
- 2009
- [j19]John K. Reid, Jennifer A. Scott:
Algorithm 891: A fortran virtual memory system. ACM Trans. Math. Softw. 36(1): 5:1-5:12 (2009) - [j18]John K. Reid, Jennifer A. Scott:
An out-of-core sparse Cholesky solver. ACM Trans. Math. Softw. 36(2): 9:1-9:33 (2009) - 2007
- [j17]Nicholas I. M. Gould, Jennifer A. Scott, Yifan Hu:
A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations. ACM Trans. Math. Softw. 33(2): 10 (2007) - [j16]Jennifer A. Scott, Yifan Hu:
Experiences of sparse direct symmetric solvers. ACM Trans. Math. Softw. 33(3): 18 (2007) - 2006
- [j15]John K. Reid, Jennifer A. Scott:
Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix. SIAM J. Matrix Anal. Appl. 28(3): 805-821 (2006) - [c3]John K. Reid, Jennifer A. Scott:
The Design of a New Out-of-Core Multifrontal Solver. PARA 2006: 598-607 - 2005
- [j14]Yifan Hu, Jennifer A. Scott:
Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers. Numer. Linear Algebra Appl. 12(9): 877-894 (2005) - [j13]Iain S. Duff, Jennifer A. Scott:
Stabilized bordered block diagonal forms for parallel sparse solvers. Parallel Comput. 31(3-4): 275-289 (2005) - 2004
- [j12]Iain S. Duff, Jennifer A. Scott:
A parallel direct solver for large sparse highly unsymmetric linear systems. ACM Trans. Math. Softw. 30(2): 95-117 (2004) - [j11]Nicholas I. M. Gould, Jennifer A. Scott:
A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations. ACM Trans. Math. Softw. 30(3): 300-325 (2004) - [c2]Jennifer A. Scott, Yifan Hu, Nicholas I. M. Gould:
An Evaluation of Sparse Direct Symmetric Solvers: An Introduction and Preliminary Findings. PARA 2004: 818-827 - 2003
- [j10]Jennifer A. Scott:
Parallel frontal solvers for large sparse linear systems. ACM Trans. Math. Softw. 29(4): 395-417 (2003) - 2002
- [j9]John K. Reid, Jennifer A. Scott:
Implementing Hager's exchange methods for matrix profile reduction. ACM Trans. Math. Softw. 28(4): 377-391 (2002) - 2001
- [j8]John K. Reid, Jennifer A. Scott:
Reversing the row order for the row-by-row frontal method. Numer. Linear Algebra Appl. 8(1): 1-6 (2001) - [j7]Yifan Hu, Jennifer A. Scott:
A Multilevel Algorithm for Wavefront Reduction. SIAM J. Sci. Comput. 23(4): 1352-1375 (2001)
1990 – 1999
- 1999
- [j6]Jennifer A. Scott:
A new row ordering strategy for frontal solvers. Numer. Linear Algebra Appl. 6(3): 189-211 (1999) - [j5]Iain S. Duff, Jennifer A. Scott:
A frontal code for the solution of sparse positive-definite symmetric systems arising from finite-element applications. ACM Trans. Math. Softw. 25(4): 404-424 (1999) - 1998
- [j4]Nicholas I. M. Gould, Jennifer A. Scott:
Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques. SIAM J. Sci. Comput. 19(2): 605-625 (1998) - 1996
- [j3]Iain S. Duff, Jennifer A. Scott:
The Design of a New Frontal Code for Solving Sparse, Unsymmetric Systems. ACM Trans. Math. Softw. 22(1): 30-45 (1996) - [c1]Iain S. Duff, Jennifer A. Scott:
Frontal Software for the Solution of Sparse Linear Equations. PARA 1996: 227-238 - 1995
- [j2]Jennifer A. Scott:
An Arnoldi Code for Computing Selected Eigenvalues of Sparse, Real, Unsymmetric Matrices. ACM Trans. Math. Softw. 21(4): 432-475 (1995) - 1993
- [j1]Iain S. Duff, Jennifer A. Scott:
Computing Selected Eigenvalues of Sparse Unsymmetric Matrices Using Subspace Iteration. ACM Trans. Math. Softw. 19(2): 137-159 (1993)
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-10-04 20:00 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:
