数学科学学院学术报告--- 分析与偏微分方程讨论班(2023春季第16讲) Temperature patches for the subcritical Boussinesq–Navier–Stokes system with no diffusion许孝精(北京师范大学)时间:7月7日(星期五)10:00-11:00 地点: 腾讯会议: 535-821-655https://meeting.tencent.com/dm/D2LMxKNgGibz摘要: In this talk, I will prove that temperature patch solutions to the subcritical Boussinesq–Navier–Stokes Syst...
数学科学学院学术报告--- 分析与偏微分方程讨论班(2023春季第15讲) Stabilizing phenomenon for electrically conducting fluids吴家宏(俄克拉荷马州立大学)时间:7月7日(星期五)9:00-10:00 地点:腾讯会议: 535-821-655https://meeting.tencent.com/dm/D2LMxKNgGibz摘要: Physical experiments have observed a remarkable stabilizing phenomenon: magnetic field can stabilize electrically conducting fluids. This ta...
学术报告 A Semismooth Newton-Type Method for the NearestDoubly Stochastic Matrix Problem李欣欣(吉林大学) 报告时间:2023年6月30日 星期五 17:00-18:00报告地点:沙河主楼E404腾讯会议:802-256-565报告摘要: In this talk, we study a semismooth Newton-type method for the nearest doubly stochastic matrix problem where the nonsingularity of the Jacobian can fail. The optimality conditions for this pr...
学术报告 Singular Value Decomposition of Dual Matrices and its Application to Traveling Wave Identification in the Brain丁维洋(复旦大学) 报告时间:2023年6月30日 星期五 16:00-17:00报告地点:沙河主楼E404腾讯会议:802-256-565报告摘要: Matrix factorization in dual number algebra, a hypercomplex system, has been applied to kinematics, mechanisms, and other fields recently. We develop an approac...
学术报告 A Proximal Linearized Algorithm for Dual Quaternion Optimization with Applications in Hand-Eye Calibration陈艳男(华南师范大学) 报告时间:2023年6月30日 星期五 15:00-16:00报告地点:沙河主楼E404腾讯会议:802-256-565报告摘要: Many kinetic problems arising from robotics are modeled in optimization of real function in dual quaternion variables. For example, hand-eye calibration fits dat...
数学科学学院学术报告 A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems 孟凡云(青岛理工大学) 报告时间:2023年6月30日 星期五 上午11:00-12:00 报告地点:沙河校区E404 报告摘要:We propose a class of infeasible proximal bundle methods for solving nonsmooth nonconvex multi-objective optimization problems. The proposed algorithms have no requi...