Periodic continued fractions are useful for representing or approximating numbers. Based on a self-substitution concept, we derive an O(log n) algorithm to compute periodic continued fractions. Two application examples, the approximation of a quadratic surd number and the solving of second-order linear recurrence, are presented.