Academics

Uniform accuracy of implicit-explicit backward differentiation formulas (IMEX-BDF) for linear hyperbolic relaxation systems

Time:2023-10-19 Thu 15:00-16:30

Venue:A3-4-312 ZOOM: 787 662 9899(PW: BIMSA)

Organizer:Xiaopei Jiao

Speaker:Zhiting Ma BIMSA

Abstract

This work is concerned with the uniform accuracy of implicit-explicit backward differentiation formulas for general linear hyperbolic relaxation systems satisfying the structural stability condition proposed previously by the third author. We prove the uniform stability and accuracy of a class of IMEX-BDF schemes discretized spatially by a Fourier spectral method. The result reveals that the accuracy of the fully discretized schemes is independent of the relaxation time in all regimes. It is verified by numerical experiments on several applications to traffic flows, rarefied gas dynamics and kinetic theory.


Speaker Intro

Zhiting Ma obtained the B.S. degree from Lanzhou University in 2015 and Ph.D. degree from Department of Mathematical Sciences at Tsinghua University, China in 2021. Currently, she is an Assistant Professor in Beijing Institute of Mathematical Sciences and Applications (BIMSA). Her current research interests include kinetic theory, machine learning and hyperbolic relaxation systems.

DATEOctober 19, 2023
SHARE
Related News
    • 0

      BIMSA Workshop on the physics of complex systems

      BIMSA Workshop on the physics of complex systemsMany physical, biological, engineering, and societal processes can be explained as complex systems, characterized by a large number of interacting degrees of freedom. The theoretical and computational tools for dissecting complex systems are founded on the physical principles, cross-pollinated by mathematics, statistics, ecology, evolutionary game...

    • 1

      Improved Bounds for Sampling Solutions of Random CNF Formulas

      AbstractLet Φ be a random k-CNF formula on n variables and m clauses, where each clause is a disjunction of k literals chosen independently and uniformly. Our goal is, for most Φ, to (approximately) uniformly sample from its solution space.Let α=m/n be the density. The previous best algorithm runs in time n^poly(k,α) for any α≲2^(k/300) [Galanis, Goldberg, Guo, and Yang, SIAM J. Comput.'2...