default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJun-Feng Yin
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j35]Nan Li, Jun-Feng Yin
:
The randomized circumcentered-reflection iteration method for solving consistent linear equations. Comput. Appl. Math. 44(1): 26 (2025)- [j34]Ze Wang, Jun-Feng Yin, Ji-Chen Zhao:
The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem. J. Comput. Appl. Math. 454: 116182 (2025) - [j33]Zeyu Dong, Ze Wang, Guojian Yin, Jun-Feng Yin:
A Surrogate Hyperplane Bregman-Kaczmarz Method for Solving Linear Inverse Problems. J. Sci. Comput. 102(1): 7 (2025) - 2024
- [j32]Aqin Xiao, Jun-Feng Yin:
A greedy average block sparse Kaczmarz method for sparse solutions of linear systems. Appl. Math. Lett. 153: 109053 (2024) - [j31]Yu-Xin Ye, Jun-Feng Yin:
A residual-based weighted nonlinear Kaczmarz method for solving nonlinear systems of equations. Comput. Appl. Math. 43(5): 276 (2024) - [j30]Aqin Xiao, Jun-Feng Yin:
On averaging block Kaczmarz methods for solving nonlinear systems of equations. J. Comput. Appl. Math. 451: 116041 (2024) - [i4]Ze Wang, Jun-Feng Yin, Ji-Chen Zhao:
The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem. CoRR abs/2406.15082 (2024) - 2023
- [j29]Ze Wang, Jun-Feng Yin:
A surrogate hyperplane Kaczmarz method for solving consistent linear equations. Appl. Math. Lett. 144: 108704 (2023) - [j28]Aqin Xiao, Jun-Feng Yin, Ning Zheng:
On fast greedy block Kaczmarz methods for solving large consistent linear systems. Comput. Appl. Math. 42(3) (2023) - [j27]Ming-Kai Wang, Cheng Wang, Jun-Feng Yin:
A second-order ADI method for pricing options under fractional regime-switching models. Networks Heterog. Media 18(2): 647-663 (2023) - 2022
- [j26]Jun-Feng Yin, Nan Li, Ning Zheng:
Restarted randomized surrounding methods for solving large linear equations. Appl. Math. Lett. 133: 108290 (2022) - [j25]Xiang-Long Jiang, Ke Zhang, Jun-Feng Yin:
Randomized block Kaczmarz methods with k-means clustering for solving large linear systems. J. Comput. Appl. Math. 403: 113828 (2022) - [j24]Nan Li, Jian Ding, Jun-Feng Yin:
Modified relaxation two-sweep modulus-based matrix splitting iteration method for solving a class of implicit complementarity problems. J. Comput. Appl. Math. 413: 114370 (2022) - [j23]Rui Li, Zhilin Li, Jun-Feng Yin:
A generalized modulus-based Newton method for solving a class of non-linear complementarity problems with P-matrices. Numer. Algorithms 89(2): 839-853 (2022) - [i3]Jun-Feng Yin, Nan Li, Ning Zheng:
Restarted randomized surrounding methods for solving large linear equations. CoRR abs/2205.01388 (2022) - 2021
- [j22]Yi-Shu Du, Ken Hayami, Ning Zheng, Keiichi Morikuni, Jun-Feng Yin:
Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems. SIAM J. Sci. Comput. 43(5): S345-S366 (2021) - 2020
- [j21]Zeng-Qi Wang, Jun-Feng Yin, Quan-Yu Dou:
Preconditioned modified Hermitian and skew-Hermitian splitting iteration methods for fractional nonlinear Schrödinger equations. J. Comput. Appl. Math. 367 (2020) - [i2]Yi-Shu Du, Ken Hayami, Ning Zheng, Keiichi Morikuni, Jun-Feng Yin:
Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems. CoRR abs/2006.10818 (2020) - [i1]Zeyu Liao, Ken Hayami, Keiichi Morikuni, Jun-Feng Yin:
A Stabilized GMRES Method for Solving Underdetermined Least Squares Problems. CoRR abs/2007.10853 (2020)
2010 – 2019
- 2018
- [j20]Hua Yi, Shi-You Xin, Jun-Feng Yin:
A Class of Algorithms for Continuous Wavelet Transform Based on the Circulant Matrix. Algorithms 11(3): 24 (2018) - [j19]Rui Li, Jun-Feng Yin:
On the convergence of modulus-based matrix splitting iteration methods for a class of nonlinear complementarity problems with H+-matrices. J. Comput. Appl. Math. 342: 202-209 (2018) - 2017
- [j18]Zhong-Zhi Bai, Alessandro Buccini, Ken Hayami, Lothar Reichel, Jun-Feng Yin, Ning Zheng:
Modulus-based iterative methods for constrained Tikhonov regularization. J. Comput. Appl. Math. 319: 1-13 (2017) - [j17]Rui Li, Jun-Feng Yin:
Accelerated modulus-based matrix splitting iteration methods for a restricted class of nonlinear complementarity problems. Numer. Algorithms 75(2): 339-358 (2017) - 2016
- [j16]Ning Zheng, Ken Hayami, Jun-Feng Yin:
Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems. SIAM J. Matrix Anal. Appl. 37(3): 1250-1278 (2016) - 2015
- [j15]Jun-Feng Yin, Xiao-He Kong, Ning Zheng:
Aitken extrapolation method for computing the largest eigenvalue of nonnegative tensors. Appl. Math. Comput. 258: 350-357 (2015) - [j14]Xiao-Ting Gan, Jun-Feng Yin:
Symmetric finite volume method for second order variable coefficient hyperbolic equations. Appl. Math. Comput. 268: 1015-1028 (2015) - [j13]Xiao-Ting Gan, Jun-Feng Yin:
Symmetric finite volume element approximations of second order linear hyperbolic integro-differential equations. Comput. Math. Appl. 70(10): 2589-2600 (2015) - 2014
- [j12]Ning Zheng, Jun-Feng Yin:
Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an H+-matrix. J. Comput. Appl. Math. 260: 281-293 (2014) - 2013
- [j11]Jun-Feng Yin, Yu Zhang:
Alternative gradient algorithms for computing the nearest correlation matrix. Appl. Math. Comput. 219(14): 7591-7599 (2013) - [j10]Ning Zheng, Jun-Feng Yin:
On the convergence of projected triangular decomposition methods for pricing American options with stochastic volatility. Appl. Math. Comput. 223: 411-422 (2013) - [j9]Ning Zheng, Jun-Feng Yin:
Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem. Numer. Algorithms 64(2): 245-262 (2013) - 2012
- [j8]Jun-Feng Yin, Guo-Jian Yin, Michael K. Ng:
On adaptively accelerated Arnoldi method for computing PageRank. Numer. Linear Algebra Appl. 19(1): 73-85 (2012) - 2011
- [j7]Xiaoke Cui, Ken Hayami, Jun-Feng Yin:
Greville's method for preconditioning least squares problems. Adv. Comput. Math. 35(2-4): 243-269 (2011) - 2010
- [j6]Zhong-Zhi Bai, Hua Dai, Xing-Ping Liu, Jun-Feng Yin:
Preface. Appl. Math. Comput. 216(6): 1681 (2010) - [j5]Jun-Feng Yin:
A class of preconditioners based on matrix splitting for nonsymmetric linear systems. Appl. Math. Comput. 216(6): 1694-1706 (2010) - [j4]Ken Hayami, Jun-Feng Yin, Tokushi Ito:
GMRES Methods for Least Squares Problems. SIAM J. Matrix Anal. Appl. 31(5): 2400-2430 (2010) - [c1]Guo-Jian Yin, Jun-Feng Yin:
On Arnoldi Method Accelerating PageRank Computations. WISM 2010: 378-385
2000 – 2009
- 2009
- [j3]Jun-Feng Yin:
Preconditioner based on the Sherman-Morrison formula for regularized least squares problems. Appl. Math. Comput. 215(8): 3007-3016 (2009) - [j2]Zhong-Zhi Bai, Jun-Feng Yin:
Modified incomplete orthogonal factorization methods using Givens rotations. Computing 86(1): 53-69 (2009) - 2005
- [j1]Zhong-Zhi Bai, Gene H. Golub, Linzhang Lu, Jun-Feng Yin:
Block Triangular and Skew-Hermitian Splitting Methods for Positive-Definite Linear Systems. SIAM J. Sci. Comput. 26(3): 844-863 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
