With increasing complexity of today’s electromagnetic problems, the need and opportunity to reduce domain sizes, memory requirement, computational time and possibility of errors abound for symmetric domains. With sev...With increasing complexity of today’s electromagnetic problems, the need and opportunity to reduce domain sizes, memory requirement, computational time and possibility of errors abound for symmetric domains. With several competing computational methods in recent times, methods with little or no iterations are generally preferred as they tend to consume less computer memory resources and time. This paper presents the application of simple and efficient Markov Chain Monte Carlo (MCMC) method to the Laplace’s equation in axisymmetric homogeneous domains. Two cases of axisymmetric homogeneous problems are considered. Simulation results for analytical, finite difference and MCMC solutions are reported. The results obtained from the MCMC method agree with analytical and finite difference solutions. However, the MCMC method has the advantage that its implementation is simple and fast.展开更多
文摘With increasing complexity of today’s electromagnetic problems, the need and opportunity to reduce domain sizes, memory requirement, computational time and possibility of errors abound for symmetric domains. With several competing computational methods in recent times, methods with little or no iterations are generally preferred as they tend to consume less computer memory resources and time. This paper presents the application of simple and efficient Markov Chain Monte Carlo (MCMC) method to the Laplace’s equation in axisymmetric homogeneous domains. Two cases of axisymmetric homogeneous problems are considered. Simulation results for analytical, finite difference and MCMC solutions are reported. The results obtained from the MCMC method agree with analytical and finite difference solutions. However, the MCMC method has the advantage that its implementation is simple and fast.
