Staff View
Computational connection matrix theory

Descriptive

TitleInfo
Title
Computational connection matrix theory
Name (type = personal)
NamePart (type = family)
Spendlove
NamePart (type = given)
Kelly
DisplayForm
Kelly Spendlove
Role
RoleTerm (authority = RULIB)
author
Name (type = personal)
NamePart (type = family)
Mischaikow
NamePart (type = given)
Konstantin
DisplayForm
Konstantin Mischaikow
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
chair
Name (type = personal)
NamePart (type = family)
Weibel
NamePart (type = given)
Charles
DisplayForm
Charles Weibel
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Woodward
NamePart (type = given)
Christopher
DisplayForm
Christopher Woodward
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Van der Vorst
NamePart (type = given)
Robert
DisplayForm
Robert Van der Vorst
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
outside member
Name (type = corporate)
NamePart
Rutgers University
Role
RoleTerm (authority = RULIB)
degree grantor
Name (type = corporate)
NamePart
School of Graduate Studies
Role
RoleTerm (authority = RULIB)
school
TypeOfResource
Text
Genre (authority = marcgt)
theses
OriginInfo
DateCreated (encoding = w3cdtf); (keyDate = yes); (qualifier = exact)
2019
DateOther (encoding = w3cdtf); (qualifier = exact); (type = degree)
2019-10
Language
LanguageTerm (authority = ISO 639-3:2007); (type = text)
English
Abstract (type = abstract)
We develop a computational and categorical framework for connection matrix theory. In terms of computations, we give an algorithm for computing the connection matrix based on algebraic-discrete Morse theory. The makes the connection matrix available, for the first time, as a computational tool within applied topology and dynamics. In addition, the algorithm provides a straightforward constructive proof of the existence of connection matrices. In terms of categories, our formulation resolves the non-uniqueness of the connection matrix, as well as relates the connection matrix to persistent homology.

We extend existing computational Conley theory to incorporate connection matrix theory. This is done by developing a setting, which we call transversality models, in which discrete approximations to continuous flows can be used to compute connection matrices for the underlying continuous system. We make applications to a Morse theory on spaces of braid diagrams.

Finally, we provide an implicit discrete Morse pairing for cubical complexes. This enables the computation of connection matrices in high-dimensional cubical complexes. We benchmark our algorithm on a set of such examples.
Subject (authority = RUETD)
Topic
Mathematics
Subject (authority = local)
Topic
Connection matrix
Subject (authority = LCSH)
Topic
Index theorems
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier (type = RULIB)
ETD
Identifier
ETD_10064
PhysicalDescription
Form (authority = gmd)
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
1 online resource (x, 141 pages) : illustrations
Note (type = degree)
Ph.D.
Note (type = bibliography)
Includes bibliographical references
RelatedItem (type = host)
TitleInfo
Title
School of Graduate Studies Electronic Theses and Dissertations
Identifier (type = local)
rucore10001600001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/t3-kh58-md25
Genre (authority = ExL-Esploro)
ETD doctoral
Back to the top

Rights

RightsDeclaration (ID = rulibRdec0006)
The author owns the copyright to this work.
RightsHolder (type = personal)
Name
FamilyName
Spendlove
GivenName
Kelly
Role
Copyright Holder
RightsEvent
Type
Permission or license
DateTime (encoding = w3cdtf); (qualifier = exact); (point = start)
2019-05-26 10:32:04
AssociatedEntity
Name
Kelly Spendlove
Role
Copyright holder
Affiliation
Rutgers University. School of Graduate Studies
AssociatedObject
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
ETD
OperatingSystem (VERSION = 5.1)
windows xp
CreatingApplication
Version
1.5
DateCreated (point = end); (encoding = w3cdtf); (qualifier = exact)
2019-05-26T14:18:18
DateCreated (point = end); (encoding = w3cdtf); (qualifier = exact)
2019-05-26T14:18:18
ApplicationName
pdfTeX-1.40.18
Back to the top
Version 8.5.5
Rutgers University Libraries - Copyright ©2024