APPROXIMATING SOLUTIONS OF BOUNDARY VALUE PROBLEMS

1 online resource (110 pages) : PDF

2015

University of North Carolina at Charlotte

We present a new algorithm for approximating solutions of two-point boundary value problems and prove theorems that give conditions under which the solution must exist and the algorithm generate approximations that converge to it. We show how to make the algorithm computationally efficient and demonstrate how the full method works both when guaranteed to do so and more broadly. We demonstrate that the method compares well against other methods commonly used in the literature. We also prove a theorem on existence of solutions of certain multi-dimensional Volterra integral equations and use it to show that the Parker-Sochacki method of introducing auxiliary variables, used to make the new algorithm computationally efficient, can be effectively applied to these Volterra integral equations in order to approximate their solutions by means of a Picard iteration scheme. Finally, we extend the existence theorem for solutions of two-point boundary valueproblems and prove that the new algorithm can be modified to approximate solutions in this case.

doctoral dissertations

Mathematics

Ph.D.

Algorithm
Auxiliary Variables
Boundary Value Problems
Computationally Efficient
Picard Iteration
Volterra Integral

Mathematics

Shafer, Douglas

Avrin, Joel
Sochacki, James
Ogunro, Vincent

Thesis (Ph.D.)--University of North Carolina at Charlotte, 2015.

This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). For additional information, see http://rightsstatements.org/page/InC/1.0/.

Copyright is held by the author unless otherwise indicated.

Semiyari_uncc_0694D_10755

http://hdl.handle.net/20.500.13093/etd:1256