Yuji Nakatsukasa

Orcid: 0000-0001-7911-1501

According to our database1, Yuji Nakatsukasa authored at least 73 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Speeding Up Krylov Subspace Methods for Computing \(\boldsymbol{{f}(A){b}}\) via Randomization.
SIAM J. Matrix Anal. Appl., March, 2024

AAA Rational Approximation on a Continuum.
SIAM J. Sci. Comput., 2024

2023
Randomized Low-Rank Approximation for Symmetric Indefinite Matrices.
SIAM J. Matrix Anal. Appl., September, 2023

A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices.
SIAM J. Matrix Anal. Appl., September, 2023

The first five years of the AAA algorithm.
CoRR, 2023

RTSMS: Randomized Tucker with single-mode sketching.
CoRR, 2023

Approximating Sparse Matrices and their Functions using Matrix-vector products.
CoRR, 2023

AAA rational approximation on a continuum.
CoRR, 2023

Are sketch-and-precondition least squares solvers numerically stable?
CoRR, 2023

Convergence and Near-optimal Sampling for Multivariate Function Approximations in Irregular Domains via Vandermonde with Arnoldi.
CoRR, 2023

High-Performance SVD Partial Spectrum Computation.
Proceedings of the International Conference for High Performance Computing, 2023

2022
Least-Squares Spectral Methods for ODE Eigenvalue Problems.
SIAM J. Sci. Comput., October, 2022

A Theory of Quantum Subspace Diagonalization.
SIAM J. Matrix Anal. Appl., September, 2022

Twice Is Enough for Dangerous Eigenvalues.
SIAM J. Matrix Anal. Appl., 2022

Stable and Efficient Computation of Generalized Polar Decompositions.
SIAM J. Matrix Anal. Appl., 2022

An active-set algorithm for norm constrained quadratic problems.
Math. Program., 2022

Efficient Semidefinite Programming with Approximate ADMM.
J. Optim. Theory Appl., 2022

Speeding up Krylov subspace methods for computing f(A)b via randomization.
CoRR, 2022

Efficient Bounds and Estimates for Canonical Angles in Randomized Subspace Approximations.
CoRR, 2022

A Fast Randomized Algorithm for computing the Null Space.
CoRR, 2022

Randomized algorithms for Tikhonov regularization in linear least squares.
CoRR, 2022

Stochastic diagonal estimation: probabilistic bounds and an improved algorithm.
CoRR, 2022

Rectangular eigenvalue problems.
Adv. Comput. Math., 2022

2021
Vandermonde with Arnoldi.
SIAM Rev., 2021

Reciprocal-Log Approximation and Planar PDE Solvers.
SIAM J. Numer. Anal., 2021

Error Localization of Best L<sub>1</sub> Polynomial Approximants.
SIAM J. Numer. Anal., 2021

Exponential node clustering at singularities for rational approximation, quadrature, and PDEs.
Numerische Mathematik, 2021

Approximating the pth root by composite rational functions.
J. Approx. Theory, 2021

Fast & Accurate Randomized Algorithms for Linear Systems and Eigenvalue Problems.
CoRR, 2021

Full operator preconditioning and the accuracy of solving linear systems.
CoRR, 2021

Fast randomized numerical rank estimation.
CoRR, 2021

High-Performance Partial Spectrum Computation for Symmetric eigenvalue problems and the SVD.
CoRR, 2021

2020
Fast Graph Sampling Set Selection Using Gershgorin Disc Alignment.
IEEE Trans. Signal Process., 2020

An Algorithm for Real and Complex Rational Minimax Approximation.
SIAM J. Sci. Comput., 2020

Shifted Cholesky QR for Computing the QR Factorization of Ill-Conditioned Matrices.
SIAM J. Sci. Comput., 2020

Sharp error bounds for Ritz vectors and approximate singular vectors.
Math. Comput., 2020

Zolotarev's fifth and sixth problems.
CoRR, 2020

Fast and stable randomized low-rank matrix approximation.
CoRR, 2020

Solving two-parameter eigenvalue problems using an alternating method.
CoRR, 2020

Rational neural networks.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Massively Parallel Polar Decomposition on Distributed-memory Systems.
ACM Trans. Parallel Comput., 2019

Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint.
Math. Program., 2019

Weighted Monte Carlo with least squares and randomized extended Kaczmarz for option pricing.
CoRR, 2019

Classification of chaotic time series with deep learning.
CoRR, 2019

Accuracy of approximate projection to the semidefinite cone.
CoRR, 2019

2018
The AAA Algorithm for Rational Approximation.
SIAM J. Sci. Comput., 2018

Fourth-Order Time-Stepping For Stiff PDEs On The Sphere.
SIAM J. Sci. Comput., 2018

Rational Minimax Approximation via Adaptive Barycentric Representations.
SIAM J. Sci. Comput., 2018

Reduction of Matrix Polynomials to Simpler Forms.
SIAM J. Matrix Anal. Appl., 2018

On Orthogonal Tensors and Best Rank-One Approximation Ratio.
SIAM J. Matrix Anal. Appl., 2018

A Backward Stable Algorithm for Computing the CS Decomposition via the Polar Decomposition.
SIAM J. Matrix Anal. Appl., 2018

Stable polefinding and rational least-squares fitting via eigenvalues.
Numerische Mathematik, 2018

2017
Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach.
SIAM J. Matrix Anal. Appl., 2017

Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem.
SIAM J. Optim., 2017

Finding a low-rank basis in a matrix subspace.
Math. Program., 2017

2016
Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions.
SIAM Rev., 2016

Scaled and Squared Subdiagonal Padé Approximation for the Matrix Exponential.
SIAM J. Matrix Anal. Appl., 2016

Solving Generalized CDT Problems via Two-Parameter Eigenvalues.
SIAM J. Optim., 2016

On the stability of computing polynomial roots via confederate linearizations.
Math. Comput., 2016

Roundoff error analysis of the CholeskyQR2 algorithm in an oblique inner product.
JSIAM Lett., 2016

2015
Computing the Signed Distance Between Overlapping Ellipsoids.
SIAM J. Optim., 2015

Computing the common zeros of two bivariate functions via Bézout resultants.
Numerische Mathematik, 2015

2014
A Logarithmic Minimization Property of the Unitary Polar Factor in the Spectral and Frobenius Norms.
SIAM J. Matrix Anal. Appl., 2014

CholeskyQR2: a simple and communication-avoiding algorithm for computing a tall-skinny QR factorization on a large-scale parallel system.
Proceedings of the 5th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems, 2014

Global Optimization Methods for Extended Fisher Discriminant Analysis.
Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, 2014

2013
Stable and Efficient Spectral Divide and Conquer Algorithms for the Symmetric Eigenvalue Decomposition and the SVD.
SIAM J. Sci. Comput., 2013

Erratum: Perturbation of Partitioned Hermitian Definite Generalized Eigenvalue Problems.
SIAM J. Matrix Anal. Appl., 2013

2012
Backward Stability of Iterations for Computing the Polar Decomposition.
SIAM J. Matrix Anal. Appl., 2012

dqds with Aggressive Early Deflation.
SIAM J. Matrix Anal. Appl., 2012

On the condition numbers of a multiple eigenvalue of a generalized eigenvalue problem.
Numerische Mathematik, 2012

2011
Perturbation of Partitioned Hermitian Definite Generalized Eigenvalue Problems.
SIAM J. Matrix Anal. Appl., 2011

Gerschgorin's theorem for generalized eigenvalue problems in the Euclidean metric.
Math. Comput., 2011

2010
Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition.
SIAM J. Matrix Anal. Appl., 2010


  Loading...