On the public citation graph

Solution of linear systems of equations: Direct methods (general)

https://doi.org/10.1007/bfb0116616
0 signed · 45 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-4615-8675-3openalex-snapshot
Sparse Matrices and their Applications
inferredcites →https://doi.org/10.1007/978-1-4615-8675-3_4openalex-snapshot
Some Basic Techniques for Solving Sparse Systems of Linear Equations
inferredcites →https://doi.org/10.1007/978-1-4615-8675-3_5openalex-snapshot
Vector and Matrix Variability Type in Sparse Matrix Algorithms
inferredcites →https://doi.org/10.1007/bf01436966openalex-snapshot
Monitoring the stability of the triangular factorization of a sparse matrix
inferredcites →https://doi.org/10.1007/bf02241717openalex-snapshot
Pivot selection and row ordering in givens reduction on sparse matrices
inferredcites →https://doi.org/10.1016/0020-0190(71)90006-8openalex-snapshot
Efficient determination of the transitive closure of a directed graph
inferredcites →https://doi.org/10.1090/s0025-5718-1974-0343559-8openalex-snapshot
Modifying pivot elements in Gaussian elimination
inferredcites →https://doi.org/10.1093/comjnl/13.3.309openalex-snapshot
The least squares problem and pseudo-inverses
inferredcites →https://doi.org/10.1093/imamat/10.1.118openalex-snapshot
On the Automatic Scaling of Matrices for Gaussian Elimination
inferredcites →https://doi.org/10.1093/imamat/10.3.289openalex-snapshot
Pivoting for Size and Sparsity in Linear Programming Inversion Routes
inferredcites →https://doi.org/10.1093/imamat/12.3.329openalex-snapshot
Least Squares Computations by Givens Transformations Without Square Roots
inferredcites →https://doi.org/10.1093/imamat/14.3.281openalex-snapshot
A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination
inferredcites →https://doi.org/10.1093/imamat/17.3.267openalex-snapshot
A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
inferredcites →https://doi.org/10.1093/imamat/19.3.339openalex-snapshot
On Permutations to Block Triangular Form
inferredcites →https://doi.org/10.1093/imamat/8.3.344openalex-snapshot
The Solution of Large Sparse Unsymmetric Systems of Linear Equations
inferredcites →https://doi.org/10.1093/imamat/8.3.374openalex-snapshot
A Note on the Stability of Gaussian Elimination
inferredcites →https://doi.org/10.1109/proc.1977.10514openalex-snapshot
A survey of sparse matrix research
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0711043openalex-snapshot
Partial Pivoting Strategies for Symmetric Matrices
inferredcites →https://doi.org/10.1137/1004032openalex-snapshot
An Algorithm for Scaling Matrices
inferredcites →https://doi.org/10.1145/321075.321076openalex-snapshot
Error Analysis of Direct Methods of Matrix Inversion
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1145/355780.355785openalex-snapshot
An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
inferredcites →https://doi.org/10.1287/mnsc.3.3.255openalex-snapshot
The Elimination form of the Inverse and its Application to Linear Programming
inferredcites →https://doi.org/10.2307/2309562openalex-snapshot
An Algorithm for Distinct Representatives

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.3190020209openalex-snapshot
Perfect Elimination and Chordal Bipartite Graphs
inferred← citeshttps://doi.org/10.1002/nme.1620210106openalex-snapshot
Sparse matrix factor modification in structural reanalysis
inferred← citeshttps://doi.org/10.1007/978-1-4757-0560-7_12openalex-snapshot
Miscellaneous numerical methods
inferred← citeshttps://doi.org/10.1007/978-3-322-96645-2_2openalex-snapshot
Direkte Verfahren zur Lösung Linearer Gleichungssysteme
inferred← citeshttps://doi.org/10.1007/bf00583669openalex-snapshot
Application of sparse matrix techniques to inter-regional input-output analysis
inferred← citeshttps://doi.org/10.1007/bf01931221openalex-snapshot
New factorization codes for sparse, symmetric and positive definite matrices
inferred← citeshttps://doi.org/10.1007/bfb0112537openalex-snapshot
A bipartite quotient graph model for unsymmetric matrices
inferred← citeshttps://doi.org/10.1016/0010-4825(85)90012-5openalex-snapshot
On the solution of equations for renal counterflow models
inferred← citeshttps://doi.org/10.1016/0021-9991(82)90067-5openalex-snapshot
ADI on staggered mesh—A method for the calculation of compressible convection
inferred← citeshttps://doi.org/10.1016/0377-0427(87)90127-0openalex-snapshot
A survey of the advances in the exploitation of the sparsity in the solution of large problems
inferred← citeshttps://doi.org/10.1016/b978-0-12-289260-8.50019-4openalex-snapshot
Perfect Gaussian Elimination
inferred← citeshttps://doi.org/10.1016/b978-0-12-557580-5.50015-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0167-5060(04)80060-8openalex-snapshot
Perfect Gaussian Elimination
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)71205-2openalex-snapshot
Direct Solution and Storage of Large Sparse Linear Systems
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1111/j.1365-246x.1995.tb06897.xopenalex-snapshot
A 3-D finite-difference algorithm for DC resistivity modelling using conjugate gradient methods
inferred← citeshttps://doi.org/10.1137/0214052openalex-snapshot
Approximation of the Consecutive Ones Matrix Augmentation Problem
inferred← citeshttps://doi.org/10.1137/0903032openalex-snapshot
Comparison of Two Algorithms for Solving Large Linear Systems
inferred← citeshttps://doi.org/10.2172/5206570openalex-snapshot
Finite sparse matrix techniques. [Solution of linear systems Ax = b]
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.