Genetic algorithm for intracavity laser beam shaping

Andrey Kostylev; Alexander Sobolev; Tatyana Cherezova; Alexis Kudryashov

doi:10.1117/12.626197

18 August 2005 Genetic algorithm for intracavity laser beam shaping

Andrey Kostylev, Alexander Sobolev, Tatyana Cherezova, Alexis Kudryashov

Proceedings Volume 5876, Laser Beam Shaping VI; 587605 (2005) https://doi.org/10.1117/12.626197
Event: Optics and Photonics 2005, 2005, San Diego, California, United States

Abstract

In this paper we implement a new technique of intracavity bimorph flexible mirror control, that allows to manipulate laser beam parameters (increase power, decrease divergence) and to form a given intensity profile at any distance including a far-field. Intracavity mirror surface profile is controlled by number of voltages calculated by means of genetic algorithm combined with hill-climbing one. Then the traditional Fox-Li approach is applied. We have numerically shown the possibility of successful formation of super Gaussian beam in near field, ring-like beam in far-field, and the possibility of significant power increase of TEM₀₀ mode and far-field peak intensity enlargement.

Citation Download Citation

Andrey Kostylev, Alexander Sobolev, Tatyana Cherezova, and Alexis Kudryashov "Genetic algorithm for intracavity laser beam shaping", Proc. SPIE 5876, Laser Beam Shaping VI, 587605 (18 August 2005); https://doi.org/10.1117/12.626197

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available