EVALUATING HIGHER DERIVATIVE TENSORS BY FORWARD PROPAGATION OF UNIVARIATE TAYLOR SERIES
|
|
- Darren Henderson
- 6 years ago
- Views:
Transcription
1 MATHEMATICS OF COMPUTATION Volume 69, Number 231, Pages S (00) Article electronically publishe on February 17, 2000 EVALUATING HIGHER DERIVATIVE TENSORS BY FORWARD PROPAGATION OF UNIVARIATE TAYLOR SERIES ANDREAS GRIEWANK, JEAN UTKE, AND ANDREA WALTHER Abstract. This article consiers the problem of evaluating all pure an mixe partial erivatives of some vector function efine by an evaluation proceure. The natural approach to evaluating erivative tensors might appear to be their recursive calculation in the usual forwar moe of computational ifferentiation. However, with the approach presente in this article, much simpler ata access patterns an similar or lower computational counts can be achieve through propagating a family of univariate Taylor series of a suitable egree. It is applicable for arbitrary orers of erivatives. Also it is possible to calculate erivatives only in some irections instea of the full erivative tensor. Explicit formulas for all tensor entries as well as estimates for the corresponing computational complexities are given. 1. Introuction Many applications in scientific computing require secon- an higher-orer erivatives. Therefore, this article eals with the problem of calculating erivative tensors of some vector function y = f(x) with f : D R n R m that is the composition of (at least locally) smooth elementary functions. Assume that f is given by an evaluation proceure in C or some other programming language. Then f can be ifferentiate automatically [6]. The Jacobian matrix of first partial erivatives can be compute by the forwar or reverse moe of the chainrule base technique known commonly as computational ifferentiation (CD). CD also yiels secon erivatives that are neee in optimization [8] an even higher erivatives that are calle for in numerical bifurcation, beam ynamics [2] an other nonlinear calculations. Even though the reverse moe of CD may be more efficient when the number of epenent variables is small compare to the number of inepenents [6], only the forwar moe will be consiere here. The mechanics of this irect application of the chain rule are completely inepenent of the number of epenent variables, so it is possible to restrict the analysis to a scalar-value function y = f(x) with f : D R n R. Receive by the eitor January 2, 1998 an, in revise form, June 30, Mathematics Subject Classification. Primary 65D05, 65Y20, 68Q40. Key wors an phrases. Higher orer erivatives, computational ifferentiation. This work was partially supporte by the Deutsche Forschungsgesellschaft uner grant GR 705/ c 2000 American Mathematical Society
2 1118 ANDREAS GRIEWANK, JEAN UTKE, AND ANDREA WALTHER In other wors, formulas for one component f(x) of the original vector function f(x) are erive. This greatly simplifies the notation, an the full tensors can then easily be obtaine by an outer loop over the component inex. The natural approach to evaluating erivative tensors seems to be their recursive calculation using the usual forwar moe of CD. This technique has been implemente by Berz [3], Neiinger [10], an others. The only complication here is the nee to utilize the symmetry in the higher erivative tensors, which leas to fairly complex aressing schemes. As has been mentione in [7] an [1], much simpler ata access patterns an similar or lower computational counts can be achieve through propagating a family of univariate Taylor series of an arbitrary egree. At the en, their values are interpolate to yiel the tensor coefficients. The paper is organize as follows. Section 2 introuces the notations that are use an makes some general observations. In Section 3 the complexity of storing an propagating multivariate an univariate Taylor polynomials is examine, an the avantages of the univariate Taylor series are shown. Section 4 erives formulas for the calculation of all mixe partial erivatives up to egree from a family of univariate Taylor polynomials of egree. Some run-time results are presente in Section 5. Finally, Section 6 outlines some conclusions. 2. Notations an basic observations In many applications, one oes not require full erivative tensors but only the erivatives in n n irections s i R n. Therefore suppose a collection of n n irections s i R n is given, an that they form a matrix S = [s 1, s 2,...,s n ] R n n. OnepossiblechoiceisS = I with n = n. Here, I enotes the ientity matrix in R n n. Of particular interest is the case n = 1, where only erivatives in one irection are calculate. With a coefficient vector z R n, one may wish to calculate the erivative tensors f(x + Sz) z = (f (x)s j ) j=1,...,n R n, z=0 2 f(x + Sz) z2 = (f j=1,...,n (x) s i s j ) i=1,...,n Rn n, z=0 an so on. The last equation is alreay an abuse of the usual matrix-vector notation. Here, the abbreviation S k f(x) Rnk will be use in orer to enote the k-th erivative tensor of f(x + Sz) with respect to z at z =0. The use of the see matrix S allows us to restrict our consierations to a subspace spanne by the columns s i along which the properties of f might be particularly interesting. This situation arises for example in optimization an bifurcation theory, where the range of S might be the tangent space of the active constraints or the nullspace of a egenerate Jacobian. Especially, when n n it is obviously preferable to calculate the restricte tensors S k f(x) irectly, rather than first evaluating the full tensors k f(x) I k f(x) R nk
3 EVALUATING HIGHER DERIVATIVE TENSORS 1119 an then contracting them by multiplications with the irections s i. One way to evaluate the esire tensors S k f(x) is to recursively calculate for all intermeiate quantities w the corresponing restricte tensors S w, S 2 w,... etc. The process woul be starte with the initialization S x = S an with S kx =0 for k>1. For all subsequent intermeiates, the erivative tensors are efine by the usual ifferentiation rules. For example, in the case w = u v there are the well known ifferentiation rules S w = u S v + v S u an S 2 w = u 2 S v + Su( S v) T + S v( S u) T + v S 2 u. For the thir erivative tensor, the matrix-vector notation is no longer sufficient, but the following observation is generally applicable. To calculate S k w, each element of j S u with 0 j k has to be consiere an then multiplie with all elements of k j S v. The result is then multiplie by a binomial coefficient given by Leibniz theorem, an finally incremente to the appropriate element of S kw. The next section stuies the complexity of storing an propagating multivariate an univariate Taylor polynomials. Taylor coefficients are use since they are somewhat better scale than the corresponing erivatives an satisfy slightly simpler recurrences. 3. The complexity of propagating univariate Taylor series If the k-th tensor were store an manipulate as a full n k array, the corresponing loops coul be quite simple to coe, but the memory requirement an operations count woul be unnecessary high. In the case k = 2, ignoring the symmetry of Hessians woul almost ouble the storage per intermeiate (from 1 2 (n+1)n to n 2 ) an increase the operations count for a multiplication by about fifty percent. This price may be worth paying in return for the resulting sequential or at least constant strie ata access. However, by stanar combinatorial arguments S k f(x) Rnk has exactly ( ) n + k 1 n (n +1) (n + k 1) (1) = nk k 1 2 k k! istinct elements. Hence, the symmetry reuces the number of istinct elements in S k w almost by the factor k!. Therefore in the case k = 3 the number of istinct elements is reuce almost by six an in the case k = 4 the storage ratio becomes almost 24. Since higher orer tensors have very many entries, one has to utilize symmetric storage moes. The rawback of symmetric storage moes is that the access of iniviual elements is somewhat complicate, requiring for example three integer operations for aress computations in the implementation of Berz [3]. Moreover, the resulting memory locations may be far apart with irregular spacing, so that significant paging overhea may be incurre. None of these ifficulties arises when n =1. Then for any intermeiate value w the irectional erivatives w, s w, s 2 w,..., s w can be store an manipulate as a contiguous array of ( + 1) scalars. Here enotes
4 1120 ANDREAS GRIEWANK, JEAN UTKE, AND ANDREA WALTHER the highest egree that is esire. It will be shown in Section 4 that to reconstruct the full tensors S k f(x) fork =0,...,, exactly as many univariate Taylor series are neee as the highest tensor S f(x) has istinct elements. As we will see, that entails a slight increase in storage, but a very significant gain in coe simplicity an efficiency. After this outlook, the manipulation of Taylor polynomials is consiere. The collection of Taylor coefficients that constitute the tensors k S f(x), k =0,...,, represents a general polynomial of egree in n variables. As can be conclue from (1), S k f(x) contains ( ) n + ( ) n + k 1 (2) = k k=0 istinct monomials. The truncate Taylor polynomials of all intermeiate scalar quantities w have exactly the same structure. Consiering again a prouct w = u v, for the computation of S k w each element of j S u,0 j k, has to be multiplie with all elements of k j S v. It follows that ( ) 2n + k 1 k ( )( ) n + j 1 n + k j 1 = k j k j j=0 multiplications are necessary because of (1). Hence, the total count of multiplications for computing S w is ( ) 2n + ( ) 2n + k 1 =. k k=0 When n>1 there are also a significant number of aitions an other overhea for each multiplication. Nevertheless it is possible to consier the number ( ) 2n + 1! (2n) if n as a reasonable approximation for the factor by which the cost to evaluate f grows when the calculation is performe in Taylor arithmetic of egree an orer n. Here, we have tacitly use the fact that propagating Taylor polynomials through nonlinear functions such as the exponential, logarithm, an trigonometric functions is about as costly as the convolution for the prouct iscusse above. All linear operations are cheaper, of course, since for them the effort is roughly ( ) n+ an thus about the same as the number of ata entries that nee to be fetche an store from an into memory. Provie there is a significant fraction of nonlinear elementary functions in the overall calculation, one may consier ( )/( ) 2n + n + 2 as an approximate computation/communication ratio for propagating Taylor polynomials. Consequently, even on a moern super-scalar processor with comparatively slow memory access, communication shoul not be the bottleneck. Now suppose that instea of propagating one Taylor polynomial in n variables an egree one propagates ( ) n+ 1 univariate Taylor polynomials of the same
5 EVALUATING HIGHER DERIVATIVE TENSORS 1121 egree. Since the common constant term nees to be store only once, the amount of ata per intermeiate becomes ( ) n = 1+ n ( ) n + (3). + n By inspection of the right-han sie we see this is at most times that for the stanar case (see (2)). Furthermore, ( ) ( +2)( +1) +2 = 2 multiplications are neee to propagate one univariate Taylor polynomial of egree through an elementary multiplication. Hence, the total amount of the computational effort for propagating ( ) n+ 1 univariate Taylor polynomials of egree is essentially given by (n )( ) ( ) n + (4) = q(, n), where ( +2)( +1) (n + 1)...(n) q(, n) 2 (2n + )(2n + 1)...(2n +1). It is easy to check through inuction that q is never greater than 3 2 an that q() ( +2)( +1) lim q(, n) = n One has in particular q(0,n)= 1an q(1,n) = n+2 = 3 2 O( 1 n ), q(2,n) = n+2 = 3 2 O( 1 n ), q(3,n) = q(4,n) = q(5,n) = 5n(n+2) (2n+3)(2n+1) = 5 4 O( 1 n ), 15n(n+3) 4(2n+3)(2n+1) = O( 1 n ), 21n(n+3)(n+4) 4(2n+5)(2n+3)(2n+1) = O( 1 n ), as well as, for all higher erivatives 6, ( +2)( +1) 1 ) q(, n) = O(. n In other wors, the computational effort is ramatically reuce when the egree is quite large. This fact can also be seen in Figure 1, which isplays the function q(, n). For the probably more important moerate values of 5thecomplexity ratio is surprisingly close to one. The computations/communications ratio is about /2, almost inepenently of n (see (3) an (4)). For 4 that ratio might appear rather small. However, the memory access is now strictly sequential, an no aressing calculations are neee. In this section, we have emonstrate that for moerate values of the propagation of ( ) n+ 1 univariate Taylor series has essentially the same operations count as multivariate erivative propagation. We foun also that for higher egree erivatives, one nees consierable fewer operations using univariate Taylor series instea of the multivariate one. In the next section, an efficient scheme for interpolating
6 1122 ANDREAS GRIEWANK, JEAN UTKE, AND ANDREA WALTHER q n Figure 1. q(, n) forn =4,...,100, =0,...,10 all partial erivatives up to egree from these ( ) n+ 1 univariate Taylor series is evelope. 4. Interpolation with univariate Taylor series For each irection s R n one can obtain the Taylor expansion (5) f(x + ts) =f(x)+f (1) (x; s)t + f (2) (x; s)t f () (x; s)t + O(t +1 ). The notation f (m) (x; s) will be use throughout to enote the m-th homogeneous polynomial in s in the Taylor expansion of f at x. Hence, x is consiere constant an s R n variable with the homogeneity property (6) f (m) (x; ts) = t m f (m) (x; s) for t R. Since only the last coefficient f () (x; s) contains any information about the highest tensor s f(x) withits ( ) n+ 1 istinct elements, it is clear that one nees to evaluate at least that many univariate expansions. We will see that this number is sufficient. Let i =(i 1,...,i n ) N n 0 with i j N 0 (j =1,...,n) be a multi-inex. The norm of i is efine by n i = i j. j=1 Consier the matrix S throughout this section as fixe. Now choose the irections Si i N n 0 with i =.
7 EVALUATING HIGHER DERIVATIVE TENSORS 1123 After selecting a particular, Taylor coefficients are propagate along these ( ) n+ 1 necessary irections only. In other wors, for each multi-inex i N n 0 with i =, we consier the Taylor series for the univariate function ϕ i : R R, ϕ i (t) f(x + tsi), an evaluate the Taylor coefficients of ϕ i up to the egree. The epenence of the ϕ i on S is not enote explicitly, because S is consiere as fixe. Note that there is no propagation along the irections Si with i <. However, we will see that it is still possible to obtain all lower orer erivative information that is necessary to compute the tensors S m f with m<. Interpolating secon erivatives. To illustrate our approach, let us first consier the computation of the Hessian S 2 f with S = I when the maximal egree equals 2. Denote the i-th unit vector in R n by e i. Then, the restricte graient components of S f(x) are obtaine immeiately as S f(x)e i = 1 2 ϕ i(0) = 1 { 2, k = i, (7) 2 f(x)si with i Nn 0, i k = 0, k i. Similarly, the pure secon erivatives can be obtaine from e T i 2 S f(x)e i = 1 4 ϕ i (0) = 1 4 (Si)T 2 f(x)si with the same multi-inex i as in (7). However, the mixe secon erivatives e T i 2 S f(x)e j,i j, are not irectly available. To get them, one has to consier the iagonal irection Sl efine by the multi-inex { l N n 1ifk = i or k = j, 0 with l k = 0ifk ian k j. Because of l = 2 the secon orer Taylor coefficient of ϕ l is known: ϕ l (0) = (e i + e j ) T S 2 f(x)(e i + e j ) = e T i 2 S f(x)e i + e T j 2 S f(x)e j +2e T i 2 S f(x)e j. This ientity yiels the interpolation formula (8) e T i 2 S f(x)e j = 1 2 [(e i + e j ) T 2 S f(x)(e i + e j ) e T i 2 S f(x)e i e T j 2 S f(x)e j] = 1 2 ϕ l (0) 1 8 ϕ i (0) 1 8 ϕ j (0) with the multi-inices i, j, l N n 0 an { { 2ifk = i, 2ifk = j, (9) i k = j k = 0ifk i, 0ifk j, l k = { 1ifk = i or k = j, 0ifk i an k j. When = 3 this scheme is not irectly applicable because l < 3. Therefore l oes not aim at a erivative of the highest orer, an one oes not propagate a Taylor series along the irection Sl. Hence, ϕ l (0) is unknown. To hanle that situation an generally the higher orer cases, one nees a systematic way of generating formula of the form (8) for mixe partials.
8 1124 ANDREAS GRIEWANK, JEAN UTKE, AND ANDREA WALTHER Computing mixe partials from gri values. For any polynomial P of egree n or less, it can be checke that n P (Sz) 1 1 (10) = P (i 1 s i n s n )( 1) n (i1+ +in) z 1 z 2... z n i 1=0 i n=0 through integration of the constant function on the left sie over the unit cube in n imensions. The important observation here is that one only has to know the value of the polynomial at the corners of the parallelepipe {Sz :0 z i 1} in orer to compute the mixe erivative with respect to all z i. Naturally, one oes not want to assume that f itself is a polynomial. However, one can use the m-th coefficients of the univariate Taylor expansions to compute values of the homogeneous approximating polynomials f (m) (x; s), 1 m, satisfying (5) an (6). For example, it follows immeiately for the secon mixe partials with P (Sz) =f (2) (x; Sz) an1 j<i n: 2 f (2) (x; Sz) (11) = f (2) (x; S(e i +e j )) f (2) (x; Se i ) f (2) (x; Se j ) +f (2) (x;0) z i z j }{{}}{{}}{{} = 1 2 ϕ l (0) = 1 8 ϕ i (0) = 1 8 ϕ j (0) with the multi-inices i, j, anl efine as in (9). Through the homogeneity property (6) one obtains that (12) f (m) (x;0) = 0, m>0, so that the last term in (11) rops out an one gets 2 f (2) (x; Sz) 2 f(x + Sz) z i z j z i z j because of the previous formula (8). For fixe S an given, therealnumbers f ( i ) (x; Si) with i will be referre to as the gri values. By consiering see matrices S R n with repeate columns, one can erive from (10), for any polynomial P of egree up to, its generalization i P (Sz) z i1 1 zi zin n = i 1 i 2 k 1=0 k 2=0 i n k n=0 ( )( i1 i2 k 1 k 2 z=0 ) ( in k n ) ( 1) i k P (Sk), where now S R n n an i may be any multi-inex with i = eg(p ). Applying this ientity to the homogeneous components f ( i ) (x; s) off at x an using binomial coefficient notation for multi-inices, one obtains, with (12) an the zero vector 0 N n 0, (13) f i (x) i f(x + Sz) z i1 1 zi zin n = z=0 0<k i ( ) i ( 1) i k f ( i ) (x; Sk). k We conclue this subsection with a geometric illustration of the situation. Suppose one wishes to obtain the partials f i for all i with 1 i. The functions f (m) (x; s), s R n,enotethem-th homogeneous polynomial at x as in equation (5). Through formula (13) it is possible to calculate f i (x) from the gri values f ( i ) (x; Sk) for all k i. However, the propagation of univariate Taylor series only yiels some of the gri values irectly. The others must be calculate in a secon interpolation step. The values f (m) (x; Si) are known for all i = an
9 EVALUATING HIGHER DERIVATIVE TENSORS 1125 e 2 e 1 Figure 2. Gri values an ray values for n =2an =4 for all 0 m. They will be referre to as ray values. Figure 2 illustrates this situation for n =2an = 4. The thin lines represent the irections of the propagate Taylor series incluing the e 1 -anthee 2 -axes. The gri points whose values can be obtaine by scaling of the ray values f (m) (x; Si) with i = an 0 m are marke by unfille circles. The black circles enote the values that are esire because they arise on the right han sie of (13) but are as yet unknown. The grey shae circles mark points that o not belong to the gri but whose values can be obtaine by scaling. The following section escribes the way to compute the unknown gri values from the known ray values. Computing gri values from ray values. For all multi-inices k with k <, the fact that f (m) (x; s) is homogeneous of egree m implies (14) f (m) (x; Sk) = ( k /) m f (m) (x; S(k/ k )). The ray values are place at equal istances, an the polynomial ( z j) f (m) (x; Sj) in z is nonzero for only one ray point. Hence, an interpolation process similar to the one imensional Lagrange interpolation formula yiels the equation (15) f (m) (x; Sz) = j = ( ) z f (m) (x; Sj) j for z = k/ k or any other vector z R n with value z =. Therefore the ray values f (m) (x; S(k/ k )) can be compute for any k with k <. Substituting
10 1126 ANDREAS GRIEWANK, JEAN UTKE, AND ANDREA WALTHER (15) into (14), one obtains (16) f (m) (x; Sk) = j = ( k ) m ( k/ k j ) f (m) (x; Sj). Direct computation of mixe partials from ray values. Now the main result of this article can be establishe, namely an efficient scheme for calculating all mixe partial erivatives up to egree from the known ray values. The following proposition contains the explicit formula an an estimation of the complexity of the interpolation proceure. Proposition 4.1. Let f be at least -times continuously ifferentiable at some point x R n. Then for any i N n 0 with 1 i the partial erivative f i(x) efine in (13) is given by the formula (17) ) i f i (x) = f ( i ) (x; Sj) ( )( )( i k/ k k ( 1) i k k j j = 0<k i }{{} c i,j The number of nonvanishing coefficients (18) 0 c i,j for i, j N n 0, 1 i, j =, is less than or equal to p(, n) ( )( )( ) n m + 1, m m m=1 which bouns the number of operations neee to calculate all partial erivatives from the univariate Taylor series. Proof. Combining (13) an (16), one obtains the ientity (17), which can be written in a simpler form as (19) f i (x) = c i,j f ( i ) (x; Sj). j = Define the sign function for multi-inices componentwise as follows: sign(i) (sign(i 1 ),...,sign(i n )) i N n 0. For two multi-inices i an j with 1 i an j =, the coefficient c i,j can only be nonzero if (20) sign(j) sign(i), since otherwise the secon binomial coefficient in (17) must vanish for all 0 < k i. Now, consier an arbitrary m N with 1 m. A multi-inex i with sign(i) = m has m nonvanishing components. Therefore the inequality m i must hol for all i with sign(i) = m. The number of istinct possibilities for choosing m positive integers so that their sum is no greater than is given by ( m). It follows that the total number of multi-inices i with 1 i an sign(i) = m is equal to ( n m)( m). For each of these multi-inices the coefficient ci,j can be greater than zero only if j satisfies the necessary conition (20). This implies that sign(j) m.
11 EVALUATING HIGHER DERIVATIVE TENSORS 1127 r n Figure 3. r(, n) forn =1,...,100, =0,...,10 Therefore, one has that for each multi-inex i with 1 i an sign(i) = m the number of multi-inices j with sign(j) sign(i) isgivenby ( ) m+ 1. Hence we conclue that the function ( )( )( ) n m + 1 (21) p(, n) m m m=1 enotes an upper boun for the number of nonvanishing coefficients c i,j. One can erive from (19) that (21) is also an upper boun for the total number of multiplications of the interpolation proceure. It follows from the tables at the en of this section that for =2, 3anany n N, the function p(, n) gives the exact number of nonvanishing coefficients c i,j. Therefore it may be conjecture that p(, n) correspons exactly to the number of nonvanishing factors c i,j, but so far there is no proof of this. Define r(, n) p(, n) ) = 1 ( ) ( 2n+ ( c ) + O n as the ratio of the upper boun p(, n) an the complexity ( ) 2n+ of propagating multivariate Taylor series through a single multiplication operation. Hence, one obtains for large ( r(, n) 2 1 c ) + O. π n
12 1128 ANDREAS GRIEWANK, JEAN UTKE, AND ANDREA WALTHER Table 1. Nonvanishing coefficients for =2 Multi-inices c i,j i M 1 j M 2 i T 1 j 0 2 i M 2 j M 2 i T 1 j 0 2 i M 3 j M 2 i T j i M 3 j M 3 i T j =2 1 As can be seen in Figure 3 the ratio r(, n) is quite small for the more important moerate values 5. It follows in particular that r(1,n) = n+2 = O( 1 n ), r(2,n) = r(3,n) = n(1+3n) 2(2n+1)(n+1) = O( 1 n ), n(1+3n+5n 2 ) (2n+3)(2n+1)(n+1) = O( 1 n ), as well as r(4,n) = O( 1 n ) 2+O( 1 n ), r(5,n) = O( 1 n ) 4+O( 1 n ), r(6,n) = O( 1 n ) 7+O( 1 n ), r(7,n) = O( 1 n ) 13 + O( 1 n ). To apply the formula (19) at various points x R n it makes sense to precompute the rational coefficients (18). So far a simple, explicit formula for them has not been foun, but it is possible to further reuce the computation by grouping the aitive terms together. A listing is given for =2an =3. When = 2 one has to consier the following four groups of multi-inices: (22) M 0 = {0 N n 0 }, M 1 = {i N n 0 i =1}, M 2 = {i N n 0 i =2an sign(i) =1}, M 3 = {i N n 0 i =2an sign(i) =2}. Then, the coefficient c i,j has to be calculate for each i M 0 M 1 M 2 M 3 an each j M 2 M 3. Table 1 lists the nonvanishing c i,j. For = 3 there are three groups of multi-inices besies those of (22): M 4 = {i N n 0 i =3an sign(i) =1}, M 5 = {i N n 0 i =3an sign(i) =2}, M 6 = {i N n 0 i =3an sign(i) =3}. Now, for each i M 0... M 6 an each j M 4 M 5 M 6 the coefficients (18) must be consiere. The nonvanishing c i,j are given by Table 2. As one can see, all coefficients c i,j for 3 are of moerate size an most are positive. It shoul also be note that the interpolation proceure oes not involve any ivisions, so it oes not expan errors occurre by propagating the univariate Taylor series.
13 EVALUATING HIGHER DERIVATIVE TENSORS 1129 Table 2. Nonvanishing coefficients for =3 Multi-inices c i,j Multi-inices c i,j i M 1 j M 4 i T 1 j 0 3 i M 5 j M 4 i T 2 j =3 27 i M 2 j M 4 i T 2 j 0 9 i M 5 j M 5 i T 2 j =5 3 i M 3 j M 4 i T j i M 5 j M 5 i T j =4 1 3 i M 3 j M 5 i T 1 j =3 4 i M 6 j M 4 i T 2 j 0 27 i M 4 j M 4 i T 2 j 0 9 i M 6 j M 5 i T j =3 1 6 i M 5 j M 4 i T j = i M 6 j M 6 i T j = Some run time results This section presents some run time results for computing higher erivative tensors using the interpolation with univariate Taylor expansions escribe above. To optimize bevel gears, exact knowlege of the geometric properties of bevel gear tooth flanks is necessary (see e.g. [9]). Arbitrary points on a given gri on the tooth flank can be calculate with machine accuracy by an analytical characterization [5] an computational ifferentiation. To that en one nees to compute the higher erivative tensors of a vector function f : R 3 R 3 escribing a family of surfaces. A corresponing evaluation coe consisting of approximately 160 C statements was ifferentiate using ADOL-C [4] an a special river for the calculation of higher erivative tensors by forwar propagation of univariate Taylor series. The run times observe on a Sun Sparc 10, always normalize by time for evaluating f without erivatives, are liste in Table 3. The thir column states the theoretical run time ratios given by ( +2) 2 ( +1) 2 /4 (see equation (4) in Section 3). The next column contains the ratios of the complete calculation of k f(x), k =0,...,, using ADOL-C an the special river mentione above. As can be seen, the total ratio is about 50 % 70 % of the theoretical estimate. The ratio of the run time of the interpolation process only an the run time of the function evaluation is containe in the fourth column. In agreement with the asymptotic expansion for r(, n), one observes a oubling of the ratio with each increment of by 1. Nevertheless, one fins on this example for 9thatnomorethanfive percent of the run time for the erivative calculation is neee to interpolate the coefficients of the erivative tensors from the univariate Taylor series. Table 3. Run-time ratios for erivative tensor evaluations istinct elements in theoretical ratio for evaluating ratio for the k f(x),k =0,..., run time ratio k f(x),k =0,..., interpolation
14 1130 ANDREAS GRIEWANK, JEAN UTKE, AND ANDREA WALTHER 6. Conclusions Many applications in scientific computation require higher orer erivatives. This article escribe a promising approach to compute higher orer erivatives by using univariate Taylor series. The main result is equation (17), which represents general partial erivatives in terms of univariate Taylor coefficients. It was foun that the post-processing effort for the interpolation given by the function p(, n) in Section 4 is very small, especially for the more important moerate values of. Also,forthese the complexity ratio q(, n) analyze in Section 3 between the new univariate Taylor approach an a more conventional multivariate Taylor approach is essentially 1. In aition, the ata structures an memory access pattern are much simpler an more regular, so that actual run-times shoul be significantly reuce. References 1. Christian H. Bischof, George F. Corliss, an Anreas Griewank, Structure secon- an higher-orer erivatives through univariate Taylor series. Optimization Methos an Software 2 (1993), Martin Berz, Differential algebraic escription of beam ynamics to very high orers. Particle Accelerators 12 (1989), Martin Berz, Algorithms for higher erivatives in many variables with applications to bear physics. In George F. Corliss an Anreas Griewank, eitors, Automatic Differentiation of Algorithms - Theory, Implementation, an Applications SIAM (1991), MR 92h: Anreas Griewank, Davi Juees, an Jean Utke, ADOL-C: A package for the automatic ifferentiation of algorithms written in C/C++. ACM Trans. Math. Software 22 (1996), Anreas Griewank an George W. Reien, Computation of cusp singularities for operator equations an their iscretizations. J. Comput. Appl. Math. 26 (1989), MR 91e: Anreas Griewank, On automatic ifferentiation. In Masao Iri an K. Tanabe, eitors, Mathematical programming: Recent evelopments an applications Kluwer Acaemic Publishers (1989), MR 92k: Anreas Griewank, Automatic evaluation of first- an higher-erivative vectors. In R. Seyel, F. W. Schneier, T. Küpper, an H. Troger, eitors, Proceeings of the Conference Bifurcation an Chaos: Analysis, Algorithms, Applications Birkhäuser (1991), MR 91m: Anreas Griewank, Computational ifferentiation an optimization. In J. Birge an K. Murty, eitors, Mathematical Programming: State of the Art University of Michigan (1994), Ulf Hutschenreiter, A new metho for bevel gear tooth flank computation. In Martin Berz, Christian Bischof, George F. Corliss an Anreas Griewank, eitors, Computational Differentiation - Techniques, Applications, an Tools SIAM (1996), Rich Neiinger, An efficient metho for the numerical evaluation of partial erivatives of arbitrary orer. ACM Trans. Math. Software 18 (1992), MR 93b:65040 Institute of Scientific Computing, Technical University Dresen, D Dresen, Germany aress: griewank@math.tu-resen.e Framework Technologies, Inc., 10 South Riversie Plaza, Suite 1800, Chicago, Illinois aress: utke@fti-consulting.com Institute of Scientific Computing, Technical University Dresen, D Dresen, Germany aress: awalther@math.tu-resen.e
Euler equations for multiple integrals
Euler equations for multiple integrals January 22, 2013 Contents 1 Reminer of multivariable calculus 2 1.1 Vector ifferentiation......................... 2 1.2 Matrix ifferentiation........................
More information19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control
19 Eigenvalues, Eigenvectors, Orinary Differential Equations, an Control This section introuces eigenvalues an eigenvectors of a matrix, an iscusses the role of the eigenvalues in etermining the behavior
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationImplicit Differentiation
Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,
More informationLATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION
The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson
JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises
More informationPure Further Mathematics 1. Revision Notes
Pure Further Mathematics Revision Notes June 20 2 FP JUNE 20 SDB Further Pure Complex Numbers... 3 Definitions an arithmetical operations... 3 Complex conjugate... 3 Properties... 3 Complex number plane,
More informationMath Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors
Math 18.02 Notes on ifferentials, the Chain Rule, graients, irectional erivative, an normal vectors Tangent plane an linear approximation We efine the partial erivatives of f( xy, ) as follows: f f( x+
More informationTable of Common Derivatives By David Abraham
Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec
More informationNOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy,
NOTES ON EULER-BOOLE SUMMATION JONATHAN M BORWEIN, NEIL J CALKIN, AND DANTE MANNA Abstract We stuy a connection between Euler-MacLaurin Summation an Boole Summation suggeste in an AMM note from 196, which
More informationA Note on Exact Solutions to Linear Differential Equations by the Matrix Exponential
Avances in Applie Mathematics an Mechanics Av. Appl. Math. Mech. Vol. 1 No. 4 pp. 573-580 DOI: 10.4208/aamm.09-m0946 August 2009 A Note on Exact Solutions to Linear Differential Equations by the Matrix
More informationThe Principle of Least Action
Chapter 7. The Principle of Least Action 7.1 Force Methos vs. Energy Methos We have so far stuie two istinct ways of analyzing physics problems: force methos, basically consisting of the application of
More informationDiagonalization of Matrices Dr. E. Jacobs
Diagonalization of Matrices Dr. E. Jacobs One of the very interesting lessons in this course is how certain algebraic techniques can be use to solve ifferential equations. The purpose of these notes is
More informationThe derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)
Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)
More informationMath 1271 Solutions for Fall 2005 Final Exam
Math 7 Solutions for Fall 5 Final Eam ) Since the equation + y = e y cannot be rearrange algebraically in orer to write y as an eplicit function of, we must instea ifferentiate this relation implicitly
More informationAssignment 1. g i (x 1,..., x n ) dx i = 0. i=1
Assignment 1 Golstein 1.4 The equations of motion for the rolling isk are special cases of general linear ifferential equations of constraint of the form g i (x 1,..., x n x i = 0. i=1 A constraint conition
More informationOne-dimensional I test and direction vector I test with array references by induction variable
Int. J. High Performance Computing an Networking, Vol. 3, No. 4, 2005 219 One-imensional I test an irection vector I test with array references by inuction variable Minyi Guo School of Computer Science
More informationSome vector algebra and the generalized chain rule Ross Bannister Data Assimilation Research Centre, University of Reading, UK Last updated 10/06/10
Some vector algebra an the generalize chain rule Ross Bannister Data Assimilation Research Centre University of Reaing UK Last upate 10/06/10 1. Introuction an notation As we shall see in these notes the
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More informationMath 1B, lecture 8: Integration by parts
Math B, lecture 8: Integration by parts Nathan Pflueger 23 September 2 Introuction Integration by parts, similarly to integration by substitution, reverses a well-known technique of ifferentiation an explores
More informationApplications of the Wronskian to ordinary linear differential equations
Physics 116C Fall 2011 Applications of the Wronskian to orinary linear ifferential equations Consier a of n continuous functions y i (x) [i = 1,2,3,...,n], each of which is ifferentiable at least n times.
More information4.2 First Differentiation Rules; Leibniz Notation
.. FIRST DIFFERENTIATION RULES; LEIBNIZ NOTATION 307. First Differentiation Rules; Leibniz Notation In this section we erive rules which let us quickly compute the erivative function f (x) for any polynomial
More informationNotes on Lie Groups, Lie algebras, and the Exponentiation Map Mitchell Faulk
Notes on Lie Groups, Lie algebras, an the Exponentiation Map Mitchell Faulk 1. Preliminaries. In these notes, we concern ourselves with special objects calle matrix Lie groups an their corresponing Lie
More informationREAL ANALYSIS I HOMEWORK 5
REAL ANALYSIS I HOMEWORK 5 CİHAN BAHRAN The questions are from Stein an Shakarchi s text, Chapter 3. 1. Suppose ϕ is an integrable function on R with R ϕ(x)x = 1. Let K δ(x) = δ ϕ(x/δ), δ > 0. (a) Prove
More information6 General properties of an autonomous system of two first order ODE
6 General properties of an autonomous system of two first orer ODE Here we embark on stuying the autonomous system of two first orer ifferential equations of the form ẋ 1 = f 1 (, x 2 ), ẋ 2 = f 2 (, x
More informationALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an
More informationSwitching Time Optimization in Discretized Hybrid Dynamical Systems
Switching Time Optimization in Discretize Hybri Dynamical Systems Kathrin Flaßkamp, To Murphey, an Sina Ober-Blöbaum Abstract Switching time optimization (STO) arises in systems that have a finite set
More informationPermanent vs. Determinant
Permanent vs. Determinant Frank Ban Introuction A major problem in theoretical computer science is the Permanent vs. Determinant problem. It asks: given an n by n matrix of ineterminates A = (a i,j ) an
More informationCalculus of Variations
16.323 Lecture 5 Calculus of Variations Calculus of Variations Most books cover this material well, but Kirk Chapter 4 oes a particularly nice job. x(t) x* x*+ αδx (1) x*- αδx (1) αδx (1) αδx (1) t f t
More informationChapter 6: Energy-Momentum Tensors
49 Chapter 6: Energy-Momentum Tensors This chapter outlines the general theory of energy an momentum conservation in terms of energy-momentum tensors, then applies these ieas to the case of Bohm's moel.
More informationIntroduction to Markov Processes
Introuction to Markov Processes Connexions moule m44014 Zzis law Gustav) Meglicki, Jr Office of the VP for Information Technology Iniana University RCS: Section-2.tex,v 1.24 2012/12/21 18:03:08 gustav
More informationSurvey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013
Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing
More informationd dx But have you ever seen a derivation of these results? We ll prove the first result below. cos h 1
Lecture 5 Some ifferentiation rules Trigonometric functions (Relevant section from Stewart, Seventh Eition: Section 3.3) You all know that sin = cos cos = sin. () But have you ever seen a erivation of
More informationInterconnected Systems of Fliess Operators
Interconnecte Systems of Fliess Operators W. Steven Gray Yaqin Li Department of Electrical an Computer Engineering Ol Dominion University Norfolk, Virginia 23529 USA Abstract Given two analytic nonlinear
More informationLagrangian and Hamiltonian Mechanics
Lagrangian an Hamiltonian Mechanics.G. Simpson, Ph.. epartment of Physical Sciences an Engineering Prince George s Community College ecember 5, 007 Introuction In this course we have been stuying classical
More informationThe Exact Form and General Integrating Factors
7 The Exact Form an General Integrating Factors In the previous chapters, we ve seen how separable an linear ifferential equations can be solve using methos for converting them to forms that can be easily
More informationRobust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k
A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine
More informationLecture 2 Lagrangian formulation of classical mechanics Mechanics
Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,
More informationLinear and quadratic approximation
Linear an quaratic approximation November 11, 2013 Definition: Suppose f is a function that is ifferentiable on an interval I containing the point a. The linear approximation to f at a is the linear function
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationSYNCHRONOUS SEQUENTIAL CIRCUITS
CHAPTER SYNCHRONOUS SEUENTIAL CIRCUITS Registers an counters, two very common synchronous sequential circuits, are introuce in this chapter. Register is a igital circuit for storing information. Contents
More informationLeast-Squares Regression on Sparse Spaces
Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction
More informationRobustness and Perturbations of Minimal Bases
Robustness an Perturbations of Minimal Bases Paul Van Dooren an Froilán M Dopico December 9, 2016 Abstract Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important
More informationSeparation of Variables
Physics 342 Lecture 1 Separation of Variables Lecture 1 Physics 342 Quantum Mechanics I Monay, January 25th, 2010 There are three basic mathematical tools we nee, an then we can begin working on the physical
More informationMake graph of g by adding c to the y-values. on the graph of f by c. multiplying the y-values. even-degree polynomial. graph goes up on both sides
Reference 1: Transformations of Graphs an En Behavior of Polynomial Graphs Transformations of graphs aitive constant constant on the outsie g(x) = + c Make graph of g by aing c to the y-values on the graph
More informationSimilar Operators and a Functional Calculus for the First-Order Linear Differential Operator
Avances in Applie Mathematics, 9 47 999 Article ID aama.998.067, available online at http: www.iealibrary.com on Similar Operators an a Functional Calculus for the First-Orer Linear Differential Operator
More informationFLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction
FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number
More informationFinal Exam Study Guide and Practice Problems Solutions
Final Exam Stuy Guie an Practice Problems Solutions Note: These problems are just some of the types of problems that might appear on the exam. However, to fully prepare for the exam, in aition to making
More informationOptimization of Geometries by Energy Minimization
Optimization of Geometries by Energy Minimization by Tracy P. Hamilton Department of Chemistry University of Alabama at Birmingham Birmingham, AL 3594-140 hamilton@uab.eu Copyright Tracy P. Hamilton, 1997.
More informationHyperbolic Moment Equations Using Quadrature-Based Projection Methods
Hyperbolic Moment Equations Using Quarature-Base Projection Methos J. Koellermeier an M. Torrilhon Department of Mathematics, RWTH Aachen University, Aachen, Germany Abstract. Kinetic equations like the
More information'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21
Large amping in a structural material may be either esirable or unesirable, epening on the engineering application at han. For example, amping is a esirable property to the esigner concerne with limiting
More informationWhy Bernstein Polynomials Are Better: Fuzzy-Inspired Justification
Why Bernstein Polynomials Are Better: Fuzzy-Inspire Justification Jaime Nava 1, Olga Kosheleva 2, an Vlaik Kreinovich 3 1,3 Department of Computer Science 2 Department of Teacher Eucation University of
More information7.1 Support Vector Machine
67577 Intro. to Machine Learning Fall semester, 006/7 Lecture 7: Support Vector Machines an Kernel Functions II Lecturer: Amnon Shashua Scribe: Amnon Shashua 7. Support Vector Machine We return now to
More informationTractability results for weighted Banach spaces of smooth functions
Tractability results for weighte Banach spaces of smooth functions Markus Weimar Mathematisches Institut, Universität Jena Ernst-Abbe-Platz 2, 07740 Jena, Germany email: markus.weimar@uni-jena.e March
More informationON THE OPTIMALITY SYSTEM FOR A 1 D EULER FLOW PROBLEM
ON THE OPTIMALITY SYSTEM FOR A D EULER FLOW PROBLEM Eugene M. Cliff Matthias Heinkenschloss y Ajit R. Shenoy z Interisciplinary Center for Applie Mathematics Virginia Tech Blacksburg, Virginia 46 Abstract
More informationII. First variation of functionals
II. First variation of functionals The erivative of a function being zero is a necessary conition for the etremum of that function in orinary calculus. Let us now tackle the question of the equivalent
More informationLIAISON OF MONOMIAL IDEALS
LIAISON OF MONOMIAL IDEALS CRAIG HUNEKE AND BERND ULRICH Abstract. We give a simple algorithm to ecie whether a monomial ieal of nite colength in a polynomial ring is licci, i.e., in the linkage class
More information11.7. Implicit Differentiation. Introduction. Prerequisites. Learning Outcomes
Implicit Differentiation 11.7 Introuction This Section introuces implicit ifferentiation which is use to ifferentiate functions expresse in implicit form (where the variables are foun together). Examples
More informationVectors in two dimensions
Vectors in two imensions Until now, we have been working in one imension only The main reason for this is to become familiar with the main physical ieas like Newton s secon law, without the aitional complication
More informationAcute sets in Euclidean spaces
Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of
More information2Algebraic ONLINE PAGE PROOFS. foundations
Algebraic founations. Kick off with CAS. Algebraic skills.3 Pascal s triangle an binomial expansions.4 The binomial theorem.5 Sets of real numbers.6 Surs.7 Review . Kick off with CAS Playing lotto Using
More informationSturm-Liouville Theory
LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory
More information1 dx. where is a large constant, i.e., 1, (7.6) and Px is of the order of unity. Indeed, if px is given by (7.5), the inequality (7.
Lectures Nine an Ten The WKB Approximation The WKB metho is a powerful tool to obtain solutions for many physical problems It is generally applicable to problems of wave propagation in which the frequency
More informationu!i = a T u = 0. Then S satisfies
Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace
More informationModelling and simulation of dependence structures in nonlife insurance with Bernstein copulas
Moelling an simulation of epenence structures in nonlife insurance with Bernstein copulas Prof. Dr. Dietmar Pfeifer Dept. of Mathematics, University of Olenburg an AON Benfiel, Hamburg Dr. Doreen Straßburger
More informationPolynomial Inclusion Functions
Polynomial Inclusion Functions E. e Weert, E. van Kampen, Q. P. Chu, an J. A. Muler Delft University of Technology, Faculty of Aerospace Engineering, Control an Simulation Division E.eWeert@TUDelft.nl
More informationChapter 2 Lagrangian Modeling
Chapter 2 Lagrangian Moeling The basic laws of physics are use to moel every system whether it is electrical, mechanical, hyraulic, or any other energy omain. In mechanics, Newton s laws of motion provie
More informationMath 115 Section 018 Course Note
Course Note 1 General Functions Definition 1.1. A function is a rule that takes certain numbers as inputs an assigns to each a efinite output number. The set of all input numbers is calle the omain of
More informationSchrödinger s equation.
Physics 342 Lecture 5 Schröinger s Equation Lecture 5 Physics 342 Quantum Mechanics I Wenesay, February 3r, 2010 Toay we iscuss Schröinger s equation an show that it supports the basic interpretation of
More informationOptimal CDMA Signatures: A Finite-Step Approach
Optimal CDMA Signatures: A Finite-Step Approach Joel A. Tropp Inst. for Comp. Engr. an Sci. (ICES) 1 University Station C000 Austin, TX 7871 jtropp@ices.utexas.eu Inerjit. S. Dhillon Dept. of Comp. Sci.
More informationIterated Point-Line Configurations Grow Doubly-Exponentially
Iterate Point-Line Configurations Grow Doubly-Exponentially Joshua Cooper an Mark Walters July 9, 008 Abstract Begin with a set of four points in the real plane in general position. A to this collection
More informationTwo formulas for the Euler ϕ-function
Two formulas for the Euler ϕ-function Robert Frieman A multiplication formula for ϕ(n) The first formula we want to prove is the following: Theorem 1. If n 1 an n 2 are relatively prime positive integers,
More informationCalculus and optimization
Calculus an optimization These notes essentially correspon to mathematical appenix 2 in the text. 1 Functions of a single variable Now that we have e ne functions we turn our attention to calculus. A function
More informationLectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs
Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent
More informationA. Incorrect! The letter t does not appear in the expression of the given integral
AP Physics C - Problem Drill 1: The Funamental Theorem of Calculus Question No. 1 of 1 Instruction: (1) Rea the problem statement an answer choices carefully () Work the problems on paper as neee (3) Question
More informationLecture 6: Calculus. In Song Kim. September 7, 2011
Lecture 6: Calculus In Song Kim September 7, 20 Introuction to Differential Calculus In our previous lecture we came up with several ways to analyze functions. We saw previously that the slope of a linear
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite
More informationarxiv: v1 [math.mg] 10 Apr 2018
ON THE VOLUME BOUND IN THE DVORETZKY ROGERS LEMMA FERENC FODOR, MÁRTON NASZÓDI, AND TAMÁS ZARNÓCZ arxiv:1804.03444v1 [math.mg] 10 Apr 2018 Abstract. The classical Dvoretzky Rogers lemma provies a eterministic
More informationIPA Derivatives for Make-to-Stock Production-Inventory Systems With Backorders Under the (R,r) Policy
IPA Derivatives for Make-to-Stock Prouction-Inventory Systems With Backorers Uner the (Rr) Policy Yihong Fan a Benamin Melame b Yao Zhao c Yorai Wari Abstract This paper aresses Infinitesimal Perturbation
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationStable and compact finite difference schemes
Center for Turbulence Research Annual Research Briefs 2006 2 Stable an compact finite ifference schemes By K. Mattsson, M. Svär AND M. Shoeybi. Motivation an objectives Compact secon erivatives have long
More informationCounting Lattice Points in Polytopes: The Ehrhart Theory
3 Counting Lattice Points in Polytopes: The Ehrhart Theory Ubi materia, ibi geometria. Johannes Kepler (1571 1630) Given the profusion of examples that gave rise to the polynomial behavior of the integer-point
More informationQF101: Quantitative Finance September 5, Week 3: Derivatives. Facilitator: Christopher Ting AY 2017/2018. f ( x + ) f(x) f(x) = lim
QF101: Quantitative Finance September 5, 2017 Week 3: Derivatives Facilitator: Christopher Ting AY 2017/2018 I recoil with ismay an horror at this lamentable plague of functions which o not have erivatives.
More informationTMA 4195 Matematisk modellering Exam Tuesday December 16, :00 13:00 Problems and solution with additional comments
Problem F U L W D g m 3 2 s 2 0 0 0 0 2 kg 0 0 0 0 0 0 Table : Dimension matrix TMA 495 Matematisk moellering Exam Tuesay December 6, 2008 09:00 3:00 Problems an solution with aitional comments The necessary
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationELEC3114 Control Systems 1
ELEC34 Control Systems Linear Systems - Moelling - Some Issues Session 2, 2007 Introuction Linear systems may be represente in a number of ifferent ways. Figure shows the relationship between various representations.
More information1 Math 285 Homework Problem List for S2016
1 Math 85 Homework Problem List for S016 Note: solutions to Lawler Problems will appear after all of the Lecture Note Solutions. 1.1 Homework 1. Due Friay, April 8, 016 Look at from lecture note exercises:
More informationDiscrete Mathematics
Discrete Mathematics 309 (009) 86 869 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/isc Profile vectors in the lattice of subspaces Dániel Gerbner
More informationPDE Notes, Lecture #11
PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =
More informationA FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS
A FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS TODD COCHRANE, JEREMY COFFELT, AND CHRISTOPHER PINNER 1. Introuction For a prime p, integer Laurent polynomial (1.1) f(x) = a 1 x k 1 + + a r
More informationAccelerate Implementation of Forwaring Control Laws using Composition Methos Yves Moreau an Roolphe Sepulchre June 1997 Abstract We use a metho of int
Katholieke Universiteit Leuven Departement Elektrotechniek ESAT-SISTA/TR 1997-11 Accelerate Implementation of Forwaring Control Laws using Composition Methos 1 Yves Moreau, Roolphe Sepulchre, Joos Vanewalle
More informationThe total derivative. Chapter Lagrangian and Eulerian approaches
Chapter 5 The total erivative 51 Lagrangian an Eulerian approaches The representation of a flui through scalar or vector fiels means that each physical quantity uner consieration is escribe as a function
More informationChapter 2 Derivatives
Chapter Derivatives Section. An Intuitive Introuction to Derivatives Consier a function: Slope function: Derivative, f ' For each, the slope of f is the height of f ' Where f has a horizontal tangent line,
More informationTRAJECTORY TRACKING FOR FULLY ACTUATED MECHANICAL SYSTEMS
TRAJECTORY TRACKING FOR FULLY ACTUATED MECHANICAL SYSTEMS Francesco Bullo Richar M. Murray Control an Dynamical Systems California Institute of Technology Pasaena, CA 91125 Fax : + 1-818-796-8914 email
More information23 Implicit differentiation
23 Implicit ifferentiation 23.1 Statement The equation y = x 2 + 3x + 1 expresses a relationship between the quantities x an y. If a value of x is given, then a corresponing value of y is etermine. For
More informationCalculus of Variations
Calculus of Variations Lagrangian formalism is the main tool of theoretical classical mechanics. Calculus of Variations is a part of Mathematics which Lagrangian formalism is base on. In this section,
More informationQuantum Mechanics in Three Dimensions
Physics 342 Lecture 20 Quantum Mechanics in Three Dimensions Lecture 20 Physics 342 Quantum Mechanics I Monay, March 24th, 2008 We begin our spherical solutions with the simplest possible case zero potential.
More informationThermal conductivity of graded composites: Numerical simulations and an effective medium approximation
JOURNAL OF MATERIALS SCIENCE 34 (999)5497 5503 Thermal conuctivity of grae composites: Numerical simulations an an effective meium approximation P. M. HUI Department of Physics, The Chinese University
More informationarxiv: v1 [math-ph] 5 May 2014
DIFFERENTIAL-ALGEBRAIC SOLUTIONS OF THE HEAT EQUATION VICTOR M. BUCHSTABER, ELENA YU. NETAY arxiv:1405.0926v1 [math-ph] 5 May 2014 Abstract. In this work we introuce the notion of ifferential-algebraic
More informationDifferentiability, Computing Derivatives, Trig Review. Goals:
Secants vs. Derivatives - Unit #3 : Goals: Differentiability, Computing Derivatives, Trig Review Determine when a function is ifferentiable at a point Relate the erivative graph to the the graph of an
More information