Article

Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems

SIAM Journal on Matrix Analysis and Applications (Impact Factor: 1.81). 07/2006; DOI: 10.1137/090771430
Source: arXiv

ABSTRACT We present a randomized algorithm that, on input a symmetric, weakly
diagonally dominant n-by-n matrix A with m nonzero entries and an n-vector b,
produces a y such that $\norm{y - \pinv{A} b}_{A} \leq \epsilon \norm{\pinv{A}
b}_{A}$ in expected time $O (m \log^{c}n \log (1/\epsilon)),$ for some constant
c. By applying this algorithm inside the inverse power method, we compute
approximate Fiedler vectors in a similar amount of time. The algorithm applies
subgraph preconditioners in a recursive fashion. These preconditioners improve
upon the subgraph preconditioners first introduced by Vaidya (1990).
For any symmetric, weakly diagonally-dominant matrix A with non-positive
off-diagonal entries and $k \geq 1$, we construct in time $O (m \log^{c} n)$ a
preconditioner B of A with at most $2 (n - 1) + O ((m/k) \log^{39} n)$ nonzero
off-diagonal entries such that the finite generalized condition number
$\kappa_{f} (A,B)$ is at most k, for some other constant c.
In the special case when the nonzero structure of the matrix is planar the
corresponding linear system solver runs in expected time $ O (n \log^{2} n + n
\log n \ \log \log n \ \log (1/\epsilon))$.
We hope that our introduction of algorithms of low asymptotic complexity will
lead to the development of algorithms that are also fast in practice.

1 Bookmark
 · 
195 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We introduce a family of adaptive estimators on graphs, based on penalizing the $\ell_1$ norm of discrete graph differences. This generalizes the idea of trend filtering [Kim et al. (2009), Tibshirani (2014)], used for univariate nonparametric regression, to graphs. Analogous to the univariate case, graph trend filtering exhibits a level of local adaptivity unmatched by the usual $\ell_2$-based graph smoothers. It is also defined by a convex minimization problem that is readily solved (e.g., by fast ADMM or Newton algorithms). We demonstrate the merits of graph trend filtering through examples and theory.
    10/2014;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Analysis of VLSI designs and circuits often requires the construction of a small-signal equivalent impedance representation between prescribed node pairs. Examples include IR-drop calculation, electrical overstress verification, ESD protection, di/dt current rush analysis, electro-migration checks, thermal analysis and model order reduction. VLSI designs consisting of hundreds of millions (10e11) of linear circuit elements are now commonplace and thus any method which requires compute intensive calculations is difficult to apply for all the elements of the circuit. By definition, given a circuit with n elements, conventional analysis techniques have a Ω(η2) lower-bound to exhaustively enumerate all node-pairs which meet a constraint criteria. We present the first 0(nlgn + k) algorithm for answering queries of the form: ∃(x, y):((x, y) ϵ × n) ∧(Zeff (x, y) <; Z) where Zeff(x, y) is the equivalent impedance between nodes x and y, and k node-pairs meet the constraint. Calculating all node pairs for which these constraints are met is compute intensive using existing techniques, even using heuristic methods. In this paper a new technique based on method of projection using ellipsoidal norms is presented. Our proposed method employs recently discovered techniques from theoretical computer science to compute an e-approximate embedding matrix from which effective impedance of all node pairs can be estimated as easily as taking the Euclidean norm of column differences. Using computational geometry methods, existence queries can then be answered in logarithmic time. The method works for general circuits containing resistances, capacitances, and inductances.
    2014 15th International Symposium on Quality Electronic Design (ISQED); 03/2014
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We show a closer algorithmic connection between constructing cut-approximating hierarchical tree decompositions and computing approximate maximum flows in undirected graphs. This leads to the first O(m polylog(n)) time algorithms for both problems.
    11/2014;

Preview

Download
0 Downloads
Available from