Linear-time LUP decomposition of forest-like matrices

DOI10.1016/S0898-1221(99)00124-8zbMATH Open0939.65042OpenAlexW1982758516MaRDI QIDQ1963040FDOQ1963040

Authors: Vilmar Trevisan, David P. Jacobs 

Publication date: 20 January 2000

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(99)00124-8

Recommendations

• Computing the inverse of a tree's incidence matrix
• Reducing the adjacency matrix of a tree
• An Almost Linear-Time Algorithm for Graph Realization
• Efficient algorithms for solving systems of linear equations and path problems
• An \(O(n^ 2)\) simplex algorithm for a class of linear programs with tree structure

zbMATH Keywords

matrix decompositionlinear-time algorithmforest-like matricesLUP decomposition

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Factorization of matrices (15A23)

Cites Work

• Title not available (Why is that?)
• Reducing the adjacency matrix of a tree
• The determinant of a tree's neighborhood matrix
• Integer LU-factorizations
• Title not available (Why is that?)

This page was built for publication: Linear-time LUP decomposition of forest-like matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963040)