Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.06954

Semi-Analytical Solution for a Multi-Objective TEAM Benchmark Problem

Pavel Karban·David Pánek·Tamás Orosz·Ivo Doležel
View original source ↗Read source document ↗Export metadata ↓

Abstract

Benchmarking is essential for testing new numerical analysis codes. Their solution is crucial both for testing the partial differential equation solvers and both for the optimization methods. Especially, nature-inspired optimization algorithm-based solvers, where is an important study is to use benchmark functions to test how the new algorithm may perform, in comparison with other algorithms or fine-tune the optimizer parameters. This paper proposes a novel semi-analytical solution of the multi-objective T.E.A.M benchmark problem. The goal of the benchmark problem is to optimize the layout of a coil and provide a uniform magnetic field in the given region. The proposed methodology was realized in the open-source robust design optimization framework Ārtap, and the precision of the solution is compared with the result of a fully hp-adaptive numerical solver: Agros-suite. The coil layout optimization was performed by derivative-free non-linear methods and the NSGA-II algorithm.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pavel Karban, David Pánek, Tamás Orosz, Ivo Doležel. 2020-08-16. Semi-Analytical Solution for a Multi-Objective TEAM Benchmark Problem. https://arxiv.org/abs/2008.06954

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA↗
arXiv2026

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA↗
arXiv2026

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA↗