On the public citation graph
Incomplete Nested Dissection for Solving n by n Grid Problems
0 signed · 36 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0045-7949(78)90100-1openalex-snapshot
Substructuring techniques—status and projections
inferredcites →https://doi.org/10.1016/0898-1221(78)90010-xopenalex-snapshot
Analysis of dissection algorithms for vector computers
inferredcites →https://doi.org/10.1137/0710032openalex-snapshot
Nested Dissection of a Regular Finite Element Mesh
inferredcites →https://doi.org/10.1137/0710033openalex-snapshot
Complexity Bounds for Regular Finite Difference and Finite Element Grids
inferredcites →https://doi.org/10.1137/0714011openalex-snapshot
Numerical Experiments Using Dissection Methods to Solve n by n Grid Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nme.1620210106openalex-snapshot
Sparse matrix factor modification in structural reanalysis
inferred← citeshttps://doi.org/10.1002/sim.3895openalex-snapshot
Approximate inference for disease mapping with sparse Gaussian processes
inferred← citeshttps://doi.org/10.1007/978-1-4684-5021-7_5openalex-snapshot
MIMD Supercomputers for Numerical Applications
inferred← citeshttps://doi.org/10.1007/978-3-7091-8752-4_8openalex-snapshot
The Solution of Sparse Systems of Linear Equations
inferred← citeshttps://doi.org/10.1007/bf01087548openalex-snapshot
Sparse linear problems of the least squares method
inferred← citeshttps://doi.org/10.1007/bf01396049openalex-snapshot
Algorithmique et calculs de complexit� pour un solveur de type dissections embo�t�es
inferred← citeshttps://doi.org/10.1007/bf02520911openalex-snapshot
Sparse matrix algorithms applied to dem generation
inferred← citeshttps://doi.org/10.1016/0024-3795(80)90156-1openalex-snapshot
Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
inferred← citeshttps://doi.org/10.1016/0024-3795(80)90164-0openalex-snapshot
On symbolic factorization of partitioned sparse symmetric matrices
inferred← citeshttps://doi.org/10.1016/0771-050x(79)90011-1openalex-snapshot
Bibliography on the evaluation of numerical software
inferred← citeshttps://doi.org/10.1016/0898-1221(78)90010-xopenalex-snapshot
Analysis of dissection algorithms for vector computers
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00077-0openalex-snapshot
Developments and trends in the parallel solution of linear systems
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00401-5openalex-snapshot
The impact of high-performance computing in the solution of linear systems: trends and problems
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.1023/a:1021908421589openalex-snapshot
Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse Matrix Ordering Methods
inferred← citeshttps://doi.org/10.1080/03081079408908027openalex-snapshot
HIERARCHICAL TEARING: AN EFFICIENT HOLOGRAPHIC ALGORITHM FOR SYSTEM DECOMPOSITION
inferred← citeshttps://doi.org/10.1090/s0025-5718-1980-0583501-0openalex-snapshot
Numerical Stability of Nested Dissection Orderings
inferred← citeshttps://doi.org/10.1109/tc.1982.1675939openalex-snapshot
Experience with the Parallel Solution of Partial Differential Equations on a Distributed Computing System
inferred← citeshttps://doi.org/10.1109/tcad.1987.1270339openalex-snapshot
A Parallel Solution Method for Large Sparse Systems of Equations
inferred← citeshttps://doi.org/10.1137/0902034openalex-snapshot
Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
inferred← citeshttps://doi.org/10.1137/0906060openalex-snapshot
Auxiliary Storage Methods for Solving Finite Element Systems
inferred← citeshttps://doi.org/10.1137/0910069openalex-snapshot
The Minimum Degree Ordering with Constraints
inferred← citeshttps://doi.org/10.1137/0913049openalex-snapshot
A Grid-Based Subtree-Subcube Assignment Strategy for Solving Partial Differential Equations on Hypercubes
inferred← citeshttps://doi.org/10.1137/1027055openalex-snapshot
Solution of Partial Differential Equations on Vector and Parallel Computers
inferred← citeshttps://doi.org/10.1137/s1064827594276412openalex-snapshot
Data-Parallel Sparse Factorization
inferred← citeshttps://doi.org/10.1137/s1064827596300656openalex-snapshot
Improving the Run Time and Quality of Nested Dissection Ordering
inferred← citeshttps://doi.org/10.1145/356004.356006openalex-snapshot
A New Implementation of Sparse Gaussian Elimination
inferred← citeshttps://doi.org/10.1201/b11644-3openalex-snapshot
Combinatorial Problems in Solving Linear Systems
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.