List of moments of inertia: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
No edit summary
 
Moments of inertia: set vectors in bold
Line 1: Line 1:
Some consumers of laptop or computer are aware that their computer become slower or have certain errors after utilizing for a while. But most people don't know how to accelerate their computer and a few of them don't dare to work it. They always find several experts to keep the computer inside wise condition yet they have to spend some money on it. Actually, you are able to do it by yourself. There are many registry cleaner software which there are 1 of them online. Some of them are free plus we only have to download them. After installing it, this registry cleaner software can scan the registry. If it found these mistakes, it usually report we and you can delete them to keep the registry clean. It is simple to work plus it's the most effective method to repair registry.<br><br>Many of the reliable businesses will offer a full income back guarantee. This signifies which you have the chance to receive a funds back if you find the registry cleaning has not delivered what you expected.<br><br>The 'registry' is a central database that stores info, settings and options for a computer. It's really the many well-known reason why XP runs slow plus in the event you fix this issue, we might make a computer run a lot quicker. The problem is that the 'registry' shops a lot of settings plus details regarding the PC... and considering Windows requires to employ numerous of these settings, any corrupted or damaged ones might straight affect the speed of your system.<br><br>Always see to it which we have installed antivirus, anti-spyware plus anti-adware programs plus have them updated regularly. This can help stop windows XP running slow.<br><br>When it comes to software, this is the vital part because it is the one running your program and also additional programs needed inside your functions. Always maintain the cleanliness of your program from obsolete data by getting a superior [http://bestregistrycleanerfix.com/tune-up-utilities tuneup utilities 2014]. Protect it from a virus online by providing a workable virus protection program. You could equally have a monthly clean up by running your defragmenter program. This means it usually enhance the performance of the computer plus for you to avoid any mistakes. If you think anything is incorrect with all the computer software, and we don't know how to fix it then refer to a technician.<br><br>The software finds these issues and takes care of them in the shortest time possible. Your hard drive would furthermore result problems at times, especially if you have 1 that is almost maxed. When a begin the machine, the are thus many booting processes involved plus having an virtually full storage space refuses to assist a bit. You will always have a slow PC because there are numerous things in the difficult disk being processed at the same time. The best way to resolve this problem is to upgrade. This allows the PC several time to breath and functioning faster instantaneously.<br><br>We require a choice to automatically delete unwanted registry keys. This might conserve you hours of laborious checking through a registry keys. Automatic deletion is a key element whenever we compare registry cleaners.<br><br>There is a lot a superior registry cleaner will do for the computer. It may check for and download changes for Windows, Java and Adobe. Keeping updates present is an significant piece of good computer wellness. It can additionally protect the individual and company privacy in addition to a online safety.
In [[mathematics]], an '''exponential sum''' may be a finite [[Fourier series]] (i.e. a [[trigonometric polynomial]]), or other finite sum formed using the [[exponential function]], usually expressed by means of the function
 
:<math>e(x) = \exp(2\pi ix).\,</math>
 
Therefore a typical exponential sum may take the form
 
:<math>\sum e(x_n),</math>
 
summed over a finite sequence of [[real number]]s ''x''<sub>''n''</sub>.
 
==Formulation==
 
If we allow some real coefficients ''a''<sub>''n''</sub>, to get the form
 
:<math>\sum a_n e(x_n)</math>
 
it is the same as allowing exponents that are [[complex number]]s. Both forms are certainly useful in applications. A large part of twentieth century [[analytic number theory]] was devoted to finding good estimates for these sums, a trend started by basic work of [[Hermann Weyl]] in [[diophantine approximation]].
 
==Estimates==
 
The main thrust of the subject is that a sum
 
:<math>S=\sum e(x_n)</math>
 
is ''trivially'' estimated by the number ''N'' of terms. That is, the [[absolute value]]
 
:<math>|S| \le N\,</math>
 
by the [[triangle inequality]], since each summand has absolute value 1. In applications one would like to do better. That involves proving some cancellation takes place, or in other words that this sum of complex numbers on the [[unit circle]] is not of numbers all with the same [[Parameter|argument]]. The best that is reasonable to hope for is an estimate of the form
 
:<math>|S|= O(\sqrt{N})\,</math>
 
which signifies, up to the implied constant in the [[big O notation]], that the sum resembles a [[random walk]] in two dimensions.
 
Such an estimate can be considered ideal; it is unattainable in many of the major problems, and estimates
 
:<math>|S|= o(N)\,</math>
 
have to be used, where the o(''N'') function represents only a ''small saving'' on the trivial estimate. A typical 'small saving' may be a factor of log(''N''), for example. Even such a minor-seeming result in the right direction has to be referred all the way back to the structure of the initial sequence ''x''<sub>''n''</sub>, to show a degree of [[randomness]]. The techniques involved are ingenious and subtle.
 
A variant of 'Weyl differencing' investigated by Weyl involving a generating exponential sum
 
<math> G(\tau)= \sum e^{iaf(x)+ia\tau n} </math>
 
Was previously studied by Weyl himself, he developed a method to express the sum as the value <math> G(0)</math>, where 'G' can be defined via a linear differential equation similar to [[Dyson equation]] obtained via summation by parts.
 
==History==
 
If the sum is of the form
 
:<math> S(x)= e^{ia f(x) } </math>
 
where ''ƒ'' is a smooth function, you could use the [[Euler–Maclaurin formula]] to convert the series into an integral, plus some corrections involving derivatives of ''S''(''x''), then for large values of ''a'' you could use "stationary phase" method to calculate the integral and give an approximate evaluation of the sum. Major advances in the subject were ''[[Van der Corput's method]]'' (c. 1920), related to the [[principle of stationary phase]], and the later ''[[Vinogradov method]]'' (c.1930).
 
The [[large sieve method]] (c.1960), the work of many researchers, is a relatively transparent general principle; but no one method has general application.
 
==Types of exponential sum==
 
Many types of sums are used in formulating particular problems; applications require usually a reduction to some known type, often by ingenious manipulations. [[Partial summation]] can be used to remove coefficients ''a''<sub>''n''</sub>, in many cases.
 
A basic distinction is between a '''complete exponential sum''', which is typically a sum over all [[residue class]]es ''[[modular arithmetic|modulo]]'' some integer ''N'' (or more general [[finite ring]]), and an '''incomplete exponential sum''' where the range of summation is restricted by some [[inequality (mathematics)|inequality]]. Examples of complete exponential sums are [[Gauss sum]]s and [[Kloosterman sum]]s; these are in some sense [[finite field]] or finite ring analogues of the [[gamma function]] and some sort of [[Bessel function]], respectively, and have many 'structural' properties. An example of an incomplete sum is the partial sum of the quadratic Gauss sum (indeed, the case investigated by [[Carl Friedrich Gauss|Gauss]]). Here there are good estimates for sums over shorter ranges than the whole set of residue classes, because, in geometric terms, the partial sums approximate a [[Cornu spiral]]; this implies massive cancellation.
 
Auxiliary types of sums occur in the theory, for example [[character sum]]s; going back to [[Harold Davenport]]'s thesis. The [[Weil conjectures]] had major applications to complete sums with domain restricted by polynomial conditions (i.e., along an [[algebraic variety]] over a finite field).
 
==Weyl sums==
One of the most general types of exponential sum is the '''Weyl sum''', with exponents 2π''if''(''n'') where ''f'' is a fairly general real-valued [[smooth function]]. These are the sums involved in the distribution of the values
 
:''&fnof;''(''n'') modulo 1,
 
according to [[Weyl's equidistribution criterion]]. A basic advance was [[Weyl's inequality]] for such sums, for polynomial ''f''.
 
There is a general theory of [[exponent pair]]s, which formulates estimates. An important case is where ''f'' is logarithmic, in relation with the [[Riemann zeta function]].  See also [[equidistribution theorem]].<ref name=Mont39>Montgomery (1994) p.39</ref>
 
==Example: the quadratic Gauss sum==
 
Let ''p'' be an odd prime and let <math>\xi = e^{2\pi i / p}</math>. Then
the quadratic [[Gauss sum]] is given by
 
:<math>\sum_{n=0}^{p-1}\xi^{n^2} =
\begin{cases}
\sqrt{p}, & p = 1 \mod 4 \\
i\sqrt{p}, & p = 3 \mod 4
\end{cases}
</math>
 
where the square roots are taken to be positive.
 
This is the ideal degree of cancellation one could hope for without any ''a priori'' knowledge of the structure of the sum, since it matches the scaling of a [[random walk]].
 
==See also==
* [[Hua's lemma]]
 
==References==
{{reflist}}
* {{cite book | last=Montgomery | first=Hugh L. | authorlink=Hugh Montgomery (mathematician) | title=Ten lectures on the interface between analytic number theory and harmonic analysis | series=Regional Conference Series in Mathematics | volume=84 | location=Providence, RI | publisher=[[American Mathematical Society]] | year=1994 | isbn=0-8218-0737-4 | zbl=0814.11001 }}
* {{cite book | editor1-last=Sándor | editor1-first=József | editor2-last=Mitrinović | editor2-first=Dragoslav S. | editor3-last=Crstici |editor3-first=Borislav | title=Handbook of number theory I | location=Dordrecht | publisher=[[Springer-Verlag]] | year=2006 | isbn=1-4020-4215-9 | zbl=1151.11300 }}
 
==Further reading==
* {{cite book | zbl=0754.11022 | last=Korobov | first=N.M. | title=Exponential sums and their applications | others=Translated from the Russian by Yu. N. Shakhov | series=Mathematics and Its Applications. Soviet Series. | volume=80 | location=Dordrecht | publisher=Kluwer Academic Publishers | year=1992 | isbn=0-7923-1647-9 }}
 
==External links==
* [http://mathworld.wolfram.com/WeylSum.html A brief introduction to Weyl sums on Mathworld]
 
[[Category:Exponentials]]
[[Category:Analytic number theory]]

Revision as of 01:30, 12 December 2013

In mathematics, an exponential sum may be a finite Fourier series (i.e. a trigonometric polynomial), or other finite sum formed using the exponential function, usually expressed by means of the function

e(x)=exp(2πix).

Therefore a typical exponential sum may take the form

e(xn),

summed over a finite sequence of real numbers xn.

Formulation

If we allow some real coefficients an, to get the form

ane(xn)

it is the same as allowing exponents that are complex numbers. Both forms are certainly useful in applications. A large part of twentieth century analytic number theory was devoted to finding good estimates for these sums, a trend started by basic work of Hermann Weyl in diophantine approximation.

Estimates

The main thrust of the subject is that a sum

S=e(xn)

is trivially estimated by the number N of terms. That is, the absolute value

|S|N

by the triangle inequality, since each summand has absolute value 1. In applications one would like to do better. That involves proving some cancellation takes place, or in other words that this sum of complex numbers on the unit circle is not of numbers all with the same argument. The best that is reasonable to hope for is an estimate of the form

|S|=O(N)

which signifies, up to the implied constant in the big O notation, that the sum resembles a random walk in two dimensions.

Such an estimate can be considered ideal; it is unattainable in many of the major problems, and estimates

|S|=o(N)

have to be used, where the o(N) function represents only a small saving on the trivial estimate. A typical 'small saving' may be a factor of log(N), for example. Even such a minor-seeming result in the right direction has to be referred all the way back to the structure of the initial sequence xn, to show a degree of randomness. The techniques involved are ingenious and subtle.

A variant of 'Weyl differencing' investigated by Weyl involving a generating exponential sum

G(τ)=eiaf(x)+iaτn

Was previously studied by Weyl himself, he developed a method to express the sum as the value G(0), where 'G' can be defined via a linear differential equation similar to Dyson equation obtained via summation by parts.

History

If the sum is of the form

S(x)=eiaf(x)

where ƒ is a smooth function, you could use the Euler–Maclaurin formula to convert the series into an integral, plus some corrections involving derivatives of S(x), then for large values of a you could use "stationary phase" method to calculate the integral and give an approximate evaluation of the sum. Major advances in the subject were Van der Corput's method (c. 1920), related to the principle of stationary phase, and the later Vinogradov method (c.1930).

The large sieve method (c.1960), the work of many researchers, is a relatively transparent general principle; but no one method has general application.

Types of exponential sum

Many types of sums are used in formulating particular problems; applications require usually a reduction to some known type, often by ingenious manipulations. Partial summation can be used to remove coefficients an, in many cases.

A basic distinction is between a complete exponential sum, which is typically a sum over all residue classes modulo some integer N (or more general finite ring), and an incomplete exponential sum where the range of summation is restricted by some inequality. Examples of complete exponential sums are Gauss sums and Kloosterman sums; these are in some sense finite field or finite ring analogues of the gamma function and some sort of Bessel function, respectively, and have many 'structural' properties. An example of an incomplete sum is the partial sum of the quadratic Gauss sum (indeed, the case investigated by Gauss). Here there are good estimates for sums over shorter ranges than the whole set of residue classes, because, in geometric terms, the partial sums approximate a Cornu spiral; this implies massive cancellation.

Auxiliary types of sums occur in the theory, for example character sums; going back to Harold Davenport's thesis. The Weil conjectures had major applications to complete sums with domain restricted by polynomial conditions (i.e., along an algebraic variety over a finite field).

Weyl sums

One of the most general types of exponential sum is the Weyl sum, with exponents 2πif(n) where f is a fairly general real-valued smooth function. These are the sums involved in the distribution of the values

ƒ(n) modulo 1,

according to Weyl's equidistribution criterion. A basic advance was Weyl's inequality for such sums, for polynomial f.

There is a general theory of exponent pairs, which formulates estimates. An important case is where f is logarithmic, in relation with the Riemann zeta function. See also equidistribution theorem.[1]

Example: the quadratic Gauss sum

Let p be an odd prime and let ξ=e2πi/p. Then the quadratic Gauss sum is given by

n=0p1ξn2={p,p=1mod4ip,p=3mod4

where the square roots are taken to be positive.

This is the ideal degree of cancellation one could hope for without any a priori knowledge of the structure of the sum, since it matches the scaling of a random walk.

See also

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

  • 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
  • 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534

Further reading

  • 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534

External links

  1. Montgomery (1994) p.39