On the public citation graph

The Role of Elimination Trees in Sparse Factorization

https://doi.org/10.1137/0611010
0 signed · 530 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.1620180804openalex-snapshot
Yale sparse matrix package I: The symmetric codes
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_14openalex-snapshot
Efficiency of Equivalence Algorithms
inferredcites →https://doi.org/10.1007/bf01396660openalex-snapshot
The analysis of a nested dissection algorithm
inferredcites →https://doi.org/10.1007/bfb0093150openalex-snapshot
Full matrix techniques in sparse Gaussian elimination
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.1016/0024-3795(80)90159-7openalex-snapshot
Solution of sparse linear least squares problems using givens rotations
inferredcites →https://doi.org/10.1016/0024-3795(87)90111-xopenalex-snapshot
Householder reflections versus givens rotations in sparse orthogonal decomposition
inferredcites →https://doi.org/10.1016/0045-7949(80)90066-8openalex-snapshot
Algorithms and software for in-core factorization of sparse symmetric positive definite matrices
inferredcites →https://doi.org/10.1016/0095-8956(74)90094-xopenalex-snapshot
The intersection graphs of subtrees in trees are exactly the chordal graphs
inferredcites →https://doi.org/10.1016/0167-8191(86)90014-1openalex-snapshot
Computational models and task scheduling for parallel sparse Cholesky factorization
inferredcites →https://doi.org/10.1016/0167-8191(86)90019-0openalex-snapshot
Parallel implementation of multifrontal schemes
inferredcites →https://doi.org/10.1016/0167-8191(89)90064-1openalex-snapshot
Reordering sparse matrices for parallel elimination
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50010-6openalex-snapshot
Applications of an Element Model for Gaussian Elimination11This work was supported in part by NSF Grant GJ-43157 and ONR Grant N00014-67-A-0097-0016.
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50018-0openalex-snapshot
A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1038/scientificamerican0984-60openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1090/s0025-5718-1977-0428694-0openalex-snapshot
Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
inferredcites →https://doi.org/10.1093/imanum/3.1.37openalex-snapshot
A Note on the Work Involved in No-fill Sparse Matrix Factorization
inferredcites →https://doi.org/10.1109/tc.1982.1675979openalex-snapshot
A Data Structure for Parallel L/U Decomposition
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0202012openalex-snapshot
Dividing a Graph into Triconnected Components
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0209044openalex-snapshot
An Optimal Agorithm for Symbolic Factorization of Symmetric Matrices
inferredcites →https://doi.org/10.1137/0213035openalex-snapshot
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
inferredcites →https://doi.org/10.1137/0402011openalex-snapshot
A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs
inferredcites →https://doi.org/10.1137/0605032openalex-snapshot
A Separator Theorem for Chordal Graphs
inferredcites →https://doi.org/10.1137/0609003openalex-snapshot
A Tree Model for Sparse Symmetric Indefinite Matrix Factorization
inferredcites →https://doi.org/10.1137/0710032openalex-snapshot
Nested Dissection of a Regular Finite Element Mesh
inferredcites →https://doi.org/10.1137/0902019openalex-snapshot
Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination
inferredcites →https://doi.org/10.1137/0906028openalex-snapshot
An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
inferredcites →https://doi.org/10.1137/0907081openalex-snapshot
On General Row Merging Schemes for Sparse Givens Transformations
inferredcites →https://doi.org/10.1137/0908052openalex-snapshot
General Sparse Elimination Requires No Permanent Integer Storage
inferredcites →https://doi.org/10.1137/0908053openalex-snapshot
An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme
inferredcites →https://doi.org/10.1137/0908072openalex-snapshot
Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
inferredcites →https://doi.org/10.1137/0908087openalex-snapshot
A Note on Sparse Factorization in a Paging Environment
inferredcites →https://doi.org/10.1137/0909008openalex-snapshot
A Data Structure for Sparse $QR$ and $LU$ Factorizations
inferredcites →https://doi.org/10.1137/0909021openalex-snapshot
Sparse Cholesky Factorization on a Local-Memory Multiprocessor
inferredcites →https://doi.org/10.1137/0909029openalex-snapshot
Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/356004.356006openalex-snapshot
A New Implementation of Sparse Gaussian Elimination
inferredcites →https://doi.org/10.1145/356044.356047openalex-snapshot
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
inferredcites →https://doi.org/10.1145/6497.6499openalex-snapshot
A compact row storage scheme for Cholesky factors using elimination trees
inferredcites →https://doi.org/10.1145/66888.66890openalex-snapshot
A graph partitioning algorithm by node separators
inferredcites →https://doi.org/10.1145/7921.11325openalex-snapshot
On the storage requirement in the out-of-core multifrontal method for sparse factorization
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.
inferredcites →https://doi.org/10.2307/2008670openalex-snapshot
Direct Methods for Sparse Matrices.

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4684496openalex-extracted
Fully Parallel and Pipelined Sparse Direct Solver for Large Symmetric Indefinite Finite Element Problems
inferred← citeshttps://doi.org/10.2139/ssrn.4814522openalex-extracted
Fully Parallel and Pipelined Sparse Direct Solver for Large Symmetric Indefinite Finite Element Problems
inferred← citeshttps://doi.org/10.1002/(sici)1096-9128(200002/03)12:2/3<53::aid-cpe473>3.0.co;2-bopenalex-snapshot
Towards a scalable hybrid sparse solver
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/1099-047x(200101)11:1<38::aid-mmce5>3.0.co;2-4openalex-snapshot
Parallel electromagnetic modeling of 3D microstrip discontinuities using FEM and PML
inferred← citeshttps://doi.org/10.1002/1099-1506(200010/12)7:7/8<649::aid-nla217>3.0.co;2-wopenalex-snapshot
A parallel linear system solver for circuit simulation problems
inferred← citeshttps://doi.org/10.1002/cpe.3158openalex-snapshot
Supernodal sparse Cholesky factorization on graphics processing units
inferred← citeshttps://doi.org/10.1002/cpe.7842openalex-snapshot
Mapping tree‐shaped workflows on systems with different memory sizes and processor speeds
inferred← citeshttps://doi.org/10.1002/cpe.959openalex-snapshot
A study into the feasibility of using two parallel sparse direct solvers for the Helmholtz equation on Linux clusters
inferred← citeshttps://doi.org/10.1002/gamm.201490037openalex-snapshot
Combinatorial Aspects in Sparse Elimination Methods
inferred← citeshttps://doi.org/10.1002/mmce.10094openalex-snapshot
Analysis of 3D ferrite-loaded waveguide discontinuity problems
inferred← citeshttps://doi.org/10.1002/mop.1256openalex-snapshot
A convenient and general approach for analyzing NRD‐guide leaky‐wave antennas
inferred← citeshttps://doi.org/10.1002/nag.384openalex-snapshot
ParCYCLIC: finite element modelling of earthquake liquefaction response on parallel computers
inferred← citeshttps://doi.org/10.1002/nla.1810openalex-snapshot
An efficient analyse phase for element problems
inferred← citeshttps://doi.org/10.1002/nla.691openalex-snapshot
Fast algorithms for hierarchically semiseparable matrices
inferred← citeshttps://doi.org/10.1002/nme.1620281010openalex-snapshot
On updating the structure of sparse matrix factors
inferred← citeshttps://doi.org/10.1002/nme.2239openalex-snapshot
An evaluation of limited‐memory sparse linear solvers for thermo‐mechanical applications
inferred← citeshttps://doi.org/10.1006/jagm.1995.1035openalex-snapshot
Optimal Partitioning of Sequences
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/10692760_8openalex-snapshot
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking
inferred← citeshttps://doi.org/10.1007/11428831_31openalex-snapshot
Multi-pass Mapping Schemes for Parallel Sparse Matrix Computations
inferred← citeshttps://doi.org/10.1007/11558958_76openalex-snapshot
Parallel Hybrid Sparse Solvers Through Flexible Incomplete Cholesky Preconditioning
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-19487-8_17openalex-snapshot
Parallel solution of sparse linear systems
inferred← citeshttps://doi.org/10.1007/3-540-47840-x_11openalex-snapshot
A Framework for Efficient Sparse LU Factorization in a Cluster Based Platform
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_149openalex-snapshot
Scheduling of Algorithms Based on Elimination Trees on NUMA Systems
inferred← citeshttps://doi.org/10.1007/3-540-55895-0_424openalex-snapshot
Partitioning and mapping for parallel nested dissection on distributed memory architectures
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_187openalex-snapshot
On vertex ranking for permutation and other graphs
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_56openalex-snapshot
Rankings of graphs
inferred← citeshttps://doi.org/10.1007/3-540-60321-2_22openalex-snapshot
A reconfigurable parallel algorithm for sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1007/3-540-60609-2_37openalex-snapshot
On the efficiency of superscalar and vector computer for some problems in scientific computing
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_152openalex-snapshot
Fast separator decomposition for finite element meshes
inferred← citeshttps://doi.org/10.1007/3-540-63138-0_22openalex-snapshot
Parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1007/978-0-585-26778-4_6openalex-snapshot
Sparse Linear Least Squares Problems in Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4612-1516-5_11openalex-snapshot
Coarsening, Sampling, and Smoothing: Elements of the Multilevel Method
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_1openalex-snapshot
An Introduction to Chordal Graphs and Clique Trees
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_10openalex-snapshot
Sparse Matrix Factorization on SIMD Parallel Computers
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_2openalex-snapshot
Cutting down on Fill Using Nested Dissection: Provably Good Elimination Orderings
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_6openalex-snapshot
Predicting Structure in Nonsymmetric Sparse Matrix Factorizations
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_7openalex-snapshot
Highly Parallel Sparse Triangular Solution
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_8openalex-snapshot
The Fan-Both Family of Column-Based Distributed Cholesky Factorization Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4615-5205-5_1openalex-snapshot
PSPASES: Building a High Performance Scalable Parallel Direct Solver for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-43736-7_1openalex-snapshot
State-of-the-Art Sparse Direct Solvers
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_28openalex-snapshot
MaxSAT-Based Postprocessing for Treedepth
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_7openalex-snapshot
The Complexity of Bicriteria Tree-Depth
inferred← citeshttps://doi.org/10.1007/978-3-030-89698-0_21openalex-snapshot
A Left-Looking Sparse Cholesky Parallel Algorithm for Shared Memory Multiprocessors
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-031-25820-6_5openalex-snapshot
Sparse Cholesky Solver: The Factorization Phase
inferred← citeshttps://doi.org/10.1007/978-3-031-25820-6_6openalex-snapshot
Sparse LU Factorizations
inferred← citeshttps://doi.org/10.1007/978-3-031-31209-0_12openalex-snapshot
Mapping Tree-Shaped Workflows on Memory-Heterogeneous Architectures
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_1openalex-snapshot
Approximation Algorithms for Treewidth, Pathwidth, and Treedepth—A Short Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-05089-8_1openalex-snapshot
Direct Methods for Linear Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-05089-8_2openalex-snapshot
Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-43659-3_49openalex-snapshot
Effective Minimally-Invasive GPU Acceleration of Distributed Sparse Matrix Factorization
inferred← citeshttps://doi.org/10.1007/978-3-319-53429-9_2openalex-snapshot
Related Work
inferred← citeshttps://doi.org/10.1007/978-3-319-53429-9_4openalex-snapshot
Parallel Sparse Left-Looking Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-67792-7_28openalex-snapshot
Automatic Algorithms for the Construction of Element Partition Trees for Isogeometric Finite Element Method
inferred← citeshttps://doi.org/10.1007/978-3-540-24669-5_127openalex-snapshot
Cholesky Factorization of Matrices in Parallel and Ranking of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-34469-8_94openalex-snapshot
A Hybrid Parallel Preconditioner Using Incomplete Cholesky Factorization and Sparse Approximate Inversion
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_8openalex-snapshot
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
inferred← citeshttps://doi.org/10.1007/978-3-540-71351-7_21openalex-snapshot
Combinatorial Scientific Computing: The Enabling Power of Discrete Algorithms in Computational Science
inferred← citeshttps://doi.org/10.1007/978-3-642-01085-9_8openalex-snapshot
Graph-Based Local Elimination Algorithms in Discrete Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-03095-6_37openalex-snapshot
An On-Line Parallel Algorithm for Node Ranking of Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-04818-0_7openalex-snapshot
Algorithms for Systems of Linear Equations
inferred← citeshttps://doi.org/10.1007/978-3-642-11266-9_64openalex-snapshot
Vertex Ranking with Capacity
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_4openalex-snapshot
Ordered Coloring Grids and Related Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-12535-5_92openalex-snapshot
Factorization-Based Graph Repartitionings
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_14openalex-snapshot
Graph Unique-Maximum and Conflict-Free Colorings
inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_35openalex-snapshot
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_16openalex-snapshot
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-28145-7_23openalex-snapshot
Fine Granularity Sparse QR Factorization for Multicore Based Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-37801-0_8openalex-snapshot
Algorithms for Systems of Linear Equations
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_9openalex-snapshot
Search-Space Size in Contraction Hierarchies
inferred← citeshttps://doi.org/10.1007/978-3-642-57172-5_3openalex-snapshot
The Design of Sparse Direct Solvers using Object-Oriented Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-78123-0_25openalex-snapshot
Eine parallele Implementation des Karmarkar—Verfahrens
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_77openalex-snapshot
A Faster Parameterized Algorithm for Treedepth
inferred← citeshttps://doi.org/10.1007/978-3-662-48096-0_37openalex-snapshot
Scheduling Trees of Malleable Tasks for Sparse Linear Algebra
inferred← citeshttps://doi.org/10.1007/978-94-009-0369-2_3openalex-snapshot
Generalized and Sparse Least Squares Problems
inferred← citeshttps://doi.org/10.1007/978-94-011-5412-3_12openalex-snapshot
Graph Partitioning Algorithms with Applications to Scientific Computing
inferred← citeshttps://doi.org/10.1007/978-94-011-5412-3_3openalex-snapshot
Parallel Direct Methods for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1007/978-94-015-8196-7_56openalex-snapshot
Intermediate Fill-In in Sparse QR Decomposition
inferred← citeshttps://doi.org/10.1007/978-981-95-8405-5_6openalex-snapshot
A Structure-Aware Irregular Blocking Method for Sparse LU Factorization
inferred← citeshttps://doi.org/10.1007/bf00155801openalex-snapshot
Sparse QR factorization on a massively parallel computer
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/bf01407861openalex-snapshot
Task scheduling for parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1007/bf01934264openalex-snapshot
Finding minimum height elimination trees for interval graphs in polynomial time
inferred← citeshttps://doi.org/10.1007/bf02024486openalex-snapshot
A parallel interior point algorithm for linear programming on a network of transputers
inferred← citeshttps://doi.org/10.1007/bf02668848openalex-snapshot
Parallel finite element modeling of earthquake ground response and liquefaction
inferred← citeshttps://doi.org/10.1007/bfb0002801openalex-snapshot
Scalability of parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1007/bfb0002824openalex-snapshot
A parallel sparse LU decomposition with application to semiconductor device simulation
inferred← citeshttps://doi.org/10.1007/bfb0009493openalex-snapshot
Vertex ranking of asteroidal triple-free graphs
inferred← citeshttps://doi.org/10.1007/bfb0045088openalex-snapshot
Generalized vertex-rankings of partial k-trees
inferred← citeshttps://doi.org/10.1007/bfb0094923openalex-snapshot
Application of parallel sparse direct methods in semiconductor device and process simulation
inferred← citeshttps://doi.org/10.1007/bfb0100583openalex-snapshot
Scalable parallel sparse factorization with left-right looking strategy on shared memory multiprocessors
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/s00373-017-1824-1openalex-snapshot
$$l_p$$ l p -Optimal Rankings and Max-Optimal Rankings are Different
inferred← citeshttps://doi.org/10.1007/s00453-001-0091-xopenalex-snapshot
A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems
inferred← citeshttps://doi.org/10.1007/s00453-004-1117-yopenalex-snapshot
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
inferred← citeshttps://doi.org/10.1007/s10107-020-01516-yopenalex-snapshot
Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
inferred← citeshttps://doi.org/10.1007/s10543-007-0116-1openalex-snapshot
On the row merge tree for sparse LU factorization with partial pivoting
inferred← citeshttps://doi.org/10.1007/s10559-013-9583-3openalex-snapshot
Block Local Elimination Algorithms for Sparse Discrete Optimization Problems
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.1007/s10898-020-00973-1openalex-snapshot
Learning chordal extensions
inferred← citeshttps://doi.org/10.1007/s11227-008-0188-yopenalex-snapshot
Hypermatrix oriented supernode amalgamation
inferred← citeshttps://doi.org/10.1007/s11633-007-0088-2openalex-snapshot
A fast LDL-factorization approach for large sparse positive definite system and its application to one-to-one marketing optimization computation
inferred← citeshttps://doi.org/10.1007/s42514-025-00259-6openalex-snapshot
Qklu: a two-dimensional block-cyclic sparse direct solver
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00172-7openalex-snapshot
Generalized vertex-rankings of trees
inferred← citeshttps://doi.org/10.1016/0020-0190(95)90815-iopenalex-snapshot
Minimizing elimination tree height can increase fill more than linearly
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90248-mopenalex-snapshot
Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
inferred← citeshttps://doi.org/10.1016/0045-7949(91)90182-lopenalex-snapshot
An implementation of a generalized sparse/profile finite element solution method
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90121-xopenalex-snapshot
On constructing the elimination tree
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90104-hopenalex-snapshot
Parallel symbolic factorization of sparse linear systems
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90031-2openalex-snapshot
A parallel algorithm for elimination tree computation and symbolic factorization
inferred← citeshttps://doi.org/10.1016/0167-8191(93)90045-mopenalex-snapshot
Supernodal symbolic Cholesky factorization on a local-memory multiprocessor
inferred← citeshttps://doi.org/10.1016/0167-8191(93)90048-popenalex-snapshot
Parallel algorithms for sparse triangular system solution
inferred← citeshttps://doi.org/10.1016/0167-8191(94)00092-oopenalex-snapshot
Parallel sparse QR factorization on shared memory architectures
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-08-040806-4.50011-3openalex-snapshot
IMPLEMENTATION OF AN INTERIOR POINT LP ALGORITHM ON A SHARED-MEMORY VECTOR MULTIPROCESSOR
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/j.ascom.2013.03.002openalex-snapshot
Simultaneous analysis of large INTEGRAL/SPI11Based on observations with INTEGRAL, an ESA project with instruments and science data center funded by ESA member states (especially the PI countries: Denmark, France, Germany, Italy, Spain, and Switzerland), Czech Republic and Poland with participation…
inferred← citeshttps://doi.org/10.1016/j.camwa.2024.10.017openalex-snapshot
Fully parallel and pipelined sparse direct solver for large symmetric indefinite finite element problems
inferred← citeshttps://doi.org/10.1016/j.compfluid.2015.08.016openalex-snapshot
Free-surface film flow over topography: Full three-dimensional finite element solutions
inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.012openalex-snapshot
Finding the edge ranking number through vertex partitions
inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.031openalex-snapshot
On the tree-depth of random graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.015openalex-snapshot
The complexity of restricted star colouring
inferred← citeshttps://doi.org/10.1016/j.dam.2023.04.022openalex-snapshot
On the size of minimal separators for treedepth decomposition
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.003openalex-snapshot
Minimal triangulations of graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2015.03.008openalex-snapshot
On vertex rankings of graphs and its relatives
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.014openalex-snapshot
Forbidden graphs for tree-depth
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.041openalex-snapshot
Obstructions for Tree-depth
inferred← citeshttps://doi.org/10.1016/j.ic.2008.08.001openalex-snapshot
Optimal vertex ranking of block graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2009.03.008openalex-snapshot
Treewidth computations I. Upper bounds
inferred← citeshttps://doi.org/10.1016/j.ins.2007.02.002openalex-snapshot
Constructing a minimum height elimination tree of a tree in linear time
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.07.007openalex-snapshot
An optimal parallel algorithm for c-vertex-ranking of trees
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.12.006openalex-snapshot
Vertex rankings of chordal graphs and weighted trees
inferred← citeshttps://doi.org/10.1016/j.jcp.2010.07.027openalex-snapshot
Acoustic inverse scattering via Helmholtz operator factorization and optimization
inferred← citeshttps://doi.org/10.1016/j.jcp.2013.01.036openalex-snapshot
A fast algorithm for sparse matrix computations related to inversion
inferred← citeshttps://doi.org/10.1016/j.jda.2011.03.005openalex-snapshot
Graph unique-maximum and conflict-free colorings
inferred← citeshttps://doi.org/10.1016/j.jocs.2024.102312openalex-snapshot
A new hybrid GPU-CPU sparse LDLT factorization algorithm with GPU and CPU factorizing concurrently
inferred← citeshttps://doi.org/10.1016/j.jpdc.2026.105299openalex-snapshot
Minimizing memory in parallel task graph scheduling: Focusing on average consumption
inferred← citeshttps://doi.org/10.1016/j.parco.2003.05.010openalex-snapshot
Adapting a parallel sparse direct solver to architectures with clusters of SMPs
inferred← citeshttps://doi.org/10.1016/j.parco.2005.07.004openalex-snapshot
Hybrid scheduling for the parallel solution of linear systems
inferred← citeshttps://doi.org/10.1016/j.parco.2007.12.003openalex-snapshot
On finding approximate supernodes for an efficient block-ILU(k) factorization
inferred← citeshttps://doi.org/10.1016/j.parco.2008.03.007openalex-snapshot
A parallel out-of-core multifrontal method: Storage of factors on disk and analysis of models for an out-of-core active memory
inferred← citeshttps://doi.org/10.1016/j.parco.2009.06.001openalex-snapshot
Analysis of the solution phase of a parallel multifrontal approach
inferred← citeshttps://doi.org/10.1016/j.parco.2017.06.003openalex-snapshot
Basker: Parallel sparse LU factorization utilizing hierarchical parallelism and data layouts
inferred← citeshttps://doi.org/10.1016/j.parco.2017.11.009openalex-snapshot
PSelInv – A distributed memory parallel algorithm for selected inversion: The non-symmetric case
inferred← citeshttps://doi.org/10.1016/j.procs.2011.04.159openalex-snapshot
Interior Point Methods for the Inverse Medium Problem on Massively Parallel Architectures
inferred← citeshttps://doi.org/10.1016/j.procs.2014.05.085openalex-snapshot
Dynamic Programming Algorithm for Generation of Optimal Elimination Trees for Multi-frontal Direct Solver Over H-refined Grids
inferred← citeshttps://doi.org/10.1016/j.procs.2014.05.086openalex-snapshot
Graph Grammar based Multi-thread Multi-frontal Direct Solver with Galois Scheduler
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.038openalex-snapshot
Digraph measures: Kelly decompositions, games, and orderings
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.04.036openalex-snapshot
Ordered coloring of grids and related graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.032openalex-snapshot
The complexity of bicriteria tree-depth
inferred← citeshttps://doi.org/10.1016/j.vlsi.2023.102062openalex-snapshot
Optimized matrix ordering of sparse linear solver using a few-shot model for circuit simulation
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00262-9openalex-snapshot
On vertex ranking of a starlike graph
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00162-8openalex-snapshot
Vertex ranking of asteroidal triple-free graphs
inferred← citeshttps://doi.org/10.1016/s0024-3795(96)00473-9openalex-snapshot
Separators and Structure Prediction in Sparse Orthogonal Factorization
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00056-0openalex-snapshot
An optimal parallel algorithm for node ranking of cographs
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00179-1openalex-snapshot
On the vertex ranking problem for trapezoid, circular-arc and other graphs
inferred← citeshttps://doi.org/10.1016/s0167-739x(00)00076-5openalex-snapshot
PARDISO: a high-performance serial and parallel sparse linear solver in semiconductor device simulation
inferred← citeshttps://doi.org/10.1016/s0167-8191(01)00135-1openalex-snapshot
Two-level dynamic scheduling in PARDISO: Improved scalability on shared memory multiprocessing systems
inferred← citeshttps://doi.org/10.1016/s0167-8191(03)00099-1openalex-snapshot
Impact of reordering on the memory of a multifrontal solver
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00064-1openalex-snapshot
Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
inferred← citeshttps://doi.org/10.1016/s0168-2024(99)80012-5openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00240-6openalex-snapshot
Algorithms for generalized vertex-rankings of partial k-trees
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00399-xopenalex-snapshot
Refining an approximate inverse
inferred← citeshttps://doi.org/10.1016/s0377-0427(02)00707-0openalex-snapshot
Numerical aspects in developing LP softwares, LPAKO and LPABO
inferred← citeshttps://doi.org/10.1016/s0378-7796(02)00042-1openalex-snapshot
An on-line distributed intelligent fault section estimation system for large-scale power networks
inferred← citeshttps://doi.org/10.1016/s0898-1221(01)00279-6openalex-snapshot
LU-decomposition and numerical structure for solving large sparse nonsymmetric linear systems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)51610-9openalex-snapshot
Recursively Parallel Solution of Large Sparse Equations with Incidence-Symmetric Matrices
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.1016/s1570-8659(04)13008-1openalex-snapshot
Solution of Linear Systems
inferred← citeshttps://doi.org/10.1017/s096249290000235xopenalex-snapshot
Parallel numerical linear algebra
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1017/s0962492922000113openalex-snapshot
Linear optimization over homogeneous matrix cones
inferred← citeshttps://doi.org/10.1021/ct100618sopenalex-snapshot
Fast Sparse Cholesky Decomposition and Inversion using Nested Dissection Matrix Reordering
inferred← citeshttps://doi.org/10.1023/a:1008680131271openalex-snapshot
Sparse Linear Least Squares Problems in Optimization
inferred← citeshttps://doi.org/10.1023/a:1019122726788openalex-snapshot
Two-dimensional block partitionings for the parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1023/a:1021908421589openalex-snapshot
Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse Matrix Ordering Methods
inferred← citeshttps://doi.org/10.1023/a:1021943902025openalex-snapshot
Computing Row and Column Counts for Sparse QR and LU Factorization
inferred← citeshttps://doi.org/10.1023/a:1022326604210openalex-snapshot
Efficient Sparse LU Factorization with Left-Right Looking Strategy on Shared Memory Multiprocessors
inferred← citeshttps://doi.org/10.1049/ip-map:20040048openalex-snapshot
Analysis of waveguide-fed dielectric resonator antenna using a hybrid finite element method∕moment method
inferred← citeshttps://doi.org/10.1063/5.0085040openalex-snapshot
A novel approach to quantify ventilation heterogeneity in occluded bronchial tree based on lung admittance
inferred← citeshttps://doi.org/10.1080/00207160210940openalex-snapshot
Efficient Solution of a Sparse Non-symmetric System of Linear Equations
inferred← citeshttps://doi.org/10.1080/00207169508804403openalex-snapshot
ThewwTfactorization of dense and sparse matrices
inferred← citeshttps://doi.org/10.1080/10556788.2012.684353openalex-snapshot
Logarithmic barriers for sparse matrix cones
inferred← citeshttps://doi.org/10.1080/10556789908805757openalex-snapshot
PCx: an interior-point code for linear programming
inferred← citeshttps://doi.org/10.1080/10637190412331279957openalex-snapshot
FPGA implementation of a Cholesky algorithm for a shared-memory multiprocessor architecture
inferred← citeshttps://doi.org/10.1080/15236803.2008.12001507openalex-snapshot
A Primer for Developing a Public Agency Service Ethos of Cultural Competency in Public Services Programming and Public Services Delivery
inferred← citeshttps://doi.org/10.1088/0967-3334/33/5/787openalex-snapshot
Addressing the computational cost of large EIT solutions
inferred← citeshttps://doi.org/10.1088/1742-6596/180/1/012015openalex-snapshot
Factorization-based sparse solvers and preconditioners
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.001.0001openalex-snapshot
Direct Methods for Sparse Matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.002.0001openalex-snapshot
Glossary of Symbols
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.002.0005openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.002.0006openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0001openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0002openalex-snapshot
Sparse matrices: storage schemes and simple operations
showing the first 200 of 484 · page through all 484
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.