Xiao-Qing Jin
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
Xiao-Qing Jin has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Zheng-Jian Bai
School of Mathematical Sciences, Xiamen University, Xiamen, People’s Republic of China
6 shared publications - Zhi Zhao
Department of Mathematics, School of Sciences, Hangzhou Dianzi University, Hangzhou, People’s Republic of China
6 shared publications - Teng-Teng Yao
Department of Mathematics, School of Sciences, Zhejiang University of Science and Technology, Hangzhou, People’s Republic of China
4 shared publications - Seakweng Vong
Department of Mathematics, University of Macau, Avenida da Universidade, Macau, China
3 shared publications - Weiping Shen
School of Mathematical Sciences, Zhejiang Normal University, Jinhua, P. R. China
3 shared publications - Yimin Wei
School of Mathematical Sciences and Shanghai Key Laboratory of Contemporary Applied Mathematics, Fudan University, Shanghai, P. R. of China
3 shared publications
Latest Publications
- Open Access
Some Tucker-like approximations based on the modal semi-tensor product
Approximating higher-order tensors by the Tucker format has been applied in many fields such as psychometrics, chemometrics, signal processing, pattern classification, and so on. In this paper, we propose some new Tucker-like approximations based on the modal semi-tensor product (STP), especially, a new singular value decomposition (SVD) and a new higher-order SVD (HOSVD) are derived. Algorithms for computing new decompositions are provided. We also give some numerical examples to illustrate our theoretical results.
Open AccessSome Tucker-like approximations based on the modal semi-tensor product
Approximating higher-order tensors by the Tucker format has been applied in many fields such as psychometrics, chemometrics, signal processing, pattern classification, and so on. In this paper, we propose some new Tucker-like approximations based on the modal semi-tensor product (STP), especially, a new singular value decomposition (SVD) and a new higher-order SVD (HOSVD) are derived. Algorithms for computing new decompositions are provided. We also give some numerical examples to illustrate our theoretical results.
- 25 February 2020
- Published by Springer Nature in Numerical Algorithms
- Vol. 86 (1) , 325-355
A Riemannian derivative-free Polak–Ribiére–Polyak method for tangent vector field
- 25 February 2020
- Published by Springer Nature in Numerical Algorithms
- Vol. 86 (1) , 325-355
A Riemannian derivative-free Polak–Ribiére–Polyak method for tangent vector field
- 6 May 2019
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 59 (3) , 675-694
Riemannian inexact Newton method for structured inverse eigenvalue and singular value problems
- 6 May 2019
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 59 (3) , 675-694
Riemannian inexact Newton method for structured inverse eigenvalue and singular value problems
- Open Access
A Riemannian Derivative-Free Polak-Ribiere-Polyak Method for Tangent Vector Field
This paper is concerned with the problem of finding a zero of a tangent vector field on a Riemannian manifold. We first reformulate the problem as an equivalent Riemannian optimization problem. Then we propose a Riemannian derivative-free Polak-Ribi\'ere-Polyak method for solving the Riemannian optimization problem, where a non-monotone line search is employed. The global convergence of the proposed method is established under some mild assumptions. To further improve the efficiency, we also provide a hybrid method, which combines the proposed geometric method with the Riemannian Newton method. Finally, some numerical experiments are reported to illustrate the efficiency of the proposed method.
Open AccessA Riemannian Derivative-Free Polak-Ribiere-Polyak Method for Tangent Vector Field
This paper is concerned with the problem of finding a zero of a tangent vector field on a Riemannian manifold. We first reformulate the problem as an equivalent Riemannian optimization problem. Then we propose a Riemannian derivative-free Polak-Ribi\'ere-Polyak method for solving the Riemannian optimization problem, where a non-monotone line search is employed. The global convergence of the proposed method is established under some mild assumptions. To further improve the efficiency, we also provide a hybrid method, which combines the proposed geometric method with the Riemannian Newton method. Finally, some numerical experiments are reported to illustrate the efficiency of the proposed method.
- Open Access
Riemannian Inexact Newton Method for Structured Inverse Eigenvalue and Singular Value Problems
Inverse eigenvalue and singular value problems have been widely discussed for decades. The well-known result is the Weyl-Horn condition, which presents the relations between the eigenvalues and singular values of an arbitrary matrix. This result by Weyl-Horn then leads to an interesting inverse problem, i.e., how to construct a matrix with desired eigenvalues and singular values. In this work, we do that and more. We propose an eclectic mix of techniques from differential geometry and the inexact Newton method for solving inverse eigenvalue and singular value problems as well as additional desired characteristics such as nonnegative entries, prescribed diagonal entries, and even predetermined entries. We show theoretically that our method converges globally and quadratically, and we provide numerical examples to demonstrate the robustness and accuracy of our proposed method. {Having theoretical interest, we provide in the appendix a necessary and sufficient condition for the existence of a $2\times 2$ real matrix, or even a nonnegative matrix, with prescribed eigenvalues, singular values, and main diagonal entries.Open AccessRiemannian Inexact Newton Method for Structured Inverse Eigenvalue and Singular Value Problems
Inverse eigenvalue and singular value problems have been widely discussed for decades. The well-known result is the Weyl-Horn condition, which presents the relations between the eigenvalues and singular values of an arbitrary matrix. This result by Weyl-Horn then leads to an interesting inverse problem, i.e., how to construct a matrix with desired eigenvalues and singular values. In this work, we do that and more. We propose an eclectic mix of techniques from differential geometry and the inexact Newton method for solving inverse eigenvalue and singular value problems as well as additional desired characteristics such as nonnegative entries, prescribed diagonal entries, and even predetermined entries. We show theoretically that our method converges globally and quadratically, and we provide numerical examples to demonstrate the robustness and accuracy of our proposed method. {Having theoretical interest, we provide in the appendix a necessary and sufficient condition for the existence of a $2\times 2$ real matrix, or even a nonnegative matrix, with prescribed eigenvalues, singular values, and main diagonal entries. - 20 September 2018
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 68 (5) , 886-902
An optimal preconditioner for tensor equations involving Einstein product
An optimal preconditioner for tensor equations involving the Einstein product is considered. This preconditioner actually is an approximation to any given tensor in some tensor subspaces such as the subspace of all circulant tensors. Numerical examples show that the optimal preconditioner is efficient for some Toeplitz tensor equations.
- 20 September 2018
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 68 (5) , 886-902
An optimal preconditioner for tensor equations involving Einstein product
An optimal preconditioner for tensor equations involving the Einstein product is considered. This preconditioner actually is an approximation to any given tensor in some tensor subspaces such as the subspace of all circulant tensors. Numerical examples show that the optimal preconditioner is efficient for some Toeplitz tensor equations.
- Open Access
A Preconditioned Riemannian Gauss-Newton Method for Least Squares Inverse Eigenvalue Problems
This paper is concerned with the least squares inverse eigenvalue problem of reconstructing a linear parameterized real symmetric matrix from the prescribed partial eigenvalues in the sense of least squares, which was originally proposed by Chen and Chu [SIAM J. Numer. Anal., 33 (1996), pp. 2417--2430]. We provide a Riemannian inexact Gausss-Newton method for solving the least squares inverse eigenvalue problem. The global and local convergence analysis of the proposed method is discussed. Also, a preconditioned conjugate gradient method with an efficient preconditioner is proposed for solving the Riemannian Gauss-Newton equation. Finally, some numerical tests, including an application in the inverse Sturm-Liouville problem, are reported to illustrate the efficiency of the proposed method.
Open AccessA Preconditioned Riemannian Gauss-Newton Method for Least Squares Inverse Eigenvalue Problems
This paper is concerned with the least squares inverse eigenvalue problem of reconstructing a linear parameterized real symmetric matrix from the prescribed partial eigenvalues in the sense of least squares, which was originally proposed by Chen and Chu [SIAM J. Numer. Anal., 33 (1996), pp. 2417--2430]. We provide a Riemannian inexact Gausss-Newton method for solving the least squares inverse eigenvalue problem. The global and local convergence analysis of the proposed method is discussed. Also, a preconditioned conjugate gradient method with an efficient preconditioner is proposed for solving the Riemannian Gauss-Newton equation. Finally, some numerical tests, including an application in the inverse Sturm-Liouville problem, are reported to illustrate the efficiency of the proposed method.
- Open Access
A Riemannian Inexact Newton-CG Method for Nonnegative Inverse Eigenvalue Problems: Nonsymmetric Case
This paper is concerned with the nonnegative inverse eigenvalue problem of finding a nonnegative matrix such that its spectrum is the prescribed self-conjugate set of complex numbers. We first reformulate the nonnegative inverse eigenvalue problem as an under-determined constrained nonlinear matrix equation over several matrix manifolds. Then we propose a Riemannian inexact Newton-CG method for solving the nonlinear matrix equation. The global and quadratic convergence of the proposed method is established under some mild conditions. We also extend the proposed method to the case of prescribed entries. Finally, numerical experiments are reported to illustrate the efficiency of the proposed method.
Open AccessA Riemannian Inexact Newton-CG Method for Nonnegative Inverse Eigenvalue Problems: Nonsymmetric Case
This paper is concerned with the nonnegative inverse eigenvalue problem of finding a nonnegative matrix such that its spectrum is the prescribed self-conjugate set of complex numbers. We first reformulate the nonnegative inverse eigenvalue problem as an under-determined constrained nonlinear matrix equation over several matrix manifolds. Then we propose a Riemannian inexact Newton-CG method for solving the nonlinear matrix equation. The global and quadratic convergence of the proposed method is established under some mild conditions. We also extend the proposed method to the case of prescribed entries. Finally, numerical experiments are reported to illustrate the efficiency of the proposed method.
- 3 May 2017
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 74 (1) , 412-425
Tensor Methods for Solving Symmetric ${\mathcal {M}}$ M -tensor Systems- 3 May 2017
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 74 (1) , 412-425
Tensor Methods for Solving Symmetric ${\mathcal {M}}$ M -tensor Systems- 1 January 2017
- Published by Global Science Press in East Asian Journal on Applied Mathematics
- Vol. 7 (4) , 827-836
A Convergence Analysis of the MINRES Method for Some Hermitian Indefinite Systems
A Convergence Analysis of the MINRES Method for Some Hermitian Indefinite Systems - Volume 7 Issue 4 - Ze-Jia Xie, Xiao-Qing Jin, Zhi Zhao
- 1 January 2017
- Published by Global Science Press in East Asian Journal on Applied Mathematics
- Vol. 7 (4) , 827-836
A Convergence Analysis of the MINRES Method for Some Hermitian Indefinite Systems
A Convergence Analysis of the MINRES Method for Some Hermitian Indefinite Systems - Volume 7 Issue 4 - Ze-Jia Xie, Xiao-Qing Jin, Zhi Zhao