OPTIMUM RADAR-ANTENNA-GAIN PATTERNS FOR ATTENUATION OF FIXED BACKGROUND CLUTTER
|
|
- Caren Martin
- 6 years ago
- Views:
Transcription
1 R646 Philips Res. Repts 22, , 1967 OPTIMUM RADAR-ANTENNA-GAIN PATTERNS FOR ATTENUATION OF FIXED BACKGROUND CLUTTER Abstract 1. Introduetion by S. B. WEINSTEIN The antenna-gain patterns which maximize the clutter attenuation, subject to a constraint on beamwidth, are numerically determined for a detection radar using a delay-line canceler to attenuate fixed background clutter. Plots of these optimum patterns are presented for radar systems using single and double delay-line cancelers. For the former case, it is,shown that Gaussian patterns are almost optimum. It is frequently necessary to detect a moving target against a background of fixed reflectors, as, for example, a vehicle or low-flying aircraft against the ground. Detection of such targets is possible, even when the target echo is much weaker than the return from the background clutter, by detecting the Doppler shift in the target echo and attempting to cancel out the non-doppler-shifted clutter signal. In this study, we determine the optimum antenna-gain patterns, under a reasonable beamwidth constraint, for a pulsed detection radar using a delayline canceler to attenuate the clutter. It is shown that the performance of these patterns can often be closely approximated by simple Gaussian patterns. 2. Delay-line cancel ers The delay-line apparatus described by Skolnik 1) subtracts the echo of the current pulse from the delayed echo of the previous pulse. If the antenna did not rotate between pulses, the fixed clutter would be completely canceled. However, if the rotation angle ij</> between pulses is very small, substantial cancelation will occur, and may be numerically defined by the following expression for the attenuation Al ofthe received energy contributed by statistically uniform clutter in the observation plane.: where G(B) is the antenna-voltage-gain pattern. -It A 1 = (1)
2 OPTIMUM RADAR-ANTENNA-GAIN PATTERNS FOR CLUTTER ATTENUATION 569 If an additional delay-line section is introduced to take advantage of the clutter coherence over 3 pulses, the clutter attenuation is defined as - A 2 = (2) For either the single (eq. (1» or double (eq. (2» delay-line canceler, clutter attenuation is unbounded for G(O) = constant. It is clear, however, that a radar system with an antenna gain which is uniform in all directions has no resolution. In the following sections, beamwidth constraints are formulated and the antenna-gain patterns G(O) which maximize (1) and (2) are determined subject to these constraints. 3. Maximizing clutter attenuation with a beamwidth constraint A beamwidth constraint in integral form, resembling (1) or (2), is desirable in order to make use ofthe Lagrange-multiplier formulation. As a first thought, we propose a beamwidth (J2 defined by a2 = _-_---- (3) which is equal to the variance of the square of the gain pattern. The G(O) which is peaked near 0 = 0 and small near 0 = ± n will result in a small beamwidth. In sec. 5 we will shortly propose a slightly modified definition of beamwidth which is better suited to physical radars, but the formulation is very similar to that using (3)., If G(O) is narrow compared with the interval (-n, zr), the problem of maxi- mizing (1) with the constraint (3) is already solved. The Weyl inequality 2) (4) can then be approximately rewritten: J G 2 (6)d6 (LI cf»2 Al = _-_00 ~ 4 _-_00 = 4 (J2, J [G'(B)]2d
3 570 S. B. WEINSTEIN and equality is obtained when G(B) is Gaussian, i.e. G(B) = A exp (-rxb2), rx ~ o. (6) The Gaussian solution is no longer optimum when the (-:lt,:lt) limits of expressions (1) and (3) cannot be replaced by (-00, (0) with negligible error, but it still, as will be seen, comes very close to the optimum in performance. 4. Single delay-line canceler Instead of attempting to maximize (1) directly, subject to constraint (3), we shall perform the equivalent, but much easier, task of minimizing subject to the two constraints 7< J [G'(B)J2dB, -7< and -To: 7< 7< (7) (8) The normalization to unity in the first constraint implies no loss of generality, since expressions (1), (2) and (3) are not affected by a scalar multiplication of G(B). By the use of Lagrange multipliers p, and Ao, the problem reduces to the minimization of -7< 1t (9) The variational calculus may be used to derive the Euler- Lagrange equation 3) for the extremal G(B), with a polynomial in B as a solution, but the coefficients of the polynomial are functions of p,and Ao. The evaluation of p, and Ao from the constraint equations i s extremely difficult. A more practical approach is to write a truncated Fourier series for G(B) in the interval (-:lt,:lt) and solve for the coefficients. It will be seen that -p, becomes an eigenvalue of a linear transformation, and that the corresponding eigenvector is the desired solution. Let 6. ao 1 N G(B) = l: an cos (nb), (2:lt)1/2 JI:lt n= 1 -:lt ~ B ~:lt, (10) where the symmetry in () is a consequence of the symmetry of expression (9), in which no bias with respect to contributions from G(B) as compared with
4 OPTIMUM RADAR-ANTENNA-GAIN PATIERNS FOR CLUTfER ATIENUATION 571 G(-e) is evident. Odd symmetry is ruled out because of its physical unreasonableness, particularly near e = 0, but mathematically a sine series would also yield, an optimum G(e). Substituting (10) into (9), N N N 11 n=o n=o m=o -11 N N (11) where -n n=o m=o Rnm = J 0 2 cos (no) cos (mo)do = n=m =0 2:n(_1)n+1II :n , n=m=l=o (n + m)2 3 (_I)n+1II (_1)n-mJ (12) 2:n +, n =1= m, [ (n + m)2 (n- m)2 and.6.,10,1=-, :n n=o n =F 0. The set {al}~=o of Fourier coefficients yielding a minimum of (11) is found as a solution of the simultaneous equations i = 0, 1,..., N. (13) These equations can be written as a vector equation o = {B(A) + f11}a, (14) where the elements of the (N + 1) X (N + 1) matrix B(A) are (15)
5 572 S. B. WEINSTEIN It is evident that the solution vector a is an eigenvector of B()'). A computer programme using the Jacobi numerical solution method can be used to find the N + 1 eigenveetors associated with each choice of).. For each eigenvector, one may readily compute the beamwidth (3) and dutter attenuation (1) generated by the function G(8) whose Fourier coefficients constitute the eigenvector. One of these eigenveetors is the best, in the sense ofyielding the highest clutter attenuation that can be achieved with the resulting beamwidth. Because values of ). are chosen without precise knowledge of the functional relation between ). and beamwidth, the resulting values of beamwidth are -not well rounded. Figure 1 pictures the optimum antenna-gain patterns, all renormalized to the value 1 at 8 = 0, constructed from a Foutier series truncated to 15 terms (N = 14). For small values of the beamwidth 0-2, the curves are very close to the (almost) optimum Gaussian, and the ratio of clutter attenuation x(li cfo)2 to 0-2 is about 4, as required by inequality (5). For larger values of 0-2 the curves are still close to Gaussian, even though the inequality(5)is no longer applicable. G (e) 1 1.a e 3 5 Fig. 1. Antenna-gain patterns which maximize the clutter attenuation Al ofthe single delayline canceler (eq. (1» subject to the constraint of eq. (3) on the beamwidth u 2 On the interval -:Tt < IJ < 0, the gain patterns are the mirror images of the above curves. The patterns produce the following beamwidth - clutter-attenuation pairs:. curve a2.a1x(llcf»2' ' '089 0' '0515 0' '
6 OPTIMUM RADAR-ANTENNA-GAIN PATTERNS FOR CLUTI'ER ATTENUATION 573 ( S O A,x(tlcpl O S 0 2 / '/ 1/ / 1/ 1 / Ó-Ol 0-02 O-OS O S _C)2. Fig. 2. Clutter attenuation (eq. (1)) vs beamwidth (eq. (3)) for solutions shown in fig. 1 (upper curve in this figure) and for Gaussian antenna patterns. Figure 2 shows the plots of clutter attenuation vs beamwidth corresponding to the solutions of fig. land to the Gaussian patterns. 5. A revised beamwidth constraint The initial beamwidth constraint (3) tends to discourage large values of G(f) for f) far from f) = 0, but does not very much suppress large values of G(f) for f) closer to f) = 0. Since large values of G(B) occurring close to, but not within, the nominal width of the central peak are as undesirable as large values which are farther away, it is better to discourage G(f) more or less equally for all 1f)1 ;;;:: f)o, where 2f)o is roughly the desired width of the central peak. We therefore propose the following beamwidth constraint, where (12 again denotes the beamwidth: J f (O)G 2 ( a2 = _-_----- O)dO (16) where f(f) is the piecewise-linear function sketched in fig. 3. -T( Fig. 3. Function.t.:(O) used in beamwidth constraint (eq. (16)).
7 574 S. B. WEINSTEIN The formulation of the optimization problem is the same as in the last section, with eq. (14) again valid. However, the matrix R now has terms, s; 1t = J fee) cos (ne) cos (me)de. -1t As a numerical example, let BI and Bo of fig. 3 be arbitrarily chosen as 0 3 and 0 5 radians, respectively. Following the procedure of the last section, we find the antenna patterns of fig. 4. The plots of clutter attenuation (eq. (1» vs beamwidth (eq. (16» are given in fig. 5 for the results of fig. 4 and for Gaussian G(B). Again, the Gaussian gain pattern is close to optimum. (17) G (9) ro {)OS 3 1( Fig. 4. Antenna-gain patterns which maximize the clutter attenuation Al of the single delayline canceler (eq. (1)) subject to the constraint of eq. (16) on the beamwidth az. The patterns produce the following beamwidth - clutter-attenuation pairs: 6. Double delay-line canceler curve a Z Alx(Llr/»Z ' ' ' '0100 0'091 With the double delay-line canceler, one seeks to minimize 1t (18) -1t, which is a modification of eq. (9). Substituting the series expansion (10) into (18), we have /
8 OPTIMUM RADAR-ANTENNA-GAIN PATTERNS FOR CLUTTER ATTENUATION 575 S'O A,X(tJCP) O'S 0 2 V V ~I / V If' II ~ /; 1 Ö-Ol _û 2 Fig. 5. Clutter attenuation (eq. (I» vs beamwidth (eq. (16) for solutions shown in fig. 4 and for Gaussian antenna patterns. where 6. s.; = J f(o) cos (no) cos (mo)do (20) - and Il and H; are as previously defined. Then the vector equation, formally identical to (14), is o = {B(Il) +,ui}a, (21) where now (19) (22) The solutions of (21), for N = 14 and f (B) the piecewise-continuous function of fig. 3 with BI and Bo again chosen as 0 3 and 0 5 radians, respectively, are shown in fig. 6. One should not compare the clutter attenuations of fig. 6 with those of fig. 4 (single delay-line canceler) without noting that a factor of 1j(iJcp)4 is required in fig. 6 and a factor of 1j(iJ cp)2 in fig. 4. Since ij cp is ordinarily a small fraction of a radian, the clutter attenuation achieved by the double delay-line canceler is much greater than that of the single delay-line canceler. 7. Conclusions The exact shape of the antenna diagram does not appear to be of critical importance in achieving good clutter attenuation. Any smooth and almost unimodal function can be expected to perform well, and experimental antennas which suppress and smooth side lobes by utilizing an auxiliary non-directional
9 576 S. B. WEINSTEIN --...e Fig. 6. Antenna-gain patterns which maximize the clutter attenuation A 2 ofthe double delayline canceler (eq. (2)) subject to the constraint of eq. (16) on the beamwidth 0 2 The patterns of this figure produce the following beamwidth-clutter-attenuation pairs: curve 0 2 A 2 x(.dcf» antenna 4) have been very successful as clutter attenuators, although they have no claim to optimality. Since the ideal antenna patterns can only be approximated in practice, it appears worth while to maximize clutter attenuation within the constraints of a physical antenna. This work is now in progress. Acknowledgement The author wishes to thank Professors C. J. Bouwkamp and N. G. de Bruijn, Ir A. Meijer, Ir J. Oosterkamp, Dr F. L. H. M. Stumpers and Ir F. Valster for their valuable suggestions. Eindhoven, May 1967 REFERENCES 1) M. I. Skolnik, Introduetion to radar systems, McGraw-Hill Book Co., Inc., New York, 1962, pp ) H. Weyl, Theory of groups and quantum mechanics, Dover Publication 5269, Appendix 1, p ) O. Bolza, Lectures on the calculus of variations, Dover Publication 5218, chapter 1. ~) J. Croriey and P. R. Wallis, A side-lobe suppression system for primary radar, lee Symp. on signal processing in radar and sonar direction systems, Birmingham, England, 1964.
EFFECTIVE CONDUCTIVITY, DIELECTRIC CONSTANT AND PERMEABILITY OF A DILUTE SUSPENSION*)
R893 I Philips Res. Repts 30, 83*-90*, 1~75 Issue in honour of C. J. Bouwkamp EFFECTIVE CONDUCTIVITY, DIELECTRIC CONSTANT AND PERMEABILITY OF A DILUTE SUSPENSION*) by Joseph B. KELLER Courant Institute
More information1 Mathematical Preliminaries
Mathematical Preliminaries We shall go through in this first chapter all of the mathematics needed for reading the rest of this book. The reader is expected to have taken a one year course in differential
More informationPhysics 221A Fall 2017 Notes 27 The Variational Method
Copyright c 2018 by Robert G. Littlejohn Physics 221A Fall 2017 Notes 27 The Variational Method 1. Introduction Very few realistic problems in quantum mechanics are exactly solvable, so approximation methods
More information1 The linear algebra of linear programs (March 15 and 22, 2015)
1 The linear algebra of linear programs (March 15 and 22, 2015) Many optimization problems can be formulated as linear programs. The main features of a linear program are the following: Variables are real
More informationPage 404. Lecture 22: Simple Harmonic Oscillator: Energy Basis Date Given: 2008/11/19 Date Revised: 2008/11/19
Page 404 Lecture : Simple Harmonic Oscillator: Energy Basis Date Given: 008/11/19 Date Revised: 008/11/19 Coordinate Basis Section 6. The One-Dimensional Simple Harmonic Oscillator: Coordinate Basis Page
More informationFundamentals of Linear Algebra. Marcel B. Finan Arkansas Tech University c All Rights Reserved
Fundamentals of Linear Algebra Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 PREFACE Linear algebra has evolved as a branch of mathematics with wide range of applications to the natural
More informationMaximum variance formulation
12.1. Principal Component Analysis 561 Figure 12.2 Principal component analysis seeks a space of lower dimensionality, known as the principal subspace and denoted by the magenta line, such that the orthogonal
More informationOffset Spheroidal Mirrors for Gaussian Beam Optics in ZEMAX
Offset Spheroidal Mirrors for Gaussian Beam Optics in ZEMAX Antony A. Stark and Urs Graf Smithsonian Astrophysical Observatory, University of Cologne aas@cfa.harvard.edu 1 October 2013 This memorandum
More informationLecture Notes on the Gaussian Distribution
Lecture Notes on the Gaussian Distribution Hairong Qi The Gaussian distribution is also referred to as the normal distribution or the bell curve distribution for its bell-shaped density curve. There s
More informationContinuous Probability Distributions from Finite Data. Abstract
LA-UR-98-3087 Continuous Probability Distributions from Finite Data David M. Schmidt Biophysics Group, Los Alamos National Laboratory, Los Alamos, New Mexico 87545 (August 5, 1998) Abstract Recent approaches
More informationCompensation 8. f4 that separate these regions of stability and instability. The characteristic S 0 L U T I 0 N S
S 0 L U T I 0 N S Compensation 8 Note: All references to Figures and Equations whose numbers are not preceded by an "S"refer to the textbook. As suggested in Lecture 8, to perform a Nyquist analysis, we
More informationCourse Information 2DM60 Wiskunde II (Mathematics II, code 2DM60)
Course Information 2DM60 Wiskunde II (Mathematics II, code 2DM60) Responsible lecturer: dr. ir. R. Duits R.Duits@tue.nl (office: MF 5.071a/Gemini 2.110, tel: 2859/3037) Instructor I: ir. Tom Dela Haije
More informationLimits at Infinity. Horizontal Asymptotes. Definition (Limits at Infinity) Horizontal Asymptotes
Limits at Infinity If a function f has a domain that is unbounded, that is, one of the endpoints of its domain is ±, we can determine the long term behavior of the function using a it at infinity. Definition
More informationHigh Accuracy Evaluation of the Finite Fourier Transform using Sampled Data
NASA Technical Memorandum 1134 High Accuracy Evaluation of the Finite Fourier Transform using Sampled Data Eugene A. Morelli NASA Langley Research Center Hampton, Virginia June 1997 National Aeronautics
More informationEigenvalues and Eigenfunctions of the Laplacian
The Waterloo Mathematics Review 23 Eigenvalues and Eigenfunctions of the Laplacian Mihai Nica University of Waterloo mcnica@uwaterloo.ca Abstract: The problem of determining the eigenvalues and eigenvectors
More informationLinear Algebra Practice Problems
Math 7, Professor Ramras Linear Algebra Practice Problems () Consider the following system of linear equations in the variables x, y, and z, in which the constants a and b are real numbers. x y + z = a
More informationThe Sommerfeld Polynomial Method: Harmonic Oscillator Example
Chemistry 460 Fall 2017 Dr. Jean M. Standard October 2, 2017 The Sommerfeld Polynomial Method: Harmonic Oscillator Example Scaling the Harmonic Oscillator Equation Recall the basic definitions of the harmonic
More informationNotes on Noncoherent Integration Gain
Notes on Noncoherent Integration Gain Mark A. Richards July 2014 1 Noncoherent Integration Gain Consider threshold detection of a radar target in additive complex Gaussian noise. To achieve a certain probability
More informationThe Quantum Harmonic Oscillator
The Classical Analysis Recall the mass-spring system where we first introduced unforced harmonic motion. The DE that describes the system is: where: Note that throughout this discussion the variables =
More informationLinear Algebra. Preliminary Lecture Notes
Linear Algebra Preliminary Lecture Notes Adolfo J. Rumbos c Draft date April 29, 23 2 Contents Motivation for the course 5 2 Euclidean n dimensional Space 7 2. Definition of n Dimensional Euclidean Space...........
More informationCalculus Summer TUTORIAL
Calculus Summer TUTORIAL The purpose of this tutorial is to have you practice the mathematical skills necessary to be successful in Calculus. All of the skills covered in this tutorial are from Pre-Calculus,
More information2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1
Lectures - Week 11 General First Order ODEs & Numerical Methods for IVPs In general, nonlinear problems are much more difficult to solve than linear ones. Unfortunately many phenomena exhibit nonlinear
More informationTwo hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45
Two hours MATH20602 To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER NUMERICAL ANALYSIS 1 29 May 2015 9:45 11:45 Answer THREE of the FOUR questions. If more
More information11 a 12 a 21 a 11 a 22 a 12 a 21. (C.11) A = The determinant of a product of two matrices is given by AB = A B 1 1 = (C.13) and similarly.
C PROPERTIES OF MATRICES 697 to whether the permutation i 1 i 2 i N is even or odd, respectively Note that I =1 Thus, for a 2 2 matrix, the determinant takes the form A = a 11 a 12 = a a 21 a 11 a 22 a
More informationWest Essex Regional School District. AP Calculus AB. Summer Packet
West Esse Regional School District AP Calculus AB Summer Packet 05-06 Calculus AB Calculus AB covers the equivalent of a one semester college calculus course. Our focus will be on differential and integral
More informationHomework 3 Solutions Math 309, Fall 2015
Homework 3 Solutions Math 39, Fall 25 782 One easily checks that the only eigenvalue of the coefficient matrix is λ To find the associated eigenvector, we have 4 2 v v 8 4 (up to scalar multiplication)
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationVectors in Function Spaces
Jim Lambers MAT 66 Spring Semester 15-16 Lecture 18 Notes These notes correspond to Section 6.3 in the text. Vectors in Function Spaces We begin with some necessary terminology. A vector space V, also
More informationLogical Kronecker delta deconstruction of the absolute value function and the treatment of absolute deviations
Logical Kronecker delta deconstruction of the absolute value function and the treatment of absolute deviations Journal of Mathematical Chemistry ISSN 0259-9791 Volume 49 Number 3 J Math Chem (2010) 49:619-624
More informationPolynomial and Rational Functions. Chapter 3
Polynomial and Rational Functions Chapter 3 Quadratic Functions and Models Section 3.1 Quadratic Functions Quadratic function: Function of the form f(x) = ax 2 + bx + c (a, b and c real numbers, a 0) -30
More informationIEEE Ultrasonic symposium 2002
IEEE Ultrasonic symposium 2002 Short Course 6: Flow Measurements Hans Torp Department of Circulation and Medical Imaging TU, orway Internet-site for short course: http://www.ifbt.ntnu.no/~hanst/flowmeas02/index.html
More informationPART IV Spectral Methods
PART IV Spectral Methods Additional References: R. Peyret, Spectral methods for incompressible viscous flow, Springer (2002), B. Mercier, An introduction to the numerical analysis of spectral methods,
More informationChem 3502/4502 Physical Chemistry II (Quantum Mechanics) 3 Credits Fall Semester 2006 Christopher J. Cramer. Lecture 5, January 27, 2006
Chem 3502/4502 Physical Chemistry II (Quantum Mechanics) 3 Credits Fall Semester 2006 Christopher J. Cramer Lecture 5, January 27, 2006 Solved Homework (Homework for grading is also due today) We are told
More informationhttp://topex.ucsd.edu/gmtsar amplitude and phase coherence and pixel matching resolution: optical vs. microwave D s = 2H sinθ r = 2H λ L H = 800km. Optical : L = 1m λ = 0.5µm D s = 0.8m Microwave : L
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationSIGNALS AND SYSTEMS: PAPER 3C1 HANDOUT 6a. Dr David Corrigan 1. Electronic and Electrical Engineering Dept.
SIGNALS AND SYSTEMS: PAPER 3C HANDOUT 6a. Dr David Corrigan. Electronic and Electrical Engineering Dept. corrigad@tcd.ie www.mee.tcd.ie/ corrigad FOURIER SERIES Have seen how the behaviour of systems can
More information19. TAYLOR SERIES AND TECHNIQUES
19. TAYLOR SERIES AND TECHNIQUES Taylor polynomials can be generated for a given function through a certain linear combination of its derivatives. The idea is that we can approximate a function by a polynomial,
More informationPrecalculus Review. Functions to KNOW! 1. Polynomial Functions. Types: General form Generic Graph and unique properties. Constants. Linear.
Precalculus Review Functions to KNOW! 1. Polynomial Functions Types: General form Generic Graph and unique properties Constants Linear Quadratic Cubic Generalizations for Polynomial Functions - The domain
More informationCS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationTHE EIGENVALUE PROBLEM
THE EIGENVALUE PROBLEM Let A be an n n square matrix. If there is a number λ and a column vector v 0 for which Av = λv then we say λ is an eigenvalue of A and v is an associated eigenvector. Note that
More informationNotes on Linear Algebra and Matrix Theory
Massimo Franceschet featuring Enrico Bozzo Scalar product The scalar product (a.k.a. dot product or inner product) of two real vectors x = (x 1,..., x n ) and y = (y 1,..., y n ) is not a vector but a
More informationA = 3 B = A 1 1 matrix is the same as a number or scalar, 3 = [3].
Appendix : A Very Brief Linear ALgebra Review Introduction Linear Algebra, also known as matrix theory, is an important element of all branches of mathematics Very often in this course we study the shapes
More informationFinding Limits Analytically
Finding Limits Analytically Most of this material is take from APEX Calculus under terms of a Creative Commons License In this handout, we explore analytic techniques to compute its. Suppose that f(x)
More informationAnswers for NSSH exam paper 2 type of questions, based on the syllabus part 2 (includes 16)
Answers for NSSH eam paper type of questions, based on the syllabus part (includes 6) Section Integration dy 6 6. (a) Integrate with respect to : d y c ( )d or d The curve passes through P(,) so = 6/ +
More informationTreatment of Overlapping Divergences in the Photon Self-Energy Function*) Introduction
Supplement of the Progress of Theoretical Physics, Nos. 37 & 38, 1966 507 Treatment of Overlapping Divergences in the Photon Self-Energy Function*) R. L. MILLSt) and C. N. YANG State University of New
More informationPolynomials. p n (x) = a n x n + a n 1 x n 1 + a 1 x + a 0, where
Polynomials Polynomials Evaluation of polynomials involve only arithmetic operations, which can be done on today s digital computers. We consider polynomials with real coefficients and real variable. p
More informationAlgebra II. Paulius Drungilas and Jonas Jankauskas
Algebra II Paulius Drungilas and Jonas Jankauskas Contents 1. Quadratic forms 3 What is quadratic form? 3 Change of variables. 3 Equivalence of quadratic forms. 4 Canonical form. 4 Normal form. 7 Positive
More informationINTRODUCTION TO COMPUTATIONAL MATHEMATICS
INTRODUCTION TO COMPUTATIONAL MATHEMATICS Course Notes for CM 271 / AMATH 341 / CS 371 Fall 2007 Instructor: Prof. Justin Wan School of Computer Science University of Waterloo Course notes by Prof. Hans
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationFourier Analysis Fourier Series C H A P T E R 1 1
C H A P T E R Fourier Analysis 474 This chapter on Fourier analysis covers three broad areas: Fourier series in Secs...4, more general orthonormal series called Sturm iouville epansions in Secs..5 and.6
More informationCalculus of Variations Summer Term 2014
Calculus of Variations Summer Term 2014 Lecture 5 7. Mai 2014 c Daria Apushkinskaya 2014 () Calculus of variations lecture 5 7. Mai 2014 1 / 25 Purpose of Lesson Purpose of Lesson: To discuss catenary
More informationChapter 2 Fourier Series Phase Object Spectra
PhD University of Edinburgh 99 Phase-Only Optical Information Processing D. J. Potter Index Chapter 3 4 5 6 7 8 9 Chapter Fourier Series Phase Object Spectra In chapter one, it was noted how one may describe
More informationDensità spettrale di clutter
Densità spettrale di clutter Pierfrancesco Lombardo RRSN DIET, Università di Roma La Sapienza CLUTTER SPECTRA 1 Power Spectral Density (PSD) models Correct spectral shape impacts clutter cancellation and
More informationECEN 615 Methods of Electric Power Systems Analysis Lecture 18: Least Squares, State Estimation
ECEN 615 Methods of Electric Power Systems Analysis Lecture 18: Least Squares, State Estimation Prof. om Overbye Dept. of Electrical and Computer Engineering exas A&M University overbye@tamu.edu Announcements
More informationNumerical Methods. King Saud University
Numerical Methods King Saud University Aims In this lecture, we will... find the approximate solutions of derivative (first- and second-order) and antiderivative (definite integral only). Numerical Differentiation
More informationOverview of Beamforming
Overview of Beamforming Arye Nehorai Preston M. Green Department of Electrical and Systems Engineering Washington University in St. Louis March 14, 2012 CSSIP Lab 1 Outline Introduction Spatial and temporal
More informationThe Simplex Method: An Example
The Simplex Method: An Example Our first step is to introduce one more new variable, which we denote by z. The variable z is define to be equal to 4x 1 +3x 2. Doing this will allow us to have a unified
More informationPHYS 611, SPR 12: HOMEWORK NO. 4 Solution Guide
PHYS 611 SPR 12: HOMEWORK NO. 4 Solution Guide 1. In φ 3 4 theory compute the renormalized mass m R as a function of the physical mass m P to order g 2 in MS scheme and for an off-shell momentum subtraction
More informationModule 1: Introduction to Experimental Techniques Lecture 6: Uncertainty analysis. The Lecture Contains: Uncertainity Analysis
The Lecture Contains: Uncertainity Analysis Error Propagation Analysis of Scatter Table A1: Normal Distribution Table A2: Student's-t Distribution file:///g /optical_measurement/lecture6/6_1.htm[5/7/2012
More informationA Detailed Look at a Discrete Randomw Walk with Spatially Dependent Moments and Its Continuum Limit
A Detailed Look at a Discrete Randomw Walk with Spatially Dependent Moments and Its Continuum Limit David Vener Department of Mathematics, MIT May 5, 3 Introduction In 8.366, we discussed the relationship
More informationIn Z: x + 3 = 2 3x = 2 x = 1 No solution In Q: 3x = 2 x 2 = 2. x = 2 No solution. In R: x 2 = 2 x = 0 x = ± 2 No solution Z Q.
THE UNIVERSITY OF NEW SOUTH WALES SCHOOL OF MATHEMATICS AND STATISTICS MATH 1141 HIGHER MATHEMATICS 1A ALGEBRA. Section 1: - Complex Numbers. 1. The Number Systems. Let us begin by trying to solve various
More informationA Family of Nyquist Filters Based on Generalized Raised-Cosine Spectra
Proc. Biennial Symp. Commun. (Kingston, Ont.), pp. 3-35, June 99 A Family of Nyquist Filters Based on Generalized Raised-Cosine Spectra Nader Sheikholeslami Peter Kabal Department of Electrical Engineering
More informationTheory and Problems of Signals and Systems
SCHAUM'S OUTLINES OF Theory and Problems of Signals and Systems HWEI P. HSU is Professor of Electrical Engineering at Fairleigh Dickinson University. He received his B.S. from National Taiwan University
More informationTwo-photon nonlinearity in general cavity QED systems
PHYSICAL REVIEW A 70, 013806 (2004) Two-photon nonlinearity in general cavity QED systems Kazuki Koshino* and Hajime Ishihara CREST, Japan Science and Technology Agency, 4-1-8 Honcho, Kawaguchi, Saitama
More informationCHAPTER 2. The Simplex Method
CHAPTER 2 The Simplex Method In this chapter we present the simplex method as it applies to linear programming problems in standard form. 1. An Example We first illustrate how the simplex method works
More informationData Sparse Matrix Computation - Lecture 20
Data Sparse Matrix Computation - Lecture 20 Yao Cheng, Dongping Qi, Tianyi Shi November 9, 207 Contents Introduction 2 Theorems on Sparsity 2. Example: A = [Φ Ψ]......................... 2.2 General Matrix
More informationAppendix A Wirtinger Calculus
Precoding and Signal Shaping for Digital Transmission. Robert F. H. Fischer Copyright 0 2002 John Wiley & Sons, Inc. ISBN: 0-471-22410-3 Appendix A Wirtinger Calculus T he optimization of system parameters
More informationVector Calculus. Lecture Notes
Vector Calculus Lecture Notes Adolfo J. Rumbos c Draft date November 23, 211 2 Contents 1 Motivation for the course 5 2 Euclidean Space 7 2.1 Definition of n Dimensional Euclidean Space........... 7 2.2
More informationThe simplex algorithm
The simplex algorithm The simplex algorithm is the classical method for solving linear programs. Its running time is not polynomial in the worst case. It does yield insight into linear programs, however,
More informationPre-Calculus Midterm Practice Test (Units 1 through 3)
Name: Date: Period: Pre-Calculus Midterm Practice Test (Units 1 through 3) Learning Target 1A I can describe a set of numbers in a variety of ways. 1. Write the following inequalities in interval notation.
More informationProf. Shayla Sawyer CP08 solution
What does the time constant represent in an exponential function? How do you define a sinusoid? What is impedance? How is a capacitor affected by an input signal that changes over time? How is an inductor
More informationVariational Inference and Learning. Sargur N. Srihari
Variational Inference and Learning Sargur N. srihari@cedar.buffalo.edu 1 Topics in Approximate Inference Task of Inference Intractability in Inference 1. Inference as Optimization 2. Expectation Maximization
More informationLecture 34. Fourier Transforms
Lecture 34 Fourier Transforms In this section, we introduce the Fourier transform, a method of analyzing the frequency content of functions that are no longer τ-periodic, but which are defined over the
More informationAdvanced. Engineering Mathematics
Advanced Engineering Mathematics A new edition of Further Engineering Mathematics K. A. Stroud Formerly Principal Lecturer Department of Mathematics, Coventry University with additions by Dexter j. Booth
More informationEstimates for probabilities of independent events and infinite series
Estimates for probabilities of independent events and infinite series Jürgen Grahl and Shahar evo September 9, 06 arxiv:609.0894v [math.pr] 8 Sep 06 Abstract This paper deals with finite or infinite sequences
More informationLecture 12 : Graph Laplacians and Cheeger s Inequality
CPS290: Algorithmic Foundations of Data Science March 7, 2017 Lecture 12 : Graph Laplacians and Cheeger s Inequality Lecturer: Kamesh Munagala Scribe: Kamesh Munagala Graph Laplacian Maybe the most beautiful
More informationModular Multiplication in GF (p k ) using Lagrange Representation
Modular Multiplication in GF (p k ) using Lagrange Representation Jean-Claude Bajard, Laurent Imbert, and Christophe Nègre Laboratoire d Informatique, de Robotique et de Microélectronique de Montpellier
More informationChapter One Hilbert s 7th Problem: It s statement and origins
Chapter One Hilbert s 7th Problem: It s statement and origins At the second International Congress of athematicians in Paris, 900, the mathematician David Hilbert was invited to deliver a keynote address,
More information0 t < 0 1 t 1. u(t) =
A. M. Niknejad University of California, Berkeley EE 100 / 42 Lecture 13 p. 22/33 Step Response A unit step function is described by u(t) = ( 0 t < 0 1 t 1 While the waveform has an artificial jump (difficult
More informationA New Twist to Fourier Transforms
Hamish D. Meikle A New Twist to Fourier Transforms WILEY VCH WILEY-VCH Verlag GmbH &, Co. KGaA Table ofcontents 1 The Fourier Transform and the Helix 1 1.1 Fourier Transform Conventions 1 1.1.1 Fourier
More informationSection 3: Complex numbers
Essentially: Section 3: Complex numbers C (set of complex numbers) up to different notation: the same as R 2 (euclidean plane), (i) Write the real 1 instead of the first elementary unit vector e 1 = (1,
More informationRecitation 1 (Sep. 15, 2017)
Lecture 1 8.321 Quantum Theory I, Fall 2017 1 Recitation 1 (Sep. 15, 2017) 1.1 Simultaneous Diagonalization In the last lecture, we discussed the situations in which two operators can be simultaneously
More informationCommunication Signals (Haykin Sec. 2.4 and Ziemer Sec Sec. 2.4) KECE321 Communication Systems I
Communication Signals (Haykin Sec..4 and iemer Sec...4-Sec..4) KECE3 Communication Systems I Lecture #3, March, 0 Prof. Young-Chai Ko 년 3 월 일일요일 Review Signal classification Phasor signal and spectra Representation
More informationLinear Algebra: Lecture Notes. Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway
Linear Algebra: Lecture Notes Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway November 6, 23 Contents Systems of Linear Equations 2 Introduction 2 2 Elementary Row
More information8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x)
8. Limit Laws 8.1. Basic Limit Laws. If f and g are two functions and we know the it of each of them at a given point a, then we can easily compute the it at a of their sum, difference, product, constant
More informationpage 1 of 14 1 for all x because f 1 = f and1 f = f. The identity for = x for all x because f
page of 4 Entry # Inverses in General The term inverse is used in very different contexts in mathematics. For example, the multiplicative inverse of a number, the inverse of a function, and the inverse
More informationTOPICS IN HARMONIC ANALYSIS WITH APPLICATIONS TO RADAR AND SONAR. Willard Miller
TOPICS IN HARMONIC ANALYSIS WITH APPLICATIONS TO RADAR AND SONAR Willard Miller October 23 2002 These notes are an introduction to basic concepts and tools in group representation theory both commutative
More informationEconometric software as a theoretical research tool
Journal of Economic and Social Measurement 29 (2004) 183 187 183 IOS Press Some Milestones in Econometric Computing Econometric software as a theoretical research tool Houston H. Stokes Department of Economics,
More information1 + z 1 x (2x y)e x2 xy. xe x2 xy. x x3 e x, lim x log(x). (3 + i) 2 17i + 1. = 1 2e + e 2 = cosh(1) 1 + i, 2 + 3i, 13 exp i arctan
Complex Analysis I MT333P Problems/Homework Recommended Reading: Bak Newman: Complex Analysis Springer Conway: Functions of One Complex Variable Springer Ahlfors: Complex Analysis McGraw-Hill Jaenich:
More informationFINANCIAL OPTIMIZATION
FINANCIAL OPTIMIZATION Lecture 1: General Principles and Analytic Optimization Philip H. Dybvig Washington University Saint Louis, Missouri Copyright c Philip H. Dybvig 2008 Choose x R N to minimize f(x)
More informationPolynomial Chaos and Karhunen-Loeve Expansion
Polynomial Chaos and Karhunen-Loeve Expansion 1) Random Variables Consider a system that is modeled by R = M(x, t, X) where X is a random variable. We are interested in determining the probability of the
More informationFIBONACCI SEARCH WITH ARBITRARY FIRST EVALUATION ABSTKACT
FIBONACCI SEARCH WITH ARBITRARY FIRST EVALUATION CHRISTOPHWITZGALL Mathematics Research Laboratory, Boeing Scientific Research Laboratory ABSTKACT The Fibonacci search technique for maximizing a unimodal
More informationSection 6.2 Notes Page Trigonometric Functions; Unit Circle Approach
Section Notes Page Trigonometric Functions; Unit Circle Approach A unit circle is a circle centered at the origin with a radius of Its equation is x y = as shown in the drawing below Here the letter t
More informationANALYSIS OF WEINSTEIN'S DIFFRACTION FUNCTION
R898 Philips Res. Repts 30, 161*-170*,1975 Issue in honour of C. J. Bouwkamp ANALYSIS OF WEINSTEIN'S DIFFRACTION FUNCTION by J. BOERSMA Technological University Eindhoven Eindhoven, The Netherlands (Received
More informationOn the Optimal Insulation of Conductors 1
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS: Vol. 100, No. 2, pp. 253-263, FEBRUARY 1999 On the Optimal Insulation of Conductors 1 S. J. COX, 2 B. KAWOHL, 3 AND P. X. UHLIG 4 Communicated by K. A.
More informationSeminar on Linear Algebra
Supplement Seminar on Linear Algebra Projection, Singular Value Decomposition, Pseudoinverse Kenichi Kanatani Kyoritsu Shuppan Co., Ltd. Contents 1 Linear Space and Projection 1 1.1 Expression of Linear
More informationDirect method for variational problems by using hybrid of block-pulse and Bernoulli polynomials
Direct method for variational problems by using hybrid of block-pulse and Bernoulli polynomials M Razzaghi, Y Ordokhani, N Haddadi Abstract In this paper, a numerical method for solving variational problems
More information5. Some theorems on continuous functions
5. Some theorems on continuous functions The results of section 3 were largely concerned with continuity of functions at a single point (usually called x 0 ). In this section, we present some consequences
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Spring Semester 2015
Department of Mathematics, University of California, Berkeley YOUR OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Spring Semester 205. Please write your - or 2-digit exam number on this
More informationHow to Explain Usefulness of Different Results when Teaching Calculus: Example of the Mean Value Theorem
Journal of Uncertain Systems Vol.7, No.3, pp.164-175, 2013 Online at: www.jus.org.uk How to Explain Usefulness of Different Results when Teaching Calculus: Example of the Mean Value Theorem Olga Kosheleva
More information