default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuji Nakatsukasa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j50]Alice Cortinovis
, Daniel Kressner, Yuji Nakatsukasa:
Speeding Up Krylov Subspace Methods for Computing \(\boldsymbol{{f}(A){b}}\) via Randomization. SIAM J. Matrix Anal. Appl. 45(1): 619-633 (2024)- [j49]Maike Meier, Yuji Nakatsukasa, Alex Townsend, Marcus Webb:
Are Sketch-and-Precondition Least Squares Solvers Numerically Stable? SIAM J. Matrix Anal. Appl. 45(2): 905-929 (2024) - [j48]Yuji Nakatsukasa, Joel A. Tropp:
Fast and Accurate Randomized Algorithms for Linear Systems and Eigenvalue Problems. SIAM J. Matrix Anal. Appl. 45(2): 1183-1214 (2024) - [j47]Tobin A. Driscoll, Yuji Nakatsukasa, Lloyd N. Trefethen:
AAA Rational Approximation on a Continuum. SIAM J. Sci. Comput. 46(2): 929- (2024) - [c5]Takeshi Fukaya, Yuji Nakatsukasa, Yusaku Yamamoto:
A Cholesky QR type algorithm for computing tall-skinny QR factorization with column pivoting. IPDPS 2024: 63-75 - [i42]Taejun Park, Yuji Nakatsukasa:
Accuracy and Stability of CUR decompositions with Oversampling. CoRR abs/2405.06375 (2024) - [i41]Ethan N. Epperly, Maike Meier, Yuji Nakatsukasa:
Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers. CoRR abs/2406.03468 (2024) - [i40]Stefan Güttel, Yuji Nakatsukasa, Marcus Webb, Alban Bloor Riley:
A Sherman-Morrison-Woodbury approach to solving least squares problems with low-rank updates. CoRR abs/2406.15120 (2024) - [i39]Taejun Park, Yuji Nakatsukasa:
Low-rank approximation of parameter-dependent matrices via CUR decomposition. CoRR abs/2408.05595 (2024) - [i38]Lorenzo Lazzarino, Hussam Al Daas, Yuji Nakatsukasa:
Matrix perturbation analysis of methods for extracting singular values from approximate singular subspaces. CoRR abs/2409.09187 (2024) - [i37]Takeru Matsuda, Yuji Nakatsukasa:
Polynomial approximation of noisy functions. CoRR abs/2410.02317 (2024) - 2023
- [j46]Peter Benner, Yuji Nakatsukasa, Carolin Penke:
A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices. SIAM J. Matrix Anal. Appl. 44(3): 1245-1270 (2023) - [j45]Yuji Nakatsukasa, Taejun Park:
Randomized Low-Rank Approximation for Symmetric Indefinite Matrices. SIAM J. Matrix Anal. Appl. 44(3): 1370-1392 (2023) - [c4]David E. Keyes, Hatem Ltaief, Yuji Nakatsukasa, Dalal Sukkari:
High-Performance SVD Partial Spectrum Computation. SC 2023: 74:1-74:12 - [i36]Wenqi Zhu, Yuji Nakatsukasa:
Convergence and Near-optimal Sampling for Multivariate Function Approximations in Irregular Domains via Vandermonde with Arnoldi. CoRR abs/2301.12241 (2023) - [i35]Maike Meier, Yuji Nakatsukasa, Alex Townsend, Marcus Webb:
Are sketch-and-precondition least squares solvers numerically stable? CoRR abs/2302.07202 (2023) - [i34]Toby Driscoll, Yuji Nakatsukasa, Lloyd N. Trefethen:
AAA rational approximation on a continuum. CoRR abs/2305.03677 (2023) - [i33]Taejun Park, Yuji Nakatsukasa:
Approximating Sparse Matrices and their Functions using Matrix-vector products. CoRR abs/2310.05625 (2023) - [i32]Behnam Hashemi, Yuji Nakatsukasa:
RTSMS: Randomized Tucker with single-mode sketching. CoRR abs/2311.14873 (2023) - [i31]Yuji Nakatsukasa, Olivier Sète, Lloyd N. Trefethen:
The first five years of the AAA algorithm. CoRR abs/2312.03565 (2023) - 2022
- [j44]Behnam Hashemi, Yuji Nakatsukasa, Lloyd N. Trefethen:
Rectangular eigenvalue problems. Adv. Comput. Math. 48(6): 80 (2022) - [j43]Nikitas Rontsis, Paul Goulart, Yuji Nakatsukasa:
Efficient Semidefinite Programming with Approximate ADMM. J. Optim. Theory Appl. 192(1): 292-320 (2022) - [j42]Nikitas Rontsis, Paul J. Goulart, Yuji Nakatsukasa:
An active-set algorithm for norm constrained quadratic problems. Math. Program. 193(1): 447-483 (2022) - [j41]Andrew Horning, Yuji Nakatsukasa:
Twice Is Enough for Dangerous Eigenvalues. SIAM J. Matrix Anal. Appl. 43(1): 68-93 (2022) - [j40]Peter Benner, Yuji Nakatsukasa, Carolin Penke:
Stable and Efficient Computation of Generalized Polar Decompositions. SIAM J. Matrix Anal. Appl. 43(3): 1058-1083 (2022) - [j39]Ethan N. Epperly, Lin Lin, Yuji Nakatsukasa:
A Theory of Quantum Subspace Diagonalization. SIAM J. Matrix Anal. Appl. 43(3): 1263-1290 (2022) - [j38]Behnam Hashemi, Yuji Nakatsukasa:
Least-Squares Spectral Methods for ODE Eigenvalue Problems. SIAM J. Sci. Comput. 44(5): 3244- (2022) - [i30]Robert A. Baston, Yuji Nakatsukasa:
Stochastic diagonal estimation: probabilistic bounds and an improved algorithm. CoRR abs/2201.10684 (2022) - [i29]Maike Meier, Yuji Nakatsukasa:
Randomized algorithms for Tikhonov regularization in linear least squares. CoRR abs/2203.07329 (2022) - [i28]Peter Benner, Yuji Nakatsukasa, Carolin Penke:
A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices. CoRR abs/2203.08900 (2022) - [i27]Yuji Nakatsukasa, Taejun Park:
A Fast Randomized Algorithm for computing the Null Space. CoRR abs/2206.00975 (2022) - [i26]Yijun Dong, Per-Gunnar Martinsson, Yuji Nakatsukasa:
Efficient Bounds and Estimates for Canonical Angles in Randomized Subspace Approximations. CoRR abs/2211.04676 (2022) - [i25]Taejun Park, Yuji Nakatsukasa:
Randomized low-rank approximation for symmetric indefinite matrices. CoRR abs/2212.01127 (2022) - [i24]Alice Cortinovis, Daniel Kressner, Yuji Nakatsukasa:
Speeding up Krylov subspace methods for computing f(A)b via randomization. CoRR abs/2212.12758 (2022) - 2021
- [j37]Evan S. Gawlik, Yuji Nakatsukasa:
Approximating the pth root by composite rational functions. J. Approx. Theory 266: 105577 (2021) - [j36]Lloyd N. Trefethen, Yuji Nakatsukasa, J. A. C. Weideman:
Exponential node clustering at singularities for rational approximation, quadrature, and PDEs. Numerische Mathematik 147(1): 227-254 (2021) - [j35]Yuji Nakatsukasa, Alex Townsend:
Error Localization of Best L1 Polynomial Approximants. SIAM J. Numer. Anal. 59(1): 314-333 (2021) - [j34]Yuji Nakatsukasa, Lloyd N. Trefethen:
Reciprocal-Log Approximation and Planar PDE Solvers. SIAM J. Numer. Anal. 59(6): 2801-2822 (2021) - [j33]Pablo D. Brubeck, Yuji Nakatsukasa, Lloyd N. Trefethen:
Vandermonde with Arnoldi. SIAM Rev. 63(2): 405-415 (2021) - [i23]Peter Benner, Yuji Nakatsukasa, Carolin Penke:
Stable and Efficient Computation of Generalized Polar Decompositions. CoRR abs/2104.06659 (2021) - [i22]David E. Keyes, Hatem Ltaief, Yuji Nakatsukasa, Dalal Sukkari:
High-Performance Partial Spectrum Computation for Symmetric eigenvalue problems and the SVD. CoRR abs/2104.14186 (2021) - [i21]Maike Meier, Yuji Nakatsukasa:
Fast randomized numerical rank estimation. CoRR abs/2105.07388 (2021) - [i20]Stephan Mohr, Yuji Nakatsukasa, Carolina Urzúa-Torres:
Full operator preconditioning and the accuracy of solving linear systems. CoRR abs/2105.07963 (2021) - [i19]Behnam Hashemi, Yuji Nakatsukasa:
Least-squares spectral methods for ODE eigenvalue problems. CoRR abs/2109.05384 (2021) - [i18]Ethan N. Epperly, Lin Lin, Yuji Nakatsukasa:
A Theory of Quantum Subspace Diagonalization. CoRR abs/2110.07492 (2021) - [i17]Yuji Nakatsukasa, Joel A. Tropp:
Fast & Accurate Randomized Algorithms for Linear Systems and Eigenvalue Problems. CoRR abs/2111.00113 (2021) - [i16]Behnam Hashemi, Yuji Nakatsukasa, Lloyd N. Trefethen:
Rectangular eigenvalue problems. CoRR abs/2112.13698 (2021) - 2020
- [j32]Yuji Nakatsukasa:
Sharp error bounds for Ritz vectors and approximate singular vectors. Math. Comput. 89(324): 1843-1866 (2020) - [j31]Takeshi Fukaya, Ramaseshan Kannan, Yuji Nakatsukasa, Yusaku Yamamoto, Yuka Yanagisawa:
Shifted Cholesky QR for Computing the QR Factorization of Ill-Conditioned Matrices. SIAM J. Sci. Comput. 42(1): A477-A503 (2020) - [j30]Yuji Nakatsukasa, Lloyd N. Trefethen:
An Algorithm for Real and Complex Rational Minimax Approximation. SIAM J. Sci. Comput. 42(5): A3157-A3179 (2020) - [j29]Yuanchao Bai, Fen Wang, Gene Cheung, Yuji Nakatsukasa, Wen Gao:
Fast Graph Sampling Set Selection Using Gershgorin Disc Alignment. IEEE Trans. Signal Process. 68: 2419-2434 (2020) - [c3]Nicolas Boullé, Yuji Nakatsukasa, Alex Townsend:
Rational neural networks. NeurIPS 2020 - [i15]Nicolas Boullé, Yuji Nakatsukasa, Alex Townsend:
Rational neural networks. CoRR abs/2004.01902 (2020) - [i14]Lloyd N. Trefethen, Yuji Nakatsukasa, J. A. C. Weideman:
Exponential node clustering at singularities for rational approximation, quadrature, and PDEs. CoRR abs/2007.11828 (2020) - [i13]Henrik Eisenmann, Yuji Nakatsukasa:
Solving two-parameter eigenvalue problems using an alternating method. CoRR abs/2008.03385 (2020) - [i12]Yuji Nakatsukasa:
Fast and stable randomized low-rank matrix approximation. CoRR abs/2009.11392 (2020) - [i11]Yuji Nakatsukasa, Lloyd N. Trefethen:
Reciprocal-log approximation and planar PDE solvers. CoRR abs/2010.01807 (2020) - [i10]Andrew Horning, Yuji Nakatsukasa:
Twice is enough for dangerous eigenvalues. CoRR abs/2010.09710 (2020) - [i9]Evan S. Gawlik, Yuji Nakatsukasa:
Zolotarev's fifth and sixth problems. CoRR abs/2011.10877 (2020)
2010 – 2019
- 2019
- [j28]Satoru Adachi, Yuji Nakatsukasa:
Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint. Math. Program. 173(1-2): 79-116 (2019) - [j27]Hatem Ltaief, Dalal Sukkari, Aniello Esposito, Yuji Nakatsukasa, David E. Keyes:
Massively Parallel Polar Decomposition on Distributed-memory Systems. ACM Trans. Parallel Comput. 6(1): 4:1-4:15 (2019) - [i8]Evan S. Gawlik, Yuji Nakatsukasa:
Approximating the pth Root by Composite Rational Functions. CoRR abs/1906.11326 (2019) - [i7]Paul J. Goulart, Yuji Nakatsukasa, Nikitas Rontsis:
Accuracy of approximate projection to the semidefinite cone. CoRR abs/1908.01606 (2019) - [i6]Yuji Nakatsukasa, Lloyd N. Trefethen:
An algorithm for real and complex rational minimax approximation. CoRR abs/1908.06001 (2019) - [i5]Nicolas Boullé, Vassilios Dallas, Yuji Nakatsukasa, D. Samaddar:
Classification of chaotic time series with deep learning. CoRR abs/1908.06848 (2019) - [i4]Damir Filipovic, Kathrin Glau, Yuji Nakatsukasa, Francesco Statti:
Weighted Monte Carlo with least squares and randomized extended Kaczmarz for option pricing. CoRR abs/1910.07241 (2019) - [i3]Pablo D. Brubeck, Yuji Nakatsukasa, Lloyd N. Trefethen:
Vandermonde with Arnoldi. CoRR abs/1911.09988 (2019) - 2018
- [j26]Shinji Ito, Yuji Nakatsukasa:
Stable polefinding and rational least-squares fitting via eigenvalues. Numerische Mathematik 139(3): 633-682 (2018) - [j25]Yuji Nakatsukasa, Leo Taslaman, Françoise Tisseur, Ion Zaballa:
Reduction of Matrix Polynomials to Simpler Forms. SIAM J. Matrix Anal. Appl. 39(1): 148-177 (2018) - [j24]Zhening Li, Yuji Nakatsukasa, Tasuku Soma, André Uschmajew:
On Orthogonal Tensors and Best Rank-One Approximation Ratio. SIAM J. Matrix Anal. Appl. 39(1): 400-425 (2018) - [j23]Evan S. Gawlik, Yuji Nakatsukasa, Brian D. Sutton:
A Backward Stable Algorithm for Computing the CS Decomposition via the Polar Decomposition. SIAM J. Matrix Anal. Appl. 39(3): 1448-1469 (2018) - [j22]Hadrien Montanelli, Yuji Nakatsukasa:
Fourth-Order Time-Stepping For Stiff PDEs On The Sphere. SIAM J. Sci. Comput. 40(1) (2018) - [j21]Yuji Nakatsukasa, Olivier Sète, Lloyd N. Trefethen:
The AAA Algorithm for Rational Approximation. SIAM J. Sci. Comput. 40(3) (2018) - [j20]Silviu-Ioan Filip, Yuji Nakatsukasa, Lloyd N. Trefethen, Bernhard Beckermann:
Rational Minimax Approximation via Adaptive Barycentric Representations. SIAM J. Sci. Comput. 40(4): A2427-A2455 (2018) - 2017
- [j19]Yuji Nakatsukasa, Tasuku Soma, André Uschmajew:
Finding a low-rank basis in a matrix subspace. Math. Program. 162(1-2): 325-361 (2017) - [j18]Satoru Adachi, Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda:
Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem. SIAM J. Optim. 27(1): 269-291 (2017) - [j17]Yuji Nakatsukasa, Vanni Noferini, Alex Townsend:
Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach. SIAM J. Matrix Anal. Appl. 38(1): 1-29 (2017) - [i2]Zhening Li, Yuji Nakatsukasa, Tasuku Soma, André Uschmajew:
On orthogonal tensors and best rank-one approximation ratio. CoRR abs/1707.02569 (2017) - 2016
- [j16]Yusaku Yamamoto, Yuji Nakatsukasa, Yuka Yanagisawa, Takeshi Fukaya:
Roundoff error analysis of the CholeskyQR2 algorithm in an oblique inner product. JSIAM Lett. 8: 5-8 (2016) - [j15]Yuji Nakatsukasa, Vanni Noferini:
On the stability of computing polynomial roots via confederate linearizations. Math. Comput. 85(301): 2391-2425 (2016) - [j14]Shinsaku Sakaue, Yuji Nakatsukasa, Akiko Takeda, Satoru Iwata:
Solving Generalized CDT Problems via Two-Parameter Eigenvalues. SIAM J. Optim. 26(3): 1669-1694 (2016) - [j13]Stefan Güttel, Yuji Nakatsukasa:
Scaled and Squared Subdiagonal Padé Approximation for the Matrix Exponential. SIAM J. Matrix Anal. Appl. 37(1): 145-170 (2016) - [j12]Yuji Nakatsukasa, Roland W. Freund:
Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions. SIAM Rev. 58(3): 461-493 (2016) - 2015
- [j11]Yuji Nakatsukasa, Vanni Noferini, Alex Townsend:
Computing the common zeros of two bivariate functions via Bézout resultants. Numerische Mathematik 129(1): 181-209 (2015) - [j10]Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda:
Computing the Signed Distance Between Overlapping Ellipsoids. SIAM J. Optim. 25(4): 2359-2384 (2015) - [i1]Yuji Nakatsukasa, Tasuku Soma, André Uschmajew:
Finding a low-rank basis in a matrix subspace. CoRR abs/1503.08601 (2015) - 2014
- [j9]Patrizio Neff, Yuji Nakatsukasa, Andreas Fischle:
A Logarithmic Minimization Property of the Unitary Polar Factor in the Spectral and Frobenius Norms. SIAM J. Matrix Anal. Appl. 35(3): 1132-1154 (2014) - [c2]Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda:
Global Optimization Methods for Extended Fisher Discriminant Analysis. AISTATS 2014: 411-419 - [c1]Takeshi Fukaya, Yuji Nakatsukasa, Yuka Yanagisawa, Yusaku Yamamoto:
CholeskyQR2: a simple and communication-avoiding algorithm for computing a tall-skinny QR factorization on a large-scale parallel system. ScalA@SC 2014: 31-38 - 2013
- [j8]Ren-Cang Li, Yuji Nakatsukasa, Ninoslav Truhar, Shufang Xu:
Erratum: Perturbation of Partitioned Hermitian Definite Generalized Eigenvalue Problems. SIAM J. Matrix Anal. Appl. 34(1): 280-281 (2013) - [j7]Yuji Nakatsukasa, Nicholas J. Higham:
Stable and Efficient Spectral Divide and Conquer Algorithms for the Symmetric Eigenvalue Decomposition and the SVD. SIAM J. Sci. Comput. 35(3) (2013) - 2012
- [j6]Yuji Nakatsukasa:
On the condition numbers of a multiple eigenvalue of a generalized eigenvalue problem. Numerische Mathematik 121(3): 531-544 (2012) - [j5]Yuji Nakatsukasa, Kensuke Aishima, Ichitaro Yamazaki:
dqds with Aggressive Early Deflation. SIAM J. Matrix Anal. Appl. 33(1): 22-51 (2012) - [j4]Yuji Nakatsukasa, Nicholas J. Higham:
Backward Stability of Iterations for Computing the Polar Decomposition. SIAM J. Matrix Anal. Appl. 33(2): 460-479 (2012) - 2011
- [j3]Yuji Nakatsukasa:
Gerschgorin's theorem for generalized eigenvalue problems in the Euclidean metric. Math. Comput. 80(276): 2127-2142 (2011) - [j2]Ren-Cang Li, Yuji Nakatsukasa, Ninoslav Truhar, Shufang Xu:
Perturbation of Partitioned Hermitian Definite Generalized Eigenvalue Problems. SIAM J. Matrix Anal. Appl. 32(2): 642-663 (2011) - 2010
- [j1]Yuji Nakatsukasa, Zhaojun Bai, François Gygi:
Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition. SIAM J. Matrix Anal. Appl. 31(5): 2700-2720 (2010)
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-11-08 21:32 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:
