Copertina

Matrices with displacement structure: a deterministic approach for linear systems and nullspace bases

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Khichane, Sara, Neiger, Vincent
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Symbolic Computation Computational Complexity
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Computing submatrices of the Hermite normal form of a structured polynomial matrix
di: Berthomieu, Jérémy, et al.
Pubblicazione: (2026)

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

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

Hilbert's Nullstellensatz is in the Counting Hierarchy
di: Andrews, Robert, et al.
Pubblicazione: (2026)

Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals
di: Garg, Abhibhav, et al.
Pubblicazione: (2025)

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

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

Constant-Depth Arithmetic Circuits for Linear Algebra Problems
di: Andrews, Robert, et al.
Pubblicazione: (2024)

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

Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields
di: Dwivedi, Ashish, et al.
Pubblicazione: (2024)

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

Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides
di: Bournez, Olivier, et al.
Pubblicazione: (2026)

Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings
di: Vu, Thi Xuan
Pubblicazione: (2025)

A New Bound on Cofactors of Sparse Polynomials
di: Nahshon, Ido, et al.
Pubblicazione: (2023)

On the complexity of Chow and Hurwitz forms
di: Doğan, Mahmut Levent, et al.
Pubblicazione: (2022)

A quasi-optimal lower bound for skew polynomial multiplication
di: Chen, Qiyuan, et al.
Pubblicazione: (2024)

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)

Quantifier Elimination Meets Treewidth
di: Wu, Hao, et al.
Pubblicazione: (2026)

Identity Testing for Radical Expressions
di: Balaji, Nikhil, et al.
Pubblicazione: (2022)

Runtime Repeated Recursion Unfolding in CHR: A Just-In-Time Online Program Optimization Strategy That Can Achieve Super-Linear Speedup
di: Fruehwirth, Thom
Pubblicazione: (2023)

A Complexity Map of Probabilistic Reasoning for Neurosymbolic Classification Techniques
di: Ledaguenel, Arthur, et al.
Pubblicazione: (2024)

Trinomials and Deterministic Complexity Limits for Real Solving
di: Boniface, Emma, et al.
Pubblicazione: (2022)

A Faster Solution to Smale's 17th Problem I: Real Binomial Systems
di: Paouris, Grigoris, et al.
Pubblicazione: (2019)

Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems
di: Yamakami, Tomoyuki
Pubblicazione: (2024)

The Scaling Properties of Implicit Deductive Reasoning in Transformers
di: Vompa, Enrico, et al.
Pubblicazione: (2026)

Extrapolating Solution Paths of Polynomial Homotopies towards Singularities with PHCpack and phcpy
di: Verschelde, Jan, et al.
Pubblicazione: (2024)

Algorithms for Recursive Block Matrices
di: Watt, Stephen M.
Pubblicazione: (2024)

A unified approach for degree bound estimates of linear differential operators
di: Gaillard, Louis
Pubblicazione: (2025)

Deciding One to One property of Boolean maps: Condition and algorithm in terms of implicants
di: Sule, Virendra
Pubblicazione: (2023)

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

Degree bounds for linear differential equations and recurrences
di: Gaillard, Louis
Pubblicazione: (2026)

Integer multiplication is at least as hard as matrix transposition
di: Harvey, David, et al.
Pubblicazione: (2025)

Connection Matrices in Macaulay2
di: Görlach, Paul, et al.
Pubblicazione: (2025)

Strided Difference Bound Matrices
di: Pitchanathan, Arjun, et al.
Pubblicazione: (2024)

On the dimension of the solution space of linear difference equations over the ring of infinite sequences
di: Abramov, Sergei, et al.
Pubblicazione: (2023)

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

Structural Preprocessing Method for Nonlinear Differential-Algebraic Equations Using Linear Symbolic Matrices
di: Oki, Taihei, et al.
Pubblicazione: (2024)

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

A Rank 23 Algorithm for Multiplying 3 x 3 Matrices with an Arithmetic Complexity of 59
di: Mårtensson, Erik, et al.
Pubblicazione: (2025)