Large-scale multi-scenario stochastic economic dispatch (SED) is hard to directly solve due to the huge number of variables and constraints. To reduce the computational burden, a nested dual-DQAM (Diagonal Quadratic Approximation Method) is proposed in this paper to decouple the SED problem in both scenarios and time periods, where each subproblem only contains one time period and one scenario. Moreover, these subproblems can be handled in parallel, such that the computational performance can be significantly improved. Besides, we have investigated the optimal policy to select the best parallel structure of the proposed dual-DQAM, and the theorical convergence performance is proved. Numerical results on several test systems show the effectiveness of the proposed dual-DQAM. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Note to Practitioners</i> —Nowadays, the safe operation and economic dispatch in power system are greatly challenged by the high penetration of renewable energy. Although the uncertainty of renewable energy can be well modeled by stochastic programming, the solution complexity will seriously increase due to the large number of typical scenarios. For this problem, the parallel solution using decomposition methods is the state-of-the-art strategy. In this paper, we propose an efficient solution to the multi-scenario SED problem by temporal and scenario decompositions. It realizes an important innovation in both reducing the computational burden and improving the solving efficiency, which greatly promotes the application of SED in large-scale systems. To better use this method, the following two properties should be highlighted: i) the proposed method has a convergence guarantee and works especially well on SED due to the sparsity property of linking constraint matrices. ii) the computational efficiency of the proposed method becomes more significant as the number of time periods and scenarios grows and can be further improved under a fast ramp rate.