首页> 外文会议>Computational Mechanics >An Algebraic Method for Numerical Stabilization of Transport Equation
【24h】

An Algebraic Method for Numerical Stabilization of Transport Equation

机译:输运方程数值稳定的代数方法

获取原文
获取外文期刊封面目录资料

摘要

A new methodology for evaluating unknown parameters in a numerical method for solving a partialdifferential equation is developed. The main result is the construction of several adaptive algorithmsover the global matrix spectrum to yield “optimal” solutions over a parameter spaces. This methodallows that the global matrix becomes in quasi self-adjoin matrix. Many algorithms based on thealgebraic methods, such that Bisection Methods, Newton methods, or Truncated Newton methodshave been explored with successful results. These procedures do not require exact or approximate,analytical solutions of the continuous problem, and are derived from the numerical solution of thealgebraic equation that characterizes the zeros of the imaginary part of the global matrix spectrum.We call the attention that all operations are done over a set of finite-dimensional spaces. Also, a localprocedure has been implemented to multiple spatial dimensions cases. As a simple illustration, it isapplied to the linear advection-diffusion problem to yield an adaptive algebraic method. Thenumerical performance of this method in one and two dimensions is analyzed, and it is found that ityields results that are commensurate to the SUPG method, inclusive in cases of high anisotropy.In the numerical experiments, we have found that the resulting diffusivity, which is a non-linearfunction of the numerical solution, converges to the value obtained using the SUPG analysis. Weshow the convergence of Quasi-Newton method as a function of iteration number, for differentvalues of Peclet numbers and error levels. For an error level equal to 1×10~(-2) in L~2-norm, thisprocedure converges to the SUPG method within about 10 iterations. For an error level equal to1×10~(-8) in L~2-norm, we found that the iteration numbers decrease to 30 iterations while the values ofPeclet numbers increase until 1×10~(10). Applying a Hybrid Method the numerical results wereimproved. We have found successful results for error level lower to 1×10~(-4), combining the BisectionMethod and the Quasi-Newton Method. Also, a method to reduce the phase of largest eigenvalue ofthe resulting global matrix has been examined. Several interesting aspects of the proposedmethodology will be studied in the future. These include a parallel version of this method and the useof gradient methods.
机译:在求解局部变量的数值方法中评估未知参数的新方法 发展了微分方程。主要结果是构建了几种自适应算法 在全局矩阵频谱上生成参数空间上的“最优”解。这个方法 允许全局矩阵变成拟自伴随矩阵。许多算法基于 代数方法,例如对分方法,牛顿方法或截断牛顿方法 已经探索了成功的结果。这些程序不需要精确的或近似的, 连续问题的解析解,并从数值解得到 表征整体矩阵谱虚部零点的代数方程。 我们提请注意,所有操作都是在一组有限维空间上完成的。还有一个当地人 该程序已被实施到多个空间维度的案例中。举一个简单的例子,它是 将其应用于线性对流扩散问题以产生自适应代数方法。这 分析了该方法在一维和二维中的数值性能,发现它 产生的结果与SUPG方法相当,包括高各向异性的情况。 在数值实验中,我们发现所得的扩散率是非线性的 数值解的函数收敛到使用SUPG分析获得的值。我们 展示了对于不同的迭代次数,拟牛顿法的收敛性 Peclet数字的值和错误级别。对于L〜2-范数中等于1×10〜(-2)的误差水平,此 大约10次迭代后,过程收敛到SUPG方法。对于等于 在L〜2范数中为1×10〜(-8),我们发现迭代次数减少到30次迭代,而 Peclet数增加到1×10〜(10)。应用混合方法,数值结果为 改善。结合平分法,我​​们已经找到了将错误级别降低到1×10〜(-4)的成功结果 方法和拟牛顿法。另外,一种减少相位最大特征值相位的方法 由此产生的全局矩阵已经过检查。拟议的几个有趣的方面 方法将在以后进行研究。其中包括此方法的并行版本以及使用方法 梯度方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号