ABSTRACT

This chapter deals with the explicit version of the Lanczos algorithm. With this goal, we first notice that the coefficients multiplying the powers of u in the numerators are the minors of the Hankel determinant H3(c0) = q0. The chapter presents an explicit Lanczos algorithm as opposed to the recursive relation. For {| φn)}, it is possible to design the explicit Lanczos algorithm by deriving the expression which holds the whole result with no recourse to recurrence relations at all.