Publication:2702027
From MaRDI portal
zbMath0976.65042MaRDI QIDQ2702027
Publication date: 8 January 2002
complexity; characteristic polynomial; sparse matrix; Frobenius normal form; matrix-vector multiplication
65F50: Computational methods for sparse matrices
65Y20: Complexity and performance of numerical algorithms
15A21: Canonical forms, reductions, classification
Related Items
Dynamic normal forms and dynamic characteristic polynomial, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., From additive flowers to additive automata networks, Automating algorithm selection: checking for matrix properties that can simplify computations