Quadratic convergence refers to the property of an iterative method where the number of correct digits approximately doubles with each step, leading to very rapid convergence to a solution. This is a highly desirable characteristic in numerical algorithms, particularly in root-finding methods like Newton's method, as it significantly reduces computational effort for achieving high precision results.