Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Effective shooting algorithm and its application to fiber amplifiers

Open Access Open Access

Abstract

A series of new methods based on the Runge-Kutta (RK) formula are proposed, which not only retain the merit of RK methods, in that the adaptive stepsize is easily implemented, but also dramatically decrease the error under the same conditions. Based on the new methods, an effective shooting algorithm is also proposed. A two-point boundary value problem for the Raman amplifier propagation equations is solved using the proposed algorithm. Our algorithm markedly increases the simulating speed for Raman amplifier propagation equations, as well as improves the accuracy, compared to the traditional algorithm.

©2003 Optical Society of America

Full Article  |  PDF Article
More Like This
A fast and stable method for Raman amplifier propagation equations

Xueming Liu and Byoungho Lee
Opt. Express 11(18) 2163-2176 (2003)

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (4)

Fig. 1.
Fig. 1. Relationship of relative error with t, for (a) the fourth-order RK method, and (b) the fourth-order ORK method.
Fig. 2.
Fig. 2. Calculation procedure for the shooting algorithm based on the fourth-order ORK method, where (a) for y 1(t), (b) for y 2(t), and (c) for the relative error of y 1(t) and y 2(t) in the last iteration.
Fig. 3.
Fig. 3. Raman gain spectrum gR v) of the fiber, which was used in the simulation.
Fig. 4.
Fig. 4. Iteration procedure and numerical results for a distributed pump Raman amplifier, for (a) iteration procedures of a pump, (b) iteration procedures of a signal, and (c) results of all pumps and signals at the last iteration. The calculating procedure is from z=L to z=0.

Equations (25)

Equations on this page are rendered with MathJax. Learn more.

d y d t = f ( t , y ) ,
y ( t = t 0 ) = y 0 .
y n + 1 = y n + i = 1 m w i k i ,
k i = h f ( t n + c i , y n + j = 1 m d ij k j ) , i = 1 , 2 , m .
d z d t = g ( t , exp ( z ) ) .
z n + 1 = z n + i = 1 m w i q i ,
q i = h g ( t n + c i , exp ( z n ) ( 1 + j = 1 m d ij q j ) ) , i = 1 , 2 , m .
y n + 1 = y n exp ( i = 1 m w i q i ) ,
q i = h g ( t n + c i , y n + y n j = 1 m d ij q j ) , i = 1 , 2 , m .
y n + 1 = y n exp [ ( q 1 + 2 q 2 + 2 q 3 + q 4 ) h 6 ] ,
q 1 = g ( t n , y n ) ,
q 2 = g ( t n + h 2 , y n + y n q 1 h 2 ) ,
q 3 = g ( t n + h 2 , y n + y n q 2 h 2 ) ,
q 4 = g ( t n + h , y n + y n q 3 h ) ,
g ( t n ) = f ( t n ) y n .
ε = C h 5 [ In ( y ) ] ( 5 ) ( ξ ) .
ε = C h 5 y ( 5 ) ( ξ ) .
dy dt = y ( t 3 200 + t 2 50 + t ) , y ( 0 ) = 1 , and t [ 0 , 3.6 ] .
y = exp ( t 4 800 + t 3 150 + t 2 2 ) .
d y 1 ( t ) d t = f 1 ( t , y 1 , y 2 ) ,
d y 2 ( t ) d t = f 2 ( t , y 1 , y 2 ) ,
y 1 ( a ) = α ,
y 2 ( b ) = β .
A j + 1 = { A j 1 + ( β β j 1 ) ( A j A j 1 ) ( β j β j 1 ) , ( if j > 1 ) A j β β j , ( if j = 1 )
± d P i d z = [ α i + j = 1 i 1 g R ( v j v i ) Γ A eff P j j = i + 1 m v i v j g R ( v i v j ) Γ A eff P j ] P i , ( i = 1 , 2 , , m ) ,
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.