On the public citation graph

https://doi.org/10.2139/ssrn.4050432

0 signed · 17 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.1016/j.parco.2019.07.002openalex-extracted
Parallel eigenvalue computation for banded generalized eigenvalue problems
inferredcites →https://doi.org/10.1016/s0377-0427(03)00565-xopenalex-extracted
A projection method for generalized eigenvalue problems using numerical integration
inferredcites →https://doi.org/10.1088/0953-8984/26/21/213201openalex-extracted
The ELPA library: scalable parallel eigenvalue solutions for electronic structure theory and computational science
inferredcites →https://doi.org/10.1103/physrevb.79.115112openalex-extracted
Density-matrix-based algorithm for solving eigenvalue problems
inferredcites →https://doi.org/10.1137/0908009openalex-extracted
The WY Representation for Products of Householder Matrices
inferredcites →https://doi.org/10.1137/0910005openalex-extracted
A Storage-Efficient $WY$ Representation for Products of Householder Transformations
inferredcites →https://doi.org/10.1137/s0036144599363084openalex-extracted
A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
inferredcites →https://doi.org/10.1137/s0895479894270427openalex-extracted
A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
inferredcites →https://doi.org/10.1145/365723.365735openalex-extracted
A framework for symmetric band reduction
inferredcites →https://doi.org/10.1145/365723.365736openalex-extracted
Algorithm 807
inferredcites →https://doi.org/10.1145/42288.42291openalex-extracted
An extended set of FORTRAN basic linear algebra subprograms
inferredcites →https://doi.org/10.1145/42288.42292openalex-extracted
Algorithm 656: an extended set of basic linear algebra subprograms: model implementation and test programs
inferredcites →https://doi.org/10.1145/77626.77627openalex-extracted
Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs
inferredcites →https://doi.org/10.1145/77626.79170openalex-extracted
A set of level 3 basic linear algebra subprograms
inferredcites →https://doi.org/10.1145/800195.805928openalex-extracted
Reducing the bandwidth of sparse symmetric matrices
inferredcites →https://doi.org/10.15669/pnst.2.643openalex-extracted
Development of a High-Performance Eigensolver on a Peta-Scale Next-Generation Supercomputer System
inferredcites →https://doi.org/10.6028/jres.045.026openalex-extracted
An iteration method for the solution of the eigenvalue problem of linear differential and integral operators
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.