advanced functions part 2

... CustomPropertyToolPart = New CustomPropertyToolPart toolParts(0) = objWebToolPart toolParts(1) = objCustomProperty 20 1 5750_c07_final.qxd 20 2 11/3/05 9:40 PM Page 20 2 CHAPTER ■ ADVANCED WEB PART DEVELOPMENT ... objWebToolPart toolParts(1) = objCustomProperty 'This is where we add our tool part toolParts (2) = New Tool Return toolParts End Function 22 7 5750_c07_final.qxd 22 8 11/3/05 9:40 PM Page 22 8 CHAPTER ■ ADVANCED ... toolParts(3) As ToolPart Dim objWebToolPart As WebPartToolPart = New WebPartToolPart Dim objCustomProperty As CustomPropertyToolPart = New CustomPropertyToolPart toolParts(0) = objWebToolPart...

Ngày tải lên: 05/10/2013, 14:20

... external signals to the module I/O arguments in a task are used to pass values to and from the task 8 .2. 2 Task Examples We discuss two examples of tasks The first example illustrates the use of input ... in the module task asymmetric_sequence; begin # 12 clock = 1'b0; #5 clock = 1'b1; #3 clock = 1'b0; #10 clock = 1'b1; end endtask endmodule 8 .2. 3 Automatic (Re-entrant) Tasks Tasks are normally ... variables in the task invocation statement when the task is completed Tasks can invoke other tasks or functions Although the keywords input, inout, and output used for I/O arguments in a task are the...

Ngày tải lên: 24/10/2013, 15:15

... defined below //Result of clogb2 = //input [7:0] addr_bus; //Constant function function integer clogb2(input integer depth); begin for(clogb2=0; depth >0; clogb2=clogb2+1) depth = depth >> 1; end ... 8.3.5 Signed Functions Signed functions allow signed operations to be performed on the function return values Example 8- 12 shows an example of a signed function Example 8- 12 Signed Functions module ... %0d", result); //Displays 24 end endmodule 8.3.4 Constant Functions A constant function[1] is a regular Verilog HDL function, but with certain restrictions These functions can be used to reference...

Ngày tải lên: 24/10/2013, 15:15

... IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0- 521 -43108-5) Copyright (C) 1988-19 92 by Cambridge University Press.Programs Copyright (C) 1988-19 92 by Numerical Recipes Software Permission is granted ... Computations (Englewood Cliffs, NJ: Prentice-Hall), §5 .2, p 89 [1] Davis, P., and Rabinowitz, P 1984, Methods of Numerical Integration, 2nd ed (Orlando, FL: Academic Press) 4.1 Classical Formulas ... Numerical Recipes books,diskettes, or CDROMs visit website http://www.nr.com or call 1-800-8 72- 7 423 (North America only),or send email to trade@cup.cam.ac.uk (outside North America) of various...

Ngày tải lên: 07/11/2013, 19:15

... Abscissas 133 x1 f(x)dx = h[f1 ] + O(h2 f ) (4.1.7) x0 x1 f(x)dx = h f1 − f2 2 f(x)dx = h 16 23 f1 − f2 + f3 12 12 12 f(x)dx = h 59 37 55 f1 − f2 + f3 − f4 24 24 24 24 x0 x1 x0 x1 x0 + O(h3 f ) (4.1.8) ... f(x)dx = h x1 3 f2 + f3 + f4 + · · ·+ fN 2 + fN−1 2 +O N2 (4.1.15) Equations (4.1.8) and (4.1. 12) give xN f(x)dx = h x1 23 f2 + f3 + f4 + f5 + 12 12 23 · · · + fN−3 + fN 2 + fN−1 12 12 +O N3 (4.1.16) ... = h x1 23 f2 + f3 + f4 + f5 + 12 12 13 · · · + fN 2 + fN−1 + fN 12 12 +O N3 (4.1 .20 ) CITED REFERENCES AND FURTHER READING: Abramowitz, M., and Stegun, I.A 1964, Handbook of Mathematical Functions, ...

Ngày tải lên: 07/11/2013, 19:15

... http://www.nr.com or call 1-800-8 72- 7 423 (North America only),or send email to trade@cup.cam.ac.uk (outside North America) B 396 Chapter 10 Minimization or Maximization of Functions We now turn to the ... IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0- 521 -43108-5) Copyright (C) 1988-19 92 by Cambridge University Press.Programs Copyright (C) 1988-19 92 by Numerical Recipes Software Permission is granted ... IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0- 521 -43108-5) Copyright (C) 1988-19 92 by Cambridge University Press.Programs Copyright (C) 1988-19 92 by Numerical Recipes Software Permission is granted...

Ngày tải lên: 15/12/2013, 04:15

... (fabs(x3-x0) > tol*(fabs(x1)+fabs(x2))) { at the original endpoints if (f2 < f1) { One possible outcome, SHFT3(x0,x1,x2,R*x1+C*x3) its housekeeping, SHFT2(f1,f2,(*f)(x2)) and a new function evaluation ... evaluation } else { The other outcome, SHFT3(x3,x2,x1,R*x2+C*x0) SHFT2(f2,f1,(*f)(x1)) and its new function evaluation } } Back to see if we are done if (f1 < f2) { We are done Output the best of the ... returned function value { float f1,f2,x0,x1,x2,x3; Sample page from NUMERICAL RECIPES IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0- 521 -43108-5) Copyright (C) 1988-19 92 by Cambridge University Press.Programs...

Ngày tải lên: 15/12/2013, 04:15

... equation (10.1 .2) (iii) The scheme for detecting a cooperative versus noncooperative function must be very robust Brent’s method [1] is up to the task in all particulars At any particular stage, ... IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0- 521 -43108-5) Copyright (C) 1988-19 92 by Cambridge University Press.Programs Copyright (C) 1988-19 92 by Numerical Recipes Software Permission is granted ... http://www.nr.com or call 1-800-8 72- 7 423 (North America only),or send email to trade@cup.cam.ac.uk (outside North America) 404 Chapter 10 Minimization or Maximization of Functions #include ...

Ngày tải lên: 15/12/2013, 04:15

... derivative at x: u1=x+d1; u2=x+d2; ok1 = (a-u1)*(u1-b) > 0.0 && dx*d1 0.0 && dx*d2

Ngày tải lên: 15/12/2013, 04:15

... = y[1]>y [2] ? (inhi =2, 1) : (inhi=1 ,2) ; for (i=1;i y[inhi] && i != ihi) inhi=i; } rtol =2. 0*fabs(y[ihi]-y[ilo])/(fabs(y[ihi])+fabs(y[ilo])+TINY); ... http://www.nr.com or call 1-800-8 72- 7 423 (North America only),or send email to trade@cup.cam.ac.uk (outside North America) reflection 410 Chapter 10 Minimization or Maximization of Functions Pi = P0 + λei ... IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0- 521 -43108-5) Copyright (C) 1988-19 92 by Cambridge University Press.Programs Copyright (C) 1988-19 92 by Numerical Recipes Software Permission is granted...

Ngày tải lên: 15/12/2013, 04:15

... Mathematical Association of America), pp 464–467 [2] Jacobs, D.A.H (ed.) 1977, The State of the Art in Numerical Analysis (London: Academic Press), pp 25 9 26 2 ... (10.5.1) x·A·x ≈ c − b·x + where c ≡ f(P) b ≡ − f|P [A]ij ≡ ∂ 2f ∂xi ∂xj P (10.5 .2) The matrix A whose components are the second partial derivative matrix of the function is called the Hessian ... IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0- 521 -43108-5) Copyright (C) 1988-19 92 by Cambridge University Press.Programs Copyright (C) 1988-19 92 by Numerical Recipes Software Permission is granted...

Ngày tải lên: 15/12/2013, 04:15

... Summation Formula, xN f(x)dx = h x1 1 f1 + f2 + f3 + · · · + fN−1 + fN 2 B2 h2 B2k h2k (2k−1) (2k−1) (fN − f1 ) − · · · − (f − − f1 ) −··· 2! (2k)! N (4 .2. 1) Here B2k is a Bernoulli number, defined by ... −1 e n! n=0 (4 .2. 2) with the first few even values (odd values vanish except for B1 = −1 /2) B0 = B8 = − B2 = 30 B10 = B4 = − 66 30 B6 = B 12 = − 42 691 27 30 (4 .2. 3) Equation (4 .2. 1) is not a convergent ... numbers become very large, e.g., B50 = 49505 720 524 107964 821 2477 525 66 The key point is that only even powers of h occur in the error series of (4 .2. 1) This fact is not, in general, shared by...

Ngày tải lên: 15/12/2013, 04:15

... Cliffs, NJ: Prentice-Hall), §§7.4.1–7.4 .2 Ralston, A., and Rabinowitz, P 1978, A First Course in Numerical Analysis, 2nd ed (New York: McGraw-Hill), §4.10 2 4.4 Improper Integrals For our present ... IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0- 521 -43108-5) Copyright (C) 1988-19 92 by Cambridge University Press.Programs Copyright (C) 1988-19 92 by Numerical Recipes Software Permission is granted ... takes many, many fewer function evaluations than either of the routines in §4 .2 For example, the integral x4 log(x + x2 + 1)dx converges (with parameters as shown above) on the very first extrapolation,...

Ngày tải lên: 15/12/2013, 04:15

... call 1-800-8 72- 7 423 (North America only),or send email to trade@cup.cam.ac.uk (outside North America) B2 h2 (fN − f1 ) + · · · B2k h2k (2k−1) (2k−1) (1 − 2 2k+1 )(fN − f1 ) +··· + (2k)! + 4.4 Improper ... f(x)dx = h[f3 /2 + f5 /2 + f7 /2 + · · · + fN−3 /2 + fN−1 /2 ] x1 (4.4.1) This equation can be derived by writing out (4 .2. 1) with stepsize h, then writing it out again with stepsize h /2, then subtracting ... and (4.4.4) are particularly simple in the case of inverse square-root singularities, a case that occurs frequently in practice: √ b−a b 2tf(a + t2 )dt (b > a) (4.4.5) 2tf(b − t2 )dt f(x)dx =...

Ngày tải lên: 15/12/2013, 04:15

... are given by cj = 2( j + 1)(j + α + β + 1)(2j + α + β) dj = (2j + α + β + 1)( 2 − β ) ej = (2j + α + β)(2j + α + β + 1)(2j + α + β + 2) (4.5.15) fj = 2( j + α)(j + β)(2j + α + β + 2) We now give individual ... abscissas and weights 0.67940956 82, 0.8650633666,0.973906 528 5}; First value of each array static float w[]={0.0,0 .29 5 524 224 7,0 .26 926 67193, not used 0 .21 90863 625 ,0.1494513491,0.0666713443}; xm=0.5*(b+a); ... the p3=p2; Jacobi polynomial evaluated at z p2=p1; temp =2* j+alfbet; a =2* j*(j+alfbet)*(temp -2. 0); b=(temp-1.0)*(alf*alf-bet*bet+temp*(temp -2. 0)*z); c =2. 0*(j-1+alf)*(j-1+bet)*temp; p1=(b*p2-c*p3)/a;...

Ngày tải lên: 15/12/2013, 04:15

... limits x1, x2, and by the user-supplied functions yy1, yy2, z1, and z2, as defined in (4.6 .2) (The functions y1 and y2 are here called yy1 and yy2 to avoid conflict with the names of Bessel functions ... words, find the numbers x1 and x2 , and the functions y1 (x), y2 (x), z1 (x, y), and z2 (x, y) such that I≡ dx dy dzf(x, y, z) x2 y2 (x) dx = x1 y1 (x) (4.6 .2) z2 (x,y) dy dz f(x, y, z) z1 (x,y) ... qgaus(f1,x1,x2); } float f1(float x) This is H of eq (4.6.5) { float qgaus(float (*func)(float), float a, float b); float f2(float y); float yy1(float),yy2(float); xsav=x; return qgaus(f2,yy1(x),yy2(x));...

Ngày tải lên: 15/12/2013, 04:15

Ngày tải lên: 15/12/2013, 04:15

... b0 + a1 b1 + a2 b2 + b3 + (5 .2. 1) a3 a4 a5 b4 + b5 +··· Printers prefer to write this as f(x) = b0 + a1 a2 a3 a4 a5 ··· b1 + b2 + b3 + b4 + b5 + (5 .2. 2) In either (5 .2. 1) or (5 .2. 2), the a’s and ... even) is ∞ ∞ (−1)s us = u0 − u1 + u2 − un−1 + s=0 s=0 (−1)s s [∆ un ] 2s+1 (5.1.5) ∆un ≡ un+1 − un 2 un ≡ un +2 − 2un+1 + un (5.1.6) ∆3 un ≡ un+3 − 3un +2 + 3un+1 − un etc Of course you don’t ... Methods of Physics, 2nd ed (Reading, MA: W.A Benjamin/Addison-Wesley), 2. 3 [2] 5 .2 Evaluation of Continued Fractions Continued fractions are often powerful ways of evaluating functions that occur...

Ngày tải lên: 15/12/2013, 04:15

... tolerable In our example, with x = (2 )2 , the first term smaller than 10−7 is x13 / (27 !) This then approximates the error of the finite series whose last term is x 12 / (25 !) Notice that because of the ... might be doing a problem that requires evaluating the series many times in some particular interval, say [0, (2 )2 ] Everything is fine, except that the series requires a large number of terms ... IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0- 521 -43108-5) Copyright (C) 1988-19 92 by Cambridge University Press.Programs Copyright (C) 1988-19 92 by Numerical Recipes Software Permission is granted...

Ngày tải lên: 15/12/2013, 04:15

... xk = Tk (x) + 2k−1 k Tk 2 (x) + k Tk−4 (x) + · · · (5.11 .2) where the last term depends on whether k is even or odd, ··· + k T1 (x) (k odd), (k − 1) /2 ··· + k T0 (x) (k even) k /2 (5.11.3) void ... http://www.nr.com or call 1-800-8 72- 7 423 (North America only),or send email to trade@cup.cam.ac.uk (outside North America) pcshft(a,b,d,n) 20 0 Chapter Evaluation of Functions #define NFEW #define ... 1-800-8 72- 7 423 (North America only),or send email to trade@cup.cam.ac.uk (outside North America) c=vector(0,NMANY-1); d=vector(0,NFEW-1); e=vector(0,NMANY-1); pcshft(( -2. 0-b-a)/(b-a), (2. 0-b-a)/(b-a),e,NMANY);...

Ngày tải lên: 15/12/2013, 04:15