DISTURBED SPARSE LINEAR EQUATIONS OVER THE 0-1 FINITE FIELD
DISTURBED SPARSE LINEAR EQUATIONS OVER THE 0-1 FINITE FIELD
摘要
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.
参考文献20
-
1K.M. Anstreicher, Recent advances in the solution of quadratic assignment Problems. Mathematical Programming, Ser.B, 97 (2003), 24-42.
-
2K. Anstreicher, X. Chen, H. Wolkowicz and Y. Yuan, "Strong duality for a trust-region type relaxation of the quadratic assignment problem", Linear Algebra and its Appl., 301 (1999), 121-136.
-
3R.S. Burkard, and T. BSnniger, A heuristic for quadratic Boolean programs with applications to quadratic assignment problems. European Journal of Operational Research, 13 (1983), 374-386.
-
4E. Cela, The Quadratic Assignment Problem: Theory and Algorithms, (Kluwer, New York, 1998).
-
5D. Coppersmith, Solving linear equation over GF(2): block Lanczos algorithm, Linear Algebra and Its Applications, 192 (1993) 33-60.
-
6D. Coppersmith, Solving linear equations over GF(2) via block Wiedemann algorithm, Math.Comp., 62 (1994), 333-350.
-
7J.E. Dennis, L.N. Vicente, Trust-region interior-point algorithms for minimization problems with simple bounds, Applied Mathematics and Parallel Computin, Springer, New York, pp.97-107,1996.
-
8Z. Drezner, Compounded genetic algorithms for the quadratic assignment problem, Operations Research Letters, 33 (2005), 475-480.
-
9CH. Fleurent and J. A. Ferland, Genetic hybrids for the quadratic assignment problem, DIMACS,Series in Mathematics and Theoretical Computer Science, 16 (1994), 190-206.
-
10D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, (Addison-Wesley, Reading, 1989.)
-
1Qun Ying LIAO,Qi SUN.Normal Bases and Their Dual-Bases over Finite Fields[J].Acta Mathematica Sinica,English Series,2006,22(3):845-848. 被引量：9
-
2Ma Chuangui\ Liu Weijun.TWO-OPERATION HOMOMORPHIC PERFECT SHARING SCHEMES OVER RINGS[J].Applied Mathematics(A Journal of Chinese Universities),1999,14(2):233-238.
-
3张艳娥,孙建平,王熙照.A Mathod to Solve Systems of Fuzzy Linear Equations[J].Chinese Quarterly Journal of Mathematics,1998,13(4):106-110.
-
4赵辉芳,秦德生.Using Normal Form of Nilpotent Matrices over Finite Fields to Construct Cartesian Authentication Codes[J].Northeastern Mathematical Journal,2004,20(4):415-423. 被引量：5
-
5夏林林,ZHANG Li,吴开腾.A PCGM algorithm for solving linear equations[J].Journal of Chongqing University,2013,12(2):85-90.
-
6林泓,钱建国.On the Number of Solutions of Some Type Equations in Finite Fields[J].Northeastern Mathematical Journal,2005,21(1):18-24.
-
7刘柳斜,丁涪江.计算分子二阶超极化率的基组选择[J].原子与分子物理学报,2005,22(1):143-148.
-
8樊恽,袁媛.ON SELF-DUAL PERMUTATION CODES[J].Acta Mathematica Scientia,2008,28(3):633-638.
-
9孙琦.The least positive integer represented by sum from i=1 to n x_i/d_i (1≤x_i≤d_i-1)[J].Chinese Science Bulletin,1996,41(6):447-450.
-
10任济时,俞卞章.混合技术解表面阻抗加载劈柱组合体散射[J].航空学报,1991,12(11).
