COLAMD

swMATH145MaRDI QIDQ12913FDOQ12913

Author name not available (Why is that?)

Described by source

• A column approximate minimum degree ordering algorithm
• Algorithm 836

Cited In (32)

• Decompositional analysis of Kronecker structured Markov chains
• Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
• Sparse Matrix Methods for Circuit Simulation Problems
• Algorithm 907
• A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
• Factoring matrices with a tree-structured sparsity pattern
• Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry
• Block SOR for Kronecker structured representations
• Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
• Wavelet solvers for \(hp\)-FEM discretizations in 3D using hexahedral elements
• Localized spectrum slicing
• Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers
• A triangulation and fill-reducing initialization procedure for the simplex algorithm
• A numerical model of stress driven grain boundary diffusion.
• Block SOR Preconditioned Projection Methods for Kronecker Structured Markovian Representations
• Efficient Preconditioning for Time Fractional Diffusion Inverse Source Problems
• A regularization method for the reconstruction of adsorption isotherms in liquid chromatography
• A mathematical model for the simulation of the contraction of burns
• System Level Aspects for Single Cell Scenarios
• Algorithm 930
• Generalized Rybicki Press algorithm
• Characterizing Marginalization and Incremental Operations on the Bayes Tree
• A sparse proximal implementation of the LP dual active set algorithm
• Dual multilevel optimization
• Title not available (Why is that?)
• Analyzing Markov Chains using Kronecker Products
• Exploiting chordal structure in polynomial ideals: a Gröbner bases approach
• \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria
• Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work
• Algorithm 980
• Combinatorial Aspects in Sparse Elimination Methods
• Parallel unsymmetric-pattern multifrontal sparse LU with column preordering

This page was built for software: COLAMD