Kang-Li Xu
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
Kang-Li Xu has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
Yao-Lin Jiang
7 shared publications- Yao-Lin Jiang
School of Mathematics and Statistics, Xian Jiaotong University, Xian, Shaanxi, China
6 shared publications - Zhao-Hong Wang
College of Mathematics and System Science Xinjiang University Urumqi Xinjiang China
3 shared publications - Zhen Li
School of Computer Science and Technology, Xian University of Science and Technology, Xian, China
3 shared publications Zhen Li
2 shared publicationsBin Wang
1 shared publication
Latest Publications
- Open Access
- 11 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (16) , 2565
Model Reduction in Parallelization Based on Equivalent Transformation of Block Bi-Diagonal Toeplitz Matrices for Two-Dimensional Discrete-Time Systems
This study proposes a parallel model reduction method for two-dimensional discrete-time systems, utilizing Krawtchouk moments and equivalent transformation. This work makes two significant contributions. First, we introduce a projection subspace that is independent of the input as well as of the Krawtchouk parameters, thus ensuring robustness. Second, we propose an efficient parallel algorithm for computing the basis of the projection subspace. With the difference relation of Krawtchouk polynomials and the analytic identity theorem, we obtain the explicit formula for the Krawtchouk moments of the state, which is input-dependent and Krawtchouk-parameter-dependent. We derive a projection subspace that is independent of both input and Krawtchouk parameter, such that it is equivalent to the subspace spanned by the Krawtchouk moments. Further, we propose a parallel strategy based on the equivalent transformation of the block bi-diagonal Toeplitz matrices with bi-diagonal blocks to compute the basis of the projection subspace, facilitating acceleration of the model reduction process on high-performance computers. Moreover, we analyze the Krawtchouk moment invariants of the proposed parallel method. Finally, the effectiveness of the proposed method is illustrated by two numerical examples.
- 11 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (16) , 2565
Open AccessModel Reduction in Parallelization Based on Equivalent Transformation of Block Bi-Diagonal Toeplitz Matrices for Two-Dimensional Discrete-Time Systems
This study proposes a parallel model reduction method for two-dimensional discrete-time systems, utilizing Krawtchouk moments and equivalent transformation. This work makes two significant contributions. First, we introduce a projection subspace that is independent of the input as well as of the Krawtchouk parameters, thus ensuring robustness. Second, we propose an efficient parallel algorithm for computing the basis of the projection subspace. With the difference relation of Krawtchouk polynomials and the analytic identity theorem, we obtain the explicit formula for the Krawtchouk moments of the state, which is input-dependent and Krawtchouk-parameter-dependent. We derive a projection subspace that is independent of both input and Krawtchouk parameter, such that it is equivalent to the subspace spanned by the Krawtchouk moments. Further, we propose a parallel strategy based on the equivalent transformation of the block bi-diagonal Toeplitz matrices with bi-diagonal blocks to compute the basis of the projection subspace, facilitating acceleration of the model reduction process on high-performance computers. Moreover, we analyze the Krawtchouk moment invariants of the proposed parallel method. Finally, the effectiveness of the proposed method is illustrated by two numerical examples.
- 13 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 72 (1) , 198-202
Parametric Interpolation Model Order Reduction on Grassmann Manifolds by Parallelization
Based on Riemannian geometry of Grassmann manifolds and discrete Laguerre polynomials, we propose a parametric interpolation parallel MOR method for discrete-time parametric systems. First, a block discrete Fourier transform-based (BDFT) parallel strategy is presented to construct the local basis matrices, which achieves two level acceleration by parallelization. Further, using the retractions and vector transports on Grassmann manifolds, the basis matrix for a new parameter is obtained by interpolating the local bases on the tangent spaces at the different reference points. Finally, a numerical example is used to demonstrate the efficiency of our method.
- 13 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 72 (1) , 198-202
Parametric Interpolation Model Order Reduction on Grassmann Manifolds by Parallelization
Based on Riemannian geometry of Grassmann manifolds and discrete Laguerre polynomials, we propose a parametric interpolation parallel MOR method for discrete-time parametric systems. First, a block discrete Fourier transform-based (BDFT) parallel strategy is presented to construct the local basis matrices, which achieves two level acceleration by parallelization. Further, using the retractions and vector transports on Grassmann manifolds, the basis matrix for a new parameter is obtained by interpolating the local bases on the tangent spaces at the different reference points. Finally, a numerical example is used to demonstrate the efficiency of our method.
- 4 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (5) , 3317-3324
Riemannian Geometric-Nonlinear Conjugate Gradient Model Order Reduction of Linear Port-Hamiltonian Systems on Finite Frequency Intervals
In this article, we propose a new frequency-limited Riemannian geometric-nonlinear conjugate gradient model order reduction (MOR) method with the modified Armijo step-size control to solve the frequency-limited $\mathcal {H}_{2}$ optimal MOR problem of linear port-Hamiltonian systems. This problem is formulated as a Riemannian optimization problem on the product of several manifolds. Based on the geometric properties of the product manifold, the Riemannian gradient of the cost function is derived. Further, by scaling the vector transport of the product manifold, we design a new Riemannian spectral conjugate gradient direction, which is always descent for the cost function and is independent of the line search used and the convexity of the cost function. Meanwhile, a new modified Armijo step-size control strategy is presented. The resulting reduced system can preserve the port-Hamiltonian structure and the passivity of the original system. Two numerical examples are simulated to demonstrate the efficiency of the proposed method.
- 4 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (5) , 3317-3324
Riemannian Geometric-Nonlinear Conjugate Gradient Model Order Reduction of Linear Port-Hamiltonian Systems on Finite Frequency Intervals
In this article, we propose a new frequency-limited Riemannian geometric-nonlinear conjugate gradient model order reduction (MOR) method with the modified Armijo step-size control to solve the frequency-limited $\mathcal {H}_{2}$ optimal MOR problem of linear port-Hamiltonian systems. This problem is formulated as a Riemannian optimization problem on the product of several manifolds. Based on the geometric properties of the product manifold, the Riemannian gradient of the cost function is derived. Further, by scaling the vector transport of the product manifold, we design a new Riemannian spectral conjugate gradient direction, which is always descent for the cost function and is independent of the line search used and the convexity of the cost function. Meanwhile, a new modified Armijo step-size control strategy is presented. The resulting reduced system can preserve the port-Hamiltonian structure and the passivity of the original system. Two numerical examples are simulated to demonstrate the efficiency of the proposed method.
- 28 May 2023
- Published by Wiley in Asian Journal of Control
- Vol. 25 (6) , 4658-4666
Balanced truncation reduced models of quadratic‐bilinear systems in time interval
Accumulative error along with time impedes the application of many computational methods on high‐precision simulation; therefore, time‐interval methods emerge. In this paper, a new model reduction method of quadratic‐bilinear (QB) systems based on time‐interval Gramians (TIGs) is presented. The conditions for generalized Lyapunov equations whose solutions are exactly TIGs to be solvable are derived. Lyapunov stability and error bound are discussed to demonstrate the succession and advance of time‐interval balanced truncation (TIBT). The accuracy and robustness are improved, as is illustrated in numerical results.
- 28 May 2023
- Published by Wiley in Asian Journal of Control
- Vol. 25 (6) , 4658-4666
Balanced truncation reduced models of quadratic‐bilinear systems in time interval
Accumulative error along with time impedes the application of many computational methods on high‐precision simulation; therefore, time‐interval methods emerge. In this paper, a new model reduction method of quadratic‐bilinear (QB) systems based on time‐interval Gramians (TIGs) is presented. The conditions for generalized Lyapunov equations whose solutions are exactly TIGs to be solvable are derived. Lyapunov stability and error bound are discussed to demonstrate the succession and advance of time‐interval balanced truncation (TIBT). The accuracy and robustness are improved, as is illustrated in numerical results.
- 12 May 2023
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 212, 441-456
Reduced-order state-space models for two-dimensional discrete systems via bivariate discrete orthogonal polynomials
- 12 May 2023
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 212, 441-456
Reduced-order state-space models for two-dimensional discrete systems via bivariate discrete orthogonal polynomials
- 7 January 2023
- Published by Springer Nature in Multidimensional Systems and Signal Processing
- Vol. 34 (1) , 227-248
Reduced-order modeling methods via bivariate discrete orthogonal polynomials for two-dimensional discrete state-delayed systems
- 7 January 2023
- Published by Springer Nature in Multidimensional Systems and Signal Processing
- Vol. 34 (1) , 227-248
Reduced-order modeling methods via bivariate discrete orthogonal polynomials for two-dimensional discrete state-delayed systems
- 2 January 2023
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 661, 222-246
Model reduction of discrete time-delay systems based on Charlier polynomials and high-order Krylov subspaces
- 2 January 2023
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 661, 222-246
Model reduction of discrete time-delay systems based on Charlier polynomials and high-order Krylov subspaces
- 15 March 2022
- Published by Oxford University Press (OUP) in IMA Journal of Mathematical Control and Information
- Vol. 39 (2) , 590-608
Riemannian optimization model order reduction method for general linear port-Hamiltonian systems
This paper presents a Riemannian optimal model order reduction method for general linear stable port-Hamiltonian systems based on the Riemannian trust-region method. We consider the $\mathcal{H}_2$ optimal model order reduction problem of the general linear port-Hamiltonian systems. The problem is formulated as an optimization problem on the product manifold, which is composed of the set of skew symmetric matrices, the manifold of the positive definite matrices, the manifold of the positive semidefinite matrices with fixed rank and the Euclidean space. To solve the optimal problem, the Riemannian geometry of the product manifold is given. Moreover, the Riemannian gradient and the Riemannian Hessian of the objective function are derived. Furthermore, we propose the Riemannian trust-region method for the optimization problem and introduce the truncated conjugate gradient method to solve the trust-region subproblem. Finally, the numerical experiments illustrate the efficiency of the proposed method.- 15 March 2022
- Published by Oxford University Press (OUP) in IMA Journal of Mathematical Control and Information
- Vol. 39 (2) , 590-608
Riemannian optimization model order reduction method for general linear port-Hamiltonian systems
This paper presents a Riemannian optimal model order reduction method for general linear stable port-Hamiltonian systems based on the Riemannian trust-region method. We consider the $\mathcal{H}_2$ optimal model order reduction problem of the general linear port-Hamiltonian systems. The problem is formulated as an optimization problem on the product manifold, which is composed of the set of skew symmetric matrices, the manifold of the positive definite matrices, the manifold of the positive semidefinite matrices with fixed rank and the Euclidean space. To solve the optimal problem, the Riemannian geometry of the product manifold is given. Moreover, the Riemannian gradient and the Riemannian Hessian of the objective function are derived. Furthermore, we propose the Riemannian trust-region method for the optimization problem and introduce the truncated conjugate gradient method to solve the trust-region subproblem. Finally, the numerical experiments illustrate the efficiency of the proposed method.