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

Factorization of polynomials based on the multiplicities of their roots and applications

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

DOI10.1016/0898-1221(96)00174-5zbMath0865.65027OpenAlexW2037898649MaRDI QIDQ1352392

O. Diekmann

Publication date: 20 July 1997

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(96)00174-5


zbMATH Keywords

algorithmgreatest common divisordiscriminantssystem of polynomialsNewton's identitiesextraction methodfactorization based on multiplicitypolynomial of distinct roots


Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)


Related Items (1)

A direct algorithm for extracting a transfer function's multiple zeros or poles




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Introduction to vectors and tensors. Vol. 1: Linear and multilinear algebra. Vol. 2: Vector and tensor analysis
  • A direct algorithm for extracting a transfer function's multiple zeros or poles




This page was built for publication: Factorization of polynomials based on the multiplicities of their roots and applications

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