dc.contributor.supervisor Clouatre, Raphael dc.contributor.supervisor Slevinsky, Richard Mikael dc.contributor.author Klippenstein, Brock dc.date.accessioned 2022-08-24T17:57:41Z dc.date.available 2022-08-24T17:57:41Z dc.date.copyright 2022-08-24 dc.date.issued 2022-08-24 dc.date.submitted 2022-08-24T16:48:14Z en_US dc.identifier.uri http://hdl.handle.net/1993/36747 dc.description.abstract A Sylvester equation is an operator equation of the form \$AX-XB=C\$. A fact that has been proven multiple times before, see \cite{penzl2000eigenvalue,sabino2006solution}, is that if \$C\$ has low rank, then \$A\$ and \$B\$ satisfying certain conditions imply \$X\$ has a low rank approximation. Another set of conditions was given by Beckermann and Townsend in 2019, \cite{beckermann2019bounds}, where they impose the conditions that \$A\$ and \$B\$ are both normal, and have disjoint and well-separated spectra. In this thesis, we explore cases where the normality condition can be relaxed. Our main tool is unitary operator dilations, whereby one can realize a given operator as the corner of a unitary operator acting on a bigger space. The basic problem becomes the lifting of the original Sylvester equation to a new one involving the unitary dilation. This is reminiscent of the so-called intertwining dilation theorem, but it requires a completely new analysis as we require additional conditions if we wish to be able to guarantee the solution has a low rank approximation. en_US Our main result states that if we trade in normality of \$A\$ for a norm condition on \$A\$ and \$B\$, then we can unitarily dilate \$A\$. This in turn allows us to conclude that \$X\$ has a low rank approximation provided our condition is satisfied, \$B\$ is normal, and \$C\$ has low rank. Due to the similarity in the conditions for the theorem by Beckermann and Townsend and the conditions required to solve a Sylvester equation quickly using algorithms such as the alternating direction implicit (ADI) method, our dilation method also allows us to show the ADI method does not require too many iterations without requiring \$A\$ to be normal. dc.language.iso eng en_US dc.rights open access en_US dc.subject Sylvester en_US dc.subject Zolotarev en_US dc.subject Operator en_US dc.subject Dilation en_US dc.subject Singular value en_US dc.title Singular value decay for solutions of Sylvester equations en_US dc.type master thesis en_US dc.degree.discipline Mathematics en_US dc.contributor.examiningcommittee Shiu Hong Lui en_US dc.contributor.examiningcommittee Robert Martin en_US dc.degree.level Master of Science (M.Sc.) en_US dc.description.note October 2022 en_US oaire.awardNumber Student Number: 7790770 en_US oaire.awardURI https://umanitoba.ca/graduate-studies/funding-awards-and-financial-aid/university-manitoba-graduate-fellowship-umgf en_US oaire.awardTitle University of Manitoba Graduate Fellowship (UMGF) en_US project.funder.name University of Manitoba en_US project.funder.identifier https://doi.org/10.13039/100010318 en_US local.subject.manitoba no en_US
﻿