On the public citation graph

An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme

https://doi.org/10.1137/0908053
0 signed · 30 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/nme.1620020104openalex-snapshot
A frontal solution program for finite element analysis
inferredcites →https://doi.org/10.1007/978-1-4615-8675-3_3openalex-snapshot
Sparse Matrix Approach to the Frequency Domain Analysis of Linear Passive Electrical Networks
inferredcites →https://doi.org/10.1007/bfb0093150openalex-snapshot
Full matrix techniques in sparse Gaussian elimination
inferredcites →https://doi.org/10.1016/0020-0190(80)90136-2openalex-snapshot
The space complexity of pebble games on trees
inferredcites →https://doi.org/10.1016/0024-3795(86)90167-9openalex-snapshot
Parallel Cholesky factorization on a shared-memory multiprocessor
inferredcites →https://doi.org/10.1016/0045-7949(74)90063-7openalex-snapshot
Direct solution of large systems of linear equations
inferredcites →https://doi.org/10.1016/0045-7949(78)90130-xopenalex-snapshot
Direct numerical solution of large sets of simultaneous equations
inferredcites →https://doi.org/10.1016/s0022-0000(76)80048-7openalex-snapshot
Storage requirements for deterministic polynomialtime recognizable languages
inferredcites →https://doi.org/10.1038/scientificamerican0984-60openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1137/0905019openalex-snapshot
Design Features of a Frontal Code for Solving Sparse Unsymmetric Linear Systems Out-of-Core
inferredcites →https://doi.org/10.1145/1057588.1057590openalex-snapshot
Sparse matrix test problems
inferredcites →https://doi.org/10.1145/214392.214398openalex-snapshot
Modification of the minimum-degree algorithm by multiple elimination
inferredcites →https://doi.org/10.1145/355815.355817openalex-snapshot
Some Design Features of a Sparse Matrix Code
inferredcites →https://doi.org/10.1145/356004.356006openalex-snapshot
A New Implementation of Sparse Gaussian Elimination
inferredcites →https://doi.org/10.1145/356044.356047openalex-snapshot
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
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/7921.11325openalex-snapshot
On the storage requirement in the out-of-core multifrontal method for sparse factorization

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.tcs.2017.09.037openalex-snapshot
Scheduling series-parallel task graphs to minimize peak memory
inferred← citeshttps://doi.org/10.1016/s0168-2024(99)80012-5openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s1570-8659(00)07002-2openalex-snapshot
Gaussian elimination for the solution of linear systems of equations
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1137/0608031openalex-snapshot
An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
inferred← citeshttps://doi.org/10.1137/0611010openalex-snapshot
The Role of Elimination Trees in Sparse Factorization
inferred← citeshttps://doi.org/10.1137/0909029openalex-snapshot
Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
inferred← citeshttps://doi.org/10.1137/s1064827597322975openalex-snapshot
Efficient Methods for Out-of-Core Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1145/582034.582073openalex-snapshot
The design of I/O-efficient sparse direct solvers
inferred← citeshttps://doi.org/10.1145/974781.974783openalex-snapshot
The design and implementation of a new out-of-core sparse cholesky factorization method
inferred← citeshttps://doi.org/10.1177/109434208700100403openalex-snapshot
Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers
inferred← citeshttps://doi.org/10.1201/9781315119335-61openalex-snapshot
Elimination Structures in Scientific Computing
inferred← citeshttps://doi.org/10.3390/rs11222681openalex-snapshot
Introduction of Variable Correlation for the Improved Retrieval of Crop Traits Using Canopy Reflectance Model Inversion
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.