On the public citation graph

An Optimal Agorithm for Symbolic Factorization of Symmetric Matrices

https://doi.org/10.1137/0209044

0 signed · 41 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.1137/0205021openalex-snapshot

Algorithmic Aspects of Vertex Elimination on Graphs

inferredcites →https://doi.org/10.1137/0714011openalex-snapshot

Numerical Experiments Using Dissection Methods to Solve n by n Grid Problems

inferredcites →https://doi.org/10.1137/0715069openalex-snapshot

An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems

inferredcites →https://doi.org/10.1137/0717024openalex-snapshot

A Minimal Storage Implementation of the Minimum Degree Algorithm

inferredcites →https://doi.org/10.1137/1003021openalex-snapshot

The Use of Linear Graphs in Gauss Elimination

inferredcites →https://doi.org/10.2307/2333777openalex-snapshot

The Theory of Graphs and its Applications.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119903895.ch4openalex-snapshot

Large‐Scale Algebraic Equations

inferred← citeshttps://doi.org/10.1002/nme.1620190610openalex-snapshot

A two‐step approach to finite element ordering

inferred← citeshttps://doi.org/10.1002/nme.1620210106openalex-snapshot

Sparse matrix factor modification in structural reanalysis

inferred← citeshttps://doi.org/10.1007/978-3-031-25820-6_4openalex-snapshot

Sparse Cholesky Solver: The Symbolic Phase

inferred← citeshttps://doi.org/10.1007/978-3-662-39812-8_2openalex-snapshot

Solution of Sparse Systems of Equations on Multiprocessor Architectures

inferred← citeshttps://doi.org/10.1007/bf01396049openalex-snapshot

Algorithmique et calculs de complexit� pour un solveur de type dissections embo�t�es

inferred← citeshttps://doi.org/10.1007/bf01399695openalex-snapshot

Approximation by cubicC 1-splines on arbitrary triangulations

inferred← citeshttps://doi.org/10.1007/bf02023054openalex-snapshot

Parallel sparse Gaussian elimination with partial pivoting

inferred← citeshttps://doi.org/10.1007/bfb0085717openalex-snapshot

Solution of sparse systems of equations on multiprocessor architectures

inferred← citeshttps://doi.org/10.1007/bfb0112537openalex-snapshot

A bipartite quotient graph model for unsymmetric matrices

inferred← citeshttps://doi.org/10.1007/s10846-016-0367-7openalex-snapshot

Efficient Cholesky Factor Recovery for Column Reordering in Simultaneous Localisation and Mapping

inferred← citeshttps://doi.org/10.1016/0016-0032(83)90050-9openalex-snapshot

A Physical Interpretation of Factorization and Factor Modification in Structural Analysis

inferred← citeshttps://doi.org/10.1016/0024-3795(80)90159-7openalex-snapshot

Solution of sparse linear least squares problems using givens rotations

inferred← citeshttps://doi.org/10.1016/0024-3795(80)90164-0openalex-snapshot

On symbolic factorization of partitioned sparse symmetric matrices

inferred← citeshttps://doi.org/10.1016/0377-0427(89)90364-6openalex-snapshot

Solution of sparse positive definite systems on a hypercube

inferred← citeshttps://doi.org/10.1016/b978-0-444-88621-7.50012-8openalex-snapshot

Solution of sparse positive definite systems on a hypercube* *Research was supported by the Applied Mathematical Sciences Research Program of the Office of Energy Research, U.S. Department of Energy, and by the Canadian Natural Sciences and Engineering Research Council under grant A5509.

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.1017/s0962492916000076openalex-snapshot

A survey of direct methods for sparse linear systems

inferred← citeshttps://doi.org/10.1021/ct100618sopenalex-snapshot

Fast Sparse Cholesky Decomposition and Inversion using Nested Dissection Matrix Reordering

inferred← citeshttps://doi.org/10.1137/0611010openalex-snapshot

The Role of Elimination Trees in Sparse Factorization

inferred← citeshttps://doi.org/10.1137/0902019openalex-snapshot

Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination

inferred← citeshttps://doi.org/10.1137/0908072openalex-snapshot

Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting

inferred← citeshttps://doi.org/10.1137/0909021openalex-snapshot

Sparse Cholesky Factorization on a Local-Memory Multiprocessor

inferred← citeshttps://doi.org/10.1137/1033099openalex-snapshot

Parallel Algorithms for Sparse Linear Systems

inferred← citeshttps://doi.org/10.1137/s089547980343641xopenalex-snapshot

Row Modifications of a Sparse Cholesky Factorization

inferred← citeshttps://doi.org/10.1137/s0895479897321076openalex-snapshot

Modifying a Sparse Cholesky Factorization

inferred← citeshttps://doi.org/10.1137/s1064827593260449openalex-snapshot

Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors

inferred← citeshttps://doi.org/10.1145/1024074.1024079openalex-snapshot

A column approximate minimum degree ordering algorithm

inferred← citeshttps://doi.org/10.1145/3731599.3767440openalex-snapshot

Performance-Portable Symbolic Factorization through Common Graph Operations

inferred← citeshttps://doi.org/10.1145/5960.5963openalex-snapshot

A node-addition model for symbolic factorization

inferred← citeshttps://doi.org/10.1145/6497.6499openalex-snapshot

A compact row storage scheme for Cholesky factors using elimination trees

inferred← citeshttps://doi.org/10.1186/1297-9686-45-45openalex-snapshot

Inversion of a part of the numerator relationship matrix using pedigree information

inferred← citeshttps://doi.org/10.1201/9781315119335-61openalex-snapshot

Elimination Structures in Scientific Computing

inferred← citeshttps://doi.org/10.9746/sicetr1965.24.370openalex-snapshot

Linear Algebra by Symbolic Manipulation and Application to the Canonical Decomposition of Control Systems

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.