Shu-Xin Miao

Orcid: 0000-0002-0905-7770

According to our database1, Shu-Xin Miao authored at least 19 papers between 2009 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
An improved noise-tolerant zeroing neural network model for solving the time-varying Yang-Baxter-like matrix equation.
Comput. Appl. Math., June, 2026

A predefined-time neurodynamic model for solving absolute value equation.
Neural Networks, 2026

Design and analysis of a predefined-time zeroing neural network model for solving the Stein tensor equation.
J. Frankl. Inst., 2026

2025
Preconditioned inexact fixed point iteration method for solving tensor absolute value equation.
Numer. Algorithms, November, 2025

2024
A modified improved alternating positive semi-definite splitting preconditioner for double saddle point problems.
J. Appl. Math. Comput., October, 2024

A new fixed point iterative method for solving tensor absolute value equation.
Comput. Appl. Math., October, 2024

A new inexact fixed point iteration method for solving tensor absolute value equation.
Appl. Math. Lett., 2024

2022
On the solvability and Picard-type method for absolute value matrix equations.
Comput. Appl. Math., March, 2022

2021
A general Uzawa-type method for a class of 2 × 2 block structure linear system.
Comput. Math. Appl., 2021

A general fast shift-splitting iteration method for nonsymmetric saddle point problems.
Comput. Appl. Math., 2021

2020
A generalized SHSS preconditioner for generalized saddle point problem.
Comput. Appl. Math., 2020

2018
On the semi-convergence of preconditioned GLHSS iteration method for non-Hermitian singular saddle point problem.
Comput. Math. Appl., 2018

Two new preconditioned GAOR methods for weighted linear least squares problems.
Appl. Math. Comput., 2018

2017
On preconditioned generalized shift-splitting iteration methods for saddle point problems.
Comput. Math. Appl., 2017

A new Uzawa-type method for saddle point problems.
Appl. Math. Comput., 2017

2016
On semi-convergence of the generalized shift-splitting iteration method for singular nonsymmetric saddle point problems.
Comput. Math. Appl., 2016

2014
On Comparison Theorems for Splittings of Different Semimonotone Matrices.
J. Appl. Math., 2014

A note on GPIU method for generalized saddle point problems.
Appl. Math. Comput., 2014

2009
Two new modified Gauss-Seidel methods for linear system with M-matrices.
J. Comput. Appl. Math., 2009


  Loading...