A New Initial Approximation Bound in the Durand Kerner Algorithm for Finding Polynomial Zeros

Documenti analoghi

• A square root algorithm faster than Newton's method for multiprecision numbers, using floating-point arithmetic
  di: Romano, Fabio
  Pubblicazione: (2024)
• Permutation-Avoiding FFT-Based Convolution
  di: Venkovic, Nicolas, et al.
  Pubblicazione: (2025)
• Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
  di: Shao, Xuancheng, et al.
  Pubblicazione: (2007)
• Stability of the Lanczos Method for Matrix Function Approximation
  di: Musco, Cameron, et al.
  Pubblicazione: (2017)
• Sublinear Time Low-Rank Approximation of Hankel Matrices
  di: Kapralov, Michael, et al.
  Pubblicazione: (2025)