Tue, 10 May 2022

16:00 - 17:00
C1

Representing the string 2-group on Clifford von Neumann algebras.

Peter Kristel
(University of Manitoba)
Abstract

The string 2-group is a fundamental object in string geometry, which is a refinement of spin geometry required to describe the spinning string. While many models for the string 2-group exist, the construction of a representation for it is new. In this talk, I will recall the notion of strict 2-group, and then give two examples: the automorphism 2-group of a von Neumann algebra, and the string 2-group. I will then describe the representation of the string 2-group on the hyperfinite III_1 factor, which is a functor from the string 2-group to the automorphism 2-group of the hyperfinite III_1 factor.

Tue, 03 Dec 2019
14:00
L1

On symmetrizing the ultraspherical spectral method for self-adjoint problems

Mikael Slevinsky
(University of Manitoba)
Abstract

A mechanism is described to symmetrize the ultraspherical spectral method for self-adjoint problems. The resulting discretizations are symmetric and banded. An algorithm is presented for an adaptive spectral decomposition of self-adjoint operators. Several applications are explored to demonstrate the properties of the symmetrizer and the adaptive spectral decomposition.

 

Thu, 17 May 2007

14:00 - 15:00
Comlab

Spectral methods for PDEs in complex geometry

Prof Shiu-hong Lui
(University of Manitoba)
Abstract

Spectral methods are a class of methods for solving PDEs numerically.

If the solution is analytic, it is known that these methods converge

exponentially quickly as a function of the number of terms used.

The basic spectral method only works in regular geometry (rectangles/disks).

A huge amount of effort has gone into extending it to

domains with a complicated geometry. Domain decomposition/spectral

element methods partition the domain into subdomains on which the PDE

can be solved (after transforming each subdomain into a

regular one). We take the dual approach - embedding the domain into

a larger regular domain - known as the fictitious domain method or

domain embedding. This method is extremely simple to implement and

the time complexity is almost the same as that for solving the PDE

on the larger regular domain. We demonstrate exponential convergence

for Dirichlet, Neumann and nonlinear problems. Time permitting, we

shall discuss extension of this technique to PDEs with discontinuous

coefficients.

Subscribe to University of Manitoba