The Complexity of Diagonalization (Q6060340): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A stable, polynomial-time algorithm for the eigenpair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian Regularization of the Pseudospectrum and Davies’ Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new similarity transformation method for eigenvalues and eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matrix Sign Function Method and the Computation of Invariant Subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Diagonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast linear algebra is stable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On condition numbers and the distance to the nearest ill-posed problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly Optimal Algorithms for Canonical Matrix Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing rational forms of integer matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the real Davies' conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the structure of the Jordan normal form of a matrix by symbolic computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for the discriminant of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the matrix eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5694789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039860 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:49, 3 August 2024

scientific article; zbMATH DE number 7760740
Language Label Description Also known as
English
The Complexity of Diagonalization
scientific article; zbMATH DE number 7760740

    Statements

    The Complexity of Diagonalization (English)
    0 references
    3 November 2023
    0 references

    Identifiers