Nonlinear embeddings: Applications to analysis, fractals and polynomial root finding

Vladimir García-Morales

Chaos, Solitons & Fractals, 2017, vol. 99, issue C, 312-324

Abstract: We introduce Bκ-embeddings, nonlinear mathematical structures that connect, through smooth paths parameterized by κ, a finite or denumerable set of objects at κ=0 (e.g. numbers, functions, vectors, coefficients of a generating function...) to their ordinary sum at κ → ∞. We show that Bκ-embeddings can be used to design nonlinear irreversible processes through this connection. A number of examples of increasing complexity are worked out to illustrate the possibilities uncovered by this concept. These include not only smooth functions but also fractals on the real line and on the complex plane. As an application, we use Bκ-embeddings to formulate a robust method for finding all roots of a univariate polynomial without factorizing or deflating the polynomial. We illustrate this method by finding all roots of a polynomial of 19th degree.

Keywords: Fractals; Partitions; Irreversibility; Superposition principle; Polynomial root finding (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S096007791730156X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:99:y:2017:i:c:p:312-324

DOI: 10.1016/j.chaos.2017.04.021

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().