...
首页> 外文期刊>Romanian journal of physics >A FAST SOLVER FOR MAGNETOSTATIC FIELD PROBLEMS
【24h】

A FAST SOLVER FOR MAGNETOSTATIC FIELD PROBLEMS

机译:静磁场问题的快速求解器

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Poisson equation in a plane polygonal domain is used for modeling many important problems in physics as e.g. electrostatic and magnetostatic field distribution. In this respect, fast and robust solvers for numerical solution of this equation are requested in real world applications. In our paper we propose and analyze such a method. Starting from an initial multigrid-type algorithm first proposed by D. Braess (1981), we construct a full-multigrid method in which we start with an exact solution on a very coarse discretization level of the problem and then interpolate and smooth it on finer ones such that on the finest one we get an approximation of the same order as the discretization scheme used. This is obtained in a number of arithmetic operations of the same order as the dimension of the finest grid matrix, which makes our algorithm much faster than other classical solvers. Numerical experiments are given for a magnetostatic field problem.
机译:平面多边形域中的Poisson方程用于对物理学中的许多重要问题进行建模,例如静电场和静磁场场。在这方面,在实际应用中需要用于该方程数值解的快速且鲁棒的求解器。在我们的论文中,我们提出并分析了这种方法。从D. Braess(1981)首次提出的初始多重网格类型算法开始,我们构建了一个全多重网格方法,该方法从问题的非常粗糙的离散化级别开始,采用精确的解,然后对其进行插值和平滑处理。这样最好的情况下,我们得到的近似值与所使用的离散化方案的阶数近似。这是通过与最精细的网格矩阵的维数相同数量的算术运算获得的,这使我们的算法比其他经典求解器快得多。给出了静磁场问题的数值实验。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号