**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Concept# Iterated function

Summary

In mathematics, an iterated function is a function X → X (that is, a function from some set X to itself) which is obtained by composing another function f : X → X with itself a certain number of times. The process of repeatedly applying the same function is called iteration. In this process, starting from some initial object, the result of applying a given function is fed again in the function as input, and this process is repeated. For example on the image on the right:
:with the circle‑shaped symbol of function composition.
Iterated functions are objects of study in computer science, fractals, dynamical systems, mathematics and renormalization group physics.
Definition
The formal definition of an iterated function on a set X follows.
Let ''X'' be a set and f: X → X be a function.
Defining f n as the n-th iterate of ''f'' (a notation introduced by Hans Heinrich Bürmann

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications

Loading

Related people

Loading

Related units

Loading

Related concepts

Loading

Related courses

Loading

Related lectures

Loading

Related publications (3)

Related units

No results

Loading

Loading

Loading

Related people

No results

Related courses (5)

Related lectures (12)

MATH-456: Numerical analysis and computational mathematics

The course provides an introduction to scientific computing. Several numerical methods are presented for the computer solution of mathematical problems arising in different applications. The software MATLAB is used to solve the problems and verify the theoretical properties of the numerical methods.

MATH-251(c): Numerical analysis

Le cours présente des méthodes numériques pour la résolution de problèmes mathématiques comme des systèmes d'équations linéaires ou non linéaires, approximation de fonctions, intégration et dérivation, équations différentielles.

PHYS-403: Computer simulation of physical systems I

The two main topics covered by this course are classical molecular dynamics and the Monte Carlo method.

Related concepts (30)

, , ,

Nous présentons un modèle itératif inspiré du modèle CIFS (Controlled Iterative Function System) de PRUSINKIEWICZ [PH94] - encore appelé RIFS (Recurrent Iterative Function System) par BARNSLEY ou MRIFS (Mutually Recursive Iterative Function System) par CULIK [CD93] -. Le principe de ces modèles est de définir des familles de figures géométriques avec des règles de production et des systèmes d’équations. Dans cet article, nous en présentons deux généralisations, qui permettent de contrôler la géométrie et la topologie des formes produites.

2006Dynamical system

In mathematics, a dynamical system is a system in which a function describes the time dependence of a point in an ambient space, such as in a parametric curve. Examples include the mathematical mode

Function composition

In mathematics, function composition is an operation ∘ that takes two functions f and g, and produces a function h = g ∘ f such that h(x) = g(f(x)). In this operation, the function g is applied

Logistic map

The logistic map is a polynomial mapping (equivalently, recurrence relation) of degree 2, often referred to as an archetypal example of how complex, chaotic behaviour can arise from very simple

Volkan Cevher, Anastasios Kyrillidis, Quoc Tran Dinh

We propose an algorithmic framework for convex minimization problems of a composite function with two terms: a self-concordant function and a possibly nonsmooth regularization term. Our method is a new proximal Newton algorithm that features a local quadratic convergence rate. As a specific instance of our framework, we consider the sparse inverse covariance matrix estimation in graph learning problems. Via a careful dual formulation and a novel analytic step-size selection procedure, our approach for graph learning avoids Cholesky decompositions and matrix inversions in its iteration making it attractive for parallel and distributed implementations.

2013