Mixed precision explicit numerical methods for ordinary differential equations
Univ. Rennes(雷恩大学);Université Claude Bernard Lyon 1, CNRS, École Centrale de Lyon, INSA Lyon, Université Jean Monnet, ICJ UMR5208, Inria(里昂第一大学、法国国家科学研究中心、里昂中央理工学院、里昂国立应用科学学院、让·莫内大学);Inria(法国国家信息与自动化研究所);CITI, INSA Lyon, CNRS, Inria, LIRIS UMR5205, Université Claude Bernard Lyon 1, ECL, Université Lumière Lyon 2(里昂国立应用科学学院、法国国家科学研究中心、法国国家信息与自动化研究所、里昂第一大学、里昂第二大学)
M Al Sayed Ali, S Bernard, A Marzorati, J Rouzaud-Cornabas
Our objective is to solve large systems of ordinary differential equations (ODEs) commonly used to model biological processes. These equations are typically nonlinear, complex, and high-dimensional. In computational biology, such ODEs are generally solved using numerical methods. In this work, we focus on explicit numerical methods because of their flexibility. However, their limited stability regions may result in high computational costs. To mitigate this issue, we investigate mixed precision algorithms designed to reduce computational effort by performing selected parts of the numerical method in lower arithmetic precision. We develop several mixed precision explicit methods and assess their performance on two large scale biological benchmark ODE models. Our theoretical analysis highlights the effectiveness of partially reducing arithmetic precision within explicit methods. Numerical experiments demonstrate that our mixed methods-implemented in both sequential and parallel versions using MPI-combining single (float) and double precision arithmetic can achieve up to twice the speed of a fully double precision implementation while preserving the same level of accuracy. Furthermore, the results indicate that decreasing the timestep improves the performance and robustness of our mixed methods, while the single precision method fails to converge.
Mixed-Precision in adaptive Runge-Kutta method for large ODE systems
Univ. Rennes(雷恩大学);Inria Lyon(法国国家信息与自动化研究所里昂分部);CNRS, Université Claude Bernard Lyon 1(法国国家科学研究中心,克莱贝尔·贝尔纳·里昂第一大学);INSA de Lyon, Université Claude Bernard Lyon 1(里昂国立应用科学学院,克莱贝尔·贝尔纳·里昂第一大学);INSA Lyon(里昂国立应用科学学院)
Mixed-Precision Lloyd's Algorithm for k-means Clustering
Charles University(查理大学);Sorbonne Université, CNRS(索邦大学,法国国家科学研究中心);Max Planck Institute for Dynamics of Complex Technical Systems(马克斯·普朗克复杂技术系统动力学研究所)
Performance Evaluation of Mixed-Precision Runge-Kutta Methods
在文献[8]中提出并分析了为在混合精度计算中保持高精度解而设计的附加龙格-库塔法。这些特殊设计的方法使用降低的精度或隐式计算和全精度的显式计算。在IBM POWER 9和Intel x86 64芯片上开发了一个用MP-ARK方法求解非线性系统常微分方程的FORTRAN程序。这些方法的收敛性,准确性,运行时,和能源消耗进行了探讨。我们表明,这些MP-ARK方法有效地产生准确的解决方案,显着减少运行时间(和扩展的能源消耗)。
Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education, Hunan Key Laboratory for Computation and Simulation in Science and Engineering, School of Mathematics and Computational Science, Xiangtan University(湘潭大学数学与计算科学学院)
Mixed-precision algorithms for solving the Sylvester matrix equation
Chalmers University of Technology and University of Gothenburg(查尔姆斯理工大学和哥德堡大学);University of Leeds(利兹大学);University of Manchester(曼彻斯特大学);Max Planck Institute for Dynamics of Complex Technical Systems(马普复杂技术系统动力学研究所)
Mixed precision solvers with half-precision floating point numbers for Lattice QCD on A64FX processor
RIKEN Center for Computational Science(理化学研究所计算科学中心);Computing Research Center, High Energy Accelerator Research Organization (KEK) and Accelerator Science Program, Graduate Institute for Advanced Studies, SOKENDAI(高能加速器研究机构计算研究中心及SOKENDAI研究生院加速器科学项目);The Institute for Solid State Physics, The University of Tokyo(东京大学固体物理研究所);Tomonaga Center for the History of the Universe, University of Tsukuba(筑波宇宙历史研究中心);Department of Computer Science, Fukuyama University(福山大学计算机科学系);Research Center for Nuclear Physics, Osaka University(大阪大学核物理研究中心)
Injectivity of boundary integral operator in direct-indirect mixed Burton-Miller equation for wave scattering problems with transmissive circular inclusion