BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Isaac Newton Institute Seminar Series
SUMMARY:On approximate Wiener-Hopf factorization of 2 × 2
matrices - Lasha Ephremidze (Tbilisi State Univers
ity)
DTSTART;TZID=Europe/London:20240703T104500
DTEND;TZID=Europe/London:20240703T111500
UID:TALK215437AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/215437
DESCRIPTION:We present a novel algorithm for the factorization
of triangular polynomial 2x2 matrices. Our algori
thm offers flexibility in choosing between 'exact'
and 'natural' pairs of partial indices. Integrate
d into the general Winer-Hopf factorization algori
thm for 2x2 matrices\, as described in https://doi
.org/10.1098/rspa.2020.0027\, the approach offers
a versatile method applicable to practical scenari
os. Specifically\, given a matrix function S\, our
method enables the construction of a Wiener-Hopf
factorization for an approximate matrix with manag
eable factors\, even when the exact factorization
of S may involve large factors. These large factor
s of S are presumed to arise due to inaccuracies i
n the construction process of S\, rendering its ex
act factorization impractical. The cases where S o
r its approximation have unstable partial indices
are not excluded. Thus\, selecting a reasonable fa
ctorization of the approximated matrix function S
emerges as a natural choice\, facilitating an auto
matic determination of the partial indices\, which
in turn\, could serve as a novel regularization p
rocedure. \;\n(Co-Authors: G. Mishuris\, I. Sp
itkovsky)
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:
END:VEVENT
END:VCALENDAR