Citation Impact
Citing Papers
SPOOLES: An Object-Oriented Sparse Matrix Library.
1999
Sparse matrix methods for chemical process separation calculations on supercomputers
1992
An overview of full-waveform inversion in exploration geophysics
2009 Standout
Velocity model building by 3D frequency-domain, full-waveform inversion of wide-aperture seismic data
2008
3D finite-difference frequency-domain modeling of visco-acoustic wave propagation using a massively parallel direct solver: A feasibility study
2007
Seismic imaging of complex onshore structures by 2D elastic frequency-domain full-waveform inversion
2009
cryoSPARC: algorithms for rapid unsupervised cryo-EM structure determination
2017 Standout
QM/MM Methods for Biomolecular Systems
2009 Standout
Effect of Immunosuppression on T-Helper 2 and B-Cell Responses to Influenza Vaccination
2015 StandoutNobel
SIMPLE: Software for ab initio reconstruction of heterogeneous single-particles
2012
The Environment of Childhood Poverty.
2004 Standout
A fast diffeomorphic image registration algorithm
2007 Standout
Efficient Estimation of Three-Dimensional Covariance and its Application in the Analysis of Heterogeneous Samples in Cryo-Electron Microscopy
2015 StandoutNobel
A variational eigenvalue solver on a photonic quantum processor
2014 Standout
Stan: A Probabilistic Programming Language
2017 Standout
Neuroscience, Molecular Biology, and the Childhood Roots of Health Disparities
2009 Standout
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
2005 Standout
Jacobian-free Newton–Krylov methods: a survey of approaches and applications
2003 Standout
Device Requirements for Optical Interconnects to Silicon Chips
2009 Standout
Efficient sparse LU factorization with partial pivoting on distributed memory architectures
1998
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
2007 Standout
Memory Management Issues in Sparse Multifrontal Methods On Multiprocessors
1993
Improved accuracy and acceleration of variational order-N
1998
A survey of sparse matrix research
1977
Efficient MATLAB Computations with Sparse and Factored Tensors
2007
Iterative algorithms for large sparse linear systems on parallel computers
1983
Using Krylov Methods in the Solution of Large-Scale Differential-Algebraic Systems
1994
Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse Matrix Ordering Methods
2001
Architecture of an RNA Polymerase II Transcription Pre-Initiation Complex
2013 StandoutScienceNobel
Iterative solution of linear systems in the 20th century
2000
Multifrontal parallel distributed symmetric and unsymmetric solvers
2000
Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
1980
A discrete Newton algorithm for minimizing a function of many variables
1982
The university of Florida sparse matrix collection
2011 Standout
Solution of Partial Differential Equations on Vector and Parallel Computers
1985
Geologic Evolution of the Himalayan-Tibetan Orogen
2000 Standout
Approximate Inverse Preconditioners via Sparse-Sparse Iterations
1998
FWT2D: A massively parallel program for frequency-domain full-waveform tomography of wide-aperture seismic data—Part 1
2008
Inertia-Controlling Methods for General Quadratic Programming
1991
Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
1983
Multiple centrality corrections in a primal-dual method for linear programming
1996
Diagonal Markowitz Scheme with Local Symmetrization
2007
CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
1985
Parallel Algorithms for Sparse Linear Systems
1991
The dynamo library for molecular simulations using hybrid quantum mechanical and molecular mechanical potentials
2000
Atomic Decomposition by Basis Pursuit
2001 Standout
Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
1984
Interior methods for constrained optimization
1992
On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
2001
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
2002 Standout
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
2005 Standout
Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
1987
Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
2005
A combined unifrontal/multifrontal method for unsymmetric sparse matrices
1999
An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
1985
Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy
1991
A simplex algorithm for piecewise-linear programming III: Computational analysis and applications
1992
Time dependent Thomas Fermi approach to atomic collisions I.
1981
Performance Evaluation of the Cray X1 Distributed Shared-Memory Architecture
2005
Sparse Jacobian updates in the collocation method for optimal control problems
1990
Design of New Materials for Methane Storage
2004 StandoutNobel
Advances, Applications and Performance of the Global Arrays Shared Memory Programming Toolkit
2006
The Last Glacial Maximum
2009 StandoutScience
An iterative solution method for linear systems of which the coefficient matrix is a symmetric 𝑀-matrix
1977
Vectorization of a Multiprocessor Multifrontal Code
1989
On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization
1998
Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices
2002
A column approximate minimum degree ordering algorithm
2004
A New SQP Algorithm for Large-Scale Nonlinear Programming
2001
3-D velocity images beneath the Chinese continent and adjacent regions
1990
An Approximate Minimum Degree Ordering Algorithm
1996
Eigenvalue computation in the 20th century
2000
On Algorithms for Obtaining a Maximum Transversal
1981
Large-scale linearly constrained optimization
1978
Application of sparse nonlinear programming to trajectory optimization
1992
Solution of burner-stabilized premixed laminar flames by boundary value methods
1982
SUNDIALS
2005 Standout
An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
1997
A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
1983
Domain decomposition methods for the parallel computation of reacting flows
1989
Interior Methods for Nonlinear Optimization
2002
Benchmarking optimization software with performance profiles
2002 Standout
Density-Functional Theory for Time-Dependent Systems
1984 Standout
Maintaining LU factors of a general sparse matrix
1987
Improving the Run Time and Quality of Nested Dissection Ordering
1998
Numerical solution of saddle point problems
2005 Standout
Survey of Numerical Methods for Trajectory Optimization
1998 Standout
Numerical experiments with the LANCELOT package (release A) for large-scale nonlinear optimization
1996
Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
1989
Preconditioning Techniques for Large Linear Systems: A Survey
2002
Computing the block triangular form of a sparse matrix
1990
Some numerical results using a sparse matrix updating formula in unconstrained optimization
1978
Gmsh: A 3‐D finite element mesh generator with built‐in pre‐ and post‐processing facilities
2009 Standout
Dynamic mode decomposition of numerical and experimental data
2010 Standout
FLASH: An Adaptive Mesh Hydrodynamics Code for Modeling Astrophysical Thermonuclear Flashes
2000 Standout
NWChem: A comprehensive and scalable open-source solution for large scale molecular simulations
2010 Standout
The Interface Probing Technique in Domain Decomposition
1992
A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
2004
Sparse Matrix Methods in Optimization
1984
A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
1989
A new look at the Lanczos algorithm for solving symmetric systems of linear equations
1980
Violations of Local Realism by Two EntangledN
2000 StandoutNobel
Solving staircase linear programs by the simplex method, 1: Inversion
1982
Object-oriented Programming Paradigms for Molecular Modeling
2003
Krylov subspace iteration
2000
Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learning
2018 Standout
Approximation Theory and Methods.
1982
A Supernodal Approach to Sparse Partial Pivoting
1999 Standout
Lanczos-type solvers for nonsymmetric linear systems of equations
1997
A Parallel Solution Method for Large Sparse Systems of Equations
1987
Staircase Matrices and Systems
1984
Pivot selection and row ordering in givens reduction on sparse matrices
1974
Large-Scale Direct Optimal Control Applied to a Re-Entry Problem
1998
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
2004
Iterative Methods for Sparse Linear Systems
2003 Standout
Integration of Nuclear Reaction Networks for Stellar Hydrodynamics
1999
The Role of Elimination Trees in Sparse Factorization
1990
The translation elongation cycle—capturing multiple states by cryo-electron microscopy
2017 StandoutNobel
Atomic Decomposition by Basis Pursuit
1998 Standout
Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
1993
The Glimmer community ice sheet model
2009
Multifrontal vs frontal techniques for chemical process simulation on supercomputers
1996
The SIESTA method forab initioorder-Nmaterials simulation
2002 Standout
Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions
2005 Standout
A tutorial on spectral clustering
2007 Standout
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
1986 Standout
A parallel linear system solver for circuit simulation problems
2000
Rational Krylov sequence methods for eigenvalue computation
1984
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
2001 Standout
Highly scalable parallel algorithms for sparse matrix factorization
1997
Block-iterative frequency-domain methods for Maxwell's equations in a planewave basis
2001 Standout
Nonlinearly Preconditioned Krylov Subspace Methods for Discrete Newton Algorithms
1984
Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
1979
A set of level 3 basic linear algebra subprograms
1990 Standout
A spectral algorithm for envelope reduction of sparse matrices
1995
On the limited memory BFGS method for large scale optimization
1989 Standout
The influence of relaxed supernode partitions on the multifrontal method
1989
Modification of the minimum-degree algorithm by multiple elimination
1985
MODULES FOR EXPERIMENTS IN STELLAR ASTROPHYSICS (MESA): PLANETS, OSCILLATIONS, ROTATION, AND MASSIVE STARS
2013 Standout
Iterative solution of linear systems
1992
Sparse Matrices in MATLAB: Design and Implementation
1992
Sparse Cholesky Factorization on a Local-Memory Multiprocessor
1988
A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
1982
Li Intercalation into Graphite: Direct Optical Imaging and Cahn–Hilliard Reaction Dynamics
2016 StandoutNobel
Tensor Decompositions and Applications
2009 Standout
An Explicit Link between Gaussian Fields and Gaussian Markov Random Fields: The Stochastic Partial Differential Equation Approach
2011 Standout
Iterative Methods for the Solution of Elliptic Problems on Regions Partitioned into Substructures
1986
FWT2D: A massively parallel program for frequency-domain full-waveform tomography of wide-aperture seismic data—Part 2
2008
Trajectory optimization on a parallel processor
1991
A parallel hybrid sparse linear system solver
1990
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
1999
Predicting Structure in Sparse Matrix Computations
1994
Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
1988
A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
1998
Works of John Reid being referenced
Fortran 90/95 explained (2nd ed.)
1999
MA47, a Fortran code for direct solution of indefinite sparse symmetric linear systems
1995
On applying Householder transformations to linear least squares problems.
1968
A Note on the Least Squares Solution of a Band System of Linear Equations by Householder Reductions
1967
Sparsity structure and Gaussian elimination
1988
The Factorization of Sparse Symmetric Indefinite Matrices
1991
New crash procedures for large systems of linear constraints
1989
A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
1976
Fortran 90 Explained
1996
John Reid Reports
1989
Experience of sparse matrix codes on the CRAY-1
1982
Co-arrays in the next Fortran Standard
2005
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
1983
Co‐arrays in the Next Fortran Standard
2007
On the Reduction of Sparse Matrices to Condensed Forms by Similarity Transformations
1975
Co-array Fortran for parallel programming
1998
A Note on the Work Involved in No-fill Sparse Matrix Factorization
1983
Direct Methods for Sparse Matrices.
1989
Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems
1996
A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination
1974
Some Design Features of a Sparse Matrix Code
1979
On the Estimation of Sparse Jacobian Matrices
1974
A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
1982
A Note on the Stability of Gaussian Elimination
1971
On George’s Nested Dissection Method
1976
The Use of Conjugate Gradients for Systems of Linear Equations Possessing “Property A”
1972
An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
1978
Solving Large Full Sets of Linear Equations in a Paged Virtual Store
1981
On the Automatic Scaling of Matrices for Gaussian Elimination
1972
The Multifrontal Solution of Unsymmetric Sets of Linear Equations
1984
A practicable steepest-edge simplex algorithm
1977
Tracking the Progress of the Lanczos Algorithm for Large Symmetric Eigenproblems
1981
The design of MA48
1996
Monitoring the stability of the triangular factorization of a sparse matrix
1974
The advantages of Fortran 90
1992
Direct Solution of Sets of Linear Equations whose Matrix is Sparse, Symmetric and Indefinite
1979
Large Sparse Sets of Linear Equations
1973