Improved Fourier transform methods for solving the parabolic wave equation
|
|
- Felicity Whitehead
- 5 years ago
- Views:
Transcription
1 RADIO SCIECE, VOL. 37, O., 11, 1.19/1RS488, Improved Fourier transform methods for solving the parabolic wave equation James R. Kuttler Johns Hopkins Applied Physics Laboratory, Laurel, Maryland, USA Ramakrishna Janaswamy 1 aval Postgraduate School, Monterey, California, USA Received May 1; revised September 1; accepted September 1; published 1 March. [1] A standard method for modeling electromagnetic propagation in the troposphere is the Fourier split-step algorithm for solving the parabolic wave equation. An important advance in this technique was the introduction of the mixed Fourier transform, which permitted the extension of the method from propagation over only smooth perfectly conducting surfaces to quite general surfaces with impedance boundary conditions. This paper describes improvements in the implementation of the mixed Fourier transform, which make the method more robust and efficient and avoid potential numerical instabilities, which occasionally caused problems in the previous implementation. Some examples are also presented. IDEX TERMS 644 Electromagnetics umerical methods; 689 Electromagnetics Wave propagation (475); 694 Radio Science Atmospheric propagation; 6964 Radio Science Radio wave propagation 1. Introduction [] The parabolic approximation/fourier split-step algorithm [Ko et al., 1983; Dockery, 1988] is a powerful method for modeling electromagnetic propagation through inhomogeneous atmosphere and above the surface of the Earth, which may have large- and small-scale roughness plus various dielectric properties. Assuming azimuthal symmetry, Maxwell s equations can be reduced to a two-dimensional scalar Helmholtz equation for the transverse component of either the electric field or the magnetic field, depending on whether the polarization is horizontal or vertical, respectively. The Helmholtz equation is then factored into forward and backward propagating pieces, and only the forward propagating part is used. This is a parabolic wave equation, which is solved by marching over range steps. At each step the field component at range x + Dx is obtained from the field component at range x by the action of an operator which is split into a product of three operators (hence the name split-step ), uxþ ð DxÞ ¼ ABAuðÞ x 1 ow at University of Massachusetts, Amherst, Massachusetts, USA. Copyright by the American Geophysical Union //1RS The symmetrically split out A operators account for all of the atmospheric variation and large-scale surface roughness, while the central B operator propagates the field as though in a vacuum above a horizontal impedance plane [Kuttler, 1999] and is the object of interest here. [3] The action of the B operator is implemented by Fourier transform methods. An important advance in this technique was the introduction of the mixed Fourier transform [Kuttler and Dockery, 1991]. This has permitted the extension of the split-step method from propagation over only smooth perfectly conducting surfaces to surfaces satisfying impedance boundary conditions. The split-step approach has also been extended to general terrain problems [Donohue and Kuttler, ]. [4] The algorithms used to implement the mixed Fourier transform have been improved in the years since its introduction to make it faster and more robust [Dockery and Kuttler, 1996]. However, certain combinations of parameters can occasionally cause numerical instabilities in the method. This paper will give some examples of the occurence of these instabilities and present some new algorithms for implementing the mixed Fourier transform, which will overcome these numerical problems and also speed up the method. These algorithms will be referred to as the forward difference and the backward difference methods for the
2 5 - KUTTLER AD JAASWAMY IMPROVED FOURIER TRASFORM METHODS mixed Fourier transform, and they are most effective when employed in complement to each other.. Mixed Fourier Transform (MFT) [5] The function u(z), which is to be decomposed by Fourier transform methods, is defined on z < 1, obeys the requirement that u(z)! asz!1, and satisfies the impedance boundary condition du þ a u ¼ z ¼ ; ð1þ where a is a given complex constant. Introduce the auxillary function wz ðþ¼ duðþ z þ a uz ðþ z 1 ðþ ote that w(z)! asz!1also and w vanishes at z =. ow consider the Fourier sine transform of w, UðpÞ ¼ wz ðþsin pz ð3þ Putting () into (3) and integrating by parts, it can be seen that UðpÞ ¼ uz ðþa ½ sin pz p cos pzš; which is called the mixed Fourier transform (MFT) of u for obvious reasons. [6] To invert this transform, first invert the sine transform (3) to get wz ðþ¼ p UðpÞ sin pz dp ext recover u from w by solving the differential equation (). This leads to uz ðþ¼ p a sin pz p cos pz UðpÞ a þ p dp ð4þ This is the inverse of the MFT when Re (a) <. However, when Re (a) >, there is a homogeneous solution Ke -a z of () which must be added to (4). Then the inverse of the MFT for Re (a) >is uðzþ ¼K e az þ p Uð pþ a sin pz p cos pz a þ p dp ð5þ To determine the constant K, multiply both sides of (5) by e a z and integrate over z < 1 to see that K ¼ a where the orthogonality relation uz ðþe a z ; e az ½a sin pz p cos pzš ¼ ð6þ was used. In radio frequency propagation, generally, Re (a) > for vertical polarization (v-pol) and Re (a)< for horizontal polarization (h-pol). 3. Discrete Mixed Fourier Transform (DMFT) [7] The earliest method used to numerically implement the MFT sampled the function u(z) at points n, n =, and used discrete sine and cosine transforms to give the approximation UðjdpÞ ¼ X j ¼ ; uðn Þ a sin p jn p jn jdp cos where dp = p/ and the prime on the sum means that the first and last values are to be weighted with factor 1/. The inverse is uðnþ ¼ Ke a n þ X uðjþ j¼ n ¼ ; where K ¼ a X p jn a sin jdp cos p jn a þ ðjdpþ e an uðnþ [8] An attempt at introducing an auxiliary function w(n) satisfying an analog of (), so that only a sine transform needs to be used in the algorithm, was unsuccessful because the solution of the difference equation was numerically unstable. It was also eventually discovered that the naive implementation of the DMFT described above could be numerically unstable if Re (a) became small, so that the term a + p for p Im (a). The cause of this instability was believed to be the loss of an orthogonality condition analogous to (6) between e an and the discrete functions
3 KUTTLER AD JAASWAMY IMPROVED FOURIER TRASFORM METHODS 5-3 a sin p jn p jn jdp cos [9] To restore this orthogonality, the following modification was made to the DMFT " # UðjdpÞ ¼ X uðnþ a sin p jn pj sin cos p jn j ¼ ; with inverse uðnþ ¼ X j¼ uðjþ a sin p jn 1 sin p j a þ 1 sin p j þ C 1 r n þ C ð rþ n n ¼ ; where r is the root of r þ ar 1 ¼ p jn cos of smaller magnitude (the other root being r 1 ). Then r n and ( r) n are both orthogonal to a sin p jn 1 sin p j p jn cos with respect to X j ¼ 1 1; ð7þ [1] As an additional bonus to the improved DMFT, an analog of () can now be used by defining wðnþ ¼ u ½ ðnþ 1Þ Š u ½ð n 1 ÞŠ n ¼ 1 1; with w() = w() =. Then UðjdpÞ ¼ X wðnþ sin p jn þ a uðnþ j ¼ ð8þ To recover u from the auxillary function w, solve (8). This is now an exact relation, not an approximation, so no numerical problems are caused. Although this is a difference analog of a first-order differential equation, it is a second-order difference equation. Thus the general solution consists of a particular solution plus a linear combination of two independent solutions of the homogeneous equation. These two solutions are r n and ( r) n. Approximating a first-order differential equation by a secord-order difference equation can lead to numerical instability. A disussion of this phenomenon is given, e.g., by Hildebrand [1987, section 6.7]. 4. Bad Alpha Problem [11] Although much more stable than the earlier version of the DMFT and with the advantage of only requiring a sine transform, the above version still exhibits occasional numerical instability when Re (a)!, which is generally characterized by jrj!1. This has come to be known as the bad alpha problem. It occurs sometimes when using the Miller-Brown formula [Miller et al., 1984] for modeling a rough surface by adjusting the Fresnel reflection coefficient, thereby changing the effective impedance of the surface and making a a rangedependent variable. [1] A spectacular example of the bad alpha problem is shown in Figure 1, in which the above version of the DMFT was used in a split-step method for a 1-GHz, h- pol problem. The maximum problem altitude is feet (61 m), and an aperture antenna producing a sinc beam is located at 1 feet (3 m) altitude and pointed horizontally. This is in free space over a flat Earth. The transform size is 51 and Miller-Brown was used for an RMS wave height of 5 m (16.4 feet). It can be seen why sometimes the bad alpha problem is also called the big V problem. The correct propagation factor for this problem, computed by the method to be discussed, is shown in Figure. 5. Forward Difference DMFT [13] To obtain a different formulation of the DMFT, replace the central difference equation (8) with a forward difference equation wðnþ ¼ u½ðnþ 1Þ Š u ð n Þ n ¼ 1 1; þ a uðnþ with w() = w() =. This has the advantage of being only a first-order difference equation, thus requiring only one homogeneous solution in the general solution. To analyze the forward difference algorithm,
4 5-4 KUTTLER AD JAASWAMY IMPROVED FOURIER TRASFORM METHODS Figure 1. The big V is an occurrence of the bad alpha problem for 1-GHz h-pol, 5-m RMS roughness. define r =1 a. Then, multiply the above equation by and redefine w by wðnþ ¼ u½ðnþ 1ÞŠ r uðnþ n ¼ 1 1 ð9þ The solution to the homogeneous equation is r n (note that r has a different meaning here than in the previous DMFT algorithm). ow let Uðjdp Þ ¼ X 1 ¼ X 1 ¼ X wðnþsin p jn fu½ðnþ 1ÞŠ ruðnþgsin p jn uðnþ sin p jn ð 1Þ r sin p jn This then is the forward difference DMFT. To see a connection to the previous method, write sin p jn ð 1Þ r sin p jn ¼ cos p j r sin p jn sin p j use r =1 a, and divide by to get " # a sin p j cos p jn ; sin p jn 1 sin p j p jn cos ow compare these functions with the ones in (7). It is easy to see the orthogonality of these functions with r n, X r n sin p jn ð 1Þ r sin p jn ¼
5 KUTTLER AD JAASWAMY IMPROVED FOURIER TRASFORM METHODS 5-5 Figure. Correct propagation for the problem of Figure 1 is shown. Moreover, these functions can be shown to be mutually orthogonal, where here orthogonality is with respect to X [14] To completely specify the forward difference DMFT requires computing the quantity C ¼ X r n uðnþ ð1þ To invert the forward difference DMFT, the procedure is reversed. First, inverse sine transform U to get w. Then, get a particular solution u p of the first-order difference equation (9) by setting u p () = and using u p ½ðn þ 1ÞŠ ¼ wðnþþru p ðnþ n ¼ 1 ð11þ Then u = u p + Ar n, where A is determined by requiring that (1) be satisfied. [15] The forward difference algorithm works best when jrj < 1. Since jj r ¼ ½1 ReðaÞŠ þ½imðaþš ; this condition is equivalent to Re ðaþ jaj ote that this can never hold for h-pol and even for v-pol could impose a severe restriction on the size of (and hence, the transform size) if Re (a)!, as can happen when using Miller-Brown. [16] ow it is still possible to use the forward difference algorithm when jrj > 1. In that case it is prudent to
6 5-6 KUTTLER AD JAASWAMY IMPROVED FOURIER TRASFORM METHODS write the homogeneous solution as (1/r) -n, and replace (1) with C ¼ X 1 1 n u½ð nþš ð1þ r Instead of (11), get a particular solution u p by setting u p () = and use u p ½ð nþš ¼ 1 u p f½ ðn 1ÞŠg r w½ð nþšg n ¼ 1 Then u = u p + A(1/r) n, where Ais determined by requiring that (1) be satisfied. Even with these modifications, the forward difference algorithm does not perform well when jrj gets too large, as will be seen. 6. Backward Difference DMFT [17] After analyzing the forward difference algorithm, a natural idea is to try a backward difference formulation. Instead of (8), consider wðnþ ¼ u ð n Þ u ½ð n 1 ÞŠ n ¼ 1 1; þ auðnþ ð13þ with w() = w() =. Again, this is only a first-order difference equation. ow we define r =(1+a) 1, rearrange (13), and redefine w by wðnþ ¼ uðnþ ru½ðn 1ÞŠ n ¼ 1 1 ð14þ Again the solution to the homogeneous equation is r n, where r again has a different meaning here than in the previous two algorithms. Let Uðjdp Þ ¼ X 1 ¼ X 1 ¼ X 1 wðnþsin p jn fuðnþ ru½ðn 1ÞŠgsin p jn uðn Þ sin p jn p jnþ1 r sin ð Þ This is the backward difference DMFT. Again the functions sin p jn p jnþ r sin ð 1 Þ are easily seen to be orthogonal to r n and mutually orthogonal, where here orthogonality is with respect to X 1 [18] To completely specify the forward difference DMFT requires computing the quantity C ¼ X 1 r n un ð Þ ð15þ Inverting the backward difference DMFT uses steps similar to those of the forward difference algorithm First, inverse sine transform U to get w. Then get a particular solution u p of the first-order difference equation (14) by setting u p () = and using u p ðnþ ¼ wðnþþru p ½ðn 1ÞŠ n ¼ 1 Then u = u p + Ar n, where A is determined by requiring that (15) be satisfied. [19] Again, the backward difference algorithm works best when jrj < 1. Since r 1 ¼ ½ 1 þ Re ð a ÞŠ þ½imðaþš ; this condition is equivalent to > ReðaÞ jaj This is always true for v-pol (when Re (a) > ) and imposes a lower bound on the size of for h-pol (when Re (a) < ). Again, it is still possible to use the backward difference algorithm when jrj > 1 with the same sort of modifications as were made in the forward difference case. In general, the backward difference algorithm can be used without numerical problems in many more cases than can the forward difference algorithm. 7. Central Difference DMFT [] One possible drawback to the forward and backward difference algorithms is that they only approximate the impedance boundary condition (1) to first order in, whereas in the old version of the DMFT it is approximated to second order in. A natural question is whether there is a first-order difference equation that approximates (1) to second order in? The answer is yes, provided calculations are performed on a mesh of points that is shifted by / from the usual mesh. That
7 KUTTLER AD JAASWAMY IMPROVED FOURIER TRASFORM METHODS 5-7 is, sample u(z) at the points (n + 1/), n = 1, and define wðnþ ¼ u nþ 1 u n 1 þ a u nþ 1 þ u n 1 ð16þ n ¼ 1 1; with w() = w() =. ow define r =(1 a/)/(1 + a/), rearrange (16), and redefine w by wðnþ ¼ u nþ 1 ru n 1 n ¼ 1 1 ð17þ Again, the solution to the homogeneous equation is r n, where r has yet a different meaning here than in the previous three algorithms. Let Uðjdp Þ ¼ X 1 ¼ X 1 ¼ X 1 wðnþsin p jn u nþ 1 ru n 1 sin p jn u nþ 1 sin p jn p jnþ r sin ð 1 Þ So this is the central difference DMFT. Again the functions sin p jn p jnþ r sin ð 1 Þ are easily seen to be orthogonal to r n and mutually orthogonal, where here orthogonality is with respect to X 1 [1] To completely specify the central difference DMFT requires computing the quantity C ¼ X 1 r n u nþ 1 ð18þ Inverting the central difference DMFT uses steps similar to those of the forward and backward difference algorithms. First, inverse sine transform U to get w. Then get a particular solution u p of the first-order difference equation (17) by setting u p (/) = and using u p n þ 1 ¼ wðnþþru p n 1 n ¼ 1 Then u = u p + Ar n, where A is determined by requiring that (18) be satisfied. [] There is one additional step needed in the central difference algorithm to produce a value for uon the surface. This value is not needed in the computation but is generally a quantity desired in the output. Thus (17) is used at n =, with left side zero, to get a value for u at the virtual point n/, and then uðþ ¼ 1 ½u= ð Þþu ð = ÞŠ The result is uðþ ¼ u= ð Þ 1 1 a [3] Again, the central difference algorithm works best when jrj < 1. Since jj r ¼ h 1 þ 1 i þ h i ReðaÞ 1 ImðaÞ h 1 1 i þ h i ReðaÞ 1 ; ImðaÞ this condition is equivalent to Re (a) >, which is always true for v-pol. Again, it is still possible to use the central difference algorithm when jrj > 1 with the same sort of modifications as were made in the forward difference case. The central difference algorithm can also be used without numerical problems in many more cases without numerical problems than can the forward difference algorithm. 8. Bad Alpha Regions [4] How big can jrj be before these algorithms cease to work? Apparently, the criterion is when jr j exceeds the smallest number that causes overflow in the language and platform on which the computation is done. For example, for MATLAB on a PC, this number is 14. Thus the limit on jrj in this case is 14/, which, for a transform size = 56, is 16, but, for a transform size = 15, is only Remember that the r in all the algorithms, including the older version of the DMFT,
8 5-8 KUTTLER AD JAASWAMY IMPROVED FOURIER TRASFORM METHODS Figure 3. Shaded areas are bad alpha regions for d max = 1 and feet (35 and 61 m). depend on, which, for a fixed height of the calculation region, is inversely proportional to. [5] Letting R denote this maximum value of jrj, the meaning of jrj < R, using the different definitions of r for the algorithms above, is as follows. For the forward difference algorithm, ReðaÞ 1 þ½imðaþš < R ; ð19þ which is the interior of a circle of radius R/ centered at 1/ in the right half of the complex a plane. For the backward difference algorithm, ReðaÞþ 1 þ½imðaþš > 1 ; ðþ R which is the exterior of a circle of radius 1/R centered at 1/ in the left half of the complex a plane. Finally, for the central difference algorithm, ReðaÞþ R þ 1 R 1 þ Im a ½ ð ÞŠ > 4 R R ; 1 which is also the exterior of a circle with center in the left half plane. [6] In general, the good region for the backward difference is larger than the good region for the central difference, as can be seen by comparing the radii of their circles. Furthermore, the good regions for both of these algorithms are larger than the good region for the forward difference, since the latter is the interior of a circle, rather than the exterior. However, none of these regions completely contains another one. That is, there are always values of a that will be inside any one of the
9 KUTTLER AD JAASWAMY IMPROVED FOURIER TRASFORM METHODS 5-9 Figure 4. Forward difference is going bad for -GHz h-pol, 3-m RMS roughness. good regions but outside all of the other good regions. To see this, consider just the left-most point of the forward difference circle and the right-most points of the central and backward difference circles, all on the Re (a) axis. These are 1 R < 1 R 1 þ R < 1 R R ; respectively. Since each algorithm s good region lies to the right of these points, respectively, the assertion is verified. [7] Figure 3 plots some of these good and bad regions in the complex alpha plane for the case = 14. First, for a region with maximum height d max = feet (61 m) ( = d max /), the largest circle in Figure 3 bounds the good region for the forward difference algorithm (good is inside). The small circle that it intersects bounds the good region for the backward difference algorithm (good is outside). Thus, by using either the backward or the forward difference algorithms as appropriate, the combined bad alpha region, which is the intersection of the bad alpha regions of each, is the shaded lune inside the small circle and outside the large circle. In the same figure is the case in which d max is reduced to 1 feet (35 m) (thus halving ). otice that the combined bad alpha region in this case is disjoint from the previous one. Thus a bad alpha can always be avoided by appropriate choice of backward or forward difference algorithms and computational domain height d max. 9. Concluding Discussion [8] In a series of experiments with parabolic wave equation (PWE) routines using the forward, backward, and central difference algorithms, it was generally observed that when the central difference algorithm
10 5-1 KUTTLER AD JAASWAMY IMPROVED FOURIER TRASFORM METHODS Figure 5. Backward difference gives correct results for the problem of Figure 4. worked, so did the backward difference algorithm and they gave virtually identical results. Thus, despite the fact that theoretically the central difference algorithm better approximates the impedance boundary condition, we are not currently using the central difference algorithm, because it requires calculating on a shifted grid, causing some bookkeeping and input/output nuisance. (Of course, further testing may produce cases in which the more accurate boundary condition is required.) [9] As expected, there are cases in which the backward difference algorithm gives the right answer and the forward difference algorithm does not. In Figure 4 there is a -GHz, h-pol antenna at 1 feet (3 m), d max = 5 feet (15 m), = 48, and the RMS wave height is 3 m (9.84 feet). The forward difference algorithm is clearly going bad. However, in Figure 5 the backward difference algorithm gets the correct result. (The PWE routine using the older version of the DMFT cannot do this problem at all. It blows up almost immediately.) [3] However, as shown above and in Figure 3, there are potentially cases when we can be in the bad region for the backward difference algorithm but in the good region for the forward difference algorithm. Therefore the recommended method for fixing the bad alpha problem, based on the above observations, is to determine R (which depends on the computing platform) and check to see if () is satisfied. (This need only be checked for h-pol, as it will always be true for v-pol.) If it is, use the backward difference algorithm. If not, see if (19) might be satisfied. If it is, then use the forward difference algorithm. These are both defined on the usual (mdx, n) mesh, so there is no difficulty in switching between them. If (19) is also not satisfied, change the transform size. [31] Extensive testing performed so far on this backward plus forward difference algorithm has shown the
11 KUTTLER AD JAASWAMY IMPROVED FOURIER TRASFORM METHODS 5-11 method to be extremely robust. Additional testing will still be done, but it appears that this is a major advance in solving the bad alpha problem. Also, not only is this new algorithm more robust than the older version, but it will be slightly faster as well, because only a single backsolve and one homogeneous solution calculation are needed per step, rather than two for the older version. References Dockery, G. D., Modeling electromagnetic wave propagation in the troposphere using the parabolic equation, IEEE Trans. Antennas Propag., 36(1), , Dockery, G. D., and J. R. Kuttler, An improved impedanceboundary algorithm for Fourier split-step solutions of the parabolic wave equation, IEEE Trans. Antennas Propag., 44(1), , Donohue, D. J., and J. R. Kuttler, Propagation modeling over terrain using the parabolic wave equation, IEEE Trans. Antennas Propag., 48(), 177 6,. Hildebrand, F. B., Introduction to umerical Analysis, nd ed., Dover, Mineola,. Y., Ko, H. W., J. W. Sari, and J. P. Skura, Anomalous microwave propagation through atmospheric ducts, Johns Hopkins APL Tech. Dig., 4(), 1 6, Kuttler, J. R., Differences between the narrow-angle and wideangle propagators in the split-step Fourier solution of the parabolic wave equation, IEEE Trans. Antennas Propag., 47(7), , Kuttler, J. R., and G. D. Dockery, Theoretical description of the parabolic approximation/fourier split-step method of representing electromagnetic propagation in the troposphere, Radio Sci., 6(), , Miller, A. R., R. M. Brown, and E. Vegh, ew derivation for the rough-surface reflection coefficient and for the distribution of sea-wave elevations, IEE Proc., Part H, Microwaves Opt. Antennas, 131(), , R. Janaswamy, Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, 15 A Marcus Hall, Amherst, MA 13, USA. (janaswamy@ecs. umass.edu) J. R. Kuttler, Applied Physics Laboratory, 111 Johns Hopkins Road, Laurel, MD , USA. ( jim.kuttler@ jhuapl.edu)
SPECIAL TECHNIQUES-II
SPECIAL TECHNIQUES-II Lecture 19: Electromagnetic Theory Professor D. K. Ghosh, Physics Department, I.I.T., Bombay Method of Images for a spherical conductor Example :A dipole near aconducting sphere The
More informationA Graphical User Interface (GUI) for Two-Dimensional Electromagnetic Scattering Problems
A Graphical User Interface (GUI) for Two-Dimensional Electromagnetic Scattering Problems Veysel Demir vdemir@olemiss.edu Mohamed Al Sharkawy malshark@olemiss.edu Atef Z. Elsherbeni atef@olemiss.edu Abstract
More informationRADIO SCIENCE, VOL. 39, RS1005, doi: /2003rs002872, 2004
RADIO SCIENCE, VOL. 39,, doi:10.1029/2003rs00272, 2004 Bessel planar arrays Karim Y. Kabalan, Ali El-Hajj, and Mohammed Al-Husseini Electrical and Computer Engineering Department, American University of
More informationRay tracing/correlation approach to estimation of surface-based duct parameters from radar clutter
Ray tracing/correlation approach to estimation of surface-based duct parameters from radar clutter Zhao Xiao-Feng( 赵小峰 ), Huang Si-Xun( 黄思训 ), and Sheng Zheng( 盛峥 ) Institute of Meteorology, PLA University
More informationV = 2πx(1 x) dx. x 2 dx. 3 x3 0
Wednesday, September 3, 215 Page 462 Problem 1 Problem. Use the shell method to set up and evaluate the integral that gives the volume of the solid generated by revolving the region (y = x, y =, x = 2)
More informationAdvanced Propagation Model (APM) Ver Computer Software Configuration Item (CSCI) Documents
TECHNICAL DOCUMENT 3145 August 2002 Advanced Propagation Model (APM) Ver. 1.3.1 Computer Software Configuration Item (CSCI) Documents A. E. Barrios W. L. Patterson Approved for public release; distribution
More informationDigital Image Processing. Prof. P. K. Biswas. Department of Electronic & Electrical Communication Engineering
Digital Image Processing Prof. P. K. Biswas Department of Electronic & Electrical Communication Engineering Indian Institute of Technology, Kharagpur Lecture - 21 Image Enhancement Frequency Domain Processing
More informationA Diagonal Split-cell Model for the High-order Symplectic FDTD Scheme
PIERS ONLINE, VOL. 2, NO. 6, 2006 715 A Diagonal Split-cell Model for the High-order Symplectic FDTD Scheme Wei Sha, Xianliang Wu, and Mingsheng Chen Key Laboratory of Intelligent Computing & Signal Processing
More informationWHAT YOU SHOULD LEARN
GRAPHS OF EQUATIONS WHAT YOU SHOULD LEARN Sketch graphs of equations. Find x- and y-intercepts of graphs of equations. Use symmetry to sketch graphs of equations. Find equations of and sketch graphs of
More informationUse of n-vector for Radar Applications
Use of n-vector for Radar Applications Nina Ødegaard, Kenneth Gade Norwegian Defence Research Establishment Kjeller, NORWAY email: Nina.Odegaard@ffi.no Kenneth.Gade@ffi.no Abstract: This paper aims to
More informationCHAPTER 6 Parametric Spline Curves
CHAPTER 6 Parametric Spline Curves When we introduced splines in Chapter 1 we focused on spline curves, or more precisely, vector valued spline functions. In Chapters 2 and 4 we then established the basic
More informationFourier Transforms and Signal Analysis
Fourier Transforms and Signal Analysis The Fourier transform analysis is one of the most useful ever developed in Physical and Analytical chemistry. Everyone knows that FTIR is based on it, but did one
More informationUnit Circle. Project Response Sheet
NAME: PROJECT ACTIVITY: Trigonometry TOPIC Unit Circle GOALS MATERIALS Explore Degree and Radian Measure Explore x- and y- coordinates on the Unit Circle Investigate Odd and Even functions Investigate
More informationTHE SCATTERING OF ELECTROMAGNETIC WAVES FROM ROUGH SURFACES
THE SCATTERING OF ELECTROMAGNETIC WAVES FROM ROUGH SURFACES Petr Beckmann Andre Spizzichino CONTENTS Part I-THEORY By PETR BECKMANN 1. INTRODUCTION 2. QUALITATIVE CONSIDERATIONS 9 2.1. The Rayleigh Criterion
More informationDevelopment of a Maxwell Equation Solver for Application to Two Fluid Plasma Models. C. Aberle, A. Hakim, and U. Shumlak
Development of a Maxwell Equation Solver for Application to Two Fluid Plasma Models C. Aberle, A. Hakim, and U. Shumlak Aerospace and Astronautics University of Washington, Seattle American Physical Society
More informationChapter 2 Research on Conformal Phased Array Antenna Pattern Synthesis
Chapter 2 Research on Conformal Phased Array Antenna Pattern Synthesis Guoqi Zeng, Siyin Li and Zhimian Wei Abstract Phased array antenna has many technical advantages: high power efficiency, shaped beam,
More informationLecture 7 Notes: 07 / 11. Reflection and refraction
Lecture 7 Notes: 07 / 11 Reflection and refraction When an electromagnetic wave, such as light, encounters the surface of a medium, some of it is reflected off the surface, while some crosses the boundary
More informationArchbold Area Schools Math Curriculum Map
Math 8 August - May Mathematical Processes Formulate a problem or mathematical model in response to a specific need or situation, determine information required to solve the problem, choose method for
More informationConics, Parametric Equations, and Polar Coordinates. Copyright Cengage Learning. All rights reserved.
10 Conics, Parametric Equations, and Polar Coordinates Copyright Cengage Learning. All rights reserved. 10.5 Area and Arc Length in Polar Coordinates Copyright Cengage Learning. All rights reserved. Objectives
More informationEngineering Physics 1 Dr. M. K. Srivastava Department of Physics Indian Institute of Technology- Roorkee. Module-01 Lecture 03 Double Refraction
Engineering Physics 1 Dr. M. K. Srivastava Department of Physics Indian Institute of Technology- Roorkee Module-01 Lecture 03 Double Refraction Okay, this is the third lecture of the five lecture series
More informationStable Laser Resonator Modeling: Mesh Parameter Determination and Empty Cavity Modeling
Stable Laser Resonator Modeling: Mesh Parameter Determination and Empty Cavity Modeling Justin Mansell, Steve Coy, Kavita Chand, Steve Rose, Morris Maynard, and Liyang Xu MZA Associates Corporation jmansell@mza.com
More informationMODELLING OF PROPAGATION OVER NON-HOMOGENEOUS EARTH WITH PARABOLIC EQUATION METHOD
ODELLING OF PROPAGATION OVER NON-HOOGENEOUS EARTH WITH PARABOLIC EQUATION ETHOD Esin ÖZÇAKICILAR 1 Funda AKLEAN 1 Uludag UniversityEngineering-Architecture Faculty Electronic Engineering Department 1659-Görükle/BURSA
More informationFloating-Point Numbers in Digital Computers
POLYTECHNIC UNIVERSITY Department of Computer and Information Science Floating-Point Numbers in Digital Computers K. Ming Leung Abstract: We explain how floating-point numbers are represented and stored
More informationELECTROMAGNETIC diffraction by perfectly conducting
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, VOL. 47, NO. 11, NOVEMBER 1999 1697 Oblique Scattering by a Pair of Conducting Half Planes: TM Case Jong-Won Yu and Noh-Hoon Myung Abstract An exact series
More informationMatlab representations of Polar Transmission Line Matrix Meshes.
Matlab representations of Polar Transmission Line Matrix Meshes. D.S.Hindmarsh + Abstract This paper discusses some of the issues that evolve when representing Polar Transmission Line Matrix models using
More informationSection 10.1 Polar Coordinates
Section 10.1 Polar Coordinates Up until now, we have always graphed using the rectangular coordinate system (also called the Cartesian coordinate system). In this section we will learn about another system,
More informationConics, Parametric Equations, and Polar Coordinates. Copyright Cengage Learning. All rights reserved.
10 Conics, Parametric Equations, and Polar Coordinates Copyright Cengage Learning. All rights reserved. 10.5 Area and Arc Length in Polar Coordinates Copyright Cengage Learning. All rights reserved. Objectives
More informationPrime Time (Factors and Multiples)
CONFIDENCE LEVEL: Prime Time Knowledge Map for 6 th Grade Math Prime Time (Factors and Multiples). A factor is a whole numbers that is multiplied by another whole number to get a product. (Ex: x 5 = ;
More informationOptimised corrections for finite-difference modelling in two dimensions
Optimized corrections for 2D FD modelling Optimised corrections for finite-difference modelling in two dimensions Peter M. Manning and Gary F. Margrave ABSTRACT Finite-difference two-dimensional correction
More informationFocusing properties of spherical and parabolic mirrors
Physics 5B Winter 008 Focusing properties of spherical and parabolic mirrors 1 General considerations Consider a curved mirror surface that is constructed as follows Start with a curve, denoted by y()
More informationCoupling of surface roughness to the performance of computer-generated holograms
Coupling of surface roughness to the performance of computer-generated holograms Ping Zhou* and Jim Burge College of Optical Sciences, University of Arizona, Tucson, Arizona 85721, USA *Corresponding author:
More informationA simulator of sea clutter from X-band radar at low grazing angles
A simulator of sea clutter from X-band radar at low grazing angles Guillaume Sicot, Nicolas Thomas Actimar 36 quai de la douane 29200 Brest - France Email: guillaume.sicot@actimar.fr Jean-Marc Le Caillec
More informationChapter 33 The Nature and Propagation of Light by C.-R. Hu
Chapter 33 The Nature and Propagation of Light by C.-R. Hu Light is a transverse wave of the electromagnetic field. In 1873, James C. Maxwell predicted it from the Maxwell equations. The speed of all electromagnetic
More informationFall 2016 Semester METR 3113 Atmospheric Dynamics I: Introduction to Atmospheric Kinematics and Dynamics
Fall 2016 Semester METR 3113 Atmospheric Dynamics I: Introduction to Atmospheric Kinematics and Dynamics Lecture 5 August 31 2016 Topics: Polar coordinate system Conversion of polar coordinates to 2-D
More informationGeometry I Can Statements I can describe the undefined terms: point, line, and distance along a line in a plane I can describe the undefined terms:
Geometry I Can Statements I can describe the undefined terms: point, line, and distance along a line in a plane I can describe the undefined terms: point, line, and distance along a line in a plane I can
More informationUnit 3 Higher topic list
This is a comprehensive list of the topics to be studied for the Edexcel unit 3 modular exam. Beside the topics listed are the relevant tasks on www.mymaths.co.uk that students can use to practice. Logon
More informationQuadratic Functions CHAPTER. 1.1 Lots and Projectiles Introduction to Quadratic Functions p. 31
CHAPTER Quadratic Functions Arches are used to support the weight of walls and ceilings in buildings. Arches were first used in architecture by the Mesopotamians over 4000 years ago. Later, the Romans
More informationFinding the slope to base angle of the virtual pyramid Case 1
inding the slope to base angle of the virtual pyramid ase 1 igure 1 What we are seeking to find is the measure of angle, or conversely, as triangle is isosceles the two angles at the base will be equal.
More informationNumerical dispersion analysis for three-dimensional Laplace-Fourier-domain scalar wave equation
CSIRO PUBLISHING Exploration Geophysics, 216, 47, 158 167 http://dx.doi.org/171/eg1522 Numerical dispersion analysis for three-dimensional Laplace-Fourier-domain scalar wave equation Jing-Bo Chen Key Laboratory
More informationYear 11 Key Performance Indicators Maths (Number)
Key Performance Indicators Maths (Number) M11.1 N1: Four operations with decimals and using the order of operations correctly. Solve problems using mathematical reasoning. Four rules of negative numbers
More informationFloating-Point Numbers in Digital Computers
POLYTECHNIC UNIVERSITY Department of Computer and Information Science Floating-Point Numbers in Digital Computers K. Ming Leung Abstract: We explain how floating-point numbers are represented and stored
More informationA TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3
A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 ANDREW J. HANSON AND JI-PING SHA In this paper we present a systematic and explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F
More informationBirkdale High School - Higher Scheme of Work
Birkdale High School - Higher Scheme of Work Module 1 - Integers and Decimals Understand and order integers (assumed) Use brackets and hierarchy of operations (BODMAS) Add, subtract, multiply and divide
More information5/27/12. Objectives. Plane Curves and Parametric Equations. Sketch the graph of a curve given by a set of parametric equations.
Objectives Sketch the graph of a curve given by a set of parametric equations. Eliminate the parameter in a set of parametric equations. Find a set of parametric equations to represent a curve. Understand
More informationMODELING MIXED BOUNDARY PROBLEMS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD (CVBEM) USING MATLAB AND MATHEMATICA
A. N. Johnson et al., Int. J. Comp. Meth. and Exp. Meas., Vol. 3, No. 3 (2015) 269 278 MODELING MIXED BOUNDARY PROBLEMS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD (CVBEM) USING MATLAB AND MATHEMATICA
More informationMie scattering off plasmonic nanoparticle
Mie scattering off plasmonic nanoparticle Model documentation COMSOL 2009 Version: COMSOL 3.5a1 (build 3.5.0.608) Contents I. Model Overview II. Model Navigator III. Options and settings IV. Geometry modeling
More informationLos Angeles Unified School District. Mathematics Grade 6
Mathematics Grade GRADE MATHEMATICS STANDARDS Number Sense 9.* Compare and order positive and negative fractions, decimals, and mixed numbers and place them on a number line..* Interpret and use ratios
More informationb) develop mathematical thinking and problem solving ability.
Submission for Pre-Calculus MATH 20095 1. Course s instructional goals and objectives: The purpose of this course is to a) develop conceptual understanding and fluency with algebraic and transcendental
More informationQUIZ 4 (CHAPTER 17) SOLUTIONS MATH 252 FALL 2008 KUNIYUKI SCORED OUT OF 125 POINTS MULTIPLIED BY % POSSIBLE
QUIZ 4 (CHAPTER 17) SOLUTIONS MATH 5 FALL 8 KUNIYUKI SCORED OUT OF 15 POINTS MULTIPLIED BY.84 15% POSSIBLE 1) Reverse the order of integration, and evaluate the resulting double integral: 16 y dx dy. Give
More informationMathematics. Geometry Revision Notes for Higher Tier
Mathematics Geometry Revision Notes for Higher Tier Thomas Whitham Sixth Form S J Cooper Pythagoras Theorem Right-angled trigonometry Trigonometry for the general triangle rea & Perimeter Volume of Prisms,
More informationSOME PROPERTIES OF TRIGONOMETRIC FUNCTIONS. 5! x7 7! + = 6! + = 4! x6
SOME PROPERTIES OF TRIGONOMETRIC FUNCTIONS PO-LAM YUNG We defined earlier the sine cosine by the following series: sin x = x x3 3! + x5 5! x7 7! + = k=0 cos x = 1 x! + x4 4! x6 6! + = k=0 ( 1) k x k+1
More informationksa 400 Growth Rate Analysis Routines
k-space Associates, Inc., 2182 Bishop Circle East, Dexter, MI 48130 USA ksa 400 Growth Rate Analysis Routines Table of Contents ksa 400 Growth Rate Analysis Routines... 2 1. Introduction... 2 1.1. Scan
More informationA Hybrid Magnetic Field Solver Using a Combined Finite Element/Boundary Element Field Solver
A Hybrid Magnetic Field Solver Using a Combined Finite Element/Boundary Element Field Solver Abstract - The dominant method to solve magnetic field problems is the finite element method. It has been used
More informationENGI Parametric & Polar Curves Page 2-01
ENGI 3425 2. Parametric & Polar Curves Page 2-01 2. Parametric and Polar Curves Contents: 2.1 Parametric Vector Functions 2.2 Parametric Curve Sketching 2.3 Polar Coordinates r f 2.4 Polar Curve Sketching
More informationAccuracy Analysis of Charged Particle Trajectory CAE Software
www.integratedsoft.com Accuracy Analysis of Charged Particle Trajectory CAE Software Content Executive Summary... 3 Overview of Charged Particle Beam Analysis... 3 Types of Field Distribution... 4 Simulating
More informationChallenge Problem 5 - The Solution Dynamic Characteristics of a Truss Structure
Challenge Problem 5 - The Solution Dynamic Characteristics of a Truss Structure In the final year of his engineering degree course a student was introduced to finite element analysis and conducted an assessment
More informationINTRODUCTION REFLECTION AND REFRACTION AT BOUNDARIES. Introduction. Reflection and refraction at boundaries. Reflection at a single surface
Chapter 8 GEOMETRICAL OPTICS Introduction Reflection and refraction at boundaries. Reflection at a single surface Refraction at a single boundary Dispersion Summary INTRODUCTION It has been shown that
More informationVectors and the Geometry of Space
Vectors and the Geometry of Space In Figure 11.43, consider the line L through the point P(x 1, y 1, z 1 ) and parallel to the vector. The vector v is a direction vector for the line L, and a, b, and c
More informationGrade 9 Math Terminology
Unit 1 Basic Skills Review BEDMAS a way of remembering order of operations: Brackets, Exponents, Division, Multiplication, Addition, Subtraction Collect like terms gather all like terms and simplify as
More informationComparison of TLM and FDTD Methods in RCS Estimation
International Journal of Electrical Engineering. ISSN 0974-2158 Volume 4, Number 3 (2011), pp. 283-287 International Research Publication House http://www.irphouse.com Comparison of TLM and FDTD Methods
More informationPhysics I : Oscillations and Waves Prof. S Bharadwaj Department of Physics & Meteorology Indian Institute of Technology, Kharagpur
Physics I : Oscillations and Waves Prof. S Bharadwaj Department of Physics & Meteorology Indian Institute of Technology, Kharagpur Lecture - 20 Diffraction - I We have been discussing interference, the
More informationQuantifying the Dynamic Ocean Surface Using Underwater Radiometric Measurement
DISTRIBUTION STATEMENT A. Approved for public release; distribution is unlimited. Quantifying the Dynamic Ocean Surface Using Underwater Radiometric Measurement Lian Shen Department of Mechanical Engineering
More information6. Find the equation of the plane that passes through the point (-1,2,1) and contains the line x = y = z.
Week 1 Worksheet Sections from Thomas 13 th edition: 12.4, 12.5, 12.6, 13.1 1. A plane is a set of points that satisfies an equation of the form c 1 x + c 2 y + c 3 z = c 4. (a) Find any three distinct
More information13. Brewster angle measurement
13. Brewster angle measurement Brewster angle measurement Objective: 1. Verification of Malus law 2. Measurement of reflection coefficient of a glass plate for p- and s- polarizations 3. Determination
More informationReflection & Mirrors
Reflection & Mirrors Geometric Optics Using a Ray Approximation Light travels in a straight-line path in a homogeneous medium until it encounters a boundary between two different media A ray of light is
More informationRobustness of Non-Exact Multi-Channel Equalization in Reverberant Environments
Robustness of Non-Exact Multi-Channel Equalization in Reverberant Environments Fotios Talantzis and Lazaros C. Polymenakos Athens Information Technology, 19.5 Km Markopoulo Ave., Peania/Athens 19002, Greece
More informationPROPERTIES OF TRIANGLES AND QUADRILATERALS (plus polygons in general)
Mathematics Revision Guides Properties of Triangles, Quadrilaterals and Polygons Page 1 of 15 M.K. HOME TUITION Mathematics Revision Guides Level: GCSE Foundation Tier PROPERTIES OF TRIANGLES AND QUADRILATERALS
More informationI. INTRODUCTION. 2 matrix, integral-equation-based methods, matrix inversion.
2404 IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES, VOL. 59, NO. 10, OCTOBER 2011 Dense Matrix Inversion of Linear Complexity for Integral-Equation-Based Large-Scale 3-D Capacitance Extraction Wenwen
More informationGCSE Higher Revision List
GCSE Higher Revision List Level 8/9 Topics I can work with exponential growth and decay on the calculator. I can convert a recurring decimal to a fraction. I can simplify expressions involving powers or
More informationIMPLEMENTATION OF ANALYTICAL (MATLAB) AND NUMERICAL (HFSS) SOLUTIONS ADVANCED ELECTROMAGNETIC THEORY SOHAIB SAADAT AFRIDI HAMMAD BUTT ZUNNURAIN AHMAD
STUDY OF SCATTERING & RESULTANT RADIATION PATTERN: INFINITE LINE CURRENT SOURCE POSITIONED HORIZONTALLY OVER A PERFECTLY CONDUCTING INFINITE GROUND PLANE IMPLEMENTATION OF ANALYTICAL (MATLAB) AND NUMERICAL
More informationAdvanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude
Advanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude A. Migukin *, V. atkovnik and J. Astola Department of Signal Processing, Tampere University of Technology,
More informationγ 2 γ 3 γ 1 R 2 (b) a bounded Yin set (a) an unbounded Yin set
γ 1 γ 3 γ γ 3 γ γ 1 R (a) an unbounded Yin set (b) a bounded Yin set Fig..1: Jordan curve representation of a connected Yin set M R. A shaded region represents M and the dashed curves its boundary M that
More informationA systematic approach to the analysis of polarisation-sensitive reflectors
A systematic approach to the analysis of polarisation-sensitive reflectors Hans-Henrik Viskum TICRA Læderstræde 34, 2. DK-1201 Copenhagen K Denmark hhv@ticra.com ABSTRACT The analysis of a polarisation-sensitive
More informationA Coupled 3D/2D Axisymmetric Method for Simulating Magnetic Metal Forming Processes in LS-DYNA
A Coupled 3D/2D Axisymmetric Method for Simulating Magnetic Metal Forming Processes in LS-DYNA P. L Eplattenier *, I. Çaldichoury Livermore Software Technology Corporation, Livermore, CA, USA * Corresponding
More informationGeometrical Optics. Chapter General Comments. 1.2 Snell s Law
Chapter 1 Geometrical Optics 1.1 General Comments A light wave is an electromagnetic wave, and the wavelength that optics studies ranges from the ultraviolet (0.2 mm) to the middle infrared (10 mm). The
More informationDetecting Polytomous Items That Have Drifted: Using Global Versus Step Difficulty 1,2. Xi Wang and Ronald K. Hambleton
Detecting Polytomous Items That Have Drifted: Using Global Versus Step Difficulty 1,2 Xi Wang and Ronald K. Hambleton University of Massachusetts Amherst Introduction When test forms are administered to
More informationOptics II. Reflection and Mirrors
Optics II Reflection and Mirrors Geometric Optics Using a Ray Approximation Light travels in a straight-line path in a homogeneous medium until it encounters a boundary between two different media The
More informationWORCESTER POLYTECHNIC INSTITUTE
WORCESTER POLYTECHNIC INSTITUTE MECHANICAL ENGINEERING DEPARTMENT Optical Metrology and NDT ME-593L, C 2018 Introduction: Wave Optics January 2018 Wave optics: coherence Temporal coherence Review interference
More informationPolar Coordinates. Calculus 2 Lia Vas. If P = (x, y) is a point in the xy-plane and O denotes the origin, let
Calculus Lia Vas Polar Coordinates If P = (x, y) is a point in the xy-plane and O denotes the origin, let r denote the distance from the origin O to the point P = (x, y). Thus, x + y = r ; θ be the angle
More informationNicholas J. Giordano. Chapter 24. Geometrical Optics. Marilyn Akins, PhD Broome Community College
Nicholas J. Giordano www.cengage.com/physics/giordano Chapter 24 Geometrical Optics Marilyn Akins, PhD Broome Community College Optics The study of light is called optics Some highlights in the history
More informationMoore Catholic High School Math Department
Moore Catholic High School Math Department Geometry Vocabulary The following is a list of terms and properties which are necessary for success in a Geometry class. You will be tested on these terms during
More informationSection Graphs of the Sine and Cosine Functions
Section 5. - Graphs of the Sine and Cosine Functions In this section, we will graph the basic sine function and the basic cosine function and then graph other sine and cosine functions using transformations.
More informationTransformation of curve. a. reflect the portion of the curve that is below the x-axis about the x-axis
Given graph of y f = and sketch:. Linear Transformation cf ( b + a) + d a. translate a along the -ais. f b. scale b along the -ais c. scale c along the y-ais d. translate d along the y-ais Transformation
More informationPHYS 202 Notes, Week 8
PHYS 202 Notes, Week 8 Greg Christian March 8 & 10, 2016 Last updated: 03/10/2016 at 12:30:44 This week we learn about electromagnetic waves and optics. Electromagnetic Waves So far, we ve learned about
More informationf xx (x, y) = 6 + 6x f xy (x, y) = 0 f yy (x, y) = y In general, the quantity that we re interested in is
1. Let f(x, y) = 5 + 3x 2 + 3y 2 + 2y 3 + x 3. (a) Final all critical points of f. (b) Use the second derivatives test to classify the critical points you found in (a) as a local maximum, local minimum,
More informationAge Related Maths Expectations
Step 1 Times Tables Addition Subtraction Multiplication Division Fractions Decimals Percentage & I can count in 2 s, 5 s and 10 s from 0 to 100 I can add in 1 s using practical resources I can add in 1
More informationHands-On Standards Deluxe Grades: 7, 8 States: California Content Standards
Hands-On Standards Deluxe Grades: 7, 8 States: Hands-On Standards Deluxe Edition Kit, Grades 5-6: Algebra Summary: This resource guide meets 5 and 6 math curriculum standards by matching activities to
More informationElectromagnetic migration of marine CSEM data in areas with rough bathymetry Michael S. Zhdanov and Martin Čuma*, University of Utah
Electromagnetic migration of marine CSEM data in areas with rough bathymetry Michael S. Zhdanov and Martin Čuma*, University of Utah Summary In this paper we present a new approach to the interpretation
More informationCalculating bounds in area and volume questions Manipulating complex indices, including surds Solving simultaneous equations - one linear and one
Calculating bounds in area and volume questions Manipulating complex indices, including surds Solving simultaneous equations - one linear and one quadratic Using equation of a circle and finding points
More informationSpatial Enhancement Definition
Spatial Enhancement Nickolas Faust The Electro- Optics, Environment, and Materials Laboratory Georgia Tech Research Institute Georgia Institute of Technology Definition Spectral enhancement relies on changing
More informationAQA GCSE Maths - Higher Self-Assessment Checklist
AQA GCSE Maths - Higher Self-Assessment Checklist Number 1 Use place value when calculating with decimals. 1 Order positive and negative integers and decimals using the symbols =,, , and. 1 Round to
More informationMATHEMATICS Grade 7 Advanced Standard: Number, Number Sense and Operations
Standard: Number, Number Sense and Operations Number and Number Systems A. Use scientific notation to express large numbers and numbers less than one. 1. Use scientific notation to express large numbers
More informationPrentice Hall Mathematics: Course Correlated to: Massachusetts State Learning Standards Curriculum Frameworks (Grades 7-8)
Massachusetts State Learning Standards Curriculum Frameworks (Grades 7-8) NUMBER SENSE AND OPERATIONS 8.N.1 8.N.2 8.N.3 8.N.4 8.N.5 8.N.6 8.N.7 8.N.8 Compare, order, estimate, and translate among integers,
More informationCS205b/CME306. Lecture 9
CS205b/CME306 Lecture 9 1 Convection Supplementary Reading: Osher and Fedkiw, Sections 3.3 and 3.5; Leveque, Sections 6.7, 8.3, 10.2, 10.4. For a reference on Newton polynomial interpolation via divided
More informationMath 340 Fall 2014, Victor Matveev. Binary system, round-off errors, loss of significance, and double precision accuracy.
Math 340 Fall 2014, Victor Matveev Binary system, round-off errors, loss of significance, and double precision accuracy. 1. Bits and the binary number system A bit is one digit in a binary representation
More informationPolar (BC Only) They are necessary to find the derivative of a polar curve in x- and y-coordinates. The derivative
Polar (BC Only) Polar coordinates are another way of expressing points in a plane. Instead of being centered at an origin and moving horizontally or vertically, polar coordinates are centered at the pole
More informationcoding of various parts showing different features, the possibility of rotation or of hiding covering parts of the object's surface to gain an insight
Three-Dimensional Object Reconstruction from Layered Spatial Data Michael Dangl and Robert Sablatnig Vienna University of Technology, Institute of Computer Aided Automation, Pattern Recognition and Image
More informationPlane wave in free space Exercise no. 1
Plane wave in free space Exercise no. 1 The exercise is focused on numerical modeling of plane wave propagation in ANSYS HFSS. Following aims should be met: 1. A numerical model of a plane wave propagating
More informationI can solve simultaneous equations algebraically and graphically. I can solve inequalities algebraically and graphically.
B I can factorise and expand complex expressions. I can factorise Quadratics I can recognise the Difference of Two Squares (D.O.T.S) simultaneous equations algebraically and graphically. inequalities algebraically
More informationModule 7.2: nag sym fft Symmetric Discrete Fourier Transforms. Contents
Transforms Module Contents Module 7.2: nag sym fft Symmetric Discrete Fourier Transforms nag sym fft provides procedures for computations involving one-dimensional real symmetric discrete Fourier transforms.
More information