Abstract: Data-flow analysis of arrays is an important analysis used in optimizing and parallelizing compilers. Last write tree(LWT) is a typical algorithm of array data-flow analysis. But the method of computing the root domain of LWT is not given precisely, sometimes it is even restricted. This paper presents a new computing model and a new algorithm of LWT to solve this problem. In this model, an accurate root domain of LWT can be provided.