Adaptive anomaly detection disruption prediction starting from first discharge on tokamak by X.K. Ai, W. Zheng, M. Zhang, Y.H. Ding, D.L. Chen, Z.Y. Chen, B.H. Guo, C.S. Shen, N.C. Wang, Z.J. Yang, Z.P. Chen, Y. Pan, B. Shen, B.J. Xiao, J-TEXT team

“…Plasma disruption presents a significant challenge in tokamak fusion, especially in large-size devices like ITER, where it causes severe damage. While current data-driven machine learning methods perform well in disruption prediction, they require extensive discharge data for model training. …”
Get full text

A Study on the Convergence Analysis of the Inexact Simplified Jacobi–Davidson Method by Jutao Zhao, Pengfei Guo

“…The Jacobi–Davidson iteration method is very efficient in solving Hermitian eigenvalue problems. …”
Get full text

Composition of Web Services Using Markov Decision Processes and Dynamic Programming by Víctor Uc-Cetina, Francisco Moo-Mena, Rafael Hernandez-Ucan

“…We propose a Markov decision process model for solving the Web service composition (WSC) problem. Iterative policy evaluation, value iteration, and policy iteration algorithms are used to experimentally validate our approach, with artificial and real data. …”
Get full text

IRSnet: An Implicit Residual Solver and Its Unfolding Neural Network With 0.003M Parameters for Total Variation Models by Yuanhao Gong

“…However, the traditional iterative solvers require a large number of iterations to converge, while deep learning solvers have a huge number of parameters, hampering their practical deployment. …”
Get full text

Self-Adaptive Step Firefly Algorithm by Shuhao Yu, Shanlin Yang, Shoubao Su

“…In the standard firefly algorithm, each firefly has the same step settings and its values decrease from iteration to iteration. Therefore, it may fall into the local optimum. …”
Get full text

Inversion Free Algorithms for Computing the Principal Square Root of a Matrix by Nicholas Assimakis, Maria Adam

“…In particular, all the classical iterative algorithms require matrix inversion at every iteration. …”
Get full text

Multiple Model ILC for Continuous-Time Nonlinear Systems by Xiaoli Li, Kang Wang, Yang Li

“…Multiple model iterative learning control (MMILC) method is proposed to deal with the continuous-time nonlinear system with uncertain and iteration-varying parameters. …”
Get full text

The Method Based on Series Solution for Identifying an Unknown Source Coefficient on the Temperature Field in the Quasiperiodic Media by Bingxian Wang, Chuanzhi Bai, M. Xu, L. P. Zhang

“…The innovation of this paper is solving the inverse problem by means of two different homotopy iteration processes. The first kind of homotopy iteration process is not convergent. …”
Get full text

The Unique Positive Solution for Singular Hadamard Fractional Boundary Value Problems by Jinxiu Mao, Zengqin Zhao, Chenguang Wang

“…The existence and uniqueness of the exact iterative solution are established only by using an iterative algorithm. …”
Get full text

Analysis of the Fractional-Order Kaup–Kupershmidt Equation via Novel Transforms by Naveed Iqbal, Humaira Yasmin, Ali Rezaiguia, Jeevan Kafle, A. Othman Almatroud, Taher S. Hassan

“…In this article, we develop a technique to determine the analytical result of some Kaup–Kupershmidt equations with the aid of a modified technique called the new iteration transform method. This technique is a mixture of the novel integral transformation Elzaki transformation and the new iteration technique. …”
Get full text

Comparison Theorems of Spectral Radius for Splittings of Matrices by Cui-Xia Li, Su-Hua Li

“…By structuring a new matrix, the iteration matrix of the corresponding double splitting iteration method is presented. …”
Get full text

On the numerical solving of one minimization problem by Raimondas Čiegis, Violeta Pakenienė

“… In this paper we consider the dependence of iterative methods convergence rate on iterative parameters selection. …”
Get full text

A General Class of Derivative Free Optimal Root Finding Methods Based on Rational Interpolation by Fiza Zafar, Nusrat Yasmin, Saima Akram, Moin-ud-Din Junjua

“…These methods do not need Newton’s iterate in the …first step of their iterative schemes. …”
Get full text

Screening for a Reweighted Penalized Conditional Gradient Method by Sun, Yifan, Bach, Francis

“…In the nonconvex case the screening rule converges to the true support in a finite number of iterations, but is not necessarily safe in the intermediate iterates. …”
Get full text

Fast surface reconstruction algorithm with adaptive step size. by Jingguo Dai, Yeqing Yi, Chengzhi Liu

“…In (Dai et al. 2023), the authors proposed a fast algorithm for surface reconstruction that converges rapidly from point cloud data by alternating Anderson extrapolation with implicit progressive iterative approximation (I-PIA). This algorithm employs a fixed step size during iterations to enhance convergence. …”
Get full text

Influence of partitioning methods on computational cost of cfd simulations applied to hydrocyclones by Felipe Orlando da Costa, Felipe Leonardo Barcelos Mateus, Irineu Petri Júnior

“… In simulations, when using multipartitioned computers, the way in which the mesh is partitioned directly affects the average time per iteration, and therefore, the computational cost. This study proposes an analysis of the average time per iteration of 23 different partition methods available for tridimensional mesh in software FLUENT 19.2. …”
Get full text

Coding redundancy controlled data forwarding mechanism in opportunistic networks by Da-peng WU, Peng-wen LOU, Qiao-shou LIU, Yu XIONG, Ru-yan WANG

“…But most of the data forwarding mechanism does not consider the iteration redundancy control during data transmission. …”
Get full text

Blind separation algorithm of PCMA signals with different symbol rates based on DG-PSP by Yi-ming GUO, Hua PENG, Yong YANG, Xue-juan WEI, Hao WANG

“…A blind separation algorithm was proposed for PCMA signals with different symbol rates based on double grid per-survivor processing (DG-PSP).The channel states and two input signal components were treated as two dynamic grids,receiving mixed-signal reconstructed by respectively iterative updating the two groups of grid status,thus achieving blind signal separation.The joint iterative decoding separation structure was focused,and a detailed analysis and comparison under different error estimation of parameters was shown.The complexity of the algorithm is similar to the traditional PSP algorithm.Simulation results show that,a gain of about 2 dB in signal-noise ratio can be obtained after the first iteration at a bit error rate of 10⁻²,and a gain of nearly 3 dB in signal-noise ratio can be obtained after the second iteration.…”
Get full text

A low complexity ZF precoding scheme based on weighted Gauss-Seidel in massive MIMO systems by Dong ZHOU, Haiyan CAO, Fangmin XU, Xin FANG, Xiumin WANG

“…In massive MIMO systems,due to inversion of Hermitian matrix,the complexity of the traditional ZF precoding method increases exponentially with increase of the number of users.To solve this problem,a low complexity digital ZF precoding scheme based on weighted Gauss-Seidel (WGS) was proposed.That was weighted addtion the iteration results of previous step and Gausee-Seidel iteration results to accelerate the iterative convergence.The weighting factor was determined by the least mean square sum,and the weighting factor was proved to make the algorithm converge.The simulation results show that the WGS algorithm can approximate the performance of ZF precoding scheme with very few iterations,and reduce the complexity of ZF precoding from O(K ³) to O(K²),where K is the number of users.…”
Get full text

THREE-DIMENSIONAL RECONSTRUCTION BY SART METHOD WITH MINIMIZATION OF THE TOTAL VARIATION by S. A. Zolotarev, M. A. Mirzavand

“…The algebraic reconstruction method with simultaneous iterations SART considered in this work as one of the most promising of iterative methods, suitable for the tomographic problems. …”
Get full text