800 resultados para Calm computing


Relevância:

10.00% 10.00%

Publicador:

Resumo:

A method is presented for computing the fields produced by radio frequency probes of the type used in magnetic resonance imaging. The effects of surrounding the probe with a shielding coil, intended to eliminate stray fields produced outside the probe, are included. An essential feature of these devices is the fact that the conducting rungs of the probe are of finite width relative to the coil radius, and it is therefore necessary to find the distribution of current within the conductors as part of the solution process. This is done here using a numerical method based on the inverse finite Hilbert transform, applied iteratively to the entire structure including its shielding coils. It is observed that the fields are influenced substantially by the width of the conducting rungs of the probe, since induced eddy currents within the rungs become more pronounced as their width is increased. The shield is also shown to have a significant effect on both the primary current density and the resultant fields. Quality factors are computed for these probes and compared with values measured experimentally.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A straightforward method is proposed for computing the magnetic field produced by a circular coil that contains a large number of turns wound onto a solenoid of rectangular cross section. The coil is thus approximated by a circular ring containing a continuous constant current density, which is very close to the real situation when sire of rectangular cross section is used. All that is required is to evaluate two functions, which are defined as integrals of periodic quantities; this is done accurately and efficiently using trapezoidal-rule quadrature. The solution can be obtained so rapidly that this procedure is ideally suited for use in stochastic optimization, An example is given, in which this approach is combined with a simulated annealing routine to optimize shielded profile coils for NMR.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We consider algorithms for computing the Smith normal form of integer matrices. A variety of different strategies have been proposed, primarily aimed at avoiding the major obstacle that occurs in such computations-explosive growth in size of intermediate entries. We present a new algorithm with excellent performance. We investigate the complexity of such computations, indicating relationships with NP-complete problems. We also describe new heuristics which perform well in practice. Wie present experimental evidence which shows our algorithm outperforming previous methods. (C) 1997 Academic Press Limited.

Relevância:

10.00% 10.00%

Publicador: