Skip to Content

1,285 Results Found

  • Article
  • Open Access
11 Citations
2,699 Views
13 Pages

A Novel Family of Efficient Weighted-Newton Multiple Root Iterations

  • Deepak Kumar,
  • Janak Raj Sharma and
  • Lorentz Jăntschi

10 September 2020

We propose a novel family of seventh-order iterative methods for computing multiple zeros of a nonlinear function. The algorithm consists of three steps, of which the first two are the steps of recently developed Liu–Zhou fourth-order method, w...

(This article belongs to the Special Issue Symmetry in Numerical Analysis and Numerical Methods)
  • Article
  • Open Access
357 Views
25 Pages

An Accelerated Residual ADI Method for Large-Scale Low-Rank Riccati Equations

  • Bo Yu,
  • Jia-Wang Hu,
  • Yi-Wen Liu,
  • Chen-Yi Yuan and
  • Ning Dong

3 July 2026

This paper considers the acceleration of the residual alternating direction implicit (RADI) iteration for solving large-scale low-rank Riccati matrix equations arising from time-invariant control systems. A direct attempt to accelerate the ADI iterat...

(This article belongs to the Special Issue Artificial and Computational Intelligence Innovations in Symbolic and Soft Computing for Theoretical and Applied Science)
  • Article
  • Open Access
3 Citations
3,048 Views
23 Pages

22 April 2022

Several two-level iterative methods based on nonconforming finite element methods are applied for solving numerically the 2D/3D stationary incompressible MHD equations under different uniqueness conditions. These two-level algorithms are motivated by...

(This article belongs to the Special Issue Finite Element Methods for the Navier-Stokes Equations and MHD Equations)
  • Article
  • Open Access
2,546 Views
12 Pages

Consider the computation of the solution for a class of discrete-time algebraic Riccati equations (DAREs) with the low-ranked coefficient matrix G and the high-ranked constant matrix H. A structured doubling algorithm is proposed for large-scale prob...

(This article belongs to the Special Issue Applications of Iterative Methods in Solving Nonlinear Equations)
  • Article
  • Open Access
2 Citations
3,298 Views
13 Pages

A Self Adaptive Three-Step Numerical Scheme for Variational Inequalities

  • Kubra Sanaullah,
  • Saleem Ullah and
  • Najla M. Aloraini

18 January 2024

In this paper, we introduce a new three-step iterative scheme for finding the common solutions of the variational inequality using the technique of updating the solution. We suggest, iterative algorithms involving three-steps for the predictor-correc...

(This article belongs to the Section Mathematical Analysis)
  • Feature Paper
  • Article
  • Open Access
9 Citations
3,218 Views
22 Pages

6 September 2024

In this paper, we develop an effective iterative algorithm to solve a generalized Sylvester tensor equation over quaternions which includes several well-studied matrix/tensor equations as special cases. We discuss the convergence of this algorithm wi...

(This article belongs to the Special Issue Feature Papers in Mathematics Section)
  • Article
  • Open Access
3 Citations
3,195 Views
16 Pages

5 December 2022

The method of alternating projections for extracting low-rank signals is considered. The problem of decreasing the computational costs while keeping the estimation accuracy is analyzed. The proposed algorithm consists of alternating projections on th...

(This article belongs to the Collection Feature Papers in Algorithms)
  • Article
  • Open Access
3 Citations
1,869 Views
28 Pages

20 November 2023

By applying the weighted relaxation technique to the gradient-based iterative (GI) algorithm and taking proper weighted combinations of the solutions, this paper proposes the weighted, relaxed gradient-based iterative (WRGI) algorithm to solve the ge...

(This article belongs to the Section Mathematical Analysis)
  • Article
  • Open Access
4 Citations
3,728 Views
26 Pages

7 October 2023

This paper is concerned with developing an efficient numerical algorithm for the fast implementation of the sparse grid method for computing the d-dimensional integral of a given function. The new algorithm, called the MDI-SG (multilevel dimension it...

(This article belongs to the Section E: Applied Mathematics)
  • Article
  • Open Access
3 Citations
2,741 Views
29 Pages

5 October 2022

This paper presents a novel method for computing the symmetric tridiagonal eigenvectors, which is the modification of the widely used Inverse Iteration method. We construct the corresponding algorithm by a new one-step iteration method, a new reortho...

(This article belongs to the Special Issue Computational Methods and Applications for Numerical Analysis)
  • Article
  • Open Access
3 Citations
1,807 Views
18 Pages

17 May 2023

In this paper, based on the viscosity approximation method and the hybrid steepest-descent iterative method, a new implicit iterative algorithm is presented for finding the common fixed points set of a finite family of nonexpansive mappings in a refl...

(This article belongs to the Special Issue Symmetry in Fixed Point Approaches and Nonlinear Functional Mathematical Equations)
  • Article
  • Open Access
2 Citations
2,662 Views
17 Pages

An Enhanced Belief Propagation Flipping Decoder for Polar Codes with Stepping Strategy

  • Xiaojun Zhang,
  • Yimeng Liu,
  • Chengguan Chen,
  • Hua Guo and
  • Qingtian Zeng

3 August 2022

The Belief Propagation (BP) algorithm has the advantages of high-speed decoding and low latency. To improve the block error rate (BLER) performance of the BP-based algorithm, the BP flipping algorithm was proposed. However, the BP flipping algorithm...

  • Article
  • Open Access
21 Citations
3,937 Views
15 Pages

23 October 2020

Designing an optimal iterative learning control is a huge challenge for linear and nonlinear dynamic systems. For such complex systems, standard Norm optimal iterative learning control (NOILC) is an important consideration. This paper presents a nove...

(This article belongs to the Section Systems & Control Engineering)
  • Article
  • Open Access
14 Citations
3,757 Views
14 Pages

3 July 2020

In this paper, we propose a learning-based solution for resource allocation in a wireless powered communication network (WPCN). We provide a study and analysis of a deep neural network (DNN) which can reasonably effectively approximate the iterative...

(This article belongs to the Section Electrical, Electronics and Communications Engineering)
  • Article
  • Open Access
4 Citations
935 Views
17 Pages

20 November 2025

This paper examines H(·,·)-accretive mappings in Banach spaces and proves that the resolvent operator related to these mappings is Lipschitz continuous. Using the resolvent operator technique, we formulate iterative algorithms to solve...

  • Article
  • Open Access
1 Citations
1,694 Views
14 Pages

23 November 2022

In this paper, we proposed two mixed algorithms of Newton’s and Abbasbandy’s methods using a known iteration scheme from fixed point theory in polynomiography. We numerically investigated some properties of the proposed algorithms using p...

(This article belongs to the Special Issue Symmetry in Nonlinear and Convex Analysis)
  • Article
  • Open Access
3 Citations
3,466 Views
20 Pages

24 April 2022

The nonconvex and nonsmooth optimization problem has been attracting increasing attention in recent years in image processing and machine learning research. The algorithm-based reweighted step has been widely used in many applications. In this paper,...

(This article belongs to the Special Issue Advances in Nonlinear and Convex Analysis)
  • Article
  • Open Access
810 Views
29 Pages

Parameter-Driven Analysis of Complex Fractals via Picard–Abbas Iteration

  • Bashir Nawaz,
  • Krzysztof Gdawiec,
  • Kifayat Ullah and
  • Maggie Aphane

Fractal geometry has recently been advanced through fixed-point iteration schemes, enabling new analytical approaches. In this paper, we apply the Picard–Abbas iteration process to study Mandelbrot sets, Julia sets, and biomorphs for polynomial...

(This article belongs to the Special Issue Mathematical and Computational Approaches to Fractal and Fractional Systems Using Fixed Point Theory)
  • Article
  • Open Access
4 Citations
2,447 Views
17 Pages

9 February 2020

In this paper, Landweber iteration with a relaxation factor is proposed to solve nonlinear ill-posed integral equations. A compression multiscale Galerkin method that retains the properties of the Landweber iteration is used to discretize the Landweb...

(This article belongs to the Special Issue Inverse and Ill-Posed Problems)
  • Article
  • Open Access
6 Citations
2,895 Views
21 Pages

15 August 2021

The purpose of this article is to initiate the notion of monotone multivalued generalized (α,β)-nonexpansive mappings and explore the iterative approximation of the fixed points for the mapping in an ordered CAT(0) space. In particular, we employ the...

(This article belongs to the Special Issue Nonlinear Problems and Applications of Fixed Point Theory)
  • Feature Paper
  • Article
  • Open Access
1 Citations
1,409 Views
14 Pages

15 August 2025

The first part of this study is related to the search of fixed points for (E)-operators (Garcia-Falset operators), in the Banach setting, by means of a three-step iteration procedure. The main results reveal some conclusions related to weak and stron...

(This article belongs to the Special Issue Fixed Point, Optimization, and Applications: 3rd Edition)
  • Article
  • Open Access
25 Citations
7,113 Views
17 Pages

Some Matrix Iterations for Computing Generalized Inverses and Balancing Chemical Equations

  • Farahnaz Soleimani,
  • Predrag S. Stanimirovi´c and
  • Fazlollah Soleymani

3 November 2015

An application of iterative methods for computing the Moore–Penrose inverse in balancing chemical equations is considered. With the aim to illustrate proposed algorithms, an improved high order hyper-power matrix iterative method for computing genera...

(This article belongs to the Special Issue Numerical Algorithms for Solving Nonlinear Equations and Systems)
  • Article
  • Open Access
7 Citations
3,544 Views
16 Pages

Strong Convergence of Extragradient-Type Method to Solve Pseudomonotone Variational Inequalities Problems

  • Nopparat Wairojjana,
  • Nuttapol Pakkaranang,
  • Habib ur Rehman,
  • Nattawut Pholasa and
  • Tiwabhorn Khanpanuk

13 October 2020

A number of applications from mathematical programmings, such as minimax problems, penalization methods and fixed-point problems can be formulated as a variational inequality model. Most of the techniques used to solve such problems involve iterative...

(This article belongs to the Special Issue Fixed Point Theory and Its Related Topics II)
  • Feature Paper
  • Article
  • Open Access
1 Citations
2,340 Views
22 Pages

A Graphic Method for Detecting Multiple Roots Based on Self-Maps of the Hopf Fibration and Nullity Tolerances

  • José Ignacio Extreminana-Aldana,
  • José Manuel Gutiérrez-Jiménez,
  • Luis Javier Hernández-Paricio and
  • María Teresa Rivas-Rodríguéz

11 August 2021

The aim of this paper is to study, from a topological and geometrical point of view, the iteration map obtained by the application of iterative methods (Newton or relaxed Newton’s method) to a polynomial equation. In fact, we present a collection of...

(This article belongs to the Special Issue New Trends and Developments in Numerical Analysis)
  • Article
  • Open Access
1 Citations
3,123 Views
14 Pages

26 November 2023

In this work, we introduce an extended gradient method that employs the gradients of the preceding two iterates to construct the search direction for the purpose of solving the centralized and decentralized smooth and strongly convex functions. Addit...

(This article belongs to the Section E: Applied Mathematics)
  • Article
  • Open Access
4 Citations
6,754 Views
23 Pages

Point Orthogonal Projection onto a Spatial Algebraic Curve

  • Taixia Cheng,
  • Zhinan Wu,
  • Xiaowu Li and
  • Chan Wang

1 March 2020

Point orthogonal projection onto a spatial algebraic curve plays an important role in computer graphics, computer-aided geometric design, etc. We propose an algorithm for point orthogonal projection onto a spatial algebraic curve based on Newton&rsqu...

(This article belongs to the Special Issue Modern Geometric Modeling: Theory and Applications)
  • Article
  • Open Access
3,696 Views
13 Pages

4 June 2020

To solve a system of equations that needs few updates, such as sparse systems, the leading dichotomous coordinate descent (DCD) algorithm is better than the cyclic DCD algorithm because of its fast speed of convergence. In the case of sparse systems...

  • Article
  • Open Access
4 Citations
2,890 Views
14 Pages

Piecewise Iterative Extrapolation Method for Bandlimited Signal

  • Yusi Zhang,
  • Xuejun Sha,
  • Xiaojie Fang and
  • Xu Lin

In some high spectrally efficient communication structures, the Gerchberg-Papoulis extrapolation algorithm can be used to reconstruct nonorthogonal signals. However, the extrapolation efficiency and accuracy degrades when the energy of known signal i...

(This article belongs to the Special Issue Advances and Applications of Networking and Multimedia Technologies)
  • Article
  • Open Access
27 Citations
3,418 Views
27 Pages

A Self-Adaptive Extra-Gradient Methods for a Family of Pseudomonotone Equilibrium Programming with Application in Different Classes of Variational Inequality Problems

  • Habib ur Rehman,
  • Poom Kumam,
  • Ioannis K. Argyros,
  • Nasser Aedh Alreshidi and ,
  • Wiyada Kumam and
  • Wachirapong Jirakitpuwapat
  • + 1 author+ 0 author

2 April 2020

The main objective of this article is to propose a new method that would extend Popov’s extragradient method by changing two natural projections with two convex optimization problems. We also show the weak convergence of our designed method by...

(This article belongs to the Special Issue Iterative Numerical Functional Analysis with Applications)
  • Article
  • Open Access
16 Citations
3,561 Views
21 Pages

13 September 2022

In this paper, we study the static discrete berth allocation problems (BAPs) for large-scale time-critical marine-loading scenarios. The objective is to allocate the vessels to different types of berths so that all the vessels can be loaded within th...

(This article belongs to the Special Issue Dynamic Load of Shipping)
  • Article
  • Open Access
4 Citations
10,375 Views
13 Pages

27 June 2019

Even a relatively simple equation such as Colebrook’s offers a lot of possibilities to students to increase their computational skills. The Colebrook’s equation is implicit in the flow friction factor and, therefore, it needs to be solved...

(This article belongs to the Special Issue Teaching and Learning of Fluid Mechanics)
  • Article
  • Open Access
11 Citations
3,759 Views
17 Pages

13 May 2021

In this paper, we propose a new algorithm, called FOCUSED (FOrecast Correction Using Successive prEDictions), for forecast correction of short-term wind speed predictions. We developed FOCUSED with the aim of improving the forecast of bora gusts, whi...

(This article belongs to the Section Physical Sensors)
  • Article
  • Open Access
9 Citations
3,157 Views
18 Pages

7 September 2022

We derive a conjugate-gradient type algorithm to produce approximate least-squares (LS) solutions for an inconsistent generalized Sylvester-transpose matrix equation. The algorithm is always applicable for any given initial matrix and will arrive at...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
2 Citations
4,374 Views
22 Pages

19 June 2019

Lyapunov equations are key mathematical objects in systems theory, analysis and design of control systems, and in many applications, including balanced realization algorithms, procedures for reduced order models, Newton methods for algebraic Riccati...

(This article belongs to the Special Issue ICSTCC 2018: Advances in Control and Computers)
  • Article
  • Open Access
2 Citations
5,020 Views
11 Pages

9 January 2017

In this paper, we propose an algorithm to estimate the radius of convergence for the Picard iteration in the setting of a real Hilbert space. Numerical experiments show that the proposed algorithm provides convergence balls close to or even identical...

  • Feature Paper
  • Article
  • Open Access
16 Citations
3,362 Views
13 Pages

A Novel Numerical Algorithm to Estimate the Subdivision Depth of Binary Subdivision Schemes

  • Aamir Shahzad,
  • Faheem Khan,
  • Abdul Ghaffar,
  • Ghulam Mustafa and ,
  • Kottakkaran Sooppy Nisar and
  • Dumitru Baleanu
  • + 1 author+ 0 author

1 January 2020

Subdivision schemes are extensively used in scientific and practical applications to produce continuous geometrical shapes in an iterative manner. We construct a numerical algorithm to estimate subdivision depth between the limit curves/surfaces and...

(This article belongs to the Special Issue Fixed Point Theory and Computational Analysis with Applications)
  • Article
  • Open Access
65 Views
8 Pages

Newton’s iteration is a fundamental tool for root-finding and numerical solutions of systems of equations. The iteration rapidly refines the initial approximation to the exact root, and in general, the convergence is quadratic. Since the method...

(This article belongs to the Section Computational and Numerical Mathematics)
  • Article
  • Open Access
2,277 Views
22 Pages

A Class of Novel Mann-Type Subgradient Extragradient Algorithms for Solving Quasimonotone Variational Inequalities

  • Nopparat Wairojjana,
  • Ioannis K. Argyros,
  • Meshal Shutaywi,
  • Wejdan Deebani and
  • Christopher I. Argyros

22 June 2021

Symmetries play an important role in the dynamics of physical systems. As an example, quantum physics and microworld are the basis of symmetry principles. These problems are reduced to solving inequalities in general. That is why in this article, we...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
21 Citations
5,255 Views
12 Pages

2 January 2020

In this paper, an improved encryption algorithm based on numerical methods and rotation–translation equation is proposed. We develop the new encryption-decryption algorithm by using the concept of symmetric key instead of public key. Symmetric...

(This article belongs to the Special Issue Symmetry in Chaotic Systems and Circuits)
  • Article
  • Open Access
2 Citations
2,479 Views
12 Pages

4 April 2022

Based on a successive convex programming method, an alternating iteration algorithm is proposed for solving a parameter-dependent distributionally robust optimization. Under the Slater-type condition, the convergence analysis of the algorithm is obta...

  • Article
  • Open Access
73 Citations
8,382 Views
16 Pages

Numerical Solutions of Coupled Burgers’ Equations

  • Hijaz Ahmad,
  • Tufail A. Khan and
  • Clemente Cesarano

23 October 2019

In this article, two new modified variational iteration algorithms are investigated for the numerical solution of coupled Burgers’ equations. These modifications are made with the help of auxiliary parameters to speed up the convergence rate of...

(This article belongs to the Special Issue Numerical Methods for Solving Nonlinear Equations and Systems: Convergence and Stability)
  • Article
  • Open Access
20 Citations
12,351 Views
16 Pages

16 November 2019

Finding the roots of an equation is a fundamental problem in various fields, including numerical computing, social and physical sciences. Numerical techniques are used when an analytic solution is not available. There is not a single algorithm that w...

(This article belongs to the Special Issue Numerical Modeling and Analysis)
  • Article
  • Open Access
85 Citations
5,860 Views
18 Pages

Kinematics Model Optimization Algorithm for Six Degrees of Freedom Parallel Platform

  • Mingzhe Liu,
  • Qiuxiang Gu,
  • Bo Yang,
  • Zhengtong Yin and ,
  • Shan Liu,
  • Lirong Yin and
  • Wenfeng Zheng
  • + 2 authors+ 0 author

27 February 2023

The attitude closed-loop control of the parallel platform in the working space needs to determine the relationship between the pose of the top moving platform and the length of each mechanical arm, that is, the kinematics problem of the parallel plat...

  • Article
  • Open Access
1,309 Views
17 Pages

21 September 2024

In this paper, we investigate a class of hierarchical variational inequalities (HVIPs, i.e., strongly monotone variational inequality problems defined on the solution set of multiple-set split common fixed-point problems) with quasi-pseudocontractive...

(This article belongs to the Special Issue Fixed Point, Optimization, and Applications II)
  • Article
  • Open Access
5 Citations
5,109 Views
18 Pages

16 January 2023

Recently, an extended family of power-divergence measures with two parameters was proposed together with an iterative reconstruction algorithm based on minimization of the divergence measure as an objective function of the reconstructed images for co...

(This article belongs to the Collection Traditional and Machine Learning Methods to Solve Imaging Problems)
  • Article
  • Open Access
3 Citations
2,144 Views
13 Pages

30 October 2024

The trust region method is an effective method for solving unconstrained optimization problems. Incorrectly updating the rules of the trust region radius will increase the number of iterations and affect the calculation efficiency. In order to obtain...

(This article belongs to the Special Issue Nonlinear Systems: Dynamics, Control, Optimization and Applications in Science and Engineering, 3rd Edition)
  • Article
  • Open Access
485 Views
24 Pages

30 April 2026

This paper presents on-policy and off-policy algorithms for the H∞ control of continuous-time mean-field stochastic Markov jump systems. Using online state and input data, these algorithms can learn control and disturbance strategies without th...

(This article belongs to the Special Issue Stochastic System Analysis and Control)
  • Article
  • Open Access
122 Views
24 Pages

This paper presents an improved infeasible interior-point algorithm tailored for semi-definite linear complementarity problems (SDLCPs). The proposed approach leverages full Nesterov–Todd search directions while eliminating centering steps, sig...

(This article belongs to the Topic Numerical Analysis: Algorithms, Theory and Applications)
  • Article
  • Open Access
1 Citations
2,672 Views
11 Pages

Electromagnetic modeling of multiscale wave interactions is a challenging task. This is because wave physics exhibit different characteristics at different length scales that require suitable modeling algorithms. Combining these algorithms to model m...

(This article belongs to the Special Issue Recent Advancements and Applications of Computational Electromagnetics)
  • Article
  • Open Access
10 Citations
5,787 Views
20 Pages

Hybrid Second-Order Iterative Algorithm for Orthogonal Projection onto a Parametric Surface

  • Xiaowu Li,
  • Lin Wang,
  • Zhinan Wu,
  • Linke Hou and ,
  • Juan Liang and
  • Qiaoyang Li
  • + 1 author+ 0 author

5 August 2017

To compute the minimum distance between a point and a parametric surface, three well-known first-order algorithms have been proposed by Hartmann (1999), Hoschek, et al. (1993) and Hu, et al. (2000) (hereafter, the First-Order method). In this paper,...

(This article belongs to the Special Issue Advances in Computer Graphics, Geometric Modeling, and Virtual and Augmented Reality)

of 26