Root-squaring with DPR1 matrices (Q2452939)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Root-squaring with DPR1 matrices	scientific article

Statements

scholarly article

0 references

Root-squaring with DPR1 matrices (English)

0 references

Journal of Mathematical Sciences (New York)

0 references

publication date

6 June 2014

0 references

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10958-010-9993-y

0 references

Inverse power and Durand-Kerner iterations for univariate polynomial root-finding

0 references

Improved initialization of the accelerated and robust QR-like polynomial root-finding

0 references

Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations

0 references

An iterated eigenvalue algorithm for approximating roots of univariate polynomials

0 references

Dandelin, Lobacevskii, or Graeffe

0 references

0 references

Polynomial zerofinding iterative matrix algorithms

0 references

A composite polynomial zerofinding matrix algorithm

0 references

0 references

Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding

0 references

The amended DSeSC power method for polynomial root-finding

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10958-010-9993-y

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2452939

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2452939&oldid=35392009"