High-order lifting for polynomial Sylvester matrices
From MaRDI portal
Publication:6149161
DOI10.1016/j.jco.2023.101803OpenAlexW4289307959MaRDI QIDQ6149161
Gilles Villard, Clément Pernet, Unnamed Author
Publication date: 5 February 2024
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2023.101803
Algorithms in computer science (68Wxx) Numerical linear algebra (65Fxx) Basic linear algebra (15Axx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general module theoretic framework for vector M-Padé and matrix rational interpolation
- Algebraic methods for Toeplitz-like matrices and operators
- Fast algorithms for the characteristic polynomial
- Displacement ranks of matrices and linear equations
- Fast projection methods for minimal design problems in linear system theory
- Exact solution of linear equations using p-adic expansions
- On fast multiplication of polynomials over arbitrary algebras
- Subresultants revisited.
- On the complexity of the Lickteig-Roy subresultant algorithm
- On the complexity of computing determinants
- High-order lifting and integrality certification
- Fast computation of generic bivariate resultants
- Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
- Fast computation of approximant bases in canonical form
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- Fast computation of special resultants
- Modern Computer Algebra
- On the matrix berlekamp-massey algorithm
- A Fast Algorithm for Computing the Truncated Resultant
- Fast Polynomial Factorization and Modular Composition
- A generalization of the fast LUP matrix decomposition algorithm and applications
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- Accuracy and Stability of Numerical Algorithms
- On Computing the Resultant of Generic Bivariate Polynomials
- On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Algorithms in real algebraic geometry
- Elimination ideal and bivariate resultant over finite fields
