{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/25244"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/25244","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Numerical Integration of Stiff Differential-Algebraic Equations","abstract":"Systems of differential-algebraic equations (DAEs) arise in many areas including electrical circuit simulation, chemical engineering, and robotics. The difficulty of solving a DAE is characterized by its index. For index-1 DAEs, there are several solvers, while a high-index DAE is numerically much more difficult to solve. The DAETS solver by Nedialkov and Pryce integrates numerically high-index DAEs. This solver is based on explicit Taylor series method and is efficient on non-stiff to mildly stiff problems, but can have severe stepsize restrictions on highly stiff problems. Hermite-Obreschkoff (HO) methods can be viewed as a generalization of Taylor series methods. The former have smaller error than the latter and can be A- or L- stable. In this thesis, we develop an implicit HO method for numerical solution of stiff high-index DAEs. Our method reduces a given DAE to a system of generally nonlinear equations and a constrained optimization problem. We employ Pryce’s structural analysis to determine the constraints of the problem and to organize the computations of higher-order Taylor coefficients (TCs) and their gradients. Then, we use automatic differentiation to compute these TCs and gradients, which are needed for evaluating the resulting system and its Jacobian. We design an adaptive variable-stepsize and variable-order algorithm and implement it in C++ using literate programming. The theory and implementation are interwoven in this thesis, which can be verified for correctness by a human expert. We report numerical results on stiff DAEs illustrating the accuracy and performance of our method, and in particular, its ability to take large steps on stiff problems.","abstract_html":"Systems of differential-algebraic equations (DAEs) arise in many areas including electrical circuit simulation, chemical engineering, and robotics. The difficulty of solving a DAE is characterized by its index. For index-1 DAEs, there are several solvers, while a high-index DAE is numerically much more difficult to solve. The DAETS solver by Nedialkov and Pryce integrates numerically high-index DAEs. This solver is based on explicit Taylor series method and is efficient on non-stiff to mildly stiff problems, but can have severe stepsize restrictions on highly stiff problems. Hermite-Obreschkoff (HO) methods can be viewed as a generalization of Taylor series methods. The former have smaller error than the latter and can be A- or L- stable. In this thesis, we develop an implicit HO method for numerical solution of stiff high-index DAEs. Our method reduces a given DAE to a system of generally nonlinear equations and a constrained optimization problem. We employ Pryce’s structural analysis to determine the constraints of the problem and to organize the computations of higher-order Taylor coefficients (TCs) and their gradients. Then, we use automatic differentiation to compute these TCs and gradients, which are needed for evaluating the resulting system and its Jacobian. We design an adaptive variable-stepsize and variable-order algorithm and implement it in C++ using literate programming. The theory and implementation are interwoven in this thesis, which can be verified for correctness by a human expert. We report numerical results on stiff DAEs illustrating the accuracy and performance of our method, and in particular, its ability to take large steps on stiff problems.","abstract_has_math":false,"creators":["Zolfaghari, Reza"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computational Engineering and Science","school":null,"contributors":[],"advisors":["Nedialkov, Nedialko"],"committee_chairs":[],"committee_members":[],"year":2020,"date_issued":"2020","date_published":"2020","updated_at":"2026-11-18T19:38:13Z","subjects":["differential-algebraic equations","stiff"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/20297"],"render_values":[{"text":"https://doi.org/10.71548/20297","href":"https://doi.org/10.71548/20297","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/25244","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/25244","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F25244","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Nedialkov, Nedialko"]},{"key":"dc:contributor.department","label":"Department","values":["Computational Engineering and Science"]},{"key":"dc:creator","label":"Author","values":["Zolfaghari, Reza"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2020-02-04T20:10:07Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2020-02-04T20:10:07Z"]},{"key":"dc:date.issued","label":"Date","values":["2020"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["differential-algebraic equations","stiff"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/25244","https://doi.org/10.71548/20297"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Systems of differential-algebraic equations (DAEs) arise in many areas including electrical circuit simulation, chemical engineering, and robotics. The difficulty of solving a DAE is characterized by its index. For index-1 DAEs, there are several solvers, while a high-index DAE is numerically much more difficult to solve. The DAETS solver by Nedialkov and Pryce integrates numerically high-index DAEs. This solver is based on explicit Taylor series method and is efficient on non-stiff to mildly stiff problems, but can have severe stepsize restrictions on highly stiff problems. Hermite-Obreschkoff (HO) methods can be viewed as a generalization of Taylor series methods. The former have smaller error than the latter and can be A- or L- stable. In this thesis, we develop an implicit HO method for numerical solution of stiff high-index DAEs. Our method reduces a given DAE to a system of generally nonlinear equations and a constrained optimization problem. We employ Pryce’s structural analysis to determine the constraints of the problem and to organize the computations of higher-order Taylor coefficients (TCs) and their gradients. Then, we use automatic differentiation to compute these TCs and gradients, which are needed for evaluating the resulting system and its Jacobian. We design an adaptive variable-stepsize and variable-order algorithm and implement it in C++ using literate programming. The theory and implementation are interwoven in this thesis, which can be verified for correctness by a human expert. We report numerical results on stiff DAEs illustrating the accuracy and performance of our method, and in particular, its ability to take large steps on stiff problems."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Doctor of Philosophy (PhD)"]},{"key":"dc:title","label":"Title","values":["Numerical Integration of Stiff Differential-Algebraic Equations"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Nedialkov, Nedialko"],"dc:contributor.department":["Computational Engineering and Science"],"dc:creator":["Zolfaghari, Reza"],"dc:date.accessioned":["2020-02-04T20:10:07Z"],"dc:date.available":["2020-02-04T20:10:07Z"],"dc:date.issued":["2020"],"dc:description.abstract":["Systems of differential-algebraic equations (DAEs) arise in many areas including electrical circuit simulation, chemical engineering, and robotics. The difficulty of solving a DAE is characterized by its index. For index-1 DAEs, there are several solvers, while a high-index DAE is numerically much more difficult to solve. The DAETS solver by Nedialkov and Pryce integrates numerically high-index DAEs. This solver is based on explicit Taylor series method and is efficient on non-stiff to mildly stiff problems, but can have severe stepsize restrictions on highly stiff problems. Hermite-Obreschkoff (HO) methods can be viewed as a generalization of Taylor series methods. The former have smaller error than the latter and can be A- or L- stable. In this thesis, we develop an implicit HO method for numerical solution of stiff high-index DAEs. Our method reduces a given DAE to a system of generally nonlinear equations and a constrained optimization problem. We employ Pryce’s structural analysis to determine the constraints of the problem and to organize the computations of higher-order Taylor coefficients (TCs) and their gradients. Then, we use automatic differentiation to compute these TCs and gradients, which are needed for evaluating the resulting system and its Jacobian. We design an adaptive variable-stepsize and variable-order algorithm and implement it in C++ using literate programming. The theory and implementation are interwoven in this thesis, which can be verified for correctness by a human expert. We report numerical results on stiff DAEs illustrating the accuracy and performance of our method, and in particular, its ability to take large steps on stiff problems."],"dc:description.degree":["Doctor of Philosophy (PhD)"],"dc:identifier.uri":["http://hdl.handle.net/11375/25244","https://doi.org/10.71548/20297"],"dc:language.iso":["en"],"dc:subject":["differential-algebraic equations","stiff"],"dc:title":["Numerical Integration of Stiff Differential-Algebraic Equations"],"dc:type":["Thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:38:13Z"}