Opened 9 years ago

Closed 9 years ago

#534 closed proposed feature (wontfix)

Implementation of the "Sums of Powers Algorithm" for the efficient and reliable approximation of all polynomial roots as an alternative to the kernel function "laguerre"

Reported by: Herbert Möller <herbert.moeller@…> Owned by: somebody
Priority: major Milestone: 3-2-0 and higher
Component: singular-kernel Version: 3-1-6
Keywords: SPA Cc:

Description

The Sums of Powers Algorithm (SPA) is the only efficient and reliable algorithm for the approximation of all polynomial roots. It was first published in my book ''Algorithmische Lineare Algebra'', Verlag Vieweg, Wiesbaden 1997. The article ''

Attachments (1)

moeller_end.pdf (166.6 KB) - added by Herbert Möller <herbert.moeller@…> 9 years ago.
Actual version of the Sums of Powers Algorithm

Download all attachments as: .zip

Change History (3)

Changed 9 years ago by Herbert Möller <herbert.moeller@…>

Attachment: moeller_end.pdf added

Actual version of the Sums of Powers Algorithm

comment:1 Changed 9 years ago by Herbert Möller <herbert.moeller@…>

The Sums of Powers Algorithm (SPA) is the only efficient and reliable algorithm for the approximation of all polynomial roots. It was first published in my book "Algorithmische Lineare Algebra", Verlag Vieweg, Wiesbaden 1997. The article "An Efficient and Reliable Algorithm for the Approximation of all Polynomial Roots Based on the Method of D. Bernoulli" in the journals Sovremennye Problemy Matematiki, 2012, Vol. 16, pp. 52-65, and Proceedings of the Steklov Institute of Mathematics, 2013, Vol. 280, Suppl. 2, pp. S43-S55, contains an actual version of the SPA. Moreover a Maple program and its documentation "Visualization of the First Stage of the SPA" are available in the website "Mathkompass". Since the beginning of an URL is blacklisted, the URLs can't be given here.

comment:2 Changed 9 years ago by ren

Resolution: wontfix
Status: newclosed
Note: See TracTickets for help on using tickets.