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

Stiffness analysis in the numerical solution of Raman amplifier propagation equations

Open Access Open Access

Abstract

For the first time, the stiffness of Raman amplifier propagation equations is analyzed. And based on this analysis, a novel method for propagation equations is proposed to enhance the stability of numerical simulation. To verify the reliability of this method, simulation experiments are employed by using our method and the existent predictor-corrector method with comparison. The results show that our backward differentiation formulae method behaves much better in stability with a comparative accuracy.

©2004 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)

Efficient numerical method for predicting the polarization-dependent Raman gain in fiber Raman amplifiers

Minming Zhang, Deming Liu, Ying Wang, and Dexiu Huang
J. Opt. Soc. Am. A 21(2) 263-266 (2004)

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 (5)

Fig. 1.
Fig. 1. The stiffness ratio of PERA along the fiber distance.
Fig. 2.
Fig. 2. The maximum error of ‖P⃗‖ varied with the iterating step based on model (2) and (3).
Fig. 3.
Fig. 3. Pump power evolution along the fiber distance obtained from three methods.
Fig. 4.
Fig. 4. Net gain of FRA obtained from three methods.
Fig. 5.
Fig. 5. Signal power evolution along the fiber calculated by different methods, in which (a) for BDF method based on model (2), (b) for PC method, (c) for BDF method based on model (3) and (d) for VPI.

Tables (2)

Tables Icon

Table 1. Comparison of the largest difference of the values calculated by three methods

Tables Icon

Table 2. Coefficients of zero-stable BDF methods for p=0,1,…,5.

Equations (13)

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

d P ν ± d z = F ν ± ( z , P )
F ν ± ( z , P ) = α ν P ν ± ± ε ν P ν ± ± P ν ± ς > ν g ς ν Γ ς υ · ( P ς + + P ς ) P ν ± ς < ν ν ς · g ν ς Γ ν ς · ( P ς + + P ς )
± 2 h ν ς > ν g ς ν · ( P ς + + P ς ) · [ 1 + 1 exp [ h ( ς ν ) k T ] 1 ] · Δ ν
4 h ν P ν ± ς < ν ν ς · g ν ς · [ 1 + 1 exp [ h ( ν ς ) k T ] 1 ] · Δ ς
{ d P d z = F ( z , P ) P = ( P 1 ( z ) , P 2 ( z ) , , P n + m ( z ) ) T F = ( F 1 ( z , P ) , F 2 ( z , P ) , , F n + m ( z , P ) ) T
{ d ln ( P ) d z = F * ( z , P ) P = ( P 1 ( z ) , P 2 ( z ) , , P n + m ( z ) ) T F * = ( F 1 ( z , P ) P 1 , F 2 ( z , P ) P 2 , , F n + m ( z , P ) P n + m ) T
P p i ± ( z k ± 1 ) = exp { 48 25 ln [ P p i ± ( z k ) ] 36 25 ln [ P p i ± ( z k 1 ) ] + 16 25 · ln [ P p i ± ( z k 2 ) ] 3 25 ln [ P p i ± ( z k 3 ) ] + 12 25 F p i * ( z k ± 1 , P ) }
P s j + ( z k + 1 ) = exp { 48 25 ln [ P s j + ( z k ) ] 36 25 ln [ P s j + ( z k 1 ) ] + 16 25 · ln [ P s j + ( z k 2 ) ] 3 25 ln [ P s j + ( z k 3 ) ] + 12 25 F s j * ( z k + 1 , P ) }
d y dt = A y ( t ) + ϕ ( t ) , t [ a , b ]
Re ( λ j ) < 0 , j = 1 , 2 , , n
s = max 1 j n Re ( λ j ) min 1 j n Re ( λ j ) 1
d y dt = f ( t , y ( t ) ) , t [ a , b ]
y ( z k + 1 ) = i = 0 p q i y ( z k i ) + h b 1 f k + 1
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.