ALGORITHMS FOR SIMPLIFYING DIFFERENTIAL EQUATIONS
dc.contributor.advisor | Mark van Hoeij | |
dc.contributor.author | SHAYEA WAQAIAN ALDOSSARI | |
dc.date | 2020 | |
dc.date.accessioned | 2022-06-01T12:43:04Z | |
dc.date.available | 2022-06-01T12:43:04Z | |
dc.degree.department | Mathematics | |
dc.degree.grantor | College of Science | |
dc.description.abstract | We present three algorithms to reduce homogeneous linear differential equations to their simplest form. Factoring a differential operator reduces a differential equation L(y) = 0 to equations of minimal order, but this is not the only simplification one can make. There are three order-preserving transformations that can change the degree of the coefficients. To fully simplify a differential equation, after the order is minimized, we want to find the smallest equation that can be reached under any order-preserving transformations. We design algorithms to find transformations that reduce L to its simplest form under all three transformations. The algorithms use relative invariants and integral bases for differential operators. We give an algorithm to find all relative invariants, and we generalize a prior integral basis algorithm to cover all cases. | |
dc.identifier.uri | https://drepo.sdl.edu.sa/handle/20.500.14154/57719 | |
dc.language.iso | en | |
dc.title | ALGORITHMS FOR SIMPLIFYING DIFFERENTIAL EQUATIONS | |
sdl.thesis.level | Doctoral | |
sdl.thesis.source | SACM - United States of America |