检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Ben Burnett Sigal Gottlieb Zachary J.Grant
机构地区:[1]Center for Scientific Computing and Data Science Research,UMass Dartmouth,North Dartmouth,Massachusetts,USA [2]CSME,Michigan State University,East Lansing,Michigan,USA
出 处:《Communications on Applied Mathematics and Computation》2024年第1期705-738,共34页应用数学与计算数学学报(英文)
基 金:supported by ONR UMass Dartmouth Marine and UnderSea Technology(MUST)grant N00014-20-1-2849 under the project S31320000049160;by DOE grant DE-SC0023164 sub-award RC114586-UMD;by AFOSR grants FA9550-18-1-0383 and FA9550-23-1-0037;supported by Michigan State University,by AFOSR grants FA9550-19-1-0281 and FA9550-18-1-0383;by DOE grant DE-SC0023164.
摘 要:Additive Runge-Kutta methods designed for preserving highly accurate solutions in mixed-precision computation were previously proposed and analyzed.These specially designed methods use reduced precision for the implicit computations and full precision for the explicit computations.In this work,we analyze the stability properties of these methods and their sensitivity to the low-precision rounding errors,and demonstrate their performance in terms of accuracy and efficiency.We develop codes in FORTRAN and Julia to solve nonlinear systems of ODEs and PDEs using the mixed-precision additive Runge-Kutta(MP-ARK)methods.The convergence,accuracy,and runtime of these methods are explored.We show that for a given level of accuracy,suitably chosen MP-ARK methods may provide significant reductions in runtime.
关 键 词:Mixed precision Runge-Kutta methods Additive methods ACCURACY
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147