The following pages link to COLAMD (Q12913):
Displayed 32 items.
- Factoring matrices with a tree-structured sparsity pattern (Q551257) (← links)
- Decompositional analysis of Kronecker structured Markov chains (Q836811) (← links)
- Wavelet solvers for \(hp\)-FEM discretizations in 3D using hexahedral elements (Q1008910) (← links)
- A numerical model of stress driven grain boundary diffusion. (Q1418699) (← links)
- Block SOR for Kronecker structured representations (Q1434413) (← links)
- A mathematical model for the simulation of the contraction of burns (Q2014346) (← links)
- A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← links)
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria (Q2088964) (← links)
- Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry (Q2123853) (← links)
- A sparse proximal implementation of the LP dual active set algorithm (Q2465650) (← links)
- Dual multilevel optimization (Q2465655) (← links)
- Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach (Q2818203) (← links)
- A regularization method for the reconstruction of adsorption isotherms in liquid chromatography (Q2832561) (← links)
- Analyzing Markov Chains using Kronecker Products (Q2888773) (← links)
- Sparse Matrix Methods for Circuit Simulation Problems (Q2902757) (← links)
- Localized spectrum slicing (Q2981780) (← links)
- Algorithm 907 (Q2989122) (← links)
- Algorithm 930 (Q3189692) (← links)
- Characterizing Marginalization and Incremental Operations on the Bayes Tree (Q3381968) (← links)
- Parallel unsymmetric-pattern multifrontal sparse LU with column preordering (Q3549224) (← links)
- Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers (Q3600008) (← links)
- Combinatorial Aspects in Sparse Elimination Methods (Q3603887) (← links)
- Algorithm 980 (Q4581376) (← links)
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting (Q4610132) (← links)
- System Level Aspects for Single Cell Scenarios (Q4687412) (← links)
- (Q4814503) (← links)
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work (Q5232110) (← links)
- Block SOR Preconditioned Projection Methods for Kronecker Structured Markovian Representations (Q5318302) (← links)
- A column pre-ordering strategy for the unsymmetric-pattern multifrontal method (Q5461191) (← links)
- Generalized Rybicki Press algorithm (Q5739744) (← links)
- Efficient Preconditioning for Time Fractional Diffusion Inverse Source Problems (Q5854653) (← links)
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization (Q5883713) (← links)