Xiaoyu Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Xiaoyu Jiang has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Yanpeng Zheng
School of Automation and Electrical Engineering, Linyi University, Linyi, China
18 shared publications - Zhaolin Jiang
School of Intelligent Science and Control Engineering, Shandong Vocational and Technical University of International Studies, Rizhao 276800, China
16 shared publications Zhaolin Jiang
10 shared publicationsYaru Fu
School of Mathematics and Statistics, Taiyuan Normal University, Jinzhong, China
4 shared publicationsYanpeng Zheng
School of Automation and Electrical Engineering Linyi University, Linyi, 276000, China
3 shared publicationsFawaz Alsaadi
Department of Information Technology, King Abdulaziz University, Jeddah, Saudi Arabia
2 shared publications
Latest Publications
- 30 April 2026
- Published by Elsevier in Applied Soft Computing
- Vol. 200
Two fast algorithms for solving a class of time-varying tridiagonal linear systems using zeroing neural dynamic models
- 30 April 2026
- Published by Elsevier in Applied Soft Computing
- Vol. 200
Two fast algorithms for solving a class of time-varying tridiagonal linear systems using zeroing neural dynamic models
- 8 February 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 338
Analysis of double Beltrami horn surface resistor networks and efficient path planning
- 8 February 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 338
Analysis of double Beltrami horn surface resistor networks and efficient path planning
- 27 October 2025
- Published by AIP Publishing in Applied Physics Reviews
- Vol. 12 (4)
Modeling of omnidirectional antenna space radiation shaped resistor networks and efficient path planning
This paper proposes an innovative omnidirectional antenna space radiation shaped resistor network model to analyze potential distribution characteristics in complex resistor networks and apply it to path planning. Through mathematical modeling based on Kirchhoff's laws and the recursive transformation method, combined with the discrete sine transform of the seventh kind and Chebyshev polynomials of the first kind, we derive precise formulas for node potentials and equivalent resistances. We further develop a novel path planning algorithm that leverages the natural decay properties of potentials, enhanced by directional deviation penalties and a backtracking mechanism. Comparative analyses with classical path planning algorithms demonstrate that the proposed method holds significant potential, particularly in dynamic environments. Finally, a fast algorithm for potential calculation is introduced, achieving a four- to five-fold improvement in computational efficiency over traditional approaches. These advances deepen research on resistor networks and provide strong support for applications in complex systems, autonomous driving, and wireless communications.
- 27 October 2025
- Published by AIP Publishing in Applied Physics Reviews
- Vol. 12 (4)
Modeling of omnidirectional antenna space radiation shaped resistor networks and efficient path planning
This paper proposes an innovative omnidirectional antenna space radiation shaped resistor network model to analyze potential distribution characteristics in complex resistor networks and apply it to path planning. Through mathematical modeling based on Kirchhoff's laws and the recursive transformation method, combined with the discrete sine transform of the seventh kind and Chebyshev polynomials of the first kind, we derive precise formulas for node potentials and equivalent resistances. We further develop a novel path planning algorithm that leverages the natural decay properties of potentials, enhanced by directional deviation penalties and a backtracking mechanism. Comparative analyses with classical path planning algorithms demonstrate that the proposed method holds significant potential, particularly in dynamic environments. Finally, a fast algorithm for potential calculation is introduced, achieving a four- to five-fold improvement in computational efficiency over traditional approaches. These advances deepen research on resistor networks and provide strong support for applications in complex systems, autonomous driving, and wireless communications.
- 27 October 2025
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 151
Robot path planning based on potential function of a resistor network
- 27 October 2025
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 151
Robot path planning based on potential function of a resistor network
- Open Access
- 1 July 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-7
Two fast algorithms for finding the solution of the lower Hessenberg quasi-Toeplitz linear system from Markov chain
We present two fast algorithms for finding the solution of the nonsingular lower Hessenberg quasi-Toeplitz linear system stem from Markov chain. And we confirm the complexity of these two algorithms is both O $$(n\log n)$$ based on the fact that a lower Hessenberg quasi-Toeplitz matrix can be written as the sum of a Toeplitz matrix and a rank-one matrix, such that the fast solver involves O $$(n\log n)$$ operators for solving the Toeplitz linear system can be adopted. Finally, numerical results prove the superiority and accuracy of our algorithms by comparing the values of residual and CPU time with existing algorithms.- 1 July 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-7
Open AccessTwo fast algorithms for finding the solution of the lower Hessenberg quasi-Toeplitz linear system from Markov chain
We present two fast algorithms for finding the solution of the nonsingular lower Hessenberg quasi-Toeplitz linear system stem from Markov chain. And we confirm the complexity of these two algorithms is both O $$(n\log n)$$ based on the fact that a lower Hessenberg quasi-Toeplitz matrix can be written as the sum of a Toeplitz matrix and a rank-one matrix, such that the fast solver involves O $$(n\log n)$$ operators for solving the Toeplitz linear system can be adopted. Finally, numerical results prove the superiority and accuracy of our algorithms by comparing the values of residual and CPU time with existing algorithms. - 1 June 2025
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 26 (6) , 946-958
An optimized formula for the two-point resistance of a cobweb resistance network and its potential application
In recent years, the exploration and application of resistance networks have expanded significantly, and solving the equivalent resistance between two poin
- 1 June 2025
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 26 (6) , 946-958
An optimized formula for the two-point resistance of a cobweb resistance network and its potential application
In recent years, the exploration and application of resistance networks have expanded significantly, and solving the equivalent resistance between two poin
- Open Access
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 10 (8) , 18929-18956
Structured distance to normality of PDDT Toeplitz matrices
Investigating spectral properties and operator-space distance measurements, this research focused on tridiagonal Toeplitz matrices under perturbed Dirichlet boundary conditions (hereafter referred to as PDDT Toeplitz matrices). Explicit analytical expressions for eigenvalues and their associated eigenvectors were derived. These expressions emphasized their critical role in characterizing stability under perturbation conditions. Building on the structural features of PDDT Toeplitz matrices, we developed closed-form solutions to quantify normality distance and departure from normality. Additionally, these solutions analyzed $ \varepsilon $-pseudospectra and eigenvalue sensitivity at both local and collective scales. By evaluating eigenvalue sensitivity through these parameters, our framework further enabled the evaluation of spectral sensitivity within PDDT Toeplitz environments. Through rigorous analysis, it has been shown that a dramatic increase in eigenvalue sensitivity depended exclusively on the magnitude ratio of lower to upper diagonal entries, demonstrating remarkable independence from diagonal terms or the complex phases of non-diagonal elements. The degree to which a matrix deviated from normality could be effectively characterized by examining the absolute values of its sub-diagonal and super-diagonal elements. To conclude, we explored an inverse eigenvalue problem embedded within a constrained optimization framework, which produced trapezoidal PDDT Toeplitz matrices as final optimal computational solutions.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 10 (8) , 18929-18956
Open AccessStructured distance to normality of PDDT Toeplitz matrices
Investigating spectral properties and operator-space distance measurements, this research focused on tridiagonal Toeplitz matrices under perturbed Dirichlet boundary conditions (hereafter referred to as PDDT Toeplitz matrices). Explicit analytical expressions for eigenvalues and their associated eigenvectors were derived. These expressions emphasized their critical role in characterizing stability under perturbation conditions. Building on the structural features of PDDT Toeplitz matrices, we developed closed-form solutions to quantify normality distance and departure from normality. Additionally, these solutions analyzed $ \varepsilon $-pseudospectra and eigenvalue sensitivity at both local and collective scales. By evaluating eigenvalue sensitivity through these parameters, our framework further enabled the evaluation of spectral sensitivity within PDDT Toeplitz environments. Through rigorous analysis, it has been shown that a dramatic increase in eigenvalue sensitivity depended exclusively on the magnitude ratio of lower to upper diagonal entries, demonstrating remarkable independence from diagonal terms or the complex phases of non-diagonal elements. The degree to which a matrix deviated from normality could be effectively characterized by examining the absolute values of its sub-diagonal and super-diagonal elements. To conclude, we explored an inverse eigenvalue problem embedded within a constrained optimization framework, which produced trapezoidal PDDT Toeplitz matrices as final optimal computational solutions.