The Complexity of Diagonalization

DOI10.1145/3597066.3597145arXiv2305.10575MaRDI QIDQ6060340

No author found.

Publication date: 3 November 2023

Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.10575

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Determining the structure of the Jordan normal form of a matrix by symbolic computation
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• On condition numbers and the distance to the nearest ill-posed problem
• Geometric algorithms and combinatorial optimization.
• A stable, polynomial-time algorithm for the eigenpair problem
• A new similarity transformation method for eigenvalues and eigenvectors
• Computing rational forms of integer matrices
• On the real Davies' conjecture
• Fast linear algebra is stable
• An inequality for the discriminant of a polynomial
• The complexity of the matrix eigenproblem
• Approximate Diagonalization
• Smoothed analysis of algorithms
• The Matrix Sign Function Method and the Computation of Invariant Subspaces
• COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
• Nearly Optimal Algorithms for Canonical Matrix Forms
• Gaussian Regularization of the Pseudospectrum and Davies’ Conjecture

This page was built for publication: The Complexity of Diagonalization