Domain coloring

Domain coloring
Domain coloring plot of the function
ƒ(x) =(x2 − 1)(x − 2 − i)2/(x2 + 2 + 2i). The hue represents the function argument, while the saturation represents the magnitude.

Domain coloring is a technique for visualizing functions of a complex variable. The term "domain coloring" was coined by Frank Farris [1] possibly around 1998. But the technique of using continuous color to map points from domain to codomain or image plane was used in 1999 by George Abdo and Paul Godfrey [2] and colored grids were used in graphics by Doug Arnold that he dates to 1997 [3].

Contents

Motivation

Insufficient dimensions

A real function f:\mathbb{R}\rightarrow{}\mathbb{R} (for example f(x) = x2) can be graphed using two Cartesian coordinates on a plane.

A graph of a complex function g:\mathbb{C}\rightarrow{}\mathbb{C} of one complex variable lives in a space with two complex dimensions. Since the complex plane itself is two dimensional, a graph of a complex function is an object in four real dimensions. That makes complex functions difficult to visualize in our three dimensional space. One way of depicting holomorphic functions is with a Riemann surface.

Visual encoding of complex numbers

Given a complex number z = reiθ, the phase (also known as argument) θ can be represented by a hue, and the modulus r = | z | is represented by either intensity or variations in intensity. The arrangement of hues is arbitrary, but often it follows the color wheel. Sometimes the phase is represented by a specific gradient rather than hue.

Unit circle domain coloring.png

Example

The following image depicts the sine function w = sin(z) from − 2π to on the real axis and − 1.5 to 1.5 on the imaginary axis.

Sine.png

See also

References

[1] [2] [3] http://www.ima.umn.edu/~arnold/complex.html

  1. ^ Hans Lundmark (2004). "Visualizing complex analytic functions using domain coloring". http://www.mai.liu.se/~halun/complex/domain_coloring-unicode.html. Retrieved 2006-05-25.  Ludmark refers to Farris' coining the term "domain coloring" in this 2004 article.
  2. ^ George Abdo & Paul Godfrey (1999). "Plotting functions of a complex variable: Table of Conformal Mappings Using Continuous Coloring". http://my.fit.edu/~gabdo/. Retrieved 2008-05-17. 
  3. ^ Douglas N. Arnold (2008). "Graphics for complex analysis". http://www.ima.umn.edu/~arnold/complex.html. Retrieved 2008-05-17. 

External links


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Domain — may refer to: General Territory (administrative division), a non sovereign geographic area which has come under the authority of another government Public domain, a body of works and knowledge without proprietary interest Eminent domain, the… …   Wikipedia

  • Conformal pictures — Here are examples of conformal maps understood as deforming pictures. This technique is a generalization of domain coloring where the domain space is not colored by a fixed infinite color wheel but by a finite picture tiling the plane. A… …   Wikipedia

  • List of mathematics articles (D) — NOTOC D D distribution D module D D Agostino s K squared test D Alembert Euler condition D Alembert operator D Alembert s formula D Alembert s paradox D Alembert s principle Dagger category Dagger compact category Dagger symmetric monoidal… …   Wikipedia

  • Complex number — A complex number can be visually represented as a pair of numbers forming a vector on a diagram called an Argand diagram, representing the complex plane. Re is the real axis, Im is the imaginary axis, and i is the square root of –1. A complex… …   Wikipedia

  • Sine — For other uses, see Sine (disambiguation). Sine Basic features Parity odd Domain ( ∞,∞) Codomain [ 1,1] P …   Wikipedia

  • KABBALAH — This entry is arranged according to the following outline: introduction general notes terms used for kabbalah the historical development of the kabbalah the early beginnings of mysticism and esotericism apocalyptic esotericism and merkabah… …   Encyclopedia of Judaism

  • Distributed constraint optimization — (DCOP or DisCOP) is the distributed analogue to constraint optimization. A DCOP is a problem in which a group of agents must distributedly choose values for a set of variables such that the cost of a set of constraints over the variables is… …   Wikipedia

  • Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… …   Wikipedia

  • List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

  • List of mathematics articles (F) — NOTOC F F₄ F algebra F coalgebra F distribution F divergence Fσ set F space F test F theory F. and M. Riesz theorem F1 Score Faà di Bruno s formula Face (geometry) Face configuration Face diagonal Facet (mathematics) Facetting… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”