An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix

DOI10.1145/355780.355785zbMath0389.65019OpenAlexW2152471993MaRDI QIDQ4171509

John K. Reid, Iain S. Duff

Publication date: 1978

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/355780.355785

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Direct numerical methods for linear systems and matrix inversion (65F05) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to linear algebra (15-04) Algorithms in computer science (68W99)

Related Items (28)

Diagonal Scaling to an Orthogonal Matrix ⋮ Balancing sparse Hamiltonian eigenproblems ⋮ Sparse Matrix Methods for Circuit Simulation Problems ⋮ Fast computation of multiphase flow in porous media by implicit discontinuous Galerkin schemes with optimal ordering of elements ⋮ Iterative aggregation/disaggregation method for computing stationary probability vectors of Markov type operators ⋮ The solution of the linear complementarity problem by the matrix analogue of the accelerated overrelaxation iterative method ⋮ Counting solutions to binomial complete intersections ⋮ On the row merge tree for sparse LU factorization with partial pivoting ⋮ The dominance assignment problem ⋮ Directed graphs and variable selection in large vector autoregressive models ⋮ $hp$-Adaptive Discontinuous Galerkin Methods for Neutron Transport Criticality Problems ⋮ Adaptive partitioning techniques for ordinary differential equations ⋮ Algebraic Schwarz methods for the numerical solution of Markov chains ⋮ Bounding the equilibrium distribution of Markov population models ⋮ Physiology and pathology of iterative aggregation–disaggregation methods ⋮ Balancing sparse matrices for computing eigenvalues ⋮ A note on the decomposition of systems of sparse non-linear equations ⋮ A survey of direct methods for sparse linear systems ⋮ Aggregation/disaggregation iterative methods applied to Leontev systems and Markov chains. ⋮ Adaptive partitioning techniques for index 1 IDEs ⋮ Partitioning of relative sensing networks: a stability margin perspective ⋮ Computing transfer function zeros of a state space system ⋮ Large-scale linearly constrained optimization ⋮ Diakoptics as a general approach in engineering ⋮ Algorithms for Testing the Diagonal Similarity of Matrices and Related Problems ⋮ Comparison theorems for the convergence factor of iterative methods for singular matrices ⋮ Algorithms for solving nonlinear dynamic decision models ⋮ Convergence theory of some classes of iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices

This page was built for publication: An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix