Please use this identifier to cite or link to this item: http://hdl.handle.net/11452/25794
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGökhan, Fikri Serdar-
dc.date.accessioned2022-04-15T07:27:05Z-
dc.date.available2022-04-15T07:27:05Z-
dc.date.issued2012-
dc.identifier.citationGökhan, F. S. ve Yılmaz, G. (2012). "Novel guess functions for efficient analysis of raman fiber amplifiers". COMPEL, The International Journal for Computation and Mathematics in Electrical and Electronic Engineering, 31(2), 330-345.en_US
dc.identifier.issn0332-1649-
dc.identifier.urihttps://doi.org/10.1108/03321641211199782-
dc.identifier.urihttps://www.emerald.com/insight/content/doi/10.1108/03321641211199782/full/html-
dc.identifier.urihttp://hdl.handle.net/11452/25794-
dc.description.abstractPurpose - The aim of the paper is to demonstrate a fast numerical solution for Raman fiber amplifier equations using proposed guess functions and MATLAB intrinsic properties. MATLAB BVP solvers are addressed for the solution. Design/methodology/approach - The guess functions proposed for the solution of RFA equations using MATLAB BVP solvers are derived from Taylor expansion of pump and signal wave near the boundary to specifically obtain convergence for the initial mesh point. The guess functions increase simulation speed significantly. In order to improve the simulation speed further, vectorization and analytical Jacobians are introduced. Comparisons among bvp4c and bvp5c have been made with respect to total pump power, number of signals, vectorization with/without analytical Jacobians, fiber length, relative tolerance and continuation method. The simulations are performed to determine the effect of the run time on the choice of the number of equally spaced mesh points (N) in the initial guess, and thus optimal N values are found. Findings - MATLAB BVP solvers have been proven to be effective for the numerical solution of RFAs with the proposed guess functions. In particular, with vectorizing, run time reduction is between 2.1 and 5.4 times for bvp4c and between 1.6 and 2.1 times for bvp5c and in addition to vectorizing, with the introduction of the analytical Jacobians, the reduction is between 2.4 and 6.2 times for bvp4c and 1.7 and 2.2 times for bvp5c, respectively, depending on the total pump power between 1,000 mW and 2,000 mW and the number of signals. Also, simulation results show that the efficiency of the solution with proposed guess functions is improved more than six times compared with those of previously reported continuation methods. Results show that the proposed guess functions with the vectorization and analytical Jacobians can be used for the performance evaluation of RFAs for the high power systems/long gain fiber span. Practical implications - The robust improvement of the solution proposed in this paper lies in the fact that the derived guess functions for the RFAs are highly effective in the sense that they assist the solver to converge to the solution for any total pump power value in a wide range from 1 to 3,000 mW and for any fiber lengths ranging 1 to 200 km which are used in practical applications. Hence, it is practicable for the performance evaluation of the existing RFA networks. Originality/value - The novelty of this method is that, starting with the co-propagating single pump and signal RFA schema, the authors derived the guess function specifically for the initial mesh points rather than using its analytical approximations. Moreover, the solution is generalized for co-/counter propagating pumps/signals with the curve fitted coefficient(s).en_US
dc.language.isoenen_US
dc.publisherEmerald Group Publishingen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAtıf Gayri Ticari Türetilemez 4.0 Uluslararasıtr_TR
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectComputer scienceen_US
dc.subjectEngineeringen_US
dc.subjectMathematicsen_US
dc.subjectMATLAB BVP solversen_US
dc.subjectGuess functionsen_US
dc.subjectRaman fiber amplifiers (RFAs)en_US
dc.subjectBoundary value problemsen_US
dc.subjectNumerical analysisen_US
dc.subjectFiber amplifiersen_US
dc.subjectAnalytical approximationen_US
dc.subjectAnalytical jacobiansen_US
dc.subjectContinuation methoden_US
dc.subjectDesign/methodology/approachen_US
dc.subjectEfficient analysisen_US
dc.subjectFiber lengthen_US
dc.subjectGain fibersen_US
dc.subjectHigh-power systemsen_US
dc.subjectInitial guessen_US
dc.subjectIntrinsic propertyen_US
dc.subjectMesh pointsen_US
dc.subjectN valueen_US
dc.subjectNumerical solutionen_US
dc.subjectPerformance evaluationen_US
dc.subjectPump poweren_US
dc.subjectRaman fiber amplifiersen_US
dc.subjectSignal wavesen_US
dc.subjectRuntimesen_US
dc.subjectSimulation speeden_US
dc.subjectSingle pumpsen_US
dc.subjectTaylor expansionsen_US
dc.subjectVectorizationen_US
dc.subjectMATLABen_US
dc.titleNovel guess functions for efficient analysis of raman fiber amplifiersen_US
dc.typeArticleen_US
dc.identifier.wos000302384700001tr_TR
dc.identifier.scopus2-s2.0-84857770777tr_TR
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergitr_TR
dc.contributor.departmentUludağ Üniversitesi/Mühendislik-Mimarlık Fakültesi/Elektronik Mühendisliği Bölümü.tr_TR
dc.identifier.startpage330tr_TR
dc.identifier.endpage345tr_TR
dc.identifier.volume31tr_TR
dc.identifier.issue2tr_TR
dc.relation.journalCOMPEL,The International Journal for Computation and Mathematics in Electrical and Electronic Engineeringen_US
dc.contributor.buuauthorYılmaz, Güneş-
dc.relation.collaborationYurt içitr_TR
dc.subject.wosComputer science, interdisciplinary applicationsen_US
dc.subject.wosEngineering, electrical & electronicen_US
dc.subject.wosMathematics, applieden_US
dc.indexed.wosSCIEen_US
dc.indexed.scopusScopusen_US
dc.wos.quartileQ4en_US
dc.contributor.scopusid7004543197tr_TR
dc.subject.scopusFiber Amplifiers; Raman; Wavelength Division Multiplexingen_US
Appears in Collections:Scopus
Web of Science

Files in This Item:
File Description SizeFormat 
Güneş_vd_2012.pdf313.48 kBAdobe PDFThumbnail
View/Open


This item is licensed under a Creative Commons License Creative Commons