| DC pole | Wartość | Język |
|---|
| dc.contributor.author | Gdawiec, Krzysztof | - |
| dc.contributor.author | Kotarski, Wiesław | - |
| dc.contributor.author | Lisowska, Agnieszka | - |
| dc.date.accessioned | 2021-06-14T09:37:39Z | - |
| dc.date.available | 2021-06-14T09:37:39Z | - |
| dc.date.issued | 2021 | - |
| dc.identifier.citation | "Lecture Notes in Computer Science" Vol. 12742 (2021), s. 330-337 | pl_PL |
| dc.identifier.isbn | 978-3-030-77960-3 | - |
| dc.identifier.isbn | 978-3-030-77961-0 | - |
| dc.identifier.uri | http://hdl.handle.net/20.500.12128/20401 | - |
| dc.description.abstract | In this paper, we propose an improvement of the Robust Newton's Method (RNM). The RNM is a generalisation of the known Newton's root finding method restricted to polynomials. Unfortunately, the RNM is slow. Thus, in this paper, we propose the acceleration of this method by replacing the standard Picard iteration in the RNM by the S-iteration. This leads to an essential acceleration of the modified method. We present the advantages of the proposed algorithm over the RNM using polynomiagraphs and some numerical measures. Moreover, we present its possible application to the generation of artistic patterns. | pl_PL |
| dc.language.iso | en | pl_PL |
| dc.rights | Uznanie autorstwa-Użycie niekomercyjne-Bez utworów zależnych 3.0 Polska | * |
| dc.subject | Robust Newton method | pl_PL |
| dc.subject | S-iteration | pl_PL |
| dc.subject | Polynomiography | pl_PL |
| dc.title | Acceleration of the Robust Newton Method by the use of the S-iteration | pl_PL |
| dc.type | info:eu-repo/semantics/article | pl_PL |
| dc.identifier.doi | 10.1007/978-3-030-77961-0_28 | - |
| Pojawia się w kolekcji: | Artykuły (WNŚiT)
|