Xiaotian Liu
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
Xiaotian Liu has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
Grey Ballard
Department of Computer Science Wake Forest University Winston‐Salem North Carolina USA
1 shared publication- Guohua Zhou
School of Electrical Engineering, Southwest Jiaotong University, Chengdu, China
1 shared publication Irina Viviano
Clinical & Translational Science Institute Wake Forest University School of Medicine Winston‐Salem North Carolina USA
1 shared publicationRachel Minster
Department of Computer Science Wake Forest University Winston‐Salem North Carolina USA
1 shared publication- Shuhan Zhou
College of Electrical Engineering, Sichuan University, Chengdu, China
1 shared publication Shungang Xu
Key Laboratory of Magnetic Suspension Technology and Maglev Vehicle Ministry of Education Southwest Jiaotong University Chengdu 610031 People's Republic of China
1 shared publication
Latest Publications
- Open Access
- 5 June 2023
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 30 (6)
CP decomposition for tensors via alternating least squares with QR decomposition
The CP tensor decomposition is used in applications such as machine learning and signal processing to discover latent low‐rank structure in multidimensional data. Computing a CP decomposition via an alternating least squares (ALS) method reduces the problem to several linear least squares problems. The standard way to solve these linear least squares subproblems is to use the normal equations, which inherit special tensor structure that can be exploited for computational efficiency. However, the normal equations are sensitive to numerical ill‐conditioning, which can compromise the results of the decomposition. In this paper, we develop versions of the CP‐ALS algorithm using the QR decomposition and the singular value decomposition, which are more numerically stable than the normal equations, to solve the linear least squares problems. Our algorithms utilize the tensor structure of the CP‐ALS subproblems efficiently, have the same complexity as the standard CP‐ALS algorithm when the input is dense and the rank is small, and are shown via examples to produce more stable results when ill‐conditioning is present. Our MATLAB implementation achieves the same running time as the standard algorithm for small ranks, and we show that the new methods can obtain lower approximation error.
- 5 June 2023
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 30 (6)
Open AccessCP decomposition for tensors via alternating least squares with QR decomposition
The CP tensor decomposition is used in applications such as machine learning and signal processing to discover latent low‐rank structure in multidimensional data. Computing a CP decomposition via an alternating least squares (ALS) method reduces the problem to several linear least squares problems. The standard way to solve these linear least squares subproblems is to use the normal equations, which inherit special tensor structure that can be exploited for computational efficiency. However, the normal equations are sensitive to numerical ill‐conditioning, which can compromise the results of the decomposition. In this paper, we develop versions of the CP‐ALS algorithm using the QR decomposition and the singular value decomposition, which are more numerically stable than the normal equations, to solve the linear least squares problems. Our algorithms utilize the tensor structure of the CP‐ALS subproblems efficiently, have the same complexity as the standard CP‐ALS algorithm when the input is dense and the rank is small, and are shown via examples to produce more stable results when ill‐conditioning is present. Our MATLAB implementation achieves the same running time as the standard algorithm for small ranks, and we show that the new methods can obtain lower approximation error.
- Open Access
- 1 June 2017
- Published by Institution of Engineering and Technology (IET) in IET Power Electronics
- Vol. 10 (7) , 846-853
Bifurcation analysis and operation region estimation of current‐mode‐controlled SIDO boost converter
To analyse the stable operation range with varied input and output voltages, bifurcation behaviours and operation region of current‐mode‐controlled single‐inductor dual‐output (SIDO) boost converter are investigated. The inductor current borders and one‐dimensional discrete‐mapping model are deduced firstly. On the basis of the model, the bifurcation diagram and corresponding Lyapunov exponent spectrum are analysed. Two transition conditions and boundary equations of the converter are derived, where its working state transits from stability to instability, and its operation mode shifts from continuous conduction mode (CCM) to discontinuous conduction mode (DCM). The operation region with different circuit parameters can be estimated and divided through the parameter space maps, which is significant for the design of circuit parameters and stability control. Time‐domain simulations and experimental results are presented to verify the theoretical analysis results. The research results show that the three kinds of bifurcation behaviours including period‐doubling bifurcation, border collision bifurcation, and tangential bifurcation exist in the current‐mode‐controlled SIDO boost converters. Different from the previous works, the SIDO boost converter has a particular bifurcation trend when border collisions occur. The trend includes that operation mode shifts from CCM to DCM and then backs to CCM, and system period increases or decreases doubly.
- 1 June 2017
- Published by Institution of Engineering and Technology (IET) in IET Power Electronics
- Vol. 10 (7) , 846-853
Open AccessBifurcation analysis and operation region estimation of current‐mode‐controlled SIDO boost converter
To analyse the stable operation range with varied input and output voltages, bifurcation behaviours and operation region of current‐mode‐controlled single‐inductor dual‐output (SIDO) boost converter are investigated. The inductor current borders and one‐dimensional discrete‐mapping model are deduced firstly. On the basis of the model, the bifurcation diagram and corresponding Lyapunov exponent spectrum are analysed. Two transition conditions and boundary equations of the converter are derived, where its working state transits from stability to instability, and its operation mode shifts from continuous conduction mode (CCM) to discontinuous conduction mode (DCM). The operation region with different circuit parameters can be estimated and divided through the parameter space maps, which is significant for the design of circuit parameters and stability control. Time‐domain simulations and experimental results are presented to verify the theoretical analysis results. The research results show that the three kinds of bifurcation behaviours including period‐doubling bifurcation, border collision bifurcation, and tangential bifurcation exist in the current‐mode‐controlled SIDO boost converters. Different from the previous works, the SIDO boost converter has a particular bifurcation trend when border collisions occur. The trend includes that operation mode shifts from CCM to DCM and then backs to CCM, and system period increases or decreases doubly.