On the public citation graph

Comparison of Two Algorithms for Solving Large Linear Systems

https://doi.org/10.1137/0903032
0 signed · 40 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.1002/zamm.19720520620openalex-snapshot
C. Forsythe and C. B. Moler, Computer Solution of Linear Algebraic Systems. (Series in Automatic Computation) XI + 148 S. Englewood Cliffs, N.J. 1967. Prentice‐Hall, Inc. Preis geb. 54 s. net
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-3-642-86934-1openalex-snapshot
Handbook for Automatic Computation
inferredcites →https://doi.org/10.1007/978-3-642-86940-2openalex-snapshot
Handbook for Automatic Computation
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/bf01939974openalex-snapshot
Iterative refinement of linear least squares solutions II
inferredcites →https://doi.org/10.1007/bf02166032openalex-snapshot
Note on the iterative refinement of least squares solution
inferredcites →https://doi.org/10.1007/bfb0116616openalex-snapshot
Solution of linear systems of equations: Direct methods (general)
inferredcites →https://doi.org/10.1016/0041-5553(66)90153-4openalex-snapshot
The algebraic eigenvalue problem
inferredcites →https://doi.org/10.1016/0097-8485(80)80007-6openalex-snapshot
Implementation of an iterative refinement option in a code for large and sparse systems
inferredcites →https://doi.org/10.1016/0097-8485(80)85003-0openalex-snapshot
The use of sparse matrix technique in the numerical integration of stiff systems of linear ordinary differential equations
inferredcites →https://doi.org/10.1016/0097-8485(81)80014-9openalex-snapshot
A testing scheme for subroutines solving large linear problems
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50015-5openalex-snapshot
METHODS FOR SPARSE LINEAR LEAST SQUARES PROBLEMS
inferredcites →https://doi.org/10.1038/202016a0openalex-snapshot
Rounding Errors in Algebraic Processes
inferredcites →https://doi.org/10.1080/01621459.1978.10480020openalex-snapshot
Comment on the Iterative Refinement of Least-Squares Solutions
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0275643-8openalex-snapshot
Some Results on Sparse Matrices
inferredcites →https://doi.org/10.1093/imamat/23.2.235openalex-snapshot
Direct Solution of Sets of Linear Equations whose Matrix is Sparse, Symmetric and Indefinite
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.1109/proc.1977.10514openalex-snapshot
A survey of sparse matrix research
inferredcites →https://doi.org/10.1137/0716029openalex-snapshot
An Estimate for the Condition Number of a Matrix
inferredcites →https://doi.org/10.1137/0717003openalex-snapshot
On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique
inferredcites →https://doi.org/10.1137/0719024openalex-snapshot
Use of Iterative Refinement in the Solution of Sparse Linear Systems
inferredcites →https://doi.org/10.1145/355791.355796openalex-snapshot
Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
inferredcites →https://doi.org/10.1145/355815.355817openalex-snapshot
Some Design Features of a Sparse Matrix Code
inferredcites →https://doi.org/10.1145/365876.365909openalex-snapshot
Techniques for automatic tolerance control in linear programming
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/2003558openalex-snapshot
The Algebraic Eigenvalue Problem
inferredcites →https://doi.org/10.2307/2004501openalex-snapshot
Computer Solution of Linear Algebraic Systems

What points at this work

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

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.1016/0021-9991(91)90291-ropenalex-snapshot
A locally refined rectangular grid finite element method: Application to computational fluid dynamics and computational physics
inferred← citeshttps://doi.org/10.1016/0168-9274(85)90023-6openalex-snapshot
General scheme for solving linear algebraic problems by direct methods
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/0898-1221(82)90051-7openalex-snapshot
Comparison of two pivotal strategies in sparse plane rotations
inferred← citeshttps://doi.org/10.1016/0898-1221(85)90186-5openalex-snapshot
Exploiting the sparsity in the solution of linear ordinary differential equations
inferred← citeshttps://doi.org/10.1016/0898-1221(88)90170-8openalex-snapshot
Solving large and sparse linear least-squares problems by conjugate gradient algorithms
inferred← citeshttps://doi.org/10.1016/j.cam.2011.07.026openalex-snapshot
Implementation of sparse matrix algorithms in an advection–diffusion–chemistry module
inferred← citeshttps://doi.org/10.1016/j.camwa.2010.08.025openalex-snapshot
Efficient implementation of stable Richardson Extrapolation algorithms
inferred← citeshttps://doi.org/10.1109/20.800693openalex-snapshot
Modelling the evolution of domains in nanoelements using finite elements
inferred← citeshttps://doi.org/10.1137/0907080openalex-snapshot
Condition Number Estimators in a Sparse Matrix Software
inferred← citeshttps://doi.org/10.1137/0910072openalex-snapshot
Application of Sparse Matrix Solvers as Effective Preconditioners
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.