Abstract:To address the problems of complex and time-consuming computation of the diagonal matrix D, lower triangular matrix L, and transposed matrix LT about LDLT decomposed in the traditional least-square ambiguity decorrelation adjustment(LAMBDA), we propose the M-Cholesky decomposition method. The method uses the four-corner rule method to calculate each element of the synthesis matrix step by step, and uses at most three elements in each decomposition calculation, reducing storage space and improving computational efficiency. The simulation and experimental results show that the computational efficiency of the M-Cholesky decomposition method is about 15% better than that of the Cholesky decomposition method for solving the whole-period ambiguity of GNSS.