Computing the characteristic polynomial of generic Toeplitz-like and Hankel-like matrices
From MaRDI portal
Publication:6666544
DOI10.1145/3452143.3465542MaRDI QIDQ6666544
Clément Pernet, Pierre Karpman, Gilles Villard, [[Person:6081971|Author name not available (Why is that?)]]
Publication date: 20 January 2025
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A general module theoretic framework for vector M-Padé and matrix rational interpolation
- Algebraic methods for Toeplitz-like matrices and operators
- Parallel algorithms for matrix normal forms
- Solving structured linear systems with large displacement rank
- Fast inversion algorithms of Toeplitz-plus-Hankel matrices
- Displacement ranks of matrices and linear equations
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- On the complexity of computing determinants
- High-order lifting and integrality certification
- Fast computation of approximant bases in canonical form
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- On the matrix berlekamp-massey algorithm
- Powers of tensors and fast matrix multiplication
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- New Fast Algorithms for Toeplitz-Plus-Hankel Matrices
- On Computing the Resultant of Generic Bivariate Polynomials
- On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms
This page was built for publication: Computing the characteristic polynomial of generic Toeplitz-like and Hankel-like matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666544)
