Jun-Feng Yin

Orcid: 0000-0003-4154-4138

According to our database1, Jun-Feng Yin authored at least 37 papers between 2005 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
The randomized circumcentered-reflection iteration method for solving consistent linear equations.
Comput. Appl. Math., February, 2025

A Surrogate Hyperplane Bregman-Kaczmarz Method for Solving Linear Inverse Problems.
J. Sci. Comput., January, 2025

The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem.
J. Comput. Appl. Math., 2025

2024
A residual-based weighted nonlinear Kaczmarz method for solving nonlinear systems of equations.
Comput. Appl. Math., July, 2024

On averaging block Kaczmarz methods for solving nonlinear systems of equations.
J. Comput. Appl. Math., 2024

A greedy average block sparse Kaczmarz method for sparse solutions of linear systems.
Appl. Math. Lett., 2024

2023
A surrogate hyperplane Kaczmarz method for solving consistent linear equations.
Appl. Math. Lett., October, 2023

On fast greedy block Kaczmarz methods for solving large consistent linear systems.
Comput. Appl. Math., April, 2023

A second-order ADI method for pricing options under fractional regime-switching models.
Networks Heterog. Media, 2023

2022
A generalized modulus-based Newton method for solving a class of non-linear complementarity problems with P-matrices.
Numer. Algorithms, 2022

Modified relaxation two-sweep modulus-based matrix splitting iteration method for solving a class of implicit complementarity problems.
J. Comput. Appl. Math., 2022

Randomized block Kaczmarz methods with k-means clustering for solving large linear systems.
J. Comput. Appl. Math., 2022

Restarted randomized surrounding methods for solving large linear equations.
Appl. Math. Lett., 2022

2021
Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems.
SIAM J. Sci. Comput., 2021

2020
Preconditioned modified Hermitian and skew-Hermitian splitting iteration methods for fractional nonlinear Schrödinger equations.
J. Comput. Appl. Math., 2020

A Stabilized GMRES Method for Solving Underdetermined Least Squares Problems.
CoRR, 2020

2018
On the convergence of modulus-based matrix splitting iteration methods for a class of nonlinear complementarity problems with H+-matrices.
J. Comput. Appl. Math., 2018

A Class of Algorithms for Continuous Wavelet Transform Based on the Circulant Matrix.
Algorithms, 2018

2017
Accelerated modulus-based matrix splitting iteration methods for a restricted class of nonlinear complementarity problems.
Numer. Algorithms, 2017

Modulus-based iterative methods for constrained Tikhonov regularization.
J. Comput. Appl. Math., 2017

2016
Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems.
SIAM J. Matrix Anal. Appl., 2016

2015
Symmetric finite volume element approximations of second order linear hyperbolic integro-differential equations.
Comput. Math. Appl., 2015

Aitken extrapolation method for computing the largest eigenvalue of nonnegative tensors.
Appl. Math. Comput., 2015

Symmetric finite volume method for second order variable coefficient hyperbolic equations.
Appl. Math. Comput., 2015

2014
Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an H<sub>+</sub>-matrix.
J. Comput. Appl. Math., 2014

2013
Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem.
Numer. Algorithms, 2013

On the convergence of projected triangular decomposition methods for pricing American options with stochastic volatility.
Appl. Math. Comput., 2013

Alternative gradient algorithms for computing the nearest correlation matrix.
Appl. Math. Comput., 2013

2012
On adaptively accelerated Arnoldi method for computing PageRank.
Numer. Linear Algebra Appl., 2012

2011
Greville's method for preconditioning least squares problems.
Adv. Comput. Math., 2011

2010
GMRES Methods for Least Squares Problems.
SIAM J. Matrix Anal. Appl., 2010

A class of preconditioners based on matrix splitting for nonsymmetric linear systems.
Appl. Math. Comput., 2010

Preface.
Appl. Math. Comput., 2010

On Arnoldi Method Accelerating PageRank Computations.
Proceedings of the Web Information Systems and Mining - International Conference, 2010

2009
Modified incomplete orthogonal factorization methods using Givens rotations.
Computing, 2009

Preconditioner based on the Sherman-Morrison formula for regularized least squares problems.
Appl. Math. Comput., 2009

2005
Block Triangular and Skew-Hermitian Splitting Methods for Positive-Definite Linear Systems.
SIAM J. Sci. Comput., 2005


  Loading...