On the public citation graph

Recursive formulation of Cholesky algorithm in Fortran 90

https://doi.org/10.1007/bfb0095384
0 signed · 18 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.1007/3-540-64359-1_712openalex-snapshot
High performance linear algebra package LAPACK90
inferredcites →https://doi.org/10.1007/bfb0095338openalex-snapshot
Superscalar GEMM-based level 3 BLAS—The on-going evolution of a portable and high-performance library
inferredcites →https://doi.org/10.1093/oso/9780198526926.001.0001openalex-snapshot
Fortran 95/2003 Explained
inferredcites →https://doi.org/10.1137/1.9781611971446openalex-snapshot
Applied Numerical Linear Algebra
inferredcites →https://doi.org/10.1137/s0895479896297744openalex-snapshot
Locality of Reference in LU Decomposition with Partial Pivoting
inferredcites →https://doi.org/10.1147/rd.416.0737openalex-snapshot
Recursion leads to automatic variable blocking for dense linear-algebra algorithms
inferredcites →https://doi.org/10.56021/9781421407944openalex-snapshot
Matrix Computations
inferredcites →https://doi.org/10.5860/choice.35-3919openalex-snapshot
Applied numerical linear algebra

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45492-6_78openalex-snapshot
LAWRA Workshop Linear Algebra with Recursive Algorithms http://lawra.uni-c.dk/lawra/
inferred← citeshttps://doi.org/10.1007/3-540-48051-x_29openalex-snapshot
A Recursive Formulation of the Inversion of Symmetric Positive Definite Matrices in Packed Storage Data Format
inferred← citeshttps://doi.org/10.1007/3-540-70734-4_7openalex-snapshot
LAWRA Linear Algebra with Recursive Algorithms
inferred← citeshttps://doi.org/10.1080/13926292.1999.9637105openalex-snapshot
Lawra – linear algebra with recursive algorithms
inferred← citeshttps://doi.org/10.1109/tpds.2002.1058095openalex-snapshot
Recursive array layouts and fast matrix multiplication
inferred← citeshttps://doi.org/10.1145/1067967.1067969openalex-snapshot
A fully portable high performance minimal storage hybrid format Cholesky algorithm
inferred← citeshttps://doi.org/10.1145/3061664openalex-snapshot
Algorithm 979
inferred← citeshttps://doi.org/10.18154/rwth-2018-223017openalex-snapshot
Performance Modeling and Prediction for Dense Linear Algebra
inferred← citeshttps://doi.org/10.26153/tsw/15578openalex-snapshot
Methods for Enhancing the Speed of Numerical Calculations for the Prediction of the Mechanical Behavior of Parts Made Using Additive Manufacturing
inferred← citeshttps://doi.org/10.3846/13926292.1999.9637105openalex-snapshot
LAWRA – LINEAR ALGEBRA WITH RECURSIVE ALGORITHMS
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.