On the public citation graph

Fast Sparse Cholesky Decomposition and Inversion using Nested Dissection Matrix Reordering

0 signed · 118 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/ange.200460336openalex-snapshot
Ab Initio NMR Spectra for Molecular Systems with a Thousand and More Atoms: A Linear‐Scaling Method
inferredcites →https://doi.org/10.1002/anie.200460336openalex-snapshot
Ab Initio NMR Spectra for Molecular Systems with a Thousand and More Atoms: A Linear‐Scaling Method
inferredcites →https://doi.org/10.1002/jcc.20862openalex-snapshot
Linear‐scaling Cholesky decomposition
inferredcites →https://doi.org/10.1002/qua.560120408openalex-snapshot
Simplifications in the generation and transformation of two‐electron integrals in molecular calculations
inferredcites →https://doi.org/10.1002/qua.560360602openalex-snapshot
Application of cholesky‐like matrix decomposition methods to the evaluation of atomic orbital integrals and integral derivatives
inferredcites →https://doi.org/10.1002/wics.18openalex-snapshot
Cholesky factorization
inferredcites →https://doi.org/10.1007/11558958_98openalex-snapshot
An Evaluation of Sparse Direct Symmetric Solvers: An Introduction and Preliminary Findings
inferredcites →https://doi.org/10.1007/978-1-4613-8369-7_6openalex-snapshot
Predicting Structure in Nonsymmetric Sparse Matrix Factorizations
inferredcites →https://doi.org/10.1007/bf01389453openalex-snapshot
An algorithm to compute a sparse basis of the null space
inferredcites →https://doi.org/10.1007/bf01407861openalex-snapshot
Task scheduling for parallel sparse Cholesky factorization
inferredcites →https://doi.org/10.1007/bf01459088openalex-snapshot
Zum Hilbertschen Aufbau der reellen Zahlen
inferredcites →https://doi.org/10.1007/bf01933580openalex-snapshot
A linear time implementation of the reverse Cuthill-McKee algorithm
inferredcites →https://doi.org/10.1016/0009-2614(86)80099-9openalex-snapshot
On the Beebe-Linderberg two-electron integral approximation
inferredcites →https://doi.org/10.1016/0021-9991(77)90005-5openalex-snapshot
Computation of cubic harmonics
inferredcites →https://doi.org/10.1016/0021-9991(78)90048-7openalex-snapshot
On the Householder-Fox algorithm for decomposing a projection
inferredcites →https://doi.org/10.1016/0024-3795(86)90115-1openalex-snapshot
Rank and null space calculations using matrix decomposition without column interchanges
inferredcites →https://doi.org/10.1016/0167-8191(88)90039-7openalex-snapshot
A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
inferredcites →https://doi.org/10.1016/0167-8191(89)90064-1openalex-snapshot
Reordering sparse matrices for parallel elimination
inferredcites →https://doi.org/10.1016/0167-8191(90)90054-dopenalex-snapshot
Parallel nested dissection
inferredcites →https://doi.org/10.1016/0377-0427(87)90199-3openalex-snapshot
Detection of near-singularity in Cholesky and LDLT factorizations
inferredcites →https://doi.org/10.1016/c2013-0-08305-3openalex-snapshot
Computer Organization and Design
inferredcites →https://doi.org/10.1016/j.cplett.2007.10.087openalex-snapshot
Quartic scaling evaluation of canonical scaled opposite spin second-order Møller–Plesset correlation energy using Cholesky decompositions
inferredcites →https://doi.org/10.1016/j.future.2003.07.011openalex-snapshot
Solving unsymmetric sparse systems of linear equations with PARDISO
inferredcites →https://doi.org/10.1016/j.ins.2007.02.002openalex-snapshot
Constructing a minimum height elimination tree of a tree in linear time
inferredcites →https://doi.org/10.1016/j.laa.2007.11.025openalex-snapshot
Block computation and representation of a sparse nullspace basis of a rectangular matrix
inferredcites →https://doi.org/10.1016/j.theochem.2003.08.010openalex-snapshot
Geometry optimization methods for modeling large molecules
inferredcites →https://doi.org/10.1016/s0009-2614(00)00814-9openalex-snapshot
Direct optimization of the AO density matrix in Hartree–Fock and Kohn–Sham theories
inferredcites →https://doi.org/10.1016/s0009-2614(97)00402-8openalex-snapshot
A reformulation of the coupled perturbed self-consistent field equations entirely within a local atomic orbital density matrix-based scheme
inferredcites →https://doi.org/10.1017/s0305004100030401openalex-snapshot
A generalized inverse for matrices
inferredcites →https://doi.org/10.1017/s0956796897002803openalex-snapshot
FUNCTIONAL PEARL On building trees with minimum height
inferredcites →https://doi.org/10.1021/ct1002225openalex-snapshot
Auxiliary Density Matrix Methods for Hartree−Fock Exchange Calculations
inferredcites →https://doi.org/10.1021/ct700263hopenalex-snapshot
Cholesky Decomposition-Based Multiconfiguration Second-Order Perturbation Theory (CD-CASPT2): Application to the Spin-State Energetics of CoIII(diiminato)(NPh)
inferredcites →https://doi.org/10.1021/jp990629sopenalex-snapshot
Linear Scaling Density Functional Calculations with Gaussian Orbitals
inferredcites →https://doi.org/10.1039/b517914aopenalex-snapshot
Advances in methods and algorithms in a modern quantum chemistry program package
inferredcites →https://doi.org/10.1063/1.1415083openalex-snapshot
Direct optimization of the atomic-orbital density matrix using the conjugate-gradient method with a multilevel preconditioner
inferredcites →https://doi.org/10.1063/1.1558476openalex-snapshot
Curvy steps for density matrix-based energy minimization: Application to large-scale self-consistent-field calculations
inferredcites →https://doi.org/10.1063/1.1578621openalex-snapshot
Reduced scaling in electronic structure calculations using Cholesky decompositions
inferredcites →https://doi.org/10.1063/1.1729870openalex-snapshot
An exact reformulation of the diagonalization step in electronic structure calculations as a set of second order nonlinear equations
inferredcites →https://doi.org/10.1063/1.1809602openalex-snapshot
Scaled opposite-spin second order Møller–Plesset correlation energy: An economical electronic structure method
inferredcites →https://doi.org/10.1063/1.2360264openalex-snapshot
Fast noniterative orbital localization for large molecules
inferredcites →https://doi.org/10.1063/1.2709881openalex-snapshot
Linear-scaling symmetric square-root decomposition of the overlap matrix
inferredcites →https://doi.org/10.1063/1.2736701openalex-snapshot
Low-cost evaluation of the exchange Fock matrix from Cholesky and density fitting representations of the electron repulsion integrals
inferredcites →https://doi.org/10.1063/1.2749509openalex-snapshot
Linear-scaling method for calculating nuclear magnetic resonance chemical shifts using gauge-including atomic orbitals within Hartree-Fock and density-functional theory
inferredcites →https://doi.org/10.1063/1.2777146openalex-snapshot
Unbiased auxiliary basis sets for accurate two-electron integral approximations
inferredcites →https://doi.org/10.1063/1.2794033openalex-snapshot
A density matrix-based method for the linear-scaling calculation of dynamic second- and third-order properties at the Hartree-Fock and Kohn-Sham density functional theory levels
inferredcites →https://doi.org/10.1063/1.2925269openalex-snapshot
Cholesky decomposition of the two-electron integral matrix in electronic structure calculations
inferredcites →https://doi.org/10.1063/1.2955755openalex-snapshot
Analytic derivatives for the Cholesky representation of the two-electron integrals
inferredcites →https://doi.org/10.1063/1.2988315openalex-snapshot
Method specific Cholesky decomposition: Coulomb and exchange energies
inferredcites →https://doi.org/10.1063/1.3116103openalex-snapshot
Approximated electron repulsion integrals: Cholesky decomposition versus resolution of the identity methods
inferredcites →https://doi.org/10.1063/1.3116784openalex-snapshot
Atomic Cholesky decompositions: A route to unbiased auxiliary basis sets for density fitting approximation with tunable accuracy and efficiency
inferredcites →https://doi.org/10.1063/1.3142592openalex-snapshot
Cholesky-decomposed densities in Laplace-based second-order Møller–Plesset perturbation theory
inferredcites →https://doi.org/10.1063/1.3315419openalex-snapshot
Cholesky decomposition within local multireference singles and doubles configuration interaction
inferredcites →https://doi.org/10.1063/1.473579openalex-snapshot
Linear scaling conjugate gradient density matrix search as an alternative to diagonalization for first principles electronic structure calculations
inferredcites →https://doi.org/10.1063/1.474404openalex-snapshot
Semiempirical methods with conjugate gradient density matrix search to replace diagonalization for molecular systems containing thousands of atoms
inferredcites →https://doi.org/10.1063/1.475423openalex-snapshot
A tensor formulation of many-electron theory in a nonorthogonal single-particle basis
inferredcites →https://doi.org/10.1063/1.476927openalex-snapshot
Comparison of conjugate gradient density matrix search and Chebyshev expansion methods for avoiding diagonalization in large-scale electronic structure calculations
inferredcites →https://doi.org/10.1063/1.477969openalex-snapshot
A simplified density matrix minimization for linear scaling self-consistent field theory
inferredcites →https://doi.org/10.1063/1.478008openalex-snapshot
What is the best alternative to diagonalization of the Hamiltonian in large scale semiempirical calculations?
inferredcites →https://doi.org/10.1080/00268970210158722openalex-snapshot
Curvy steps for density matrix based energy minimization: tensor formulation and toy applications
inferredcites →https://doi.org/10.1103/physrevb.47.10891openalex-snapshot
Density-matrix electronic-structure method with linear system-size scaling
inferredcites →https://doi.org/10.1103/physrevb.50.17611openalex-snapshot
Generalization of the density-matrix method to a nonorthogonal basis
inferredcites →https://doi.org/10.1109/proc.1967.6011openalex-snapshot
Direct solutions of sparse network equations by optimally ordered triangular factorization
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0209044openalex-snapshot
An Optimal Agorithm for Symbolic Factorization of Symmetric Matrices
inferredcites →https://doi.org/10.1137/0213035openalex-snapshot
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
inferredcites →https://doi.org/10.1137/050638369openalex-snapshot
On the Computation of Null Spaces of Sparse Rectangular Matrices
inferredcites →https://doi.org/10.1137/0602010openalex-snapshot
Computing the Minimum Fill-In is NP-Complete
inferredcites →https://doi.org/10.1137/0611010openalex-snapshot
The Role of Elimination Trees in Sparse Factorization
inferredcites →https://doi.org/10.1137/0613078openalex-snapshot
Rank Detection Methods for Sparse Matrices
inferredcites →https://doi.org/10.1137/0614019openalex-snapshot
On Finding Supernodes for Sparse Matrix Computations
inferredcites →https://doi.org/10.1137/0702016openalex-snapshot
Calculating the Singular Values and Pseudo-Inverse of a Matrix
inferredcites →https://doi.org/10.1137/0710032openalex-snapshot
Nested Dissection of a Regular Finite Element Mesh
inferredcites →https://doi.org/10.1137/0713009openalex-snapshot
Generalizing the Singular Value Decomposition
inferredcites →https://doi.org/10.1137/0909029openalex-snapshot
Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
inferredcites →https://doi.org/10.1137/0910070openalex-snapshot
A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
inferredcites →https://doi.org/10.1137/0914048openalex-snapshot
A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
inferredcites →https://doi.org/10.1137/0915009openalex-snapshot
Stability of the Partitioned Inverse Method for Parallel Solution of Sparse Triangular Systems
inferredcites →https://doi.org/10.1137/1031001openalex-snapshot
The Evolution of the Minimum Degree Ordering Algorithm
inferredcites →https://doi.org/10.1137/s0895479800381331openalex-snapshot
On Positive Semidefinite Matrices with Known Null Space
inferredcites →https://doi.org/10.1137/s0895479887139455openalex-snapshot
Predicting Structure in Sparse Matrix Computations
inferredcites →https://doi.org/10.1137/s0895479892236921openalex-snapshot
An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization
inferredcites →https://doi.org/10.1137/s0895479894278952openalex-snapshot
An Approximate Minimum Degree Ordering Algorithm
inferredcites →https://doi.org/10.1137/s0895479897325578openalex-snapshot
Computing the SVD of a General Matrix Product/Quotient
inferredcites →https://doi.org/10.1137/s1064827595287997openalex-snapshot
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
inferredcites →https://doi.org/10.1137/s1064827598339372openalex-snapshot
Orderings for Factorized Sparse Approximate Inverse Preconditioners
inferredcites →https://doi.org/10.1145/103418.103458openalex-snapshot
Wait-free parallel algorithms for the union-find problem
inferredcites →https://doi.org/10.1145/1356052.1356053openalex-snapshot
Anatomy of high-performance matrix multiplication
inferredcites →https://doi.org/10.1145/1377603.1377607openalex-snapshot
High-performance implementation of the level-3 BLAS
inferredcites →https://doi.org/10.1145/1391989.1391995openalex-snapshot
Algorithm 887
inferredcites →https://doi.org/10.1145/140901.141912openalex-snapshot
Space and time efficient implementations of parallel nested dissection
inferredcites →https://doi.org/10.1145/1462173.1462176openalex-snapshot
Dynamic Supernodes in Sparse Cholesky Update/Downdate and Triangular Solves
inferredcites →https://doi.org/10.1145/214392.214398openalex-snapshot
Modification of the minimum-degree algorithm by multiple elimination
inferredcites →https://doi.org/10.1145/305619.305640openalex-snapshot
Tradeoffs between parallelism and fill in nested dissection
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1145/322154.322161openalex-snapshot
Applications of Path Compression on Balanced Trees
inferredcites →https://doi.org/10.1145/602770.602897openalex-snapshot
Improved load distribution in parallel sparse cholesky factorization
inferredcites →https://doi.org/10.1145/602770.602898openalex-snapshot
A scalable parallel algorithm for sparse Cholesky factorization
inferredcites →https://doi.org/10.1145/6497.6499openalex-snapshot
A compact row storage scheme for Cholesky factors using elimination trees
inferredcites →https://doi.org/10.1145/800195.805928openalex-snapshot
Reducing the bandwidth of sparse symmetric matrices
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.
inferredcites →https://doi.org/10.3929/ethz-a-003876213openalex-snapshot
Scalable parallel sparse LU factorization methods on shared memory multiprocessors

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.comptc.2018.12.009openalex-snapshot
Generalizing energy decomposition analysis to response properties to inform expedited predictive models
inferred← citeshttps://doi.org/10.1016/j.jcp.2017.08.006openalex-snapshot
Distance descending ordering method: An O(n) algorithm for inverting the mass matrix in simulation of macromolecules with long branches
inferred← citeshttps://doi.org/10.1021/acs.jctc.6b00154openalex-snapshot
Recursive Factorization of the Inverse Overlap Matrix in Linear-Scaling Quantum Molecular Dynamics Simulations
inferred← citeshttps://doi.org/10.1021/acs.jctc.7b00605openalex-snapshot
Highly Efficient and Scalable Compound Decomposition of Two-Electron Integral Tensor and Its Application in Coupled Cluster Calculations
inferred← citeshttps://doi.org/10.1021/acs.jpca.3c04282openalex-snapshot
Automatic Generation of Auxiliary Basis Sets in Spherical Representation Using the Cholesky Decomposition
inferred← citeshttps://doi.org/10.1021/jp108218wopenalex-snapshot
A Kinetic Energy Fitting Metric for Resolution of the Identity Second-Order Møller−Plesset Perturbation Theory
inferred← citeshttps://doi.org/10.1063/1.3644893openalex-snapshot
An efficient linear scaling procedure for constructing localized orbitals of large molecules based on the one-particle density matrix
inferred← citeshttps://doi.org/10.1063/1.4928064openalex-snapshot
Positive semidefinite tensor factorizations of the two-electron integral matrix for low-scaling ab initio electronic structure
inferred← citeshttps://doi.org/10.1063/5.0134764openalex-snapshot
Sparsity of the electron repulsion integral tensor using different localized virtual orbital representations in local second-order Møller–Plesset theory
inferred← citeshttps://doi.org/10.1063/5.0316579openalex-snapshot
OptOrbFCI-CD: Combining optimal orbital selection and Cholesky decomposition for accurate and efficient full configuration interaction
inferred← citeshttps://doi.org/10.1080/08927022.2019.1706738openalex-snapshot
An 𝒪(n) framework for internal coordinate molecular dynamics applicable to molecules with arbitrary constraints and geometries
inferred← citeshttps://doi.org/10.1088/0953-4075/44/20/205102openalex-snapshot
Accelerating the convergence of the Lanczos algorithm by the use of a complex symmetric Cholesky factorization: application to correlation functions in quantum molecular dynamics
inferred← citeshttps://doi.org/10.1103/physrevlett.112.046401openalex-snapshot
Accurate and Scalable O(N) Algorithm for First-Principles Molecular-Dynamics Computations on Large Parallel Computers
inferred← citeshttps://doi.org/10.1109/tpwrs.2018.2803200openalex-snapshot
Improved Sparsity Techniques for Solving Network Equations in Transient Stability Simulations
inferred← citeshttps://doi.org/10.1137/11083352xopenalex-snapshot
Controlling Errors in Recursive Fermi–Dirac Operator Expansions with Applications in Electronic Structure Theory
inferred← citeshttps://doi.org/10.1137/140956476openalex-snapshot
A Scalable $O(N)$ Algorithm for Large-Scale Parallel First-Principles Molecular Dynamics Simulations
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.