The following pages link to Wen Li (Q201953):
Displaying 38 items.
- On the Z-Eigenvalue Bounds for a Tensor (Q5197257) (← links)
- On perturbation bounds of the linear complementarity problem (Q5206304) (← links)
- Relaxation methods for solving the tensor equation arising from the higher‐order Markov chains (Q5206495) (← links)
- The Analytic Solutions of a Class of Constrained Matrix Minimization and Maximization Problems with Applications (Q5231680) (← links)
- Combined Perturbation Bounds: I. Eigensystems and Singular Value Decompositions (Q5301197) (← links)
- (Q5318538) (← links)
- Solvability of matrix equations , under semi-tensor product (Q5351832) (← links)
- Some Refined Eigenvalue Perturbation Bounds for Two-by-Two Block Hermitian Matrices (Q5372014) (← links)
- Backward Error Analysis for Eigenproblems Involving Conjugate Symplectic Matrices (Q5372026) (← links)
- Sensitivity analysis for the generalized singular value decomposition (Q5397308) (← links)
- (Q5399608) (← links)
- On Perturbation Bounds for the Joint Stationary Distribution of Multivariate Markov Chain Models (Q5406931) (← links)
- On the limiting probability distribution of a transition probability tensor (Q5409964) (← links)
- On Condition Numbers for the Weighted Moore-Penrose Inverse and the Weighted Least Squares Problem involving Kronecker Products (Q5417786) (← links)
- (Q5435942) (← links)
- (Q5436062) (← links)
- (Q5456118) (← links)
- (Q5488733) (← links)
- (Q5490755) (← links)
- (Q5490821) (← links)
- A preconditioned modulus-based iteration method for solving linear complementarity problems of<i>H</i>-matrices (Q5741213) (← links)
- On condition numbers for the canonical generalized polar decompostion of real matrices (Q5746848) (← links)
- Numerical subspace algorithms for solving the tensor equations involving Einstein product (Q5858535) (← links)
- (Q5866759) (← links)
- Nonconvex multi-view subspace clustering via simultaneously learning the representation tensor and affinity matrix* (Q5867685) (← links)
- On the extreme points of slice-stochastic tensors (Q5887659) (← links)
- Estimates for bounds of some numerical characters of matrices (Q5926396) (← links)
- Comparison results for parallel multisplitting methods with applications to AOR methods (Q5943031) (← links)
- A non-modulus linear method for solving the linear complementarity problem (Q5962835) (← links)
- On the inverse of a tensor (Q5962844) (← links)
- An efficient method for solving a matrix least squares problem over a matrix inequality constraint (Q5963678) (← links)
- Multi-linear pseudo-PageRank for hypergraph partitioning (Q6123354) (← links)
- A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems (Q6166658) (← links)
- Anderson accelerated fixed‐point iteration for multilinear PageRank (Q6178067) (← links)
- Fast randomized algorithms for low-rank matrix approximations with applications in global comparative analysis of a class of data sets (Q6530573) (← links)
- 3-D array image data completion by tensor decomposition and nonconvex regularization approach (Q6603097) (← links)
- Enhancing long-term survival prediction with two short-term events: landmarking with a flexible varying coefficient model (Q6615910) (← links)
- Nonconvex Robust Quaternion Matrix Completion for Imaging Processing (Q6749537) (← links)
