This paper addresses the numerical solution of large-scale stable Lyapunov matrix equations, which occupy a central position in control theory, model reduction, and signal processing. While the classical Bartels-Stewart method holds a central position in control theory and related fields and is efficient for small-scale problems, it suffers from poor scalability as problem sizes increase, motivating the need for robust iterative techniques. To this end, we propose the extrapolated alternating direction implicit (EADI) method, an accelerated variant of the standard ADI approach that incorporates a low-cost refinement step governed by an extrapolation parameter \(\omega\) . We establish a rigorous convergence theory, deriving sufficient conditions for the shift parameters \(\alpha\) , \(\beta\) and the extrapolation parameter \(\omega\) to ensure that the spectral radius of the iteration matrix remains strictly less than unity. Numerical experiments demonstrate that the EADI algorithm significantly outperforms existing methods, including the standard ADI, GADI and the recently developed R-GADI iteration. The results indicate that EADI consistently achieves the target tolerance with substantially fewer iteration steps and reduced CPU time. Furthermore, the proposed method exhibits remarkable stability across varying problem dimensions, making it a highly effective and robust tool for high-dimensional sparse systems.