2,580 research outputs found
Zero attracting recursive least squares algorithms
The l1-norm sparsity constraint is a widely used
technique for constructing sparse models. In this contribution, two zero-attracting recursive least squares algorithms, referred to as ZA-RLS-I and ZA-RLS-II, are derived by employing the l1-norm of parameter vector constraint to facilitate the model sparsity. In order to achieve a closed-form solution, the l1-norm of the parameter vector is approximated by an adaptively weighted l2-norm, in which the weighting factors are set as the inversion of the associated l1-norm of parameter estimates that are readily available in the adaptive learning environment. ZA-RLS-II is computationally more efficient than ZA-RLS-I by exploiting the known results from linear algebra as well as the sparsity of the
system. The proposed algorithms are proven to converge, and adaptive sparse channel estimation is used to demonstrate the effectiveness of the proposed approach
Proof of Convergence and Performance Analysis for Sparse Recovery via Zero-point Attracting Projection
A recursive algorithm named Zero-point Attracting Projection (ZAP) is
proposed recently for sparse signal reconstruction. Compared with the reference
algorithms, ZAP demonstrates rather good performance in recovery precision and
robustness. However, any theoretical analysis about the mentioned algorithm,
even a proof on its convergence, is not available. In this work, a strict proof
on the convergence of ZAP is provided and the condition of convergence is put
forward. Based on the theoretical analysis, it is further proved that ZAP is
non-biased and can approach the sparse solution to any extent, with the proper
choice of step-size. Furthermore, the case of inaccurate measurements in noisy
scenario is also discussed. It is proved that disturbance power linearly
reduces the recovery precision, which is predictable but not preventable. The
reconstruction deviation of -compressible signal is also provided. Finally,
numerical simulations are performed to verify the theoretical analysis.Comment: 29 pages, 6 figure
Coarse Projective kMC Integration: Forward/Reverse Initial and Boundary Value Problems
In "equation-free" multiscale computation a dynamic model is given at a fine,
microscopic level; yet we believe that its coarse-grained, macroscopic dynamics
can be described by closed equations involving only coarse variables. These
variables are typically various low-order moments of the distributions evolved
through the microscopic model. We consider the problem of integrating these
unavailable equations by acting directly on kinetic Monte Carlo microscopic
simulators, thus circumventing their derivation in closed form. In particular,
we use projective multi-step integration to solve the coarse initial value
problem forward in time as well as backward in time (under certain conditions).
Macroscopic trajectories are thus traced back to unstable, source-type, and
even sometimes saddle-like stationary points, even though the microscopic
simulator only evolves forward in time. We also demonstrate the use of such
projective integrators in a shooting boundary value problem formulation for the
computation of "coarse limit cycles" of the macroscopic behavior, and the
approximation of their stability through estimates of the leading "coarse
Floquet multipliers".Comment: Submitted to Journal of Computational Physic
- …