Please use this identifier to cite or link to this item: https://doi.org/10.1117/1.1949626
DC FieldValue
dc.titleOptimization of Hamiltonian algorithm for fiber alignment by simulation and experiments
dc.contributor.authorLu, Z.
dc.contributor.authorChen, P.C.Y.
dc.contributor.authorLin, W.
dc.date.accessioned2014-06-18T05:09:24Z
dc.date.available2014-06-18T05:09:24Z
dc.date.issued2005-07
dc.identifier.citationLu, Z., Chen, P.C.Y., Lin, W. (2005-07). Optimization of Hamiltonian algorithm for fiber alignment by simulation and experiments. Optical Engineering 44 (7) : 1-8. ScholarBank@NUS Repository. https://doi.org/10.1117/1.1949626
dc.identifier.issn00913286
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/67791
dc.description.abstractWe aim to optimize the Hamiltonian algorithm for fiber alignment by simulation and experiments. We develop (1) a three-step optimization method to adjust two relevant parameters in the Hamiltonian algorithm in order to effectively make the alignment process faster and more stable, and (2) two methods to terminate Hamiltonian searching in order to preserve successful alignments under the influence of noise. We demonstrate the effectiveness of all these practical methods through experiments using an alignment system. © 2005 Society of Photo-Optical Instrumentation Engineers.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1117/1.1949626
dc.sourceScopus
dc.subjectAssembly system
dc.subjectHamiltonian algorithm
dc.subjectParameter optimization
dc.subjectPhotonic alignment application
dc.typeArticle
dc.contributor.departmentBACHELOR OF TECHNOLOGY PROGRAMME
dc.description.doi10.1117/1.1949626
dc.description.sourcetitleOptical Engineering
dc.description.volume44
dc.description.issue7
dc.description.page1-8
dc.description.codenOPEGA
dc.identifier.isiut000232591100025
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.