Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Polynomial factorization and the Q-D algorithm

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

DOI10.1016/0024-3795(68)90019-0zbMATH Open0274.65017OpenAlexW2062515807MaRDI QIDQ2265258FDOQ2265258


Authors: L. Fox, Linda J. Hayes Edit this on Wikidata


Publication date: 1968

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(68)90019-0





Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)


Cites Work

  • Title not available (Why is that?)
  • The evaluation of the zeros of ill-conditioned polynomials. I, II
  • BOUNDARY-VALUE TECHNIQUES FOR THE NUMERICAL SOLUTION OF INITIAL-VALUE PROBLEMS IN ORDINARY DIFFERENTIAL EQUATIONS
  • Title not available (Why is that?)
  • The evaluation of zeros of high-degree polynomials


Cited In (2)

  • Computations with infinite Toeplitz matrices and polynomials
  • An analysis of the method of L. Fox and L. Hayes for the factorization of a polynomial





This page was built for publication: Polynomial factorization and the Q-D algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2265258)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2265258&oldid=14820177"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 2 February 2024, at 09:17. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki