ALGORITHMS FOR SIMPLIFYING DIFFERENTIAL EQUATIONS

dc.contributor.advisorMark van Hoeij
dc.contributor.authorSHAYEA WAQAIAN ALDOSSARI
dc.date2020
dc.date.accessioned2022-06-01T12:43:04Z
dc.date.available2022-06-01T12:43:04Z
dc.degree.departmentMathematics
dc.degree.grantorCollege of Science
dc.description.abstractWe 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.urihttps://drepo.sdl.edu.sa/handle/20.500.14154/57719
dc.language.isoen
dc.titleALGORITHMS FOR SIMPLIFYING DIFFERENTIAL EQUATIONS
sdl.thesis.levelDoctoral
sdl.thesis.sourceSACM - United States of America

Files

Copyright owned by the Saudi Digital Library (SDL) © 2025