Xin Liang
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
Xin Liang has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Zhen-Chen Guo
Department of Mathematics Nanjing University 210093 Nanjing China
6 shared publications - Ren-Cang Li
Department of Mathematics, University of Texas at Arlington, Arlington, USA
4 shared publications - Li Wang
School of Mathematics University of Minnesota Twin Cities 55455 Minneapolis MN USA
3 shared publications - Peter Benner
Max Planck Institute for Dynamics of Complex Technical Systems, D-39106 Magdeburg, Germany
3 shared publications - Wen-Wei Lin
Natl Yang Ming Chiao Tung Univ, Dept Appl Math, Hsinchu 300, Taiwan
3 shared publications - Lei-Hong Zhang
School of Mathematical Sciences, Soochow University, Suzhou, China
2 shared publications
Latest Publications
- 5 April 2026
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 33 (2)
Local Convergence Behavior of Extended Local Optimal Block Preconditioned Conjugate Gradient Method for Computing Eigenvalues of Hermitian Matrices
This paper provides a comprehensive and detailed analysis of the local convergence behavior of an extended variation of the locally optimal preconditioned conjugate gradient method (LOBPCG) for computing the extreme eigenvalues of a Hermitian matrix. The convergence rates derived in this work are either obtained for the first time or sharper than those previously established, including those in Ovtchinnikov's work ( SIAM J. Numer. Anal. , 46(5):2567–2592, 2008). The study also extends to generalized problems, including Hermitian matrix polynomials that admit an extended form of the Rayleigh quotient. The new approach used to obtain these rates may also serve as a valuable tool for the convergence analysis of other gradient‐type optimization methods.
- 5 April 2026
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 33 (2)
Local Convergence Behavior of Extended Local Optimal Block Preconditioned Conjugate Gradient Method for Computing Eigenvalues of Hermitian Matrices
This paper provides a comprehensive and detailed analysis of the local convergence behavior of an extended variation of the locally optimal preconditioned conjugate gradient method (LOBPCG) for computing the extreme eigenvalues of a Hermitian matrix. The convergence rates derived in this work are either obtained for the first time or sharper than those previously established, including those in Ovtchinnikov's work ( SIAM J. Numer. Anal. , 46(5):2567–2592, 2008). The study also extends to generalized problems, including Hermitian matrix polynomials that admit an extended form of the Rayleigh quotient. The new approach used to obtain these rates may also serve as a valuable tool for the convergence analysis of other gradient‐type optimization methods.
- 1 February 2024
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 687, 8-37
On generalizing trace minimization principles, II
- 1 February 2024
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 687, 8-37
On generalizing trace minimization principles, II
- 10 November 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 44 (4) , 1749-1770
Stochastic Algebraic Riccati Equations Are Almost as Easy as Deterministic Ones Theoretically
Stochastic algebraic Riccati equations, also known as rational algebraic Riccati equations, arising in linear-quadratic optimal control for stochastic linear time-invariant systems, were considered to be not easy to solve. The state-of-the-art numerical methods mostly rely on differentiability or continuity, such as the Newton-type method, the LMI method, or the homotopy method. In this paper, we will build a novel theoretical framework and reveal the intrinsic algebraic structure appearing in this kind of algebraic Riccati equation. This structure guarantees that to solve them is almost as easy as to solve deterministic/classical ones, which will shed light on the theoretical analysis and numerical algorithm design for this topic.
- 10 November 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 44 (4) , 1749-1770
Stochastic Algebraic Riccati Equations Are Almost as Easy as Deterministic Ones Theoretically
Stochastic algebraic Riccati equations, also known as rational algebraic Riccati equations, arising in linear-quadratic optimal control for stochastic linear time-invariant systems, were considered to be not easy to solve. The state-of-the-art numerical methods mostly rely on differentiability or continuity, such as the Newton-type method, the LMI method, or the homotopy method. In this paper, we will build a novel theoretical framework and reveal the intrinsic algebraic structure appearing in this kind of algebraic Riccati equation. This structure guarantees that to solve them is almost as easy as to solve deterministic/classical ones, which will shed light on the theoretical analysis and numerical algorithm design for this topic.
- 30 March 2023
- Published by Springer Nature in Statistics and Computing
- Vol. 33 (3) , 1-11
On the optimality of the Oja’s algorithm for online PCA
- 30 March 2023
- Published by Springer Nature in Statistics and Computing
- Vol. 33 (3) , 1-11
On the optimality of the Oja’s algorithm for online PCA
- Open Access
On Generalizing Trace Minimization Principles, II
This paper is concerned with establishing a trace minimization principle for two Hermitian matrix pairs. Specifically, we will answer the question: when is $\inf_X\operatorname{tr}(\widehat AX^{\rm H}AX)$ subject to $\widehat BX^{\rm H}BX=I$ (the identity matrix of apt size) finite? Sufficient and necessary conditions are obtained and, when the infimum is finite, an explicit formula for it is presented in terms of the finite eigenvalues of the matrix pairs. Our results extend Fan's trace minimization principle (1949) for a Hermitian matrix, a minimization principle of Kovač-Striko and Veselić (1995) for a Hermitian matrix pair, and most recent ones by the authors and their collaborators for a Hermitian matrix pair and a Hermitian matrix.Open AccessOn Generalizing Trace Minimization Principles, II
This paper is concerned with establishing a trace minimization principle for two Hermitian matrix pairs. Specifically, we will answer the question: when is $\inf_X\operatorname{tr}(\widehat AX^{\rm H}AX)$ subject to $\widehat BX^{\rm H}BX=I$ (the identity matrix of apt size) finite? Sufficient and necessary conditions are obtained and, when the infimum is finite, an explicit formula for it is presented in terms of the finite eigenvalues of the matrix pairs. Our results extend Fan's trace minimization principle (1949) for a Hermitian matrix, a minimization principle of Kovač-Striko and Veselić (1995) for a Hermitian matrix pair, and most recent ones by the authors and their collaborators for a Hermitian matrix pair and a Hermitian matrix. - Open Access
Stochastic algebraic Riccati equations are almost as easy as deterministic ones theoretically
Stochastic algebraic Riccati equations, also known as rational algebraic Riccati equations, arising in linear-quadratic optimal control for stochastic linear time-invariant systems, were considered to be not easy to solve. The-state-of-art numerical methods most rely on differentiability or continuity, such as Newton-type method, LMI method, or homotopy method. In this paper, we will build a novel theoretical framework and reveal the intrinsic algebraic structure appearing in this kind of algebraic Riccati equations. This structure guarantees that to solve them is almost as easy as to solve deterministic/classical ones, which will shed light on the theoretical analysis and numerical algorithm design for this topic.
Open AccessStochastic algebraic Riccati equations are almost as easy as deterministic ones theoretically
Stochastic algebraic Riccati equations, also known as rational algebraic Riccati equations, arising in linear-quadratic optimal control for stochastic linear time-invariant systems, were considered to be not easy to solve. The-state-of-art numerical methods most rely on differentiability or continuity, such as Newton-type method, LMI method, or homotopy method. In this paper, we will build a novel theoretical framework and reveal the intrinsic algebraic structure appearing in this kind of algebraic Riccati equations. This structure guarantees that to solve them is almost as easy as to solve deterministic/classical ones, which will shed light on the theoretical analysis and numerical algorithm design for this topic.
- 10 November 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 93 (1) , 227-267
The intrinsic Toeplitz structure and its applications in algebraic Riccati equations
- 10 November 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 93 (1) , 227-267
The intrinsic Toeplitz structure and its applications in algebraic Riccati equations
- 13 October 2022
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 656, 483-509
On generalizing trace minimization principles
- 13 October 2022
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 656, 483-509
On generalizing trace minimization principles
- Open Access
The intrinsic Toeplitz structure and its applications in algebraic Riccati equations
In this paper we derive a Toeplitz-structured closed form of the unique positive semi-definite stabilizing solution for the discrete-time algebraic Riccati equations, especially for the case that the state matrix is not stable. Based on the found form and fast Fourier transform, we propose a new algorithm for solving both discrete-time and continuous-time large-scale algebraic Riccati equations with low-rank structure. It works without unnecessary assumptions, complicated shift selection strategies, or matrix calculations of the cubic order with respect to the problem scale. Numerical examples are given to illustrate its features. Besides, we show that it is theoretically equivalent to several algorithms existing in the literature in the sense that they all produce the same sequence under the same parameter setting.
Open AccessThe intrinsic Toeplitz structure and its applications in algebraic Riccati equations
In this paper we derive a Toeplitz-structured closed form of the unique positive semi-definite stabilizing solution for the discrete-time algebraic Riccati equations, especially for the case that the state matrix is not stable. Based on the found form and fast Fourier transform, we propose a new algorithm for solving both discrete-time and continuous-time large-scale algebraic Riccati equations with low-rank structure. It works without unnecessary assumptions, complicated shift selection strategies, or matrix calculations of the cubic order with respect to the problem scale. Numerical examples are given to illustrate its features. Besides, we show that it is theoretically equivalent to several algorithms existing in the literature in the sense that they all produce the same sequence under the same parameter setting.
- 30 August 2022
- Published by Springer Nature in Science China Mathematics
- Vol. 66 (5) , 1087-1122
Nearly optimal stochastic approximation for online principal subspace estimation
- 30 August 2022
- Published by Springer Nature in Science China Mathematics
- Vol. 66 (5) , 1087-1122
Nearly optimal stochastic approximation for online principal subspace estimation