# 0.5 Sampling with automatic gain control  (Page 12/19)

 Page 12 / 19

To apply steepest descent to the minimization of the polynomial $J\left(x\right)$ in [link] , suppose that a current estimate of $x$ is available at time $k$ , which is denoted $x\left[k\right]$ . A new estimate of $x$ at time $k+1$ can be made using

$x\left[k+1\right]=x\left[k\right]-\mu {\left(\frac{dJ\left(x\right)}{dx}|}_{x=x\left[k\right]},$

where $\mu$ is a small positive number called the stepsize, and where the gradient (derivative) of $J\left(x\right)$ is evaluated at the current point $x\left[k\right]$ . This is then repeated again and again as $k$ increments. This procedure isshown in [link] . When the current estimate $x\left[k\right]$ is to the right of the minimum, the negative of the gradient points left. When the current estimate is to the left of the minimum, thenegative gradient points to the right. In either case, as long as the stepsize is suitably small, the newestimate $x\left[k+1\right]$ is closer to the minimum than the old estimate $x\left[k\right]$ ; that is, $J\left(x\left[k+1\right]\right)$ is less than $J\left(x\left[k\right]\right)$ . Steepest descent finds the minimum of a function by always pointing in the direction that leads downhill.

To make this explicit, the iteration defined by [link] is

$x\left[k+1\right]=x\left[k\right]-\mu \left(2x\left[k\right]-4\right),$

or, rearranging,

$x\left[k+1\right]=\left(1-2\mu \right)x\left[k\right]+4\mu .$

In principle, if [link] is iterated over and over, the sequence $x\left[k\right]$ should approach the minimum value $x=2$ . Does this actually happen?

There are two ways to answer this question. It is straightforward to simulate the process. Here is some M atlab code that takes an initial estimate of $x$ called x(1) and iterates [link] for N=500 steps.

N=500;                          % number of iterations mu=.01;                         % algorithm stepsizex=zeros(1,N);                   % initialize x to zero x(1)=3;                         % starting point x(1)for k=1:N-1   x(k+1)=(1-2*mu)*x(k)+4*mu;    % update equationend polyconverge.m find the minimum of $J\left(x\right)={x}^{2}-4x+4$ via steepest descent (download file) 

[link] shows the output of polyconverge.m for 50 different x(1) starting values superimposed; all converge smoothly to the minimum at $x=2$ . The program polyconverge.m attempts to locate the smallestvalue of J ( x ) = x 2 - 4 x + 4 by descending the gradient. Fifty different starting values all converge to thesame minimum at x = 2 .

Explore the behavior of steepest descent by running polyconverge.m with different parameters.

1. Try mu = -.01, 0, .0001, .02, .03, .05, 1.0, 10.0. Can mu be too large or too small?
2. Try N= 5, 40, 100, 5000. Can N be too large or too small?
3. Try a variety of values of x(1) . Can x(1) be too large or too small?

As an alternative to simulation, observe that the process [link] is itself a linear time invariant system, of the general form

$x\left[k+1\right]=ax\left[k\right]+b,$

which is stable as long as $|a|<1$ . For a constant input, the final value theorem of z-Transforms (see [link] ) can be used to show that the asymptotic (convergent)output value is ${lim}_{k\to \infty }{x}_{k}=\frac{b}{1-a}$ . To see this withoutreference to arcane theory, observe that if ${x}_{k}$ is to converge, then it must converge to some value, say ${x}^{*}$ . At convergence, $x\left[k+1\right]=x\left[k\right]={x}^{*}$ , and so [link] implies that ${x}^{*}=a{x}^{*}+b$ , which implies that ${x}^{*}=\frac{b}{1-a}$ . (This holds assuming $|a|<1$ .) For example, for [link] , ${x}^{*}=\frac{4\mu }{1-\left(1-2\mu \right)}=2$ , which is indeed the minimum.

Thus, both simulation and analysis suggest that the iteration [link] is a viable way to find the minimum of the function $J\left(x\right)$ , as long as $\mu$ is suitably small. As will become clearer in later sections, suchsolutions to optimization problems are almost always possible—as long as the function $J\left(x\right)$ is differentiable. Similarly, it is usually quite straightforward to simulate thealgorithm to examine its behavior in specific cases, though it is not always so easy to carry out a theoretical analysis.

#### Questions & Answers

how can chip be made from sand
Eke Reply
is this allso about nanoscale material
Almas
are nano particles real
Missy Reply
yeah
Joseph
Hello, if I study Physics teacher in bachelor, can I study Nanotechnology in master?
Lale Reply
no can't
Lohitha
where is the latest information on a no technology how can I find it
William
currently
William
where we get a research paper on Nano chemistry....?
Maira Reply
nanopartical of organic/inorganic / physical chemistry , pdf / thesis / review
Ali
what are the products of Nano chemistry?
Maira Reply
There are lots of products of nano chemistry... Like nano coatings.....carbon fiber.. And lots of others..
learn
Even nanotechnology is pretty much all about chemistry... Its the chemistry on quantum or atomic level
learn
Google
da
no nanotechnology is also a part of physics and maths it requires angle formulas and some pressure regarding concepts
Bhagvanji
hey
Giriraj
Preparation and Applications of Nanomaterial for Drug Delivery
Hafiz Reply
revolt
da
Application of nanotechnology in medicine
has a lot of application modern world
Kamaluddeen
yes
narayan
what is variations in raman spectra for nanomaterials
Jyoti Reply
ya I also want to know the raman spectra
Bhagvanji
I only see partial conversation and what's the question here!
Crow Reply
what about nanotechnology for water purification
RAW Reply
please someone correct me if I'm wrong but I think one can use nanoparticles, specially silver nanoparticles for water treatment.
Damian
yes that's correct
Professor
I think
Professor
Nasa has use it in the 60's, copper as water purification in the moon travel.
Alexandre
nanocopper obvius
Alexandre
what is the stm
Brian Reply
is there industrial application of fullrenes. What is the method to prepare fullrene on large scale.?
Rafiq
industrial application...? mmm I think on the medical side as drug carrier, but you should go deeper on your research, I may be wrong
Damian
How we are making nano material?
LITNING Reply
what is a peer
LITNING Reply
What is meant by 'nano scale'?
LITNING Reply
What is STMs full form?
LITNING
scanning tunneling microscope
Sahil
how nano science is used for hydrophobicity
Santosh
Do u think that Graphene and Fullrene fiber can be used to make Air Plane body structure the lightest and strongest. Rafiq
Rafiq
what is differents between GO and RGO?
Mahi
what is simplest way to understand the applications of nano robots used to detect the cancer affected cell of human body.? How this robot is carried to required site of body cell.? what will be the carrier material and how can be detected that correct delivery of drug is done Rafiq
Rafiq
if virus is killing to make ARTIFICIAL DNA OF GRAPHENE FOR KILLED THE VIRUS .THIS IS OUR ASSUMPTION
Anam
analytical skills graphene is prepared to kill any type viruses .
Anam
Any one who tell me about Preparation and application of Nanomaterial for drug Delivery
Hafiz
what is Nano technology ?
Bob Reply
write examples of Nano molecule?
Bob
The nanotechnology is as new science, to scale nanometric
brayan
nanotechnology is the study, desing, synthesis, manipulation and application of materials and functional systems through control of matter at nanoscale
Damian
Got questions? Join the online conversation and get instant answers!
Jobilize.com Reply

### Read also:

#### Get Jobilize Job Search Mobile App in your pocket Now!

Source:  OpenStax, Software receiver design. OpenStax CNX. Aug 13, 2013 Download for free at http://cnx.org/content/col11510/1.3
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Software receiver design' conversation and receive update notifications? By Brooke Delaney By Abby Sharp By Eddie Unverzagt By Stephen Voron By By Madison Christian By Nicole Duquette By Saylor Foundation By OpenStax By Megan Earhart