Efficient algorithms for solving systems of linear equations and path problems

DOI10.1007/3-540-55210-3_177MaRDI QIDQ5096775zbMATH OpenOpenAlexFDO

Authors V. Radhakrishnan, R. E. Stearns, H. B. III Hunt

Publication date 18 August 2022

Published in STACS 92 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55210-3_177

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40)

Recommendations

• Efficient solution of linear systems of equations with recursive structure
• Fast and efficient solution of path algebra problems
• An algorithmic approach to linear systems
• Stable and Efficient Algorithms for Structured Systems of Linear Equations
• scientific article; zbMATH DE number 4215257
• An efficient algorithm for solving system of nonlinear equations
• Algorithms for structured linear systems solving and their implementation
• scientific article; zbMATH DE number 3968322
• scientific article; zbMATH DE number 3883605

Cites work

• Algebraic structures for transitive closure
• Applications of a Planar Separator Theorem
• Complexity of Finding Embeddings in a k-Tree
• Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
• Fast Algorithms for Solving Path Problems
• Generalized Nested Dissection
• Graph minors. II. Algorithmic aspects of tree-width
• scientific article; zbMATH DE number 3989126 (Why is no real title available?)
• scientific article; zbMATH DE number 4060712 (Why is no real title available?)
• scientific article; zbMATH DE number 4081531 (Why is no real title available?)
• scientific article; zbMATH DE number 45805 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3603173 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 512601 (Why is no real title available?)
• scientific article; zbMATH DE number 3420184 (Why is no real title available?)
• Linear-time computation of optimal subgraphs of decomposable graphs
• Parallel nested dissection for path algebra computations
• Partitioning, tearing and modification of sparse linear systems
• Power indices and easier hard problems
• Regular Algebra Applied to Path-finding Problems
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems

Cited in

(7)

• Unified all-pairs shortest path algorithms in the chordal hierarchy
• Linear-time LUP decomposition of forest-like matrices
• A family of efficient regular arrays for algebraic path problem
• Dynamic algorithms for graphs of bounded treewidth
• On Linear Recognition of Tree-Width at Most Four
• Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
• Fast Gaussian elimination for low treewidth matrices

This page was built for publication: Efficient algorithms for solving systems of linear equations and path problems

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