Fast algorithms for the characteristic polynomial
From MaRDI portal
Publication:1058849
DOI10.1016/0304-3975(85)90049-0zbMath0565.68041OpenAlexW149384130MaRDI QIDQ1058849
Publication date: 1985
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(85)90049-0
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items (43)
Reflections on termination of linear loops ⋮ Fast computation of the rank profile matrix and the generalized Bruhat decomposition ⋮ Computing minimal interpolation bases ⋮ On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems ⋮ Efficient Computation of the Characteristic Polynomial of a Threshold Graph ⋮ Dynamic matrix rank ⋮ Algebraic complexity of computing polynomial zeros ⋮ The complexity of error-correcting codes ⋮ Interlacing families. III: Sharper restricted invertibility estimates ⋮ Sequential and parallel complexity of approximate evaluation of polynomial zeros ⋮ ALGORITHMS TO IDENTIFY ABUNDANTp-SINGULAR ELEMENTS IN FINITE CLASSICAL GROUPS ⋮ Complexity of parallel matrix computations ⋮ RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS ⋮ Unnamed Item ⋮ Skew-polynomial-sparse matrix multiplication ⋮ Graph homomorphisms via vector colorings ⋮ Improvements to the deformation method for counting points on smooth projective hypersurfaces ⋮ Computing syzygies in finite dimension using fast linear algebra ⋮ High-order lifting for polynomial Sylvester matrices ⋮ Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond ⋮ Rank-profile revealing Gaussian elimination and the CUP matrix decomposition ⋮ Growth Functions and Automatic Groups ⋮ Computational complexity of \(k\)-block conjugacy ⋮ Efficient decomposition of separable algebras. ⋮ Deterministic computation of the characteristic polynomial in the time of matrix multiplication ⋮ Efficient computation of the characteristic polynomial of a threshold graph ⋮ Computational schemes for two exponential servers where the first has a finite buffer ⋮ Some computational problems in linear algebra as hard as matrix multiplication ⋮ Efficient computation of the characteristic polynomial of a tree and related tasks ⋮ A deterministic algorithm for inverting a polynomial matrix ⋮ Parametrization of Newton's iteration for computations with structured matrices and applications ⋮ Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation ⋮ Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\) ⋮ Construction of the irreducible modular representations of a finite group ⋮ Block-Krylov techniques in the context of sparse-FGLM algorithms ⋮ Constructive recognition of classical groups in odd characteristic. ⋮ Determinisability of unary weighted automata over the rational numbers ⋮ Computing Minimal Polynomials of Matrices ⋮ Subset selection for matrices with fixed blocks ⋮ Guessing Gröbner bases of structured ideals of relations of sequences ⋮ Construction of the Jordan decomposition by means of Newton's method ⋮ Unnamed Item ⋮ A Complete Implementation for Computing General Dimensional Convex Hulls
Cites Work
This page was built for publication: Fast algorithms for the characteristic polynomial
