Article

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

• ##### Shang-Hua Teng
SIAM Journal on Matrix Analysis and Applications (Impact Factor: 1.34). 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
• Source
##### Article: Approximate Spectral Clustering via Randomized Sketching
[Hide abstract]
ABSTRACT: Spectral clustering is arguably one of the most important algorithms in data mining and machine intelligence; however, its computational complexity makes challenging to use in large scale data analysis. Recently, several approximation algorithms for spectral clustering have been developed in order to alleviate the relevant costs, but theoretical results are lacking. In this paper, we present an approximation algorithm for spectral clustering with strong theoretical evidence of its performance. Our algorithm is based on approximating the eigenvectors of the Laplacian matrix using random projections, a.k.a randomized sketching. Our experimental results demonstrate that the proposed approximation algorithm compares remarkably well to the exact algorithm.
11/2013;
• Source
##### Article: An Efficient Parallel Solver for SDD Linear Systems
[Hide abstract]
ABSTRACT: We present the first parallel algorithm for solving systems of linear equations in symmetric, diagonally dominant (SDD) matrices that runs in polylogarithmic time and nearly-linear work. The heart of our algorithm is a construction of a sparse approximate inverse chain for the input matrix: a sequence of sparse matrices whose product approximates its inverse. Whereas other fast algorithms for solving systems of equations in SDD matrices exploit low-stretch spanning trees, our algorithm only requires spectral graph sparsifiers.
11/2013;
• ##### Article: Experimental Realization of Efficient, Room Temperature Single-Photon Sources with Definite Circular and Linear Polarizations
[Hide abstract]
ABSTRACT: In this thesis I present experimental demonstrations of room-temperature, single-photon sources with definite linear and circular polarizations. Definite photon polarization increases the efficiency of quantum communication systems. In contrast with cryogenic-temperature single-photon sources based on epitaxial quantum dots requiring expensive MBE and nanofabrication, my method utilizes a mature liquid crystal technology, which I made consistent with single-emitter fluorescence microscopy. The structures I have prepared are planar-aligned cholesteric liquid crystals forming 1-D photonic bandgaps for circularly-polarized light, which were used to achieve definite circularly-polarized fluorescence of single emitters doped in this environment. I also used planar-aligned nematic liquid crystals to align single molecules with linear dipole moments and achieved definite linearly-polarized fluorescence. I used single nanocrystal quantum dots, single nanodiamond color-centers, rare-earth-doped nanocrystals, and single terrylene and DiIC18(3) dye molecules as emitters. For nanocrystal quantum dots I observed circular polarization dissymmetry factors as large as ge = --1.6. In addition, I observed circularly-polarized resonances in the fluorescence of emitters within a cholesteric microcavity, with cavity quality factors of up to Q ˜ 250. I also showed that the fluorescence of DiIC18(3) dye molecules in planar-aligned nematic cells exhibits definite linear polarization, with a degree of polarization of rho = --0.58 +/- 0.03. Distributed Bragg reflectors form another type of microcavity that can be used to realize a single-photon source. I characterized the fluorescence from nanocrystal quantum dots doped in the defect layers of such microcavites, both organic and inorganic. Finally, to demonstrate the single-photon properties of single-emitter-doped cholesteric and nematic liquid crystal structures and distributed Bragg reflector microcavities, I present observations of photon antibunching from emitters doped in each of these structures. These experimental observations include photon antibunching from: nanocrystal quantum dots and nanodiamond color-centers doped in a cholesteric microcavity; terrylene and DiIC 18(3) dye molecules doped in nematic structures, and nanocrystal quantum dots doped in the distributed Bragg reflector microcavity. A value of the zero-time second-order coherence as low as g(2)(0) = 0.001 +/- 0.03 was measured. These results represent an important step forward in the realization of room temperature single-photon sources with definite polarization for secure quantum communication.
01/2011;