Back to results
University of Illinois at Urbana-Champaign
Analyses of the Lanczos Algorithm and of the Approximation Problem in Richardson's Method
Abstract
dc:descriptionTwo algorithms of use in sparse matrix computation are studied. The rounding errors of the computational Lanczos algorithm are examined in order to account for the differences between the ideal and the machine-operator quantities. The observed behavior of these errors is explained by means of a formal error analysis which relates the errors to properties of the matrix tridiagonalization problem solved by the algorithm. An investigation of the orthogonal polynomials associated with the algorithm partially explains the observed phenomena.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematics
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2014
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Grcar, Joseph Frank
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (UMI)AAI8203472
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/68189