By Topic

Optimal design, inverse problems and parallel computers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Hoole, S.R.H. ; Dept. of Eng., Harvey Mudd Coll., Claremont, CA, USA

Speed has always been a problem in the application of inverse problem methodology in optimal design. This is largely due to the time-consuming operations involved in the computation of gradients with respect to the many parameters. With the advent of parallel computers, this is no longer a problem. The conjugate gradient and Cholesky factorization solution procedures for the computation of gradients in the optimal design of a recording head were compared. It was found that the Cholesky factorization scheme is superior to the conjugate gradient methods in inverse problems if renumbering could be done efficiently to reduce the profile storage. However, when there are limitations in storage, conjugate gradient methods with sparse storage must be used for larger matrices.

Published in:

Magnetics, IEEE Transactions on  (Volume:27 ,  Issue: 5 )