量子图快速傅里叶变换及其在网络上的偏微分方程应用
A quantum graph FFT with applications to partial differential equations on networks
AI总结:
将快速傅里叶变换推广至有限图(边视为有限区间),并发展谱与伪谱方法求解网络上的时间依赖偏微分方程。
摘要:
快速傅里叶变换被推广到有限图上的函数,其中图的边被等同于有限长度的区间。开发了谱方法和伪谱方法,用于求解在由一维段在节点处连接而成的网络模型域上的多种时间依赖偏微分方程。
英文摘要:
The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial differential equations on domains which are modeled as networks of one dimensional segments joined at nodes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。