CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: iterative</title> <meta name="description" content="Search results for: iterative"> <meta name="keywords" content="iterative"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="iterative" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="iterative"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 363</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: iterative</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">363</span> Approximating Fixed Points by a Two-Step Iterative Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safeer%20Hussain%20Khan">Safeer Hussain Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we introduce a two-step iterative algorithm to prove a strong convergence result for approximating common fixed points of three contractive-like operators. Our algorithm basically generalizes an existing algorithm..Our iterative algorithm also contains two famous iterative algorithms: Mann iterative algorithm and Ishikawa iterative algorithm. Thus our result generalizes the corresponding results proved for the above three iterative algorithms to a class of more general operators. At the end, we remark that nothing prevents us to extend our result to the case of the iterative algorithm with error terms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=contractive-like%20operator" title="contractive-like operator">contractive-like operator</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm" title=" iterative algorithm"> iterative algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title=" fixed point"> fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20convergence" title=" strong convergence"> strong convergence</a> </p> <a href="https://publications.waset.org/abstracts/10341/approximating-fixed-points-by-a-two-step-iterative-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10341.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">550</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">362</span> Fixed Points of Contractive-Like Operators by a Faster Iterative Process</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safeer%20Hussain%20Khan">Safeer Hussain Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we prove a strong convergence result using a recently introduced iterative process with contractive-like operators. This improves and generalizes corresponding results in the literature in two ways: the iterative process is faster, operators are more general. In the end, we indicate that the results can also be proved with the iterative process with error terms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=contractive-like%20operator" title="contractive-like operator">contractive-like operator</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20process" title=" iterative process"> iterative process</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title=" fixed point"> fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20convergence" title=" strong convergence"> strong convergence</a> </p> <a href="https://publications.waset.org/abstracts/3818/fixed-points-of-contractive-like-operators-by-a-faster-iterative-process" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3818.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">432</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">361</span> A Three-Step Iterative Process for Common Fixed Points of Three Contractive-Like Operators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safeer%20Hussain%20Khan">Safeer Hussain Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Fukhar-ud-Din"> H. Fukhar-ud-Din</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The concept of quasi-contractive type operators was given by Berinde and extended by Imoru and Olatinwo. They named this new type as contractive-like operators. On the other hand, Xu and Noo introduced a three-step-one-mappings iterative process which can be seen as a generalization of Mann and Ishikawa iterative processes. Approximating common fixed points has its own importance as it has a direct link with minimization problem. Motivated by this, in this paper, we first extend the iterative process of Xu and Noor to the case of three-step-three-mappings and then prove a strong convergence result using contractive-like operators for this iterative process. In general, this generalizes corresponding results using Mann, Ishikawa and Xu-Noor iterative processes with quasi-contractive type operators. It is to be pointed out that our results can also be proved with iterative process involving error terms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=contractive-like%20operator" title="contractive-like operator">contractive-like operator</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20process" title=" iterative process"> iterative process</a>, <a href="https://publications.waset.org/abstracts/search?q=common%20fixed%20point" title=" common fixed point"> common fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20convergence" title=" strong convergence"> strong convergence</a> </p> <a href="https://publications.waset.org/abstracts/15892/a-three-step-iterative-process-for-common-fixed-points-of-three-contractive-like-operators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15892.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">594</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">360</span> Efficient Iterative V-BLAST Detection Technique in Wireless Communication System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hwan-Jun%20Choi">Hwan-Jun Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Sung-Bok%20Choi"> Sung-Bok Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, among the MIMO-OFDM detection techniques, a lot of papers suggested V-BLAST scheme which can achieve high data rate. Therefore, the signal detection of MIMOOFDM system is important issue. In this paper, efficient iterative VBLAST detection technique is proposed in wireless communication system. The proposed scheme adjusts the number of candidate symbol and iterative scheme based on channel state. According to the simulation result, the proposed scheme has better BER performance than conventional schemes and similar BER performance of the QRD-M with iterative scheme. Moreover complexity of proposed scheme has 50.6 % less than complexity of QRD-M detection with iterative scheme. Therefore the proposed detection scheme can be efficiently used in wireless communication. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=MIMO-OFDM" title="MIMO-OFDM">MIMO-OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=V-BLAST" title=" V-BLAST"> V-BLAST</a>, <a href="https://publications.waset.org/abstracts/search?q=QR-decomposition" title=" QR-decomposition"> QR-decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=QRDM" title=" QRDM"> QRDM</a>, <a href="https://publications.waset.org/abstracts/search?q=DFE" title=" DFE"> DFE</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20scheme" title=" iterative scheme"> iterative scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20condition" title=" channel condition"> channel condition</a> </p> <a href="https://publications.waset.org/abstracts/3522/efficient-iterative-v-blast-detection-technique-in-wireless-communication-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3522.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">530</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">359</span> Implementation of Iterative Algorithm for Earthquake Location</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hussain%20K.%20Chaiel">Hussain K. Chaiel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The development in the field of the digital signal processing (DSP) and the microelectronics technology reduces the complexity of the iterative algorithms that need large number of arithmetic operations. Virtex-Field Programmable Gate Arrays (FPGAs) are programmable silicon foundations which offer an important solution for addressing the needs of high performance DSP designer. In this work, Virtex-7 FPGA technology is used to implement an iterative algorithm to estimate the earthquake location. Simulation results show that an implementation based on block RAMB36E1 and DSP48E1 slices of Virtex-7 type reduces the number of cycles of the clock frequency. This enables the algorithm to be used for earthquake prediction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DSP" title="DSP">DSP</a>, <a href="https://publications.waset.org/abstracts/search?q=earthquake" title=" earthquake"> earthquake</a>, <a href="https://publications.waset.org/abstracts/search?q=FPGA" title=" FPGA"> FPGA</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm" title=" iterative algorithm "> iterative algorithm </a> </p> <a href="https://publications.waset.org/abstracts/28897/implementation-of-iterative-algorithm-for-earthquake-location" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28897.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">389</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">358</span> An Iterative Family for Solution of System of Nonlinear Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sonia%20Sonia">Sonia Sonia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a family of iterative scheme for solving nonlinear systems of equations which have wide application in sciences and engineering. The proposed iterative family is based upon some parameters which generates many different iterative schemes. This family is completely derivative free and uses first of divided difference operator. Moreover some numerical experiments are performed and compared with existing methods. Analysis of convergence shows that the presented family has fourth-order of convergence. The dynamical behaviour of proposed family and local convergence have also been discussed. The numerical performance and convergence region comparison demonstrates that proposed family is efficient. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convergence" title="convergence">convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=divided%20difference%20operator" title=" divided difference operator"> divided difference operator</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20system" title=" nonlinear system"> nonlinear system</a>, <a href="https://publications.waset.org/abstracts/search?q=Newton%27s%20method" title=" Newton's method"> Newton's method</a> </p> <a href="https://publications.waset.org/abstracts/80719/an-iterative-family-for-solution-of-system-of-nonlinear-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80719.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">234</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">357</span> Common Fixed Point Results and Stability of a Modified Jungck Iterative Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hudson%20Akewe">Hudson Akewe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we introduce a modified Jungck (Dual Jungck) iterative scheme and use the scheme to approximate the unique common fixed point of a pair of generalized contractive-like operators in a Banach space. The iterative scheme is also shown to be stable with respect to the maps (S,T). An example is taken to justify the convergence of the scheme. Our result is a generalization and improvement of several results in the literature on single map T. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=generalized%20contractive-like%20operators" title="generalized contractive-like operators">generalized contractive-like operators</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20Jungck%20iterative%20scheme" title=" modified Jungck iterative scheme"> modified Jungck iterative scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=stability%20results" title=" stability results"> stability results</a>, <a href="https://publications.waset.org/abstracts/search?q=weakly%20compatible%20maps" title=" weakly compatible maps"> weakly compatible maps</a>, <a href="https://publications.waset.org/abstracts/search?q=unique%20common%20fixed%20point" title=" unique common fixed point"> unique common fixed point</a> </p> <a href="https://publications.waset.org/abstracts/68459/common-fixed-point-results-and-stability-of-a-modified-jungck-iterative-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68459.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">348</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">356</span> Description of the Non-Iterative Learning Algorithm of Artificial Neuron</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20S.%20Akhmetov">B. S. Akhmetov</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20T.%20Akhmetova"> S. T. Akhmetova</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20I.%20Ivanov"> A. I. Ivanov</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20S.%20Kartbayev"> T. S. Kartbayev</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Y.%20Malygin"> A. Y. Malygin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The problem of training of a network of artificial neurons in biometric appendices is that this process has to be completely automatic, i.e. the person operator should not participate in it. Therefore, this article discusses the issues of training the network of artificial neurons and the description of the non-iterative learning algorithm of artificial neuron. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=artificial%20neuron" title="artificial neuron">artificial neuron</a>, <a href="https://publications.waset.org/abstracts/search?q=biometrics" title=" biometrics"> biometrics</a>, <a href="https://publications.waset.org/abstracts/search?q=biometrical%20applications" title=" biometrical applications"> biometrical applications</a>, <a href="https://publications.waset.org/abstracts/search?q=learning%20of%20neuron" title=" learning of neuron"> learning of neuron</a>, <a href="https://publications.waset.org/abstracts/search?q=non-iterative%20algorithm" title=" non-iterative algorithm"> non-iterative algorithm</a> </p> <a href="https://publications.waset.org/abstracts/19446/description-of-the-non-iterative-learning-algorithm-of-artificial-neuron" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19446.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">494</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">355</span> A Study on the Iterative Scheme for Stratified Shields Gamma Ray Buildup Factor Using Layer-Splitting Technique in Double-Layer Shield</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sari%20F.%20Alkhatib">Sari F. Alkhatib</a>, <a href="https://publications.waset.org/abstracts/search?q=Chang%20Je%20Park"> Chang Je Park</a>, <a href="https://publications.waset.org/abstracts/search?q=Gyuhong%20Roh"> Gyuhong Roh</a>, <a href="https://publications.waset.org/abstracts/search?q=Daeseong%20Jo"> Daeseong Jo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The iterative scheme which is used to treat buildup factors for stratified shields of three-layers or more is being investigated here using the layer-splitting technique. The second layer in a double-layer shield was split into two equivalent layers and the scheme was implemented on the new 'three-layer' shield configuration. The results of such manipulation for water-lead and water-iron shields combinations are presented here for 1 MeV photons. It was found that splitting the second layer introduces some deviation on the overall buildup factor. This expected deviation appeared to be higher in the case of low Z layer followed by high Z. However, the iterative scheme showed a great consistency and strong coherence with the introduced changes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=build-up%20factor" title="build-up factor">build-up factor</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20scheme" title=" iterative scheme"> iterative scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=stratified%20shields" title=" stratified shields"> stratified shields</a>, <a href="https://publications.waset.org/abstracts/search?q=radiation%20protection" title=" radiation protection"> radiation protection</a> </p> <a href="https://publications.waset.org/abstracts/8373/a-study-on-the-iterative-scheme-for-stratified-shields-gamma-ray-buildup-factor-using-layer-splitting-technique-in-double-layer-shield" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8373.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">576</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">354</span> Optimal Relaxation Parameters for Obtaining Efficient Iterative Methods for the Solution of Electromagnetic Scattering Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nadaniela%20Egidi">Nadaniela Egidi</a>, <a href="https://publications.waset.org/abstracts/search?q=Pierluigi%20Maponi"> Pierluigi Maponi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The approximate solution of a time-harmonic electromagnetic scattering problem for inhomogeneous media is required in several application contexts, and its two-dimensional formulation is a Fredholm integral equation of the second kind. This integral equation provides a formulation for the direct scattering problem, but it has to be solved several times also in the numerical solution of the corresponding inverse scattering problem. The discretization of this Fredholm equation produces large and dense linear systems that are usually solved by iterative methods. In order to improve the efficiency of these iterative methods, we use the Symmetric SOR preconditioning, and we propose an algorithm for the evaluation of the associated relaxation parameter. We show the efficiency of the proposed algorithm by several numerical experiments, where we use two Krylov subspace methods, i.e., Bi-CGSTAB and GMRES. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fredholm%20integral%20equation" title="Fredholm integral equation">Fredholm integral equation</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20method" title=" iterative method"> iterative method</a>, <a href="https://publications.waset.org/abstracts/search?q=preconditioning" title=" preconditioning"> preconditioning</a>, <a href="https://publications.waset.org/abstracts/search?q=scattering%20problem" title=" scattering problem"> scattering problem</a> </p> <a href="https://publications.waset.org/abstracts/142902/optimal-relaxation-parameters-for-obtaining-efficient-iterative-methods-for-the-solution-of-electromagnetic-scattering-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142902.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">103</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">353</span> A Study on the Iterative Scheme for Stratified Shields Gamma Ray Buildup Factors Using Layer-Splitting Technique in Double-Layer Shields</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sari%20F.%20Alkhatib">Sari F. Alkhatib</a>, <a href="https://publications.waset.org/abstracts/search?q=Chang%20Je%20Park"> Chang Je Park</a>, <a href="https://publications.waset.org/abstracts/search?q=Gyuhong%20Roh"> Gyuhong Roh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The iterative scheme which is used to treat buildup factors for stratified shields is being investigated here using the layer-splitting technique. A simple suggested formalism for the scheme based on the Kalos’ formula is introduced, based on which the implementation of the testing technique is carried out. The second layer in a double-layer shield was split into two equivalent layers and the scheme (with the suggested formalism) was implemented on the new “three-layer” shield configuration. The results of such manipulation on water-lead and water-iron shields combinations are presented here for 1 MeV photons. It was found that splitting the second layer introduces some deviation on the overall buildup factor value. This expected deviation appeared to be higher in the case of low Z layer followed by high Z. However, the overall performance of the iterative scheme showed a great consistency and strong coherence even with the introduced changes. The introduced layer-splitting testing technique shows the capability to be implemented in test the iterative scheme with a wide range of formalisms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=buildup%20factor" title="buildup factor">buildup factor</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20scheme" title=" iterative scheme"> iterative scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=stratified%20shields" title=" stratified shields"> stratified shields</a>, <a href="https://publications.waset.org/abstracts/search?q=layer-splitting%20tecnique" title=" layer-splitting tecnique"> layer-splitting tecnique</a> </p> <a href="https://publications.waset.org/abstracts/8371/a-study-on-the-iterative-scheme-for-stratified-shields-gamma-ray-buildup-factors-using-layer-splitting-technique-in-double-layer-shields" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8371.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">416</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">352</span> New High Order Group Iterative Schemes in the Solution of Poisson Equation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sam%20Teek%20Ling">Sam Teek Ling</a>, <a href="https://publications.waset.org/abstracts/search?q=Norhashidah%20Hj.%20Mohd.%20Ali"> Norhashidah Hj. Mohd. Ali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We investigate the formulation and implementation of new explicit group iterative methods in solving the two-dimensional Poisson equation with Dirichlet boundary conditions. The methods are derived from a fourth order compact nine point finite difference discretization. The methods are compared with the existing second order standard five point formula to show the dramatic improvement in computed accuracy. Numerical experiments are presented to illustrate the effectiveness of the proposed methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=explicit%20group%20iterative%20method" title="explicit group iterative method">explicit group iterative method</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20difference" title=" finite difference"> finite difference</a>, <a href="https://publications.waset.org/abstracts/search?q=fourth%20order%20compact" title=" fourth order compact"> fourth order compact</a>, <a href="https://publications.waset.org/abstracts/search?q=Poisson%20equation" title=" Poisson equation"> Poisson equation</a> </p> <a href="https://publications.waset.org/abstracts/1329/new-high-order-group-iterative-schemes-in-the-solution-of-poisson-equation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1329.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">432</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">351</span> Iterative Solver for Solving Large-Scale Frictional Contact Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thierno%20Diop">Thierno Diop</a>, <a href="https://publications.waset.org/abstracts/search?q=Michel%20Fortin"> Michel Fortin</a>, <a href="https://publications.waset.org/abstracts/search?q=Jean%20Deteix"> Jean Deteix</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Since the precise formulation of the elastic part is irrelevant for the description of the algorithm, we shall consider a generic case. In practice, however, we will have to deal with a non linear material (for instance a Mooney-Rivlin model). We are interested in solving a finite element approximation of the problem, leading to large-scale non linear discrete problems and, after linearization, to large linear systems and ultimately to calculations needing iterative methods. This also implies that penalty method, and therefore augmented Lagrangian method, are to be banned because of their negative effect on the condition number of the underlying discrete systems and thus on the convergence of iterative methods. This is in rupture to the mainstream of methods for contact in which augmented Lagrangian is the principal tool. We shall first present the problem and its discretization; this will lead us to describe a general solution algorithm relying on a preconditioner for saddle-point problems which we shall describe in some detail as it is not entirely standard. We will propose an iterative approach for solving three-dimensional frictional contact problems between elastic bodies, including contact with a rigid body, contact between two or more bodies and also self-contact. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frictional%20contact" title="frictional contact">frictional contact</a>, <a href="https://publications.waset.org/abstracts/search?q=three-dimensional" title=" three-dimensional"> three-dimensional</a>, <a href="https://publications.waset.org/abstracts/search?q=large-scale" title=" large-scale"> large-scale</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20method" title=" iterative method"> iterative method</a> </p> <a href="https://publications.waset.org/abstracts/90130/iterative-solver-for-solving-large-scale-frictional-contact-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/90130.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">210</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">350</span> Investigation of the Stability of the F* Iterative Algorithm on Strong Peudocontractive Mappings and Its Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Felix%20Damilola%20Ajibade">Felix Damilola Ajibade</a>, <a href="https://publications.waset.org/abstracts/search?q=Opeyemi%20O.%20Enoch"> Opeyemi O. Enoch</a>, <a href="https://publications.waset.org/abstracts/search?q=Taiwo%20Paul%20Fajusigbe"> Taiwo Paul Fajusigbe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper is centered on conducting an inquiry into the stability of the F* iterative algorithm to the fixed point of a strongly pseudo-contractive mapping in the framework of uniformly convex Banach spaces. To achieve the desired result, certain existing inequalities in convex Banach spaces were utilized, as well as the stability criteria of Harder and Hicks. Other necessary conditions for the stability of the F* algorithm on strong pseudo-contractive mapping were also obtained. Through a numerical approach, we prove that the F* iterative algorithm is H-stable for strongly pseudo-contractive mapping. Finally, the solution of the mixed-type Volterra-Fredholm functional non-linear integral equation is estimated using our results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=stability" title="stability">stability</a>, <a href="https://publications.waset.org/abstracts/search?q=F%2A%20-iterative%20algorithm" title=" F* -iterative algorithm"> F* -iterative algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=pseudo-contractive%20mappings" title=" pseudo-contractive mappings"> pseudo-contractive mappings</a>, <a href="https://publications.waset.org/abstracts/search?q=uniformly%20convex%20Banach%20space" title=" uniformly convex Banach space"> uniformly convex Banach space</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed-type%20Volterra-Fredholm%20integral%20equation" title=" mixed-type Volterra-Fredholm integral equation"> mixed-type Volterra-Fredholm integral equation</a> </p> <a href="https://publications.waset.org/abstracts/167503/investigation-of-the-stability-of-the-f-iterative-algorithm-on-strong-peudocontractive-mappings-and-its-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/167503.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">103</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">349</span> A Variant of Newton's Method with Free Second-Order Derivative</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Young%20Hee%20Geum">Young Hee Geum</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present the iterative method and determine the control parameters to converge cubically for solving nonlinear equations. In addition, we derive the asymptotic error constant. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=asymptotic%20error%20constant" title="asymptotic error constant">asymptotic error constant</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20method" title=" iterative method"> iterative method</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20root" title=" multiple root"> multiple root</a>, <a href="https://publications.waset.org/abstracts/search?q=root-finding" title=" root-finding"> root-finding</a>, <a href="https://publications.waset.org/abstracts/search?q=order%20of%20convergent" title=" order of convergent"> order of convergent</a> </p> <a href="https://publications.waset.org/abstracts/10054/a-variant-of-newtons-method-with-free-second-order-derivative" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10054.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">292</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">348</span> Reduced Complexity Iterative Solution For I/Q Imbalance Problem in DVB-T2 Systems </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Karim%20S.%20Hassan">Karim S. Hassan</a>, <a href="https://publications.waset.org/abstracts/search?q=Hisham%20M.%20Hamed"> Hisham M. Hamed</a>, <a href="https://publications.waset.org/abstracts/search?q=Yassmine%20A.%20Fahmy"> Yassmine A. Fahmy</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20F.%20Shalash"> Ahmed F. Shalash</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The mismatch between in-phase and quadrature signals in Orthogonal frequency division multiplexing (OFDM) systems, such as DVB-T2, results in a severe degradation in performance. Several general solutions have been proposed in the past, but these are largely computationally intensive, leading to complex implementations. In this paper, we propose a relatively simple iterative solution, which provides good results in relatively few iterations, using fixed precision arithmetic. An additional advantage is that complex digital blocks, such as dividers and square root, are not required. Thus, the proposed solution may be implemented in relatively simple hardware. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=OFDM" title="OFDM">OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=DVB-T2" title=" DVB-T2"> DVB-T2</a>, <a href="https://publications.waset.org/abstracts/search?q=I%2FQ%20imbalance" title=" I/Q imbalance"> I/Q imbalance</a>, <a href="https://publications.waset.org/abstracts/search?q=I%2FQ%20mismatch" title=" I/Q mismatch"> I/Q mismatch</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20method" title=" iterative method"> iterative method</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title=" fixed point"> fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=reduced%20complexity" title=" reduced complexity"> reduced complexity</a> </p> <a href="https://publications.waset.org/abstracts/1821/reduced-complexity-iterative-solution-for-iq-imbalance-problem-in-dvb-t2-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1821.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">541</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">347</span> A Comparative Study of High Order Rotated Group Iterative Schemes on Helmholtz Equation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Norhashidah%20Hj.%20Mohd%20Ali">Norhashidah Hj. Mohd Ali</a>, <a href="https://publications.waset.org/abstracts/search?q=Teng%20Wai%20Ping"> Teng Wai Ping</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present a high order group explicit method in solving the two dimensional Helmholtz equation<em>.</em> The presented method is derived from a nine-point fourth order finite difference approximation formula obtained from a 45-degree rotation of the standard grid which makes it possible for the construction of iterative procedure with reduced complexity. The developed method will be compared with the existing group iterative schemes available in literature in terms of computational time, iteration counts, and computational complexity. The comparative performances of the methods will be discussed and reported. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=explicit%20group%20method" title="explicit group method">explicit group method</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20difference" title=" finite difference"> finite difference</a>, <a href="https://publications.waset.org/abstracts/search?q=helmholtz%20equation" title=" helmholtz equation"> helmholtz equation</a>, <a href="https://publications.waset.org/abstracts/search?q=rotated%20grid" title=" rotated grid"> rotated grid</a>, <a href="https://publications.waset.org/abstracts/search?q=standard%20grid" title=" standard grid"> standard grid</a> </p> <a href="https://publications.waset.org/abstracts/51535/a-comparative-study-of-high-order-rotated-group-iterative-schemes-on-helmholtz-equation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51535.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">456</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">346</span> Explicit Iterative Scheme for Approximating a Common Solution of Generalized Mixed Equilibrium Problem and Fixed Point Problem for a Nonexpansive Semigroup in Hilbert Space</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Farid">Mohammad Farid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we introduce and study an explicit iterative method based on hybrid extragradient method to approximate a common solution of generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup in Hilbert space. Further, we prove that the sequence generated by the proposed iterative scheme converge strongly to the common solution of generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup. This common solution is the unique solution of a variational inequality problem and is the optimality condition for a minimization problem. The results presented in this paper are the supplement, extension and generalization of the previously known results in this area. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=generalized%20mixed%20equilibrium%20problem" title="generalized mixed equilibrium problem">generalized mixed equilibrium problem</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed-point%20problem" title=" fixed-point problem"> fixed-point problem</a>, <a href="https://publications.waset.org/abstracts/search?q=nonexpansive%20semigroup" title=" nonexpansive semigroup"> nonexpansive semigroup</a>, <a href="https://publications.waset.org/abstracts/search?q=variational%20inequality%20problem" title=" variational inequality problem"> variational inequality problem</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20algorithms" title=" iterative algorithms"> iterative algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20extragradient%20method" title=" hybrid extragradient method"> hybrid extragradient method</a> </p> <a href="https://publications.waset.org/abstracts/14070/explicit-iterative-scheme-for-approximating-a-common-solution-of-generalized-mixed-equilibrium-problem-and-fixed-point-problem-for-a-nonexpansive-semigroup-in-hilbert-space" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14070.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">475</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">345</span> On the Algorithmic Iterative Solutions of Conjugate Gradient, Gauss-Seidel and Jacobi Methods for Solving Systems of Linear Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hussaini%20Doko%20Ibrahim">Hussaini Doko Ibrahim</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamilton%20Cyprian%20Chinwenyi"> Hamilton Cyprian Chinwenyi</a>, <a href="https://publications.waset.org/abstracts/search?q=Henrietta%20Nkem%20Ude"> Henrietta Nkem Ude</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, efforts were made to examine and compare the algorithmic iterative solutions of the conjugate gradient method as against other methods such as Gauss-Seidel and Jacobi approaches for solving systems of linear equations of the form Ax=b, where A is a real n×n symmetric and positive definite matrix. We performed algorithmic iterative steps and obtained analytical solutions of a typical 3×3 symmetric and positive definite matrix using the three methods described in this paper (Gauss-Seidel, Jacobi, and conjugate gradient methods), respectively. From the results obtained, we discovered that the conjugate gradient method converges faster to exact solutions in fewer iterative steps than the two other methods, which took many iterations, much time, and kept tending to the exact solutions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient" title="conjugate gradient">conjugate gradient</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20equations" title=" linear equations"> linear equations</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20and%20positive%20definite%20matrix" title=" symmetric and positive definite matrix"> symmetric and positive definite matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=gauss-seidel" title=" gauss-seidel"> gauss-seidel</a>, <a href="https://publications.waset.org/abstracts/search?q=Jacobi" title=" Jacobi"> Jacobi</a>, <a href="https://publications.waset.org/abstracts/search?q=algorithm" title=" algorithm"> algorithm</a> </p> <a href="https://publications.waset.org/abstracts/138341/on-the-algorithmic-iterative-solutions-of-conjugate-gradient-gauss-seidel-and-jacobi-methods-for-solving-systems-of-linear-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/138341.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">149</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">344</span> Identification of Wiener Model Using Iterative Schemes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vikram%20Saini">Vikram Saini</a>, <a href="https://publications.waset.org/abstracts/search?q=Lillie%20Dewan"> Lillie Dewan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the iterative schemes based on Least square, Hierarchical Least Square and Stochastic Approximation Gradient method for the Identification of Wiener model with parametric structure. A gradient method is presented for the parameter estimation of wiener model with noise conditions based on the stochastic approximation. Simulation results are presented for the Wiener model structure with different static non-linear elements in the presence of colored noise to show the comparative analysis of the iterative methods. The stochastic gradient method shows improvement in the estimation performance and provides fast convergence of the parameters estimates. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hard%20non-linearity" title="hard non-linearity">hard non-linearity</a>, <a href="https://publications.waset.org/abstracts/search?q=least%20square" title=" least square"> least square</a>, <a href="https://publications.waset.org/abstracts/search?q=parameter%20estimation" title=" parameter estimation"> parameter estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20approximation%20gradient" title=" stochastic approximation gradient"> stochastic approximation gradient</a>, <a href="https://publications.waset.org/abstracts/search?q=Wiener%20model" title=" Wiener model"> Wiener model</a> </p> <a href="https://publications.waset.org/abstracts/70632/identification-of-wiener-model-using-iterative-schemes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70632.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">405</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">343</span> CT Doses Pre and Post SAFIRE: Sinogram Affirmed Iterative Reconstruction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Noroozian">N. Noroozian</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Halim"> M. Halim</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Holloway"> B. Holloway</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Computed Tomography (CT) has become the largest source of radiation exposure in modern countries however, recent technological advances have created new methods to reduce dose without negatively affecting image quality. SAFIRE has emerged as a new software package which utilizes full raw data projections for iterative reconstruction, thereby allowing for lower CT dose to be used. this audit was performed to compare CT doses in certain examinations before and after the introduction of SAFIRE at our Radiology department which showed CT doses were significantly lower using SAFIRE compared with pre-SAFIRE software at SAFIRE 3 setting for the following studies:CSKUH Unenhanced brain scans (-20.9%), CABPEC Abdomen and pelvis with contrast (-21.5%), CCHAPC Chest with contrast (-24.4%), CCHAPC Abdomen and pelvis with contrast (-16.1%), CCHAPC Total chest, abdomen and pelvis (-18.7%). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dose%20reduction" title="dose reduction">dose reduction</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20reconstruction" title=" iterative reconstruction"> iterative reconstruction</a>, <a href="https://publications.waset.org/abstracts/search?q=low%20dose%20CT%20techniques" title=" low dose CT techniques"> low dose CT techniques</a>, <a href="https://publications.waset.org/abstracts/search?q=SAFIRE" title=" SAFIRE"> SAFIRE</a> </p> <a href="https://publications.waset.org/abstracts/18344/ct-doses-pre-and-post-safire-sinogram-affirmed-iterative-reconstruction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18344.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">285</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">342</span> A Survey on Fixed Point Iterations in Modular Function Spaces and an Application to Ode</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hudson%20Akewe">Hudson Akewe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research presents complementary results with wider applications on convergence and rate of convergence of classical fixed point theory in Banach spaces to the world of the theory of fixed points of mappings defined in classes of spaces of measurable functions, known in the literature as modular function spaces. The study gives a comprehensive survey of various iterative fixed point results for the classes of multivalued ρ-contractive-like, ρ-quasi-contractive-like, ρ-quasi-contractive, ρ-Zamfirescu and ρ-contraction mappings in the framework of modular function spaces. An example is presented to demonstrate the applicability of the implicit-type iterative schemes to the system of ordinary diﬀerential equations. Furthermore, numerical examples are given to show the rate of convergence of the various explicit Kirk-type and implicit Kirk-type iterative schemes under consideration. Our results complement the results obtained on normed and metric spaces in the literature. Also, our methods of proof serve as a guide to obtain several similar improved results for nonexpansive, pseudo-contractive, and accretive type mappings. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=implicit%20Kirk-type%20iterative%20schemes" title="implicit Kirk-type iterative schemes">implicit Kirk-type iterative schemes</a>, <a href="https://publications.waset.org/abstracts/search?q=multivalued%20mappings" title=" multivalued mappings"> multivalued mappings</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence%20results" title=" convergence results"> convergence results</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title=" fixed point"> fixed point</a> </p> <a href="https://publications.waset.org/abstracts/151918/a-survey-on-fixed-point-iterations-in-modular-function-spaces-and-an-application-to-ode" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/151918.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">128</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">341</span> An Improved Method to Compute Sparse Graphs for Traveling Salesman Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Y.%20Wang">Y. Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Traveling salesman problem (TSP) is NP-hard in combinatorial optimization. The research shows the algorithms for TSP on the sparse graphs have the shorter computation time than those for TSP according to the complete graphs. We present an improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals. The iterative algorithm is enhanced by adjusting two parameters of the algorithm. The computation time of the algorithm is <em>O</em>(<em>CN</em><sub>max</sub><em>n</em><sup>2</sup>) where <em>C</em> is the iterations, <em>N</em><sub>max</sub> is the maximum number of frequency quadrilaterals containing each edge and <em>n</em> is the scale of TSP. The experimental results showed the computed sparse graphs generally have less than 5<em>n</em> edges for most of these Euclidean instances. Moreover, the maximum degree and minimum degree of the vertices in the sparse graphs do not have much difference. Thus, the computation time of the methods to resolve the TSP on these sparse graphs will be greatly reduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frequency%20quadrilateral" title="frequency quadrilateral">frequency quadrilateral</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm" title=" iterative algorithm"> iterative algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=sparse%20graph" title=" sparse graph"> sparse graph</a>, <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title=" traveling salesman problem"> traveling salesman problem</a> </p> <a href="https://publications.waset.org/abstracts/82737/an-improved-method-to-compute-sparse-graphs-for-traveling-salesman-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82737.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">233</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">340</span> Iterative Dynamic Programming for 4D Flight Trajectory Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kawser%20Ahmed">Kawser Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Bousson"> K. Bousson</a>, <a href="https://publications.waset.org/abstracts/search?q=Milca%20F.%20Coelho"> Milca F. Coelho</a> </p> <p class="card-text"><strong>Abstract:</strong></p> 4D flight trajectory optimization is one of the key ingredients to improve flight efficiency and to enhance the air traffic capacity in the current air traffic management (ATM). The present paper explores the iterative dynamic programming (IDP) as a potential numerical optimization method for 4D flight trajectory optimization. IDP is an iterative version of the Dynamic programming (DP) method. Due to the numerical framework, DP is very suitable to deal with nonlinear discrete dynamic systems. The 4D waypoint representation of the flight trajectory is similar to the discretization by a grid system; thus DP is a natural method to deal with the 4D flight trajectory optimization. However, the computational time and space complexity demanded by the DP is enormous due to the immense number of grid points required to find the optimum, which prevents the use of the DP in many practical high dimension problems. On the other hand, the IDP has shown potentials to deal successfully with high dimension optimal control problems even with a few numbers of grid points at each stage, which reduces the computational effort over the traditional DP approach. Although the IDP has been applied successfully in chemical engineering problems, IDP is yet to be validated in 4D flight trajectory optimization problems. In this paper, the IDP has been successfully used to generate minimum length 4D optimal trajectory avoiding any obstacle in its path, such as a no-fly zone or residential areas when flying in low altitude to reduce noise pollution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=4D%20waypoint%20navigation" title="4D waypoint navigation">4D waypoint navigation</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming" title=" iterative dynamic programming"> iterative dynamic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=obstacle%20avoidance" title=" obstacle avoidance"> obstacle avoidance</a>, <a href="https://publications.waset.org/abstracts/search?q=trajectory%20optimization" title=" trajectory optimization"> trajectory optimization</a> </p> <a href="https://publications.waset.org/abstracts/106496/iterative-dynamic-programming-for-4d-flight-trajectory-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/106496.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">162</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">339</span> Iterative Design Process for Development and Virtual Commissioning of Plant Control Software</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thorsten%20Prante">Thorsten Prante</a>, <a href="https://publications.waset.org/abstracts/search?q=Robert%20Sch%C3%B6ch"> Robert Schöch</a>, <a href="https://publications.waset.org/abstracts/search?q=Ruth%20Fleisch"> Ruth Fleisch</a>, <a href="https://publications.waset.org/abstracts/search?q=Vaheh%20Khachatouri"> Vaheh Khachatouri</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexander%20Walch"> Alexander Walch</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The development of industrial plant control software is a complex and often very expensive task. One of the core problems is that a lot of the implementation and adaptation work can only be done after the plant hardware has been installed. In this paper, we present our approach to virtually developing and validating plant-level control software of production plants. This way, plant control software can be virtually commissioned before actual ramp-up of a plant, reducing actual commissioning costs and time. Technically, this is achieved by linking the actual plant-wide process control software (often called plant server) and an elaborate virtual plant model together to form an emulation system. Method-wise, we are suggesting a four-step iterative process with well-defined increments and time frame. Our work is based on practical experiences from planning to commissioning and start-up of several cut-to-size plants. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=iterative%20system%20design" title="iterative system design">iterative system design</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20plant%20engineering" title=" virtual plant engineering"> virtual plant engineering</a>, <a href="https://publications.waset.org/abstracts/search?q=plant%20control%20software" title=" plant control software"> plant control software</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation%20and%20emulation" title=" simulation and emulation"> simulation and emulation</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20commissioning" title=" virtual commissioning"> virtual commissioning</a> </p> <a href="https://publications.waset.org/abstracts/14534/iterative-design-process-for-development-and-virtual-commissioning-of-plant-control-software" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14534.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">488</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">338</span> Iterative Estimator-Based Nonlinear Backstepping Control of a Robotic Exoskeleton</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Brahmi%20Brahim">Brahmi Brahim</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Habibur%20Rahman"> Mohammad Habibur Rahman</a>, <a href="https://publications.waset.org/abstracts/search?q=Maarouf%20Saad"> Maarouf Saad</a>, <a href="https://publications.waset.org/abstracts/search?q=Crist%C3%B3bal%20Ochoa%20Luna"> Cristóbal Ochoa Luna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A repetitive training movement is an efficient method to improve the ability and movement performance of stroke survivors and help them to recover their lost motor function and acquire new skills. The ETS-MARSE is seven degrees of freedom (DOF) exoskeleton robot developed to be worn on the lateral side of the right upper-extremity to assist and rehabilitate the patients with upper-extremity dysfunction resulting from stroke. Practically, rehabilitation activities are repetitive tasks, which make the assistive/robotic systems to suffer from repetitive/periodic uncertainties and external perturbations induced by the high-order dynamic model (seven DOF) and interaction with human muscle which impact on the tracking performance and even on the stability of the exoskeleton. To ensure the robustness and the stability of the robot, a new nonlinear backstepping control was implemented with designed tests performed by healthy subjects. In order to limit and to reject the periodic/repetitive disturbances, an iterative estimator was integrated into the control of the system. The estimator does not need the precise dynamic model of the exoskeleton. Experimental results confirm the robustness and accuracy of the controller performance to deal with the external perturbation, and the effectiveness of the iterative estimator to reject the repetitive/periodic disturbances. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=backstepping%20control" title="backstepping control">backstepping control</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20control" title=" iterative control"> iterative control</a>, <a href="https://publications.waset.org/abstracts/search?q=Rehabilitation" title=" Rehabilitation"> Rehabilitation</a>, <a href="https://publications.waset.org/abstracts/search?q=ETS-MARSE" title=" ETS-MARSE"> ETS-MARSE</a> </p> <a href="https://publications.waset.org/abstracts/50768/iterative-estimator-based-nonlinear-backstepping-control-of-a-robotic-exoskeleton" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50768.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">286</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">337</span> Semilocal Convergence of a Three Step Fifth Order Iterative Method under Hölder Continuity Condition in Banach Spaces</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ramandeep%20Behl">Ramandeep Behl</a>, <a href="https://publications.waset.org/abstracts/search?q=Prashanth%20Maroju"> Prashanth Maroju</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20S.%20Motsa"> S. S. Motsa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we study the semilocal convergence of a fifth order iterative method using recurrence relation under the assumption that first order Fréchet derivative satisfies the Hölder condition. Also, we calculate the R-order of convergence and provide some a priori error bounds. Based on this, we give existence and uniqueness region of the solution for a nonlinear Hammerstein integral equation of the second kind. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Holder%20continuity%20condition" title="Holder continuity condition">Holder continuity condition</a>, <a href="https://publications.waset.org/abstracts/search?q=Frechet%20derivative" title=" Frechet derivative"> Frechet derivative</a>, <a href="https://publications.waset.org/abstracts/search?q=fifth%20order%20convergence" title=" fifth order convergence"> fifth order convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=recurrence%20relations" title=" recurrence relations"> recurrence relations</a> </p> <a href="https://publications.waset.org/abstracts/57605/semilocal-convergence-of-a-three-step-fifth-order-iterative-method-under-holder-continuity-condition-in-banach-spaces" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57605.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">612</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">336</span> Analysis of the Inverse Kinematics for 5 DOF Robot Arm Using D-H Parameters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Apurva%20Patil">Apurva Patil</a>, <a href="https://publications.waset.org/abstracts/search?q=Maithilee%20Kulkarni"> Maithilee Kulkarni</a>, <a href="https://publications.waset.org/abstracts/search?q=Ashay%20Aswale"> Ashay Aswale</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes an algorithm to develop the kinematic model of a 5 DOF robot arm. The formulation of the problem is based on finding the D-H parameters of the arm. Brute Force iterative method is employed to solve the system of non linear equations. The focus of the paper is to obtain the accurate solutions by reducing the root mean square error. The result obtained will be implemented to grip the objects. The trajectories followed by the end effector for the required workspace coordinates are plotted. The methodology used here can be used in solving the problem for any other kinematic chain of up to six DOF. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=5%20DOF%20robot%20arm" title="5 DOF robot arm">5 DOF robot arm</a>, <a href="https://publications.waset.org/abstracts/search?q=D-H%20parameters" title=" D-H parameters"> D-H parameters</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20kinematics" title=" inverse kinematics"> inverse kinematics</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20method" title=" iterative method"> iterative method</a>, <a href="https://publications.waset.org/abstracts/search?q=trajectories" title=" trajectories"> trajectories</a> </p> <a href="https://publications.waset.org/abstracts/70099/analysis-of-the-inverse-kinematics-for-5-dof-robot-arm-using-d-h-parameters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70099.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">202</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">335</span> A General Iterative Nonlinear Programming Method to Synthesize Heat Exchanger Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rupu%20Yang">Rupu Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Cong%20Toan%20Tran"> Cong Toan Tran</a>, <a href="https://publications.waset.org/abstracts/search?q=Assaad%20Zoughaib"> Assaad Zoughaib</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The work provides an iterative nonlinear programming method to synthesize a heat exchanger network by manipulating the trade-offs between the heat load of process heat exchangers (HEs) and utilities. We consider for the synthesis problem two cases, the first one without fixed cost for HEs, and the second one with fixed cost. For the no fixed cost problem, the nonlinear programming (NLP) model with all the potential HEs is optimized to obtain the global optimum. For the case with fixed cost, the NLP model is iterated through adding/removing HEs. The method was applied in five case studies and illustrated quite well effectiveness. Among which, the approach reaches the lowest TAC (2,904,026$/year) compared with the best record for the famous Aromatic plants problem. It also locates a slightly better design than records in literature for a 10 streams case without fixed cost with only 1/9 computational time. Moreover, compared to the traditional mixed-integer nonlinear programming approach, the iterative NLP method opens a possibility to consider constraints (such as controllability or dynamic performances) that require knowing the structure of the network to be calculated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=heat%20exchanger%20network" title="heat exchanger network">heat exchanger network</a>, <a href="https://publications.waset.org/abstracts/search?q=synthesis" title=" synthesis"> synthesis</a>, <a href="https://publications.waset.org/abstracts/search?q=NLP" title=" NLP"> NLP</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/138480/a-general-iterative-nonlinear-programming-method-to-synthesize-heat-exchanger-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/138480.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">162</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">334</span> Parallel Multisplitting Methods for DAE’s</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Machmoum">Ahmed Machmoum</a>, <a href="https://publications.waset.org/abstracts/search?q=Malika%20El%20Kyal"> Malika El Kyal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider iterative parallel multi-splitting method for differential algebraic equations. The main feature of the proposed idea is to use the asynchronous form. We prove that the multi-splitting technique can effectively accelerate the convergent performance of the iterative process. The main characteristic of an asynchronous mode is that the local algorithm not have to wait at predetermined messages to become available. We allow some processors to communicate more frequently than others, and we allow the communication delays tobe substantial and unpredictable. Note that synchronous algorithms in the computer science sense are particular cases of our formulation of asynchronous one. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computer" title="computer">computer</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-splitting%20methods" title=" multi-splitting methods"> multi-splitting methods</a>, <a href="https://publications.waset.org/abstracts/search?q=asynchronous%20mode" title=" asynchronous mode"> asynchronous mode</a>, <a href="https://publications.waset.org/abstracts/search?q=differential%20algebraic%20systems" title=" differential algebraic systems "> differential algebraic systems </a> </p> <a href="https://publications.waset.org/abstracts/23813/parallel-multisplitting-methods-for-daes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23813.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">549</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative&page=10">10</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative&page=11">11</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative&page=12">12</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative&page=13">13</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>