In this paper, disturbed sparse linear equations over the 0-1 finite field are considered. Due to the special structure of the problem, the standard alternating coordinate method can be implemented in such a way to yi...In this paper, disturbed sparse linear equations over the 0-1 finite field are considered. Due to the special structure of the problem, the standard alternating coordinate method can be implemented in such a way to yield a fast and efficient algorithm. Our alternating coordinate algorithm makes use of the sparsity of the coefficient matrix and the current residuals of the equations. Some hybrid techniques such as random restarts and genetic crossovers are also applied to improve our algorithm.展开更多
文摘In this paper, disturbed sparse linear equations over the 0-1 finite field are considered. Due to the special structure of the problem, the standard alternating coordinate method can be implemented in such a way to yield a fast and efficient algorithm. Our alternating coordinate algorithm makes use of the sparsity of the coefficient matrix and the current residuals of the equations. Some hybrid techniques such as random restarts and genetic crossovers are also applied to improve our algorithm.
