On the public citation graph

Algorithmique et calculs de complexit� pour un solveur de type dissections embo�t�es

https://doi.org/10.1007/bf01396049
0 signed · 37 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/bf01389708openalex-snapshot
Calculs de complexit� relatifs � une m�thode de dissection embo�t�e
inferredcites →https://doi.org/10.1007/bf01396660openalex-snapshot
The analysis of a nested dissection algorithm
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50018-0openalex-snapshot
A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS
inferredcites →https://doi.org/10.1016/c2013-0-11311-6openalex-snapshot
Sparse Matrix Technology
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
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/0611010openalex-snapshot
The Role of Elimination Trees in Sparse Factorization
inferredcites →https://doi.org/10.1137/0710032openalex-snapshot
Nested Dissection of a Regular Finite Element Mesh
inferredcites →https://doi.org/10.1137/0714011openalex-snapshot
Numerical Experiments Using Dissection Methods to Solve n by n Grid Problems
inferredcites →https://doi.org/10.1137/0715021openalex-snapshot
Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element Systems
inferredcites →https://doi.org/10.1137/0715044openalex-snapshot
Incomplete Nested Dissection for Solving n by n Grid Problems
inferredcites →https://doi.org/10.1137/0715069openalex-snapshot
An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
inferredcites →https://doi.org/10.1137/1003021openalex-snapshot
The Use of Linear Graphs in Gauss Elimination
inferredcites →https://doi.org/10.1145/356004.356006openalex-snapshot
A New Implementation of Sparse Gaussian Elimination
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1096-9128(200002/03)12:2/3<69::aid-cpe472>3.0.co;2-wopenalex-snapshot
Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering
inferred← citeshttps://doi.org/10.1007/11558958_73openalex-snapshot
Applying Parallel Direct Solver Techniques to Build Robust High Performance Preconditioners
inferred← citeshttps://doi.org/10.1007/3-540-45591-4_70openalex-snapshot
PaStiX: A Parallel Sparse Direct Solver Based on a Static Scheduling for Mixed 1D/2D Block Distributions
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_148openalex-snapshot
A Mapping and Scheduling Algorithm for Parallel Sparse Fan-In Numerical Factorization⋆
inferred← citeshttps://doi.org/10.1007/3-540-55895-0_424openalex-snapshot
Partitioning and mapping for parallel nested dissection on distributed memory architectures
inferred← citeshttps://doi.org/10.1007/3-540-63138-0_23openalex-snapshot
Unstructured graph partitioning for sparse linear system solving
inferred← citeshttps://doi.org/10.1007/3-540-70734-4_15openalex-snapshot
A Scalable Parallel Assembly for Irregular Meshes Based on a Block Distribution for a Parallel Block Direct Solver
inferred← citeshttps://doi.org/10.1007/bfb0031609openalex-snapshot
Sparse matrix ordering with Scotch
inferred← citeshttps://doi.org/10.1007/bfb0097983openalex-snapshot
Hybridizing nested dissection and halo approximate minimum degree for efficient sparce matrix ordering
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90061-dopenalex-snapshot
Expression for massively parallel algorithms — description and illustrative example
inferred← citeshttps://doi.org/10.1016/j.parco.2007.12.003openalex-snapshot
On finding approximate supernodes for an efficient block-ILU(k) factorization
inferred← citeshttps://doi.org/10.1016/s0167-8191(01)00141-7openalex-snapshot
PaStiX: a high-performance parallel direct solver for sparse symmetric positive definite systems
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.1023/a:1019118015711openalex-snapshot
Parallel sparse linear algebra and application to structural mechanics
inferred← citeshttps://doi.org/10.1051/ita/1988220202451openalex-snapshot
Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées
inferred← citeshttps://doi.org/10.1109/icppw.2005.75openalex-snapshot
Programming Irregular Scientific Algorithms with Static Properties on Clusters of SMP Nodes
inferred← citeshttps://doi.org/10.1137/16m1062454openalex-snapshot
Reordering Strategy for Blocking Optimization in Sparse Linear Solvers
inferred← citeshttps://doi.org/10.13052/ejcm.18.589-605openalex-snapshot
A parallel algorithm for direct solution of large sparse linear systems, well suitable to domain decomposition methods
inferred← citeshttps://doi.org/10.70675/635276edz935ez4c82zb8d7z8966aee60c21openalex-snapshot
Combler l’écart entre H-Matrices et méthodes directes creuses pour la résolution de systèmes linéaires de grandes tailles
inferred← citeshttps://doi.org/10.70675/f03dcd69za905z4dc5za2d4zd420c3f7370fopenalex-snapshot
Utilisation de la compression low-rank pour réduire la complexité des solveurs creux parallèles basés sur des techniques de factorisation directes.
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.