No Detail Found!

New recurrence relationships between orthogonal polynomials which lead to new lanczos-type algorithms.

Author(s)
Muhammad Farooq Department of Mathematics, University of Peshawar, Peshawar, Pakistan
Abdellah Salhi Department of Mathematical Sciences, University of Essex, Wivenhoe Park, Colchester, United Kingdom
Abstract
Lanczos methods for solving Ax = b consist in constructing a sequence of vectors (xk), k = 1, … such that rk = b - Axk = Pk(A)ro, where Pk is the orthogonal polynomial of degree at most k with respect to the linear functional c de¯ned as c(xi) = (y, A’ro). Let P(1) k be the regular monic polynomial of degree k belonging to the family of formal orthogonal polynomials (FOP) with respect to c(1) de¯ned as c(1)(xi) = c(xi+1). All Lanczos-type algorithms are characterized by the choice of one or two recurrence relationships, one for Pk and one for P(1). We shall study some new recurrence relations involving these two polynomials and their possible combinations to obtain new Lanczos-type algorithms. We will show that some recurrence relations exist, but cannot be used to derive Lanczos-type algorithms, while others do not exist at all.
Publication Details
Page(s) 61-75
DOI DOI not available
Published Journal: Journal of Prime Research in Mathematics, Volume: 8, Issue: 0, Year: 2012

Request the full text from PASTIC

0

Citations

0

Downloads

26

Views