Simon Fraser University

Computer simulations of the dynamics of complex systems have become an integral tool of science and engineering. Large scale numerical models of systems evolving over a wide range of temporal and spatial scales are routinely encountered in a variety...

A spectral method for the solution of integral and differential equations is generally understood to be an expansion of the solution in a Fourier series. Chebyshev polynomials are often the preferred basis set for many problems. In kinetic theory...

The RAIN Meet is a gathering of researchers for rapid and informal communication of ongoing research activities in computational and applied mathematics in the northwest region. It is intended to complement the PNWNAS, which feature longer lectures...

In many applications one wishes to minimize an objective function that is not convex and is not differentiable at its minimizers. We discuss two algorithms for minimization of nonsmooth, nonconvex functions. Gradient Sampling is a simple method that...

SageMath is free and open-source mathematical software which started in 2004. Its features cover many aspects of mathematics, from basic arithmetic and calculus to advanced research mathematics in algebra,mcombinatorics, numerical mathematics...

The West Coast Optimization Meeting (WCOM) has a long tradition as a regional meeting bringing together scientists working in optimization and related areas. This will be third time SFU has hosted this meeting. Last year's meeting at UBC featured 8...

Optimization problems with sparsity enhancing norms have helped enable the tremendous success of computational compressed sensing techniques in the past decade, where the goal is to recover a signal from a small number of measurements. In this...

We study the propagation of chaos for the N-particle chemotaxis system subject to the Brownian diffusion. More precisely, we present a probabilistic proof of the distance between the exact microscopic and the approximate mean-field dynamics, which...

In this talk, we present a compressed sensing approach to sparse polynomial approximation via convex and non-convex optimization of functions in high dimensions. Of particular interest is the parameterized PDE setting, where the target function is...

We introduce an efficient algorithm, called partition of unity extension or PUX, to construct an extension of desired regularity of a function given on a complex multiply connected domain in $2D$.Function extension plays a fundamental role in...