Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The GPGCD algorithm with the Bézout matrix

From MaRDI portal
Publication:2110214
Jump to:navigation, search

DOI10.1007/978-3-030-60026-6_10OpenAlexW3097791144MaRDI QIDQ2110214

Boming Chi, Akira Terui

Publication date: 21 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-60026-6_10


zbMATH Keywords

Bézout matrixmodified Newton methodapproximate GCDGPGCD algorithm


Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)


Related Items (2)

Relaxed NewtonSLRA for approximate GCD ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials






This page was built for publication: The GPGCD algorithm with the Bézout matrix

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2110214&oldid=14608386"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 22:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki