Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Abhinav Bhardwaj

dblp:43/10932 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithms and data structures › numerical linear algebra
matrix perturbation theory
0.812024
Matrix Perturbation: Davis-Kahan in the Infinity Norm · SODA 2024
Algorithms and data structures
numerical linear algebra
0.812024
Matrix Perturbation: Davis-Kahan in the Infinity Norm · SODA 2024
Algorithms and data structures
spectral methods
0.812024
Matrix Perturbation: Davis-Kahan in the Infinity Norm · SODA 2024

Methods — techniques the papers use, named apart from their topics

perturbation analysis · 0.8
YearPublicationVenuePosition
2024 Matrix Perturbation: Davis-Kahan in the Infinity Norm
abstract
Perturbation theory is developed to analyze the impact of noise on data and has been an essential part of numerical analysis. Recently, it has played an important role in designing and analyzing matrix algorithms. One of the most useful tools in this subject, the Davis-Kahan sine theorem, provides an ℓ2 error bound on the perturbation of the leading singular vectors (and spaces).
Abhinav Bhardwaj, Van H. Vu
SODA1