Computing the block triangular form of a sparse matrix
From MaRDI portal
Publication:4371656
DOI10.1145/98267.98287zbMath0900.65117OpenAlexW2093992309MaRDI QIDQ4371656
Publication date: 9 February 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1990-16/
Related Items
Updating preconditioners for modified least squares problems ⋮ A clustering heuristic to detect staircase structures in large scale linear programming models ⋮ A distance constrained synaptic plasticity model of \textit{C. elegans} neuronal network ⋮ A geometric framework for sparse matrix problems ⋮ Exploiting Block Triangular form for Solving DAEs: Reducing the Number of Initial Values ⋮ First-order chemical reaction networks. I: Theoretical considerations ⋮ Using domain decomposition to find graph bisectors ⋮ Patterns that preserve sparsity in orthogonal factorization ⋮ On the row merge tree for sparse LU factorization with partial pivoting ⋮ A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations ⋮ On bounded block decomposition problems for under-specified systems of equations ⋮ Unnamed Item ⋮ Constrained Min-Cut Replication for K-Way Hypergraph Partitioning ⋮ A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs ⋮ A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs ⋮ Local null controllability of the three-dimensional Navier-Stokes system with a distributed control having two vanishing components ⋮ Efficient index reduction algorithm for large scale systems of differential algebraic equations ⋮ Matchings, covers, and Jacobian matrices ⋮ An efficient method for determining fault isolability properties based on an augmented system model ⋮ Index reduction of differential algebraic equations by differential Dixon resultant ⋮ A survey of direct methods for sparse linear systems ⋮ A manifold-based approach to sparse global constraint satisfaction problems ⋮ A Method for Sensor Placement Taking into Account Diagnosability Criteria ⋮ From structural analysis to observer-based residual generation for fault detection ⋮ Diagnosis of Partially Observed Petri Net Based on Analytical Redundancy Relationships ⋮ Preconditioners for rank deficient least squares problems ⋮ A \(2/3\)-approximation algorithm for vertex-weighted matching ⋮ Scaling matrices and counting the perfect matchings in graphs ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Controllability of Coupled Parabolic Systems with Multiple Underactuations, Part 1: Algebraic Solvability ⋮ An ADMM-based interior-point method for large-scale linear programming ⋮ DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY ⋮ Distributed algebraic tearing and interconnecting techniques ⋮ Predicting the structure of sparse orthogonal factors ⋮ DAESA—A Matlab Tool for Structural Analysis of Differential-Algebraic Equations
This page was built for publication: Computing the block triangular form of a sparse matrix
