检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Faisal Mumtaz Fahhad H.Alharbi
机构地区:[1]College of Science and Engineering,Hamad Bin Khalifa University,Doha,Qatar [2]Qatar Environment&Energy Research Institute(QEERI),Hamad Bin Khalifa University,Doha,Qatar
出 处:《Communications in Computational Physics》2018年第6期69-85,共17页计算物理通讯(英文)
基 金:The author would like to thank Qatar National Research Fund as the work is partially supported by NPRP 7-317-1-055.
摘 要:Many physical problems involve unbounded domains where the physical quantities vanish at infinities.Numerically,this has been handled using different techniques such as domain truncation,approximations using infinitely extended and vanishing basis sets,and mapping bounded basis sets using some coordinate transformations.Each technique has its own advantages and disadvantages.Yet,approximating simultaneously and efficiently a wide range of decaying rates has persisted as major challenge.Also,coordinate transformation,if not carefully implemented,can result in non-orthogonal mapped basis sets.In this work,we revisited this issue with an emphasize on designing appropriate transformations using sine series as basis set.The transformations maintain both the orthogonality and the efficiency.Furthermore,using simple basis set(sine function)help avoid the expensive numerical integrations.In the calculations,four types of physically recurring decaying behaviors are considered,which are:non-oscillating and oscillating exponential decays,and non-oscillating and oscillating algebraic decays.The results and the analyses show that properly designed high-order mapped basis sets can be efficient tools to handle challenging physical problems on unbounded domains.Decay rate ranges as large of 6 orders of magnitudes can be approximated efficiently and concurrently.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222