Research Repository

A switching approach to avoid breakdown in lanczos-type algorithms

Farooq, M and Salhi, A (2014) 'A switching approach to avoid breakdown in lanczos-type algorithms.' Applied Mathematics and Information Sciences, 8 (5). 2161 - 2169. ISSN 1935-0090

[img]
Preview
Text
switching_revised_home.pdf - Accepted Version

Download (111kB) | Preview

Abstract

Lanczos-type algorithms are well known for their inherent instability. They typically breakdown when relevant orthogonal polynomials do not exist. Current approaches to avoiding breakdown rely on jumping over the non-existent polynomials to resume computation. This jumping strategy may have to be used many times during the solution process. We suggest an alternative to jumping which consists in switching between different algorithms that have been generated using different recurrence relations between orthogonal polynomials. This approach can be implemented as three different strategies: ST1, ST2, and ST3.We shall briefly recall how Lanczos-type algorithms are derived. Four of the most prominent such algorithms namely A4, A12, A5/B10 and A5/B8 will be presented and then deployed in the switching framework. In this paper, only strategy ST2 will be investigated. Numerical results will be presented. © 2014 NSP Natural Sciences Publishing Cor.

Item Type: Article
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science and Health > Mathematical Sciences, Department of
Depositing User: Jim Jamieson
Date Deposited: 12 Nov 2014 14:17
Last Modified: 30 Jan 2019 16:18
URI: http://repository.essex.ac.uk/id/eprint/11536

Actions (login required)

View Item View Item