Generalized BDF methods applied to Hessenberg form DAEs
Keiper, Jerry Bruce
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/21587
Description
Title
Generalized BDF methods applied to Hessenberg form DAEs
Author(s)
Keiper, Jerry Bruce
Issue Date
1989
Doctoral Committee Chair(s)
Gear, C.W.
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Language
eng
Abstract
We study the numerical solution of Hessenberg form differential algebraic equations by variable stepsize generalized backward difference formulae (GBDF). GBDF methods of sufficiently high order are shown to converge for problems of index two, three, or four. The proof techniques developed are not sufficiently powerful to show convergence for index five problems. In addition, we perform very high precision numerical experiments on problems of index two, three, four, and five, using the classical six step backward difference formula. The experiments confirm the analysis regarding the error behavior of the index two and three problems, but suggest that the analysis of the index four problem is too pessimistic. It appears from the experiments that index five problems can also be solved by GBDF methods.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
