Jennifer A. Scott

Orcid: 0000-0003-2130-1091

Affiliations:
  • University of Reading, UK
  • Computational Science and Engineering Department, Rutherford Appleton Laboratory, Chilton, Oxfordshire, UK (former)


According to our database1, Jennifer A. Scott authored at least 66 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Approximating sparse Hessian matrices using large-scale linear least squares.
Numer. Algorithms, August, 2024

Avoiding Breakdown in Incomplete Factorizations in Low Precision Arithmetic.
ACM Trans. Math. Softw., June, 2024

A note on incomplete Cholesky factorizations in half precision arithmetic.
CoRR, 2024

2022
A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems.
ACM Trans. Math. Softw., 2022

A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations.
SIAM J. Sci. Comput., 2022

A null-space approach for large-scale symmetric saddle point systems with a small and non zero (2, 2) block.
Numer. Algorithms, 2022

2021
Strengths and Limitations of Stretching for Least-squares Problems with Some Dense Rows.
ACM Trans. Math. Softw., 2021

Two-Level Nyström-Schur Preconditioner for Sparse Symmetric Positive Definite Matrices.
SIAM J. Sci. Comput., 2021

Solving large linear least squares with linear equality constraints.
CoRR, 2021

On preconditioning the state formulation of incremental weak constraint 4D-Var.
CoRR, 2021

Randomised preconditioning for the forcing formulation of weak constraint 4D-Var.
CoRR, 2021

2020
Spectral estimates for saddle point matrices arising in weak constraint four-dimensional variational data assimilation.
Numer. Linear Algebra Appl., 2020

2019
Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems.
SIAM J. Sci. Comput., 2019

Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems.
Comput. Optim. Appl., 2019

2018
A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners.
SIAM J. Sci. Comput., 2018

A comparative study of null-space factorizations for sparse symmetric saddle point systems.
Numer. Linear Algebra Appl., 2018

Preordering saddle-point systems for sparse LDLT factorization without pivoting.
Numer. Linear Algebra Appl., 2018

A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows.
Numer. Algorithms, 2018

Using Jacobi iterations and blocking for solving sparse triangular systems in incomplete factorization preconditioning.
J. Parallel Distributed Comput., 2018

2017
Numerically Aware Orderings for Sparse Symmetric Indefinite Linear Systems.
ACM Trans. Math. Softw., 2017

The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems.
ACM Trans. Math. Softw., 2017

Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods.
SIAM J. Sci. Comput., 2017

On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems.
SIAM J. Sci. Comput., 2017

Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners.
Numer. Linear Algebra Appl., 2017

2016
A Sparse Symmetric Indefinite Direct Solver for GPU Architectures.
ACM Trans. Math. Softw., 2016

A Note on Performance Profiles for Benchmarking Software.
ACM Trans. Math. Softw., 2016

Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations.
SIAM J. Sci. Comput., 2016

2015
On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
Numer. Linear Algebra Appl., 2015

2014
HSL_MI28: An Efficient and Robust Limited-Memory Incomplete Cholesky Factorization Code.
ACM Trans. Math. Softw., 2014

On Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems.
SIAM J. Sci. Comput., 2014

On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization.
SIAM J. Sci. Comput., 2014

Compressed Threshold Pivoting for Sparse Symmetric Indefinite Systems.
SIAM J. Matrix Anal. Appl., 2014

Level-based heuristics and hill climbing for the antibandwidth maximization problem.
Numer. Linear Algebra Appl., 2014

Chebyshev acceleration of iterative refinement.
Numer. Algorithms, 2014

2013
Pivoting strategies for tough sparse indefinite systems.
ACM Trans. Math. Softw., 2013

Optimal Weighted Matchings for Rank-Deficient Sparse Matrices.
SIAM J. Matrix Anal. Appl., 2013

An efficient analyse phase for element problems.
Numer. Linear Algebra Appl., 2013

On the effects of scaling on the performance of Ipopt
CoRR, 2013

New Parallel Sparse Direct Solvers for Multicore Architectures.
Algorithms, 2013

2011
Partial factorization of a dense symmetric indefinite matrix.
ACM Trans. Math. Softw., 2011

2010
Scaling and pivoting in an out-of-core sparse direct solver.
ACM Trans. Math. Softw., 2010

A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems.
ACM Trans. Math. Softw., 2010

Design of a Multicore Sparse Cholesky Factorization Using DAGs.
SIAM J. Sci. Comput., 2010

A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows.
Numer. Linear Algebra Appl., 2010

2009
An out-of-core sparse Cholesky solver.
ACM Trans. Math. Softw., 2009

Algorithm 891: A fortran virtual memory system.
ACM Trans. Math. Softw., 2009

2007
Experiences of sparse direct symmetric solvers.
ACM Trans. Math. Softw., 2007

A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations.
ACM Trans. Math. Softw., 2007

2006
Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix.
SIAM J. Matrix Anal. Appl., 2006

The Design of a New Out-of-Core Multifrontal Solver.
Proceedings of the Applied Parallel Computing. State of the Art in Scientific Computing, 2006

2005
Stabilized bordered block diagonal forms for parallel sparse solvers.
Parallel Comput., 2005

Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers.
Numer. Linear Algebra Appl., 2005

2004
A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations.
ACM Trans. Math. Softw., 2004

A parallel direct solver for large sparse highly unsymmetric linear systems.
ACM Trans. Math. Softw., 2004

An Evaluation of Sparse Direct Symmetric Solvers: An Introduction and Preliminary Findings.
Proceedings of the Applied Parallel Computing, 2004

2003
Parallel frontal solvers for large sparse linear systems.
ACM Trans. Math. Softw., 2003

2002
Implementing Hager's exchange methods for matrix profile reduction.
ACM Trans. Math. Softw., 2002

2001
A Multilevel Algorithm for Wavefront Reduction.
SIAM J. Sci. Comput., 2001

Reversing the row order for the row-by-row frontal method.
Numer. Linear Algebra Appl., 2001

1999
A frontal code for the solution of sparse positive-definite symmetric systems arising from finite-element applications.
ACM Trans. Math. Softw., 1999

A new row ordering strategy for frontal solvers.
Numer. Linear Algebra Appl., 1999

1998
Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques.
SIAM J. Sci. Comput., 1998

1996
The Design of a New Frontal Code for Solving Sparse, Unsymmetric Systems.
ACM Trans. Math. Softw., 1996

Frontal Software for the Solution of Sparse Linear Equations.
Proceedings of the Applied Parallel Computing, 1996

1995
An Arnoldi Code for Computing Selected Eigenvalues of Sparse, Real, Unsymmetric Matrices.
ACM Trans. Math. Softw., 1995

1993
Computing Selected Eigenvalues of Sparse Unsymmetric Matrices Using Subspace Iteration.
ACM Trans. Math. Softw., 1993


  Loading...