Copertina

A Basis-preserving Algorithm for Computing the Bezout Matrix of Newton Polynomials

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Yang, Jing, Yang, Wei
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Symbolic Computation Numerical Analysis
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Novel Algorithm for Representing Positive Semi-Definite Polynomials as Sums of Squares with Rational Coefficients
di: Zeng, Zhenbing, et al.
Pubblicazione: (2025)

Effective Quadratic Error Bounds for Floating-Point Algorithms Computing the Hypotenuse Function
di: Muller, Jean-Michel, et al.
Pubblicazione: (2024)

Computing Clipped Products
di: Norman, Arthur C., et al.
Pubblicazione: (2024)

Subresultants of Several Univariate Polynomials in Newton Basis
di: Wang, Weidong, et al.
Pubblicazione: (2022)

A Fast Algorithm for the Finite Expression Method in Learning Dynamics on Complex Networks
di: Song, Zezheng, et al.
Pubblicazione: (2024)

Sparse Tensors and Subdivision Methods for Finding the Zero Set of Polynomial Equations
di: Moroz, Guillaume
Pubblicazione: (2024)

Efficient Tensor Decomposition via Moment Matrix Extension
di: Shi, Bobby, et al.
Pubblicazione: (2025)

A Novel Approach to the Initial Value Problem with a complete validated algorithm
di: Zhang, Bingwei, et al.
Pubblicazione: (2025)

Validated numerics for algebraic path tracking
di: Guillemot, Alexandre, et al.
Pubblicazione: (2024)

Strassen's algorithm is not optimally accurate
di: Dumas, Jean-Guillaume, et al.
Pubblicazione: (2024)

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

Groebner basis structure of ideal interpolation
di: Gong, Yihe, et al.
Pubblicazione: (2020)

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

A Finite Expression Method for Solving High-Dimensional Committor Problems
di: Song, Zezheng, et al.
Pubblicazione: (2023)

On the Algorithmic Verification of Nonlinear Superposition for Systems of First Order Ordinary Differential Equations
di: Treumova, Veronika, et al.
Pubblicazione: (2024)

Discovering Polynomial and Quadratic Structure in Nonlinear Ordinary Differential Equations
di: Kramer, Boris, et al.
Pubblicazione: (2025)

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

Quadratization of Autonomous Partial Differential Equations: Theory and Algorithms
di: Olivieri, Albani, et al.
Pubblicazione: (2026)

Dissipative quadratizations of polynomial ODE systems
di: Cai, Yubo, et al.
Pubblicazione: (2023)

The complexity of class polynomial computation via floating point approximations
di: Enge, Andreas
Pubblicazione: (2006)

Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time
di: Pagès, Raphaël
Pubblicazione: (2021)

Satire: Computing Rigorous Bounds for Floating-Point Rounding Error in Mixed-Precision Loop-Free Programs
di: Tirpankar, Tanmay, et al.
Pubblicazione: (2025)

Performance Comparison of Function Evaluation Methods
di: Liberti, Leo
Pubblicazione: (2002)

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

An Algorithm for Discriminating the Complete Multiplicities of a Parametric Univariate Polynomial
di: Qin, Simin, et al.
Pubblicazione: (2024)

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

Two-step Newton's method for deflation-one singular zeros of analytic systems
di: Lee, Kisun, et al.
Pubblicazione: (2023)

Fast Symbolic Integer-Linear Spectra
di: Luntzel, Jonny, et al.
Pubblicazione: (2024)

Training Stiff Neural Ordinary Differential Equations with Explicit Exponential Integration Methods
di: Fronk, Colby, et al.
Pubblicazione: (2024)

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

A Generalization of Habicht's Theorem for Subresultants of Several Univariate Polynomials
di: Hong, Hoon, et al.
Pubblicazione: (2024)

Effective alpha theory certification using interval arithmetic: alpha theory over regions
di: Lee, Kisun
Pubblicazione: (2024)

Certified homotopy tracking using the Krawczyk method
di: Duff, Timothy, et al.
Pubblicazione: (2024)

Certified algebraic curve projections by path tracking
di: Burr, Michael, et al.
Pubblicazione: (2025)

Three Paths to Rational Curves with Rational Arc Length
di: Schröcker, Hans-Peter, et al.
Pubblicazione: (2023)

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

Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections
di: Eberly, Wayne, et al.
Pubblicazione: (2007)

PySymmetry: A Sage/Python Framework for the Symmetry Reduction of Linear G-Equivariant Systems
di: da Silva, Leon D., et al.
Pubblicazione: (2025)

Computational Algebra with Attention: Transformer Oracles for Border Basis Algorithms
di: Kera, Hiroshi, et al.
Pubblicazione: (2025)

Exact and Approximate Moment Derivation for Probabilistic Loops With Non-Polynomial Assignments
di: Kofnov, Andrey, et al.
Pubblicazione: (2023)