default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKensuke Aishima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Kensuke Aishima
:
Statistical modeling and an adaptive averaging technique for strong convergence of the dynamic mode decomposition. J. Comput. Appl. Math. 417: 114551 (2023)- [i2]Kensuke Aishima:
Consistent estimation with the use of orthogonal projections for a linear regression model with errors in the variables. CoRR abs/2302.06824 (2023) - [i1]Kensuke Aishima:
Strong consistency of an estimator by the truncated singular value decomposition for an errors-in-variables regression model with collinearity. CoRR abs/2311.17407 (2023) - 2022
- [j13]Kensuke Aishima:
Consistent estimation for an errors-in-variables model based on constrained total least squares problems. JSIAM Lett. 14: 111-114 (2022) - 2020
- [j12]Kensuke Aishima:
A quadratically convergent algorithm for inverse generalized eigenvalue problems. J. Comput. Appl. Math. 367 (2020) - [j11]Takeshi Ogita, Kensuke Aishima:
Iterative refinement for singular value decomposition based on matrix multiplication. J. Comput. Appl. Math. 369 (2020) - [j10]Kensuke Aishima:
Strong convergence for the dynamic mode decomposition based on the total least squares to noisy datasets. JSIAM Lett. 12: 33-36 (2020)
2010 – 2019
- 2018
- [j9]Yushi Morijiri, Kensuke Aishima, Takayasu Matsuo:
Extension of an error analysis of the randomized Kaczmarz method for inconsistent linear systems. JSIAM Lett. 10: 17-20 (2018) - 2017
- [j8]Kensuke Aishima:
On convergence of iterative projection methods for symmetric eigenvalue problems. J. Comput. Appl. Math. 311: 513-521 (2017) - 2015
- [j7]Shinji Ito, Kensuke Aishima, Takaaki Nara, Masaaki Sugihara:
Orthogonal polynomial approach to estimation of poles of rational functions from data on open curves. J. Comput. Appl. Math. 273: 326-345 (2015) - [j6]Kensuke Aishima:
Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems. Numerische Mathematik 131(3): 405-423 (2015) - 2014
- [j5]Kensuke Aishima, Takayasu Matsuo, Kazuo Murota, Masaaki Sugihara:
A shift strategy for superquadratic convergence in the dqds algorithm for singular values. J. Comput. Appl. Math. 257: 132-143 (2014) - 2012
- [j4]Kensuke Aishima, Takayasu Matsuo, Kazuo Murota, Masaaki Sugihara:
A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence. J. Comput. Appl. Math. 236(15): 3556-3560 (2012) - [j3]Yuji Nakatsukasa, Kensuke Aishima, Ichitaro Yamazaki:
dqds with Aggressive Early Deflation. SIAM J. Matrix Anal. Appl. 33(1): 22-51 (2012) - 2010
- [j2]Kensuke Aishima, Takayasu Matsuo, Kazuo Murota, Masaaki Sugihara:
Superquadratic convergence of DLASQ for computing matrix singular values. J. Comput. Appl. Math. 234(4): 1179-1187 (2010)
2000 – 2009
- 2008
- [j1]Kensuke Aishima, Takayasu Matsuo, Kazuo Murota, Masaaki Sugihara:
On Convergence of the DQDS Algorithm for Singular Value Computation. SIAM J. Matrix Anal. Appl. 30(2): 522-537 (2008)
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-04-25 05:56 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:
