Abstract
AbstractBoth nonintrusive and intrusive stochastic approaches on the basis of polynomial chaos expansion are presented for the finite integration technique over generic polyhedral grids for 3D magnetostatic linear problems. Such algorithms outperform Monte Carlo methods (when the number of random parameters is small), both in accuracy and efficiency. A novel algorithm for the intrusive approach is also provided, by which the intrusive approach becomes less computationally expensive than the nonintrusive approach. Validation is performed by solving a magnetic circuit where the reluctivity is uncertain.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
