The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The Use of Linear Graphs in Gauss Elimination
Abstract
Previous article Next article The Use of Linear Graphs in Gauss EliminationS. ParterS. Parterhttps://doi.org/10.1137/1003021PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] S. D. Conte and , R. T. Dames, An alternating direction method for solving the biharmonic equation, Math. Tables Aids Comput., 12 (1958), 198–205 MR0105813 0083.12304 CrossrefGoogle Scholar[2] Elizabeth H. Cuthill and , Richard S. Varga, A method of normalized block iteration, J. Assoc. Comput. Mach., 6 (1959), 236–244 MR0117877 0088.09403 CrossrefISIGoogle Scholar[3] K. Friedrich, Beitrüge zur direkten and indirekten Auflosung der Normalgleichungen unter besonderer Beriicksichtigung der geodätischen Netzausgleichung, Zeitsehrift für Vermessungswesen, 59 (1930), 461–469, 525–539, 671–697 Google Scholar[4] Robert D. Richtmyer, Difference methods for initial-value problems, Interscience tracts in pure and applied mathematics. Iract 4, Interscience Publishers, Inc., New. York, 1957xii+238 MR0093918 0079.33702 Google Scholar[5] R. S. Varga, Factorization and normalized iterative methods, Report, WAPD T-950, West. Elec. Corp., 1959, April Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structureJournal of Symbolic Computation, Vol. 116 Cross Ref Interconnected Hierarchical Structures for Fast Direct Elliptic Solution26 February 2022 | Journal of Scientific Computing, Vol. 91, No. 1 Cross Ref Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky FactorizationsChristopher J. Lourenco and Erick Moreno-Centeno14 March 2022 | SIAM Journal on Matrix Analysis and Applications, Vol. 43, No. 1AbstractPDF (1350 KB)EXAGRAPH: Graph and combinatorial methods for enabling exascale applications30 September 2021 | The International Journal of High Performance Computing Applications, Vol. 35, No. 6 Cross Ref Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs11 April 2021 | Algorithmica, Vol. 83, No. 7 Cross Ref Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion25 May 2020 | Mathematical Programming, Vol. 188, No. 1 Cross Ref A fast direct solver for nonlocal operators in wavelet coordinatesJournal of Computational Physics, Vol. 428 Cross Ref Chordal graphs in triangular decomposition in top-down styleJournal of Symbolic Computation, Vol. 102 Cross Ref On the Chordality of Simple Decomposition in Top-Down Style18 March 2020 Cross Ref Graph-Based Locality-Sensitive Circuit Sketch RecognizerIEEE Access, Vol. 8 Cross Ref Symbolic Factorization Re-utilization for Contingency Analysis Cross Ref Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low TreewidthACM Transactions on Algorithms, Vol. 14, No. 3 Cross Ref Multiplicity adjustment for temporal and spatial scan statistics using Markov property25 May 2018 | Japanese Journal of Statistics and Data Science, Vol. 1, No. 1 Cross Ref Decomposition in Multidimensional Boolean-Optimization Problems with Sparse Matrices2 March 2018 | Journal of Computer and Systems Sciences International, Vol. 57, No. 1 Cross Ref Enabling massive deep neural networks with the GraphBLAS Cross Ref Thinning a Triangulation of a Bayesian Network or Undirected Graph to Create a Minimal TriangulationInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, Vol. 25, No. 03 Cross Ref Search-space size in contraction hierarchiesTheoretical Computer Science, Vol. 645 Cross Ref A survey of direct methods for sparse linear systems23 May 2016 | Acta Numerica, Vol. 25 Cross Ref Multi-core parallel robust structured multifrontal factorization method for large discretized PDEsJournal of Computational and Applied Mathematics, Vol. 296 Cross Ref Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach18 August 2016 | SIAM Journal on Discrete Mathematics, Vol. 30, No. 3AbstractPDF (1644 KB)Route Planning in Transportation Networks11 November 2016 Cross Ref A scalable distributed graph partitionerProceedings of the VLDB Endowment, Vol. 8, No. 12 Cross Ref Modifying a Graph Using Vertex Elimination8 November 2013 | Algorithmica, Vol. 72, No. 1 Cross Ref Large Induced Subgraphs via Triangulations and CMSO12 February 2015 | SIAM Journal on Computing, Vol. 44, No. 1AbstractPDF (738 KB)Direct Methods for Linear Systems7 October 2014 Cross Ref Graphical Models and Message-Passing Algorithms: Some Introductory Lectures Cross Ref Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies12 January 2016 Cross Ref Searching for better fill-inJournal of Computer and System Sciences, Vol. 80, No. 7 Cross Ref References5 September 2014 Cross Ref Interactively Exploring the Connection between Nested Dissection Orderings for Parallel Cholesky Factorization and Vertex Separators Cross Ref Performa
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Difference methods for initial-value problems
Richtmyer, R. D., & Morton, K. W. (1994) · International Linear Collider · Cited by 896
Cited by
Reducing the bandwidth of sparse symmetric matrices
Cuthill, E., & McKee, J. (1969) · Proceedings of the 1969 24th national conference on - · doi:10.1145/800195.805928 · Cited by 1,457
Nested Dissection of a Regular Finite Element Mesh
George, A. (1973) · SIAM Journal on Numerical Analysis · doi:10.1137/0710032 · Cited by 1,064
Route Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_2 · Cited by 610
Triangulated graphs and the elimination process
Rose, D. J. (1970) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(70)90282-9 · Cited by 500
A survey of sparse matrix research
Duff, I. S. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10514 · Cited by 262
Metadata
- Authors
- Parter, S.
- Venue
- SIAM Review
- Published
- 1961-04
- Volume
- 3
- Issue
- 2
- Pages
- 119-130
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2061782500
- Cited by
- 290
- References
- 1
- FWCI
- 0.57
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Use of Linear Graphs in Gauss Elimination. https://app.cochat.ai/papers/10.1137/1003021
- The paper
- Parter, S. (1961). The Use of Linear Graphs in Gauss Elimination. SIAM Review. https://doi.org/10.1137/1003021
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.