On the public citation graph

Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers

https://doi.org/10.1002/nla.427
0 signed · 26 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/978-1-4613-8369-7openalex-snapshot
Graph Theory and Sparse Matrix Computation
inferredcites →https://doi.org/10.1007/978-1-4613-8369-7_6openalex-snapshot
Predicting Structure in Nonsymmetric Sparse Matrix Factorizations
inferredcites →https://doi.org/10.1016/s0098-1354(01)00731-1openalex-snapshot
The design of a portable parallel frontal solver for chemical process engineering problems
inferredcites →https://doi.org/10.1016/s0098-1354(99)00314-2openalex-snapshot
A multilevel unsymmetric matrix ordering algorithm for parallel process simulation
inferredcites →https://doi.org/10.1090/s0025-5718-1965-0196924-0openalex-snapshot
A Graph Technique for Inverting Certain Matrices
inferredcites →https://doi.org/10.1137/0909057openalex-snapshot
On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices
inferredcites →https://doi.org/10.1137/s0895479896308433openalex-snapshot
Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
inferredcites →https://doi.org/10.1137/s0895479897317661openalex-snapshot
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
inferredcites →https://doi.org/10.1145/1024074.1024079openalex-snapshot
A column approximate minimum degree ordering algorithm
inferredcites →https://doi.org/10.1145/225545.225550openalex-snapshot
The design of a new frontal code for solving sparse, unsymmetric systems
inferredcites →https://doi.org/10.1145/355958.355963openalex-snapshot
On Algorithms for Obtaining a Maximum Transversal
inferredcites →https://doi.org/10.1145/355958.355968openalex-snapshot
Algorithm 575: Permutations for a Zero-Free Diagonal [F1]
inferredcites →https://doi.org/10.1145/98267.98287openalex-snapshot
Computing the block triangular form of a sparse matrix
inferredcites →https://doi.org/10.1145/992200.992201openalex-snapshot
A parallel direct solver for large sparse highly unsymmetric linear systems
inferredcites →https://doi.org/10.4153/cjm-1958-052-0openalex-snapshot
Coverings of Bipartite Graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/nla.2130openalex-snapshot
Wilkinson's inertia‐revealing factorization and its application to sparse matrices
inferred← citeshttps://doi.org/10.1007/978-3-030-92864-3_7openalex-snapshot
Greedy Dissection Method for Shared Parallelism in Incomplete Factorization Within INMOST Platform
inferred← citeshttps://doi.org/10.1007/978-3-031-25820-6_8openalex-snapshot
Sparse Matrix Ordering Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-68111-3_75openalex-snapshot
Heuristics for a Matrix Symmetrization Problem
inferred← citeshttps://doi.org/10.1007/s10910-020-01157-8openalex-snapshot
Numerical algorithms for the determinants of opposite-bordered and singly-bordered tridiagonal matrices
inferred← citeshttps://doi.org/10.1016/j.cma.2009.05.012openalex-snapshot
Computing the null space of finite element problems
inferred← citeshttps://doi.org/10.1016/j.econmod.2015.07.011openalex-snapshot
Solving intertemporal CGE models in parallel using a singly bordered block diagonal ordering technique
inferred← citeshttps://doi.org/10.1016/j.parco.2004.12.008openalex-snapshot
Stabilized bordered block diagonal forms for parallel sparse solvers
inferred← citeshttps://doi.org/10.1109/tmag.2017.2759145openalex-snapshot
Stabilized Bordered Block Diagonal Form for Solving Nonlinear Magnetic Field Problems
inferred← citeshttps://doi.org/10.1137/050629938openalex-snapshot
Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
inferred← citeshttps://doi.org/10.17918/etd-1789openalex-snapshot
Power flow computation using field programmable gate arrays
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.