数学学科Seminar第3049讲 光子准晶能带结构的保结构算法

创建时间:  2026/05/26  邵奋芬   浏览次数:   返回

报告题目 (Title):光子准晶能带结构的保结构算法

报告人 (Speaker):李铁香 教授(东南大学)

报告时间 (Time):2026年6月4日(周四)11:00

报告地点 (Place):校本部GJ303

邀请人(Inviter):刘巧华

主办部门:理学院数学系

报告摘要:

A novel bi-infinite approach to compute the band structures of 2D photonic superlattices with 1D quasicrystal sequences is devised. Leveraging strategically the bi-infinite characteristic, the approach first transforms the infinite-dimensional eigenvalue problem into a finite-dimensional nonlinear eigenvalue problem (NEVP) on a single cell for efficient numerical solution. Challengingly, the NEVP is built upon the solutions to two systems of cyclic nonlinear matrix equations that have to be solved repeatedly during iteratively solving the NEVP. The solutions are efficiently calculated by a newly developed highly efficient coalescing technique followed by a structure-preserving doubling algorithm. It is showed that the cost of coalescing is proportional to the logarithm of N, the length of the truncated quasicrystal sequence, which is significant as the cost of coalescing becomes more noticeable as N gets bigger for highly accurate simulations. Finally, through mathematical analysis, inclusion intervals for eigenvalue of interest are estimated so as to significantly narrow down the scope of search, and that significantly contributes to the overall efficiency of the approach, as the NEVP is nonlinear in nature and has to be solved iteratively.

上一条:数学学科Seminar第3050讲 Brown-Goodearl 猜想

下一条:数学学科Seminar第3048讲 保度计算几何与脑肿瘤影像处理


数学学科Seminar第3049讲 光子准晶能带结构的保结构算法

创建时间:  2026/05/26  邵奋芬   浏览次数:   返回

报告题目 (Title):光子准晶能带结构的保结构算法

报告人 (Speaker):李铁香 教授(东南大学)

报告时间 (Time):2026年6月4日(周四)11:00

报告地点 (Place):校本部GJ303

邀请人(Inviter):刘巧华

主办部门:理学院数学系

报告摘要:

A novel bi-infinite approach to compute the band structures of 2D photonic superlattices with 1D quasicrystal sequences is devised. Leveraging strategically the bi-infinite characteristic, the approach first transforms the infinite-dimensional eigenvalue problem into a finite-dimensional nonlinear eigenvalue problem (NEVP) on a single cell for efficient numerical solution. Challengingly, the NEVP is built upon the solutions to two systems of cyclic nonlinear matrix equations that have to be solved repeatedly during iteratively solving the NEVP. The solutions are efficiently calculated by a newly developed highly efficient coalescing technique followed by a structure-preserving doubling algorithm. It is showed that the cost of coalescing is proportional to the logarithm of N, the length of the truncated quasicrystal sequence, which is significant as the cost of coalescing becomes more noticeable as N gets bigger for highly accurate simulations. Finally, through mathematical analysis, inclusion intervals for eigenvalue of interest are estimated so as to significantly narrow down the scope of search, and that significantly contributes to the overall efficiency of the approach, as the NEVP is nonlinear in nature and has to be solved iteratively.

上一条:数学学科Seminar第3050讲 Brown-Goodearl 猜想

下一条:数学学科Seminar第3048讲 保度计算几何与脑肿瘤影像处理