首页> 外文会议>Workshop on computational optimization >An Improved 'Walk on Equations' Monte Carlo Algorithm for Linear Algebraic Systems
【24h】

An Improved 'Walk on Equations' Monte Carlo Algorithm for Linear Algebraic Systems

机译:线性代数系统的一种改进的“方程行走”蒙特卡罗算法

获取原文

摘要

A new Monte Carlo algorithm for solving systems of Linear Algebraic (LA) equations is presented and studied. The algorithm is based on the "Walk on Equations" Monte Carlo method recently developed by Dimov et al. (Appl Math Model 39:4494-4510,). The algorithm is improved by choosing the appropriate values for the relaxation parameters which leads to dramatic reduction in time and lower relative errors for a given number of iterations. Numerical tests are performed for examples with matrices of different size and on a system coming from a finite element approximation of a problem describing a beam structure in constructive mechanics.
机译:提出并研究了一种新的蒙特卡洛算法,用于求解线性代数(LA)方程组。该算法基于Dimov等人最近开发的“方程式行走”蒙特卡罗方法。 (应用数学模型39:4494-4510)。通过为松弛参数选择适当的值来改进算法,这对于给定的迭代次数可以显着减少时间并降低相对误差。例如,在具有不同大小的矩阵的系统上,以及在描述构造力学中描述梁结构的问题的有限元近似系统上,进行了数值测试。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号