default search action
Ken Hayami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i7]Zeyu Liao, Ken Hayami:
Convergence analysis of inner-iteration preconditioned GMRES. CoRR abs/2408.00693 (2024) - 2023
- [j24]Kota Sugihara, Ken Hayami
, Zeyu Liao
GMRES using pseudoinverse for range symmetric singular systems. J. Comput. Appl. Math. 422: 114865 (2023) - [j23]Ken Hayami
Recent advances in the numerical solution of matrix problems. J. Comput. Appl. Math. 430: 115239 (2023) - [i6]Kota Sugihara, Ken Hayami:
Right preconditioned GMRES for arbitrary singular systems. CoRR abs/2310.16442 (2023) - 2022
- [j22]Per Christian Hansen
GMRES methods for tomographic reconstruction with an unmatched back projector. J. Comput. Appl. Math. 413: 114352 (2022) - [i5]Kota Sugihara, Ken Hayami, Zeyu Liao:
GMRES using pseudo-inverse for range symmetric singular systems. CoRR abs/2201.11429 (2022) - 2021
- [j21]Ken Hayami
Corrigendum 2 to: A geometric view of Krylov subspace methods on singular systems. Numer. Linear Algebra Appl. 28(4) (2021) - [j20]Yi-Shu Du
Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems. SIAM J. Sci. Comput. 43(5): S345-S366 (2021) - [i4]Per Christian Hansen, Ken Hayami, Keiichi Morikuni:
GMRES Methods for Tomographic Reconstruction with an Unmatched Back Projector. CoRR abs/2110.01481 (2021) - 2020
- [j19]Xiongfeng Song, Wei Xu, Ken Hayami, Ning Zheng:
Secant variable projection method for solving nonnegative separable least squares problems. Numer. Algorithms 85(2): 737-761 (2020) - [j18]Kota Sugihara
Right preconditioned MINRES for singular systems†. Numer. Linear Algebra Appl. 27(3) (2020) - [i3]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) - [i2]Zeyu Liao, Ken Hayami, Keiichi Morikuni, Jun-Feng Yin:
A Stabilized GMRES Method for Solving Underdetermined Least Squares Problems. CoRR abs/2007.10853 (2020) - [i1]Ken Hayami, Kota Sugihara:
GMRES on singular systems revisited. CoRR abs/2009.00371 (2020)
2010 – 2019
- 2019
- [j17]Yiran Cui
Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning. Comput. Optim. Appl. 74(1): 143-176 (2019) - 2017
- [j16]Zhong-Zhi Bai, Alessandro Buccini
Modulus-based iterative methods for constrained Tikhonov regularization. J. Comput. Appl. Math. 319: 1-13 (2017) - [j15]José Marín, José Mas, Daniel Guerrero, Ken Hayami:
Updating preconditioners for modified least squares problems. Numer. Algorithms 75(2): 491-508 (2017) - 2016
- [j14]Wei Xu, Ning Zheng, Ken Hayami:
Jacobian-Free Implicit Inner-Iteration Preconditioner for Nonlinear Least Squares Problems. J. Sci. Comput. 68(3): 1055-1081 (2016) - [j13]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
- [j12]Philippe Gaudreau
Improvements to the cluster Newton method for underdetermined inverse problems. J. Comput. Appl. Math. 283: 122-141 (2015) - [j11]Keiichi Morikuni, Ken Hayami:
Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems. SIAM J. Matrix Anal. Appl. 36(1): 225-250 (2015) - 2014
- [j10]Ken Hayami, Masaaki Sugihara:
Corrigendum to: A geometric view of Krylov subspace methods on singular systems. Numer. Linear Algebra Appl. 21(5): 701-702 (2014) - [j9]Yasunori Aoki
Cluster Newton Method for Sampling Multiple Solutions of Underdetermined Inverse Problems: Application to a Parameter Identification Problem in Pharmacokinetics. SIAM J. Sci. Comput. 36(1) (2014) - 2013
- [j8]Keiichi Morikuni, Ken Hayami:
Inner-Iteration Krylov Subspace Methods for Least Squares Problems. SIAM J. Matrix Anal. Appl. 34(1): 1-22 (2013) - 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) - [j6]Ken Hayami, Masaaki Sugihara:
A geometric view of Krylov subspace methods on singular systems. Numer. Linear Algebra Appl. 18(3): 449-469 (2011) - 2010
- [j5]Ken Hayami, Jun-Feng Yin, Tokushi Ito:
GMRES Methods for Least Squares Problems. SIAM J. Matrix Anal. Appl. 31(5): 2400-2430 (2010)
2000 – 2009
- 2001
- [j4]Guoqiang Han, Ken Hayami, Wang Jiong:
Product integration method for Volterra integral equation with noncompact kernel. Appl. Math. Comput. 121(2-3): 363-371 (2001) - 2000
- [j3]Guoqiang Han, Ken Hayami, Kokichi Sugihara, Wang Jiong:
Extrapolation method of iterated collocation solution for two-dimensional nonlinear Volterra integral equations. Appl. Math. Comput. 112(1): 49-61 (2000)
1990 – 1999
- 1995
- [j2]Takumi Washio
Overlapped Multicolor MILU Preconditioning. SIAM J. Sci. Comput. 16(3): 636-650 (1995) - 1994
- [j1]Takumi Washio
Parallel block preconditioning based on SSOR and MILU. Numer. Linear Algebra Appl. 1(6): 533-553 (1994)
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-10-07 22:23 CEST 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: