DeepAI AI Chat
Log In Sign Up

A Fast Minimum Degree Algorithm and Matching Lower Bound

07/28/2019
by   Robert Cummings, et al.
University of Waterloo
Georgia Institute of Technology
0

The minimum degree algorithm is one of the most widely-used heuristics for reducing the cost of solving large sparse systems of linear equations. It has been studied for nearly half a century and has rich history of bridging techniques from data structures, graph algorithms, and direct methods in scientific computing. We present a simple but novel combinatorial algorithm for computing minimum degree elimination orderings in O(nm) time that relies on a careful amortized analysis. Furthermore, we show that there cannot exist an algorithm for this problem that runs in O(nm^1-ε) time, for any ε > 0, assuming the strong exponential time hypothesis.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/22/2017

On Computing Min-Degree Elimination Orderings

We study faster algorithms for producing the minimum degree ordering use...
04/11/2018

Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm

Motivated by the study of matrix elimination orderings in combinatorial ...
03/16/2023

Minimum L_∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee's Measure Problem

We present a (combinatorial) algorithm with running time close to O(n^d)...
04/01/2023

L is unequal NL under the Strong Exponential Time Hypothesis

Due to Savitch's theorem we know NL⊆ DSPACE(log^2(n)). To show this uppe...
05/08/2021

Fast Neighborhood Rendezvous

In the rendezvous problem, two computing entities (called agents) locate...
05/02/2023

Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality

Seminal results establish that the coverability problem for Vector Addit...