On the public citation graph

A parallel algorithm for computing the extremal eigenvalues of very large sparse matrices

https://doi.org/10.1007/bfb0095354
0 signed · 23 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/bf01459947openalex-snapshot
The method of coordinate overrelaxation for (A??B)x=0
inferredcites →https://doi.org/10.1016/0010-4655(89)90147-1openalex-snapshot
Super-matrix methods
inferredcites →https://doi.org/10.1016/0020-0190(93)90246-6openalex-snapshot
A still better performance guarantee for approximate graph coloring
inferredcites →https://doi.org/10.1016/0021-9991(73)90149-6openalex-snapshot
The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices
inferredcites →https://doi.org/10.1090/s0025-5718-1974-0378378-xopenalex-snapshot
𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices
inferredcites →https://doi.org/10.1137/0914037openalex-snapshot
Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
inferredcites →https://doi.org/10.1137/0914041openalex-snapshot
A Parallel Graph Coloring Heuristic
inferredcites →https://doi.org/10.21236/ada447560openalex-snapshot
Deflation Techniques for an Implicitly Re-started Arnoldi Iteration
inferredcites →https://doi.org/10.2307/2003785openalex-snapshot
Computational Methods of Linear Algebra
inferredcites →https://doi.org/10.2307/2005690openalex-snapshot
SOR-Methods for the Eigenvalue Problem with Large Sparse Matrices
inferredcites →https://doi.org/10.5555/602770.602806openalex-snapshot
A parallel Gauss-Seidel algorithm for sparse power system matrices
inferredcites →https://doi.org/10.56021/9781421407944openalex-snapshot
Matrix Computations

What points at this work

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

inferred← citeshttps://doi.org/10.1002/1096-9128(200010)12:12<1131::aid-cpe528>3.0.co;2-2openalex-snapshot
Scalable parallel graph coloring algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-10692-8_12openalex-snapshot
Evaluation of Serial and Parallel Shared-Memory Distance-1 Graph Coloring Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-29400-7_27openalex-snapshot
Graph Coloring Using GPUs
inferred← citeshttps://doi.org/10.1007/978-3-662-48096-0_32openalex-snapshot
A Fast and Scalable Graph Coloring Algorithm for Multi-core and Many-core Architectures
inferred← citeshttps://doi.org/10.1007/s11227-005-0311-2openalex-snapshot
Approaches Based on Permutations for Partitioning Sparse Matrices on Multiprocessors
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.08.002openalex-snapshot
A framework for scalable greedy coloring on distributed-memory parallel computers
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00424-9openalex-snapshot
Graph coloring on coarse grained multicomputers
inferred← citeshttps://doi.org/10.1109/glocom.2013.6831696openalex-snapshot
Null space learning in cooperative MIMO cellular networks using interference feedback
inferred← citeshttps://doi.org/10.1109/twc.2015.2415483openalex-snapshot
Null Space Learning in Cooperative MIMO Cellular Networks Using Interference Feedback
inferred← citeshttps://doi.org/10.1155/2012/713587openalex-snapshot
The Zoltan and Isorropia Parallel Toolkits for Combinatorial Scientific Computing: Partitioning, Ordering and Coloring
inferred← citeshttps://doi.org/10.25560/24812openalex-snapshot
Scalable Multithreaded Algorithms for Mutable Irregular Data with Application to Anisotropic Mesh Adaptivity
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.