On the public citation graph

Full matrix techniques in sparse Gaussian elimination

https://doi.org/10.1007/bfb0093150
0 signed · 46 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/nme.1620020104openalex-snapshot
A frontal solution program for finite element analysis
inferredcites →https://doi.org/10.1002/nme.1620100209openalex-snapshot
Frontal solution program for unsymmetric matrices
inferredcites →https://doi.org/10.1002/nme.1620180804openalex-snapshot
Yale sparse matrix package I: The symmetric codes
inferredcites →https://doi.org/10.1007/bfb0092977openalex-snapshot
The design and use of a frontal scheme for solving sparse unsymmetric equations
inferredcites →https://doi.org/10.1016/0010-4655(82)90119-9openalex-snapshot
Experience of sparse matrix codes on the CRAY-1
inferredcites →https://doi.org/10.1145/355887.355893openalex-snapshot
Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
inferredcites →https://doi.org/10.1145/355972.355980openalex-snapshot
Solving Large Full Sets of Linear Equations in a Paged Virtual Store
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.

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)1099-1506(199607/08)3:4<275::aid-nla83>3.0.co;2-7openalex-snapshot
Multifrontal QR Factorization in a Multiprocessor Environment
inferred← citeshttps://doi.org/10.1002/cpe.728openalex-snapshot
The LINPACK Benchmark: past, present and future
inferred← citeshttps://doi.org/10.1007/0-387-24049-7_8openalex-snapshot
Reducing Overhead in Sparse Hypermatrix Cholesky Factorization
inferred← citeshttps://doi.org/10.1007/11558958_96openalex-snapshot
Optimization of a Statically Partitioned Hypermatrix Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1007/3-540-18991-2_27openalex-snapshot
The LINPACK Benchmark: An explanation
inferred← citeshttps://doi.org/10.1007/3-540-62095-8_60openalex-snapshot
Parallel solution of sparse problems by using a sequence of large dense blocks
inferred← citeshttps://doi.org/10.1007/978-3-540-45209-6_68openalex-snapshot
Improving Performance of Hypermatrix Cholesky Factorization
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/bf02023054openalex-snapshot
Parallel sparse Gaussian elimination with partial pivoting
inferred← citeshttps://doi.org/10.1007/bf02510239openalex-snapshot
Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
inferred← citeshttps://doi.org/10.1007/bfb0085717openalex-snapshot
Solution of sparse systems of equations on multiprocessor architectures
inferred← citeshttps://doi.org/10.1007/s00200-007-0039-8openalex-snapshot
Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
inferred← citeshttps://doi.org/10.1007/s11227-008-0188-yopenalex-snapshot
Hypermatrix oriented supernode amalgamation
inferred← citeshttps://doi.org/10.1016/0167-8191(86)90014-1openalex-snapshot
Computational models and task scheduling for parallel sparse Cholesky factorization
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/0956-0521(95)00033-xopenalex-snapshot
Porting industrial codes and developing sparse linear solvers on parallel computers
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/j.anucene.2020.107976openalex-snapshot
Study on algorithms for solving depletion sparse matrix based on DESCAR module
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00401-5openalex-snapshot
The impact of high-performance computing in the solution of linear systems: trends and problems
inferred← citeshttps://doi.org/10.1093/oso/9780198500148.003.0002openalex-snapshot
Sparse Numerical Linear Algebra: Direct Methods and Preconditioning
inferred← citeshttps://doi.org/10.1109/icpp.1993.117openalex-snapshot
Minimum Completion Time Criterion for Parallel Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/0611010openalex-snapshot
The Role of Elimination Trees in Sparse Factorization
inferred← citeshttps://doi.org/10.1137/0907081openalex-snapshot
On General Row Merging Schemes for Sparse Givens Transformations
inferred← citeshttps://doi.org/10.1137/0908053openalex-snapshot
An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme
inferred← citeshttps://doi.org/10.1137/0909021openalex-snapshot
Sparse Cholesky Factorization on a Local-Memory Multiprocessor
inferred← citeshttps://doi.org/10.1137/1034004openalex-snapshot
The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
inferred← citeshttps://doi.org/10.1145/103147.103159openalex-snapshot
A generalized envelope method for sparse factorization by rows
inferred← citeshttps://doi.org/10.1145/275323.275327openalex-snapshot
Level 3 basic linear algebra subprograms for sparse matrices
inferred← citeshttps://doi.org/10.1145/36318.36319openalex-snapshot
A proposal for a set of level 3 basic linear algebra subprograms
inferred← citeshttps://doi.org/10.1145/567806.567810openalex-snapshot
An overview of the sparse basic linear algebra subprograms
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.1145/76909.76910openalex-snapshot
The influence of relaxed supernode partitions on the multifrontal method
inferred← citeshttps://doi.org/10.1145/76909.76911openalex-snapshot
The multifrontal method and paging in sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1145/77626.79170openalex-snapshot
A set of level 3 basic linear algebra subprograms
inferred← citeshttps://doi.org/10.1177/10943420020160020401openalex-snapshot
3 Sparse Blas
inferred← citeshttps://doi.org/10.1201/b11644-3openalex-snapshot
Combinatorial Problems in Solving Linear Systems
inferred← citeshttps://doi.org/10.3792/pjaa.98.015openalex-snapshot
On the tree-depth and tree-width in heterogeneous random graphs
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93306openalex-snapshot
A framework for efficient execution of matrix computations
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.