On the public citation graph

On the Application of the Minimum Degree Algorithm to Finite Element Systems

https://doi.org/10.1137/0715006
0 signed · 47 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-3-031-01559-5_3openalex-snapshot
Fundamental Algorithms
inferredcites →https://doi.org/10.1007/bf02478000openalex-snapshot
The theory of graphs and its applications
inferredcites →https://doi.org/10.1016/0041-5553(66)90153-4openalex-snapshot
The algebraic eigenvalue problem
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.1093/comjnl/9.3.281openalex-snapshot
A Compact Storage Scheme for the Solution of Symmetric Linear Simultaneous Equations
inferredcites →https://doi.org/10.1093/imamat/6.3.263openalex-snapshot
On the Construction and Use of Finite Elements
inferredcites →https://doi.org/10.1137/0710032openalex-snapshot
Nested Dissection of a Regular Finite Element Mesh
inferredcites →https://doi.org/10.1137/0713023openalex-snapshot
An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
inferredcites →https://doi.org/10.1137/1003021openalex-snapshot
The Use of Linear Graphs in Gauss Elimination

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)1097-0207(19960415)39:7<1137::aid-nme897>3.0.co;2-ropenalex-snapshot
MATRIX PROFILE AND WAVEFRONT REDUCTION BASED ON THE GRAPH THEORY AND WAVEFRONT MINIMIZATION
inferred← citeshttps://doi.org/10.1002/nme.1620190610openalex-snapshot
A two‐step approach to finite element ordering
inferred← citeshttps://doi.org/10.1002/nme.7545openalex-snapshot
Caveats of three direct linear solvers for finite element analyses
inferred← citeshttps://doi.org/10.1007/978-1-4757-2878-1_16openalex-snapshot
Ordering Heuristics in Interior Point LP Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-66111-3_11openalex-snapshot
Solvers and Solution Methods
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/bfb0064451openalex-snapshot
Mathematical Aspects of Finite Element Methods
inferred← citeshttps://doi.org/10.1007/s00202-006-0042-2openalex-snapshot
Local fill reduction techniques for sparse symmetric linear systems
inferred← citeshttps://doi.org/10.1007/s10479-010-0716-zopenalex-snapshot
A supernodal formulation of vertex colouring with applications in course timetabling
inferred← citeshttps://doi.org/10.1016/0045-7949(79)90112-3openalex-snapshot
Algorithms and software for in-core factorization of sparse symmetric positive definite matrices
inferred← citeshttps://doi.org/10.1016/0045-7949(80)90066-8openalex-snapshot
Algorithms and software for in-core factorization of sparse symmetric positive definite matrices
inferred← citeshttps://doi.org/10.1016/0045-7949(83)90163-3openalex-snapshot
An equation numbering algorithm based on a minimum front criteria
inferred← citeshttps://doi.org/10.1016/0045-7949(88)90196-4openalex-snapshot
An adaptive finite element technique for structural dynamic analysis
inferred← citeshttps://doi.org/10.1016/0168-874x(92)90028-bopenalex-snapshot
A sparse matrix scheme for finite elements
inferred← citeshttps://doi.org/10.1016/b978-0-12-012741-2.50009-9openalex-snapshot
Sparsity in Large-Scale Network Computation
inferred← citeshttps://doi.org/10.1016/b978-044482849-1/50076-2openalex-snapshot
Parallel computing of dispersion of passive pollutants in coastal seas
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.1016/s1570-8659(05)80036-5openalex-snapshot
Least squares methods
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1109/20.582614openalex-snapshot
On the convergence rate improvement of ICCG solver on the FE mesh
inferred← citeshttps://doi.org/10.1115/1.4055241openalex-snapshot
Combining Uneliminated Algebraic Formulations With Sparse Linear Solvers to Increase the Speed and Accuracy of Homotopy Path Tracking for Kinematic Synthesis
inferred← citeshttps://doi.org/10.1137/050622547openalex-snapshot
Unsymmetric Ordering Using A Constrained Markowitz Scheme
inferred← citeshttps://doi.org/10.1137/0611005openalex-snapshot
On the Performance of the Minimum Degree Ordering for Gaussian Elimination
inferred← citeshttps://doi.org/10.1137/0717024openalex-snapshot
A Minimal Storage Implementation of the Minimum Degree Algorithm
inferred← citeshttps://doi.org/10.1137/0913067openalex-snapshot
Highly Parallel Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/1031001openalex-snapshot
The Evolution of the Minimum Degree Ordering Algorithm
inferred← citeshttps://doi.org/10.1137/1033099openalex-snapshot
Parallel Algorithms for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1137/16m1062454openalex-snapshot
Reordering Strategy for Blocking Optimization in Sparse Linear Solvers
inferred← citeshttps://doi.org/10.1137/20m1368070openalex-snapshot
Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes
inferred← citeshttps://doi.org/10.1137/s0895479894278952openalex-snapshot
An Approximate Minimum Degree Ordering Algorithm
inferred← citeshttps://doi.org/10.1145/1024074.1024079openalex-snapshot
A column approximate minimum degree ordering algorithm
inferred← citeshttps://doi.org/10.1145/3581784.3607046openalex-snapshot
Bringing Order to Sparsity: A Sparse Matrix Reordering Study on Multicore CPUs
inferred← citeshttps://doi.org/10.1145/5960.5963openalex-snapshot
A node-addition model for symbolic factorization
inferred← citeshttps://doi.org/10.1145/952978.801067openalex-snapshot
The use of plotting in teaching computer science
inferred← citeshttps://doi.org/10.1201/b11644-3openalex-snapshot
Combinatorial Problems in Solving Linear Systems
inferred← citeshttps://doi.org/10.3133/cir1009openalex-snapshot
Review of literature on the finite-element solution of the equations of two-dimensional surface-water flow in the horizontal plane
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.