In this paper we propose three iterative greedy algorithms for compressed sensing, called iterative alternating direction (IAD), normalized iterative alternating direction (NIAD) and alternating direction pursuit (ADP), which stem from the iteration steps of alternating direction method of multiplier (ADMM) for `0-regularized least squares (`0-LS) and can be considered as the alternating direct...

A . This report analyzes the long time stability of four methods for non-iterative, sub-physics, uncoupling for the evolutionary Stokes-Darcy problem. The four methods uncouple each time step into separate Stokes and Darcy solves using ideas from splitting methods. Three methods uncouple sequentially while one is a parallel uncoupling method. We prove long time stability of four splitting based...

This paper investigates an error covariance matrix splitting technique for multiuser multiple input and multiple output (MIMO) interference downlink channel. Most of the related work has thus far considered the traditional error covariance matrix which has not been well-shaped for maximizing the system capacity. Thus, we split and propose a new iterative error covariance matrix to mitigate the ...

Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse system or others with particular structure. And most are based on parallel implementation of the classical relaxation methods such as Gauss-Seidel, SOR, and AOR methods carried efficiently on multiprcessor systems. In thi...

A framework is developed for a robust and highly accurate numerical solution of the coupled Stokes-Darcy system in three dimensions. The domain decomposition method based on Dirichlet-Neumann type splitting interface conditions solving separate Stokes Darcy problems iteratively. Second kind boundary integral equations are formulated each problem. use smoothing kernels that achieves high accurac...