Article navigation

Considers, without loss of generality, a simple linear problem, where in a certain domain the magnetic field, generated by infinitely long conductors, whose locations as well as the currents are unknown, has to meet a certain figure. The problem is solved by applying hierarchical simulated annealing, which iteratively reduces the dimension of the search space to save computational cost. A Gauss‐Newton scheme, making use of analytical Jacobians, preceding a sequential quadratic program (SQP), will be applied as a second approach to tackle this severely ill‐posed problem. The results of these two techniques will be analyzed and discussed and some comments on future work will be given.

You do not currently have access to this content.
Don't already have an account? Register

Purchased this content as a guest? Enter your email address to restore access.

Pay-Per-View Access
$41.00
Rental

or Create an Account

Close subscription notice
Close access options