convergence analysis of accelerated first-order methods for convex optimization problems are presented from the point of view of ordinary differential equation (ode) solvers. we first take another look at the acceleration phenomenon via a-stability theory for ode solvers and present a revealing spectrum analysis for quadratic programming. after that, we present the lyapunov framework for dynamical system and introduce the strong lyapunov condition. many existing continuous convex optimization models, such as gradient flow, heavy ball system, nesterov accelerated gradient flow, and dynamical inertial newton system etc, are addressed and analyzed in this framework. then we present convergence analyses of optimization algorithms obtained from implicit or explicit methods of underlying dynamical systems.