Home | History | Annotate | Download | only in docs

Lines Matching refs:While

201 valleys while preserving its convergence properties.
259 While
340 Thus, we can run PCG on $S$ with the same computational effort per iteration as PCG on $H$, while reaping the benefits of a more powerful preconditioner. In fact, we do not even need to compute $H$, \eqref{eq:schurtrick1} can be implemented using just the columns of $J$.