Аңдатпа
Our first objective is to show how to implement Francis's algorithm when A is presented in the QR-decomposed form A = QR = Q1 … Qn–1R, where Q1, …, Qn–1 are core transformations. As we indicated in Chapter 1, we may sometimes include a unitary diagonal matrix D in our factorization. This is a mere detail which, along with all of the other details discussed in Section 1.4, will be ignored here in the interest of avoiding clutter.