降低偏置并优化执行时间以求解时间依赖的Ginzburg-Landau方程迭代解
Reducing Bias and Optimising Execution Time in Iterative Solutions of the Time Dependent Ginzburg Landau Equations
AI总结:
本文提出一种新算法,用于减少迭代求解时间依赖Ginzburg-Landau方程时的偏置并优化执行时间,通过时间序列方法寻找静态解,减少迭代次数和偏置。
摘要:
在超导样品中模拟钉扎阵列以提高临界电流的重要性近年来有所增加。由于时间依赖的Ginzburg-Landau(TDGL)方程比替代方法更准确,涉及其的模拟过程对于设计能够维持更高临界电流的器件至关重要,因此对应用超导性领域具有重要意义。本文提出了一种简单的新型算法,用于减少迭代时间依赖模拟中的偏置并优化执行时间,应用于超导样品的TDGL解。通过时间序列方法研究样品的磁响应,在外部磁场演变的每个步骤中找到静态解,从而减少偏置并最小化在每个步骤中需要花费的迭代次数。结果以纯超导体的模拟框架呈现,采用简单的欧拉算法求解时间,但实现可以轻松适应于处理自适应步长解或半隐式方法,这些方法不可避免地面临偏置和迭代次数的权衡。
英文摘要:
The importance of simulating pinning arrays in superconducting samples for the increase of critical currents has been increasing in the last few years. Since the Time Dependent Ginzburg Landau (TDGL) can be more accurate than alternative methodologies, the simulation procedures involving it are critical to design devices that can sustain higher critical currents and, therefore, to the field of applied superconductivity. In this article, a simple novel algorithm is presented for the reduction of bias and optimisation of execution time in iterative time dependent simulations, applied to TDGL solutions of superconducting samples. Taking a time series approach to the magnetic response of the sample, stationary solutions are found for each step in the evolution of the applied external field, leading to bias reduction and minimisation of iterations needed to be spent at each step in the applied field. The results are presented for a pure superconductor, in a framework of simulations via link variable technique, with simple Euler algorithm for the solution in time, but the implementation can be adapted easily to deal with adaptive step size solutions or semi-implicit methods, which are not exempt from the bias and iterations tradeoff.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。