For the quadratic objective with a real symmetric matrix , the Heavy-ball method takesMultiplying by and adding givesUnder the usual zero-initial-momentum choice , one has , so induction expresses every residual as a polynomial in applied to . It belongs to the associated Krylov subspace. With two arbitrary starting iterates, the general expression instead combines polynomials applied to both starting residuals; a single-residual polynomial claim then needs an additional relation between them.
Let with , choose , and put and . The two-by-two heavy-ball error propagation matrix for a scalar eigenvalue has characteristic polynomialAt , its middle coefficient is , giving a repeated root . At , the polynomial is , whose roots are complex conjugates with modulus . Thus the full propagation matrix has spectral radius exactly .
The repeated root can produce an error term , so the spectral radius is an asymptotic rate and does not assert a stepwise error bound with one fixed constant times . For , the parameters reduce to , and the identity-matrix problem is solved in one update. Values are outside the displayed rate convention.
Articles by others on the same topic
There are currently no matching articles.