搜索
导航
学术报告Local well-posedness to the vacuum free boundary problem of full compressible Navier-Stokes equations in R^3魏正珍 暨南大学 报告时间：2023年9月9日 星期六 10:00-10:30 报告地点：腾讯会议：503-216-526 报告摘要: In this talk, we will discuss the local well-posedness of the free boundary problem of full compressible Navier-Stokes equations with physical vacuum in three dimensions. We will es...
学术报告Spectral gap of Dirac operators with application to Spetrum Zero Problem郭琪 报告时间：2023年9月6日 星期三 15:00-16:00 报告地点：沙河主楼E706 报告摘要: In this talk, we will discuss the spectralproperties of Dirac operators. First, we will go overthe physical background and geometric characteristics of Dirac operators. Then we willgive the variational characterization of eigenvaluesin ...
北航数学论坛学术报告Computing in Acoustics, Biomedical devices, and Structural Health MonitoringFangsen Cui教授 (Institute of High Performance Computing Singapore)时间：9月4日（周一）15:00-16:30地点：北京航空航天大学沙河校区国实 E404摘要：In this talk, the design, modeling, and simulation of on acoustics (vibration and noise, ultrasonic non-destructive testing, and structural health monitoring)...
北航数学论坛学术报告Elementwise containment among representations of a groupDipendra Prasad教授(印度理工学院)时间：2023年9月8日（周五）14:00-15:00 地点：#Zoom会议：622-0933-7093 密码：166155摘要: For two representations V and W of a group G, we define a weaker notion of containment of W inside V, denoted W≺ V, which we call W immersed in V, if for every element g ∈ G, the eigenvalues ofthe ac...
学术报告 A two stage dynamic scheduling of e-sports tournaments with integer programming 董志龙（西安交通大学） 报告时间：2023年8月8日 星期二 17：00-18：00报告地点：沙河主楼E404 报告摘要: Electronic sports tournaments are well adapted to dynamic scheduling. A dynamic approach for scheduling e-sports tournaments based on a modification of the Swiss system design is proposed. We use Colley's met...
数学科学学院学术报告 Fast and Practical Quantum-Inspired Classical Algorithms for Solving Linear Systems 左钱（北京大学前沿计算研究中心） 报告时间：2023年8月8日 星期二 下午16:00-17:00报告地点：沙河校区E404 报告摘要：Quantum-inspired classical algorithms have become a popular research topic in theoretical computer science, showing that for many quantum algorithms with complexity poly-logarithm...
