Hello,
can the minimize() solver handle spacer layer set up by layers(). It
seems not and this is a limitation
setGridSize(4096, 512, 4)
setcellsize(48.828125e-9, 39.0625e-9, 10e-9)
border:= Cuboid(200e-6, 20e-6, 40e-9)
spacer:= layers(2,3)
multilayer:= border.sub(spacer)
setgeom(multilayer)
//mumax 3.9.1c windows_amd64 go1.3.3 (gc)
//CUDA 6050 GeForce GTX 980(4096MB) cc5.2, using CC35 PTX
Thanks for your time and advice
Am 21.06.2015 um 05:13 schrieb Ahmad Syukri bin Abdollah:
> Greeting mumax community!
>
> I've recently implemented a steepest descent method for energy
> minimization, following Exl et al., JAP 115, 17D118 (2014)
> doi:10.1063/1.4862839 <
http://dx.doi.org/10.1063/1.4862839> (also
> implemented in Abert's fork of MicroMagnum, magnum.fd
> <
http://micromagnetics.org/magnum.fd/>, see Abert et al., JAP 116,
> 123908 (2014) doi:10.1063/1.4896360
> <
http://dx.doi.org/10.1063/1.4896360> for comparison with regular
> RK45F). This is suitable for simulations where fast dynamics are not
> considered e.g. hysteresis simulations.
>
> It has recently been committed into the master branch of mumax/3 on
> github. I'd like to thank Arne for the code cleanup, and for the honor
> of being the first commit for the first "community" version of mumax3!
>
> (Ack, I realized that I accidentally document it as conjugate gradient
> method! Correction pending…)
>
> Implementation notes:
> 1. As with Relax(), simulation time is saved before Minimize(), and
> restored after it completes.
> 2. Also as with Relax(), thermal excitation is turned off.
> 3. While it is known to work with traditional LLG effective field
> (B_anis + B_demag + B_exch + B_ext), I've not determined whether it
> correctly works with STT (Slonczewski or Zhang-Li). I hope someone
> familiar with STT can help verify.
> 4. Convergence of solution is checked via magnitude of magnetization
> change, dm (magnum.fd uses dm/dt instead). Minimization stops when the
> maximum of lastsamples of dm (number determined by MinimizerSamples,
> defaults to 10) is smaller than a threshold, MinimizerStop, which
> defaults to 1e-6. From my experience, anything smaller will not
> converge (due to numerical floor limit).
> 5. Time step is calculated according to Barzilian-Borwein rule, but
> set to 1e-4 when division by zero occurs. Exl's paper mentions use of
> inexact line search when new computed energy is still larger than
> previous samples, but I didn't implement this.
>
> While it is faster than solving regular LLG for most problems, it can
> still get stuck on certain stiff situations (I observed this
> especially when there are vortexes). Also, as Arne points out in the
> documentation (example page), it might fail on very high energy states
> like random magnetization.
>
> Again, I'd like to thank Arne for the merge, and also congratulate him
> on his move to Google. I've always admired your golang-fu, and I hope
> you get to maximize its potential over there, where it was born!
>
> Regards,
> Ahmad Syukri bin Abdollah
> --
> You received this message because you are subscribed to the Google
> Groups "mumax2" group.
> To unsubscribe from this group and stop receiving emails from it, send
> an email to
mumax2+un...@googlegroups.com
> <mailto:
mumax2+un...@googlegroups.com>.