• Corpus ID: 3700110

Solving for a Single Component of the Solution to a Linear System, Asynchronously

  title={Solving for a Single Component of the Solution to a Linear System, Asynchronously},
  author={Christina E. Lee and Asuman E. Ozdaglar and Devavrat Shah},
We present synchronous and asynchronous randomized variants of an algorithm for approximating a single component of the solution to a system of linear equations Ax = b, where A is a positive definite real matrix and b ∈ R. This can equivalently be formulated as solving for xi in x = Gx+ z for some G and z such that the spectral radius of G is less than 1. We consider the setting where n is large, yet G is sparse, i.e., each row has at most d nonzero entries. Our algorithm relies on the Neumann… 
A continuous-time distributed algorithm for solving linear equations
It is shown that for any static strongly connected graph, the algorithm causes all agents' estimates to asymptotically converge to different values, and therefore enables the agents to detect the no-solution case distributively.
Locally-synchronous, iterative solver for Fourier-based homogenization
The linear system’s properties and the advantages as well as drawbacks of the presented homogenization approach are discussed, and a synchronous and local iterative method is proposed that is capable to efficiently compute only a single component of the solution vector.
O C ] 2 1 Se p 20 15 Locality in Network Optimization
We develop the first results on the local sensitivity analysis for the solution of a broad class of equality-constrained convex network optimization problems when perturbations are made on the
Locality in Network Optimization
This work proposes a general notion of correlation among variables in optimization procedures that is based on the sensitivity of optimal points upon (possibly finite) perturbations, and presents a canonical instance in network optimization (the min-cost network flow problem) that exhibits locality.


Stochastic iterative projection methods for large linear systems
A randomized version of the projection methods belonging to the class of a “row-action” methods which work well both for systems with quadratic nonsingular matrices and for overdetermined systems that is an extremely efficient Random Walk algorithm whose convergence is exponential, and the cost does not depend on the dimension of the matrix.
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
A simple combinatorial algorithm that solves symmetric diagonally dominant (SDD) linear systems in nearly-linear time and has the fastest known running time under the standard unit-cost RAM model.
Stabilization of Stochastic Iterative Methods for Singular and Nearly Singular Linear Systems
This work introduces additional conditions and novel algorithmic stabilization schemes under which {xk} converges to a solution when A is singular and may also be used with substantial benefitWhen A is nearly singular.
Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method
This work develops efficient stochastic algorithms based on a probabilistic sampling of small size sub-matrices, or a randomized evaluation of a matrix-vector product and matrix iterations via a random sparsification of the matrix, for solving large systems of linear algebraic equations.
Sequential monte carlo techniques for the solution of linear systems
AbstractGiven alinear system Ax=b, wherex is anm-vector,direct numerical methods, such as Gaussian elimination, take timeO(m3) to findx. Iterative numerical methods, such as the Gauss-Seidel method
A Randomized Kaczmarz Algorithm with Exponential Convergence
The Kaczmarz method for solving linear systems of equations is an iterative algorithm that has found many applications ranging from computer tomography to digital signal processing. Despite the
A Nearly-m log n Time Solver for SDD Linear Systems
An algorithm of independent interest is presented that constructs nearly-tight low-stretch spanning trees in time Otiled (mlog n), a factor of O (log n) faster than the algorithm in [Abraham,Bartal,Neiman, FOCS 2008].
Stochastic Algorithms in Linear Algebra - beyond the Markov Chains and von Neumann - Ulam Scheme
New randomized solvers for large systems of linear equations, randomized singular value (SVD) decomposition for large matrices and their use for solving inverse problems, and stochastic simulation of random fields are presented.
Convergence Analysis of Markov Chain Monte Carlo Linear Solvers Using Ulam-von Neumann Algorithm
The convergence of Markov chain--based Monte Carlo linear solvers using the Ulam--von Neumann algorithm for a linear system of the form x = Hx + b is investigated and it is shown that there always exist certain transition matrices that guarantee convergence of Monte Carlo solvers.
Matrix inversion by a Monte Carlo method
The following unusual method of inverting a class of matrices was devised by J. von Neumann and S. M. Ulam. Since it appears not to be in print, an exposition may be of interest to readers of MTAC.