Copertina

Computing submatrices of the Hermite normal form of a structured polynomial matrix

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Berthomieu, Jérémy, Neiger, Vincent, Passe, Hugo
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Symbolic Computation
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Computing Krylov iterates in the time of matrix multiplication
di: Neiger, Vincent, et al.
Pubblicazione: (2024)

Matrices with displacement structure: a deterministic approach for linear systems and nullspace bases
di: Khichane, Sara, et al.
Pubblicazione: (2026)

Computing Generic Fibers of Polynomial Ideals with FGLM and Hensel Lifting
di: Berthomieu, Jérémy, et al.
Pubblicazione: (2024)

Faster List Decoding of AG Codes
di: Beelen, Peter, et al.
Pubblicazione: (2023)

Extracting Linear Relations from Gröbner Bases for Formal Verification of And-Inverter Graphs
di: Kaufmann, Daniela, et al.
Pubblicazione: (2024)

Faster modular composition using two relation matrices
di: Neiger, Vincent, et al.
Pubblicazione: (2026)

Computing points in connected components defined by a real inequation: algorithms, complexity and implementations, Part I
di: Berthomieu, Jérémy, et al.
Pubblicazione: (2026)

A complexity analysis of the F4 Gröbner basis algorithm with tracer data
di: Kouba, Robin, et al.
Pubblicazione: (2026)

Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations
di: Gopalakrishnan, Sriram, et al.
Pubblicazione: (2024)

Computing greatest common divisor of several parametric univariate polynomials via generalized subresultant polynomials
di: Hong, Hoon, et al.
Pubblicazione: (2023)

On the equivalence problem of Smith forms for multivariate polynomial matrices
di: Lu, Dong, et al.
Pubblicazione: (2024)

Probably faster multiplication of sparse polynomials
di: van der Hoeven, Joris
Pubblicazione: (2025)

On the computation of Gröbner bases for matrix-weighted homogeneous systems
di: Verron, Thibaut
Pubblicazione: (2022)

Solving parametric polynomial systems using Generic Rational Univariate Representation
di: Corniquel, Florent
Pubblicazione: (2026)

Algorithmic reduction of polynomially nonlinear PDE systems to parametric ODE systems
di: Deng, Siyuan, et al.
Pubblicazione: (2024)

How to generate all possible rational Wilf-Zeilberger forms?
di: Chen, Shaoshi, et al.
Pubblicazione: (2024)

Computing Euler products and coefficients of classical modular forms for twisted L-functions
di: Molin, Pascal
Pubblicazione: (2025)

Computing a holonomic submodule of the partial Weyl closure
di: Brochet, Hadrien
Pubblicazione: (2026)

Computational Explorations on Semifields
di: Dumas, Jean-Guillaume, et al.
Pubblicazione: (2026)

Fast interpolation and multiplication of unbalanced polynomials
di: Giorgi, Pascal, et al.
Pubblicazione: (2024)

Fast polynomial computations with space constraints
di: Grenet, Bruno
Pubblicazione: (2025)

Matrix equivalence to Smith normal form: new theoretical results for multivariate polynomial matrices
di: Lu, Dong, et al.
Pubblicazione: (2026)

Software Portability for Computer Algebra
di: Norman, Arthur C., et al.
Pubblicazione: (2025)

On the Computation of Newton Polytopes of Eliminants
di: Mohr, Rafael, et al.
Pubblicazione: (2025)

An Algorithm for Computing the Leading Monomials of a Minimal Groebner Basis of Generic Sequences
di: Sakata, Kosuke, et al.
Pubblicazione: (2025)

Computing bases in Hermite normal form of lattices of integer relations
di: Labahn, George, et al.
Pubblicazione: (2026)

Factoring sparse polynomials fast
di: Demin, Alexander, et al.
Pubblicazione: (2023)

Modular composition & polynomial GCD in the border of small, shallow circuits
di: Andrews, Robert, et al.
Pubblicazione: (2025)

Two Algorithms for Computing Rational Univariate Representations of Zero-Dimensional Ideals with Parameters
di: Wang, Dingkang, et al.
Pubblicazione: (2024)

Fast interpolation of sparse multivariate polynomials
di: van der Hoeven, Joris, et al.
Pubblicazione: (2023)

Solving generic parametric linear matrix inequalities
di: Naldi, Simone, et al.
Pubblicazione: (2025)

Geometry of the signed support of a multivariate polynomial and Descartes' rule of signs
di: Telek, Máté L.
Pubblicazione: (2023)

Botfip-LLM: An Enhanced Multimodal Scientific Computing Framework Leveraging Knowledge Distillation from Large Language Models
di: Chen, Tianhao, et al.
Pubblicazione: (2024)

Certificates for nonnegativity of multivariate integer polynomials under perturbations
di: Bender, Matías R, et al.
Pubblicazione: (2025)

Algorithms for computing norms and characteristic polynomials on general Drinfeld modules
di: Caruso, Xavier, et al.
Pubblicazione: (2023)

Towards automated generation of fast and accurate algorithms for recursive matrix multiplication
di: Dumas, Jean-Guillaume, et al.
Pubblicazione: (2025)

Green Computing: The Ultimate Carbon Destroyer for a Sustainable Future
di: Amiri, Sayed Mahbub Hasan, et al.
Pubblicazione: (2025)

Indicial polynomials and $b$-functions of $D$-modules along arbitrary varieties and their computation
di: Oaku, Toshinori
Pubblicazione: (2026)

Conditions for eigenvalue configurations of two real symmetric matrices (symmetric polynomial approach)
di: Hong, Hoon, et al.
Pubblicazione: (2023)

Computing braids from approximate data
di: Guillemot, Alexandre, et al.
Pubblicazione: (2026)