FT. the Second Fundamental Theorem of Calculus
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Section 8.8: Improper Integrals
Section 8.8: Improper Integrals One of the main applications of integrals is to compute the areas under curves, as you know. A geometric question. But there are some geometric questions which we do not yet know how to do by calculus, even though they appear to have the same form. Consider the curve y = 1=x2. We can ask, what is the area of the region under the curve and right of the line x = 1? We have no reason to believe this area is finite, but let's ask. Now no integral will compute this{we have to integrate over a bounded interval. Nonetheless, we don't want to throw up our hands. So note that b 2 b Z (1=x )dx = ( 1=x) 1 = 1 1=b: 1 − j − In other words, as b gets larger and larger, the area under the curve and above [1; b] gets larger and larger; but note that it gets closer and closer to 1. Thus, our intuition tells us that the area of the region we're interested in is exactly 1. More formally: lim 1 1=b = 1: b − !1 We can rewrite that as b 2 lim Z (1=x )dx: b !1 1 Indeed, in general, if we want to compute the area under y = f(x) and right of the line x = a, we are computing b lim Z f(x)dx: b !1 a ASK: Does this limit always exist? Give some situations where it does not exist. They'll give something that blows up. -
The Error Function Mathematical Physics
R. I. Badran The Error Function Mathematical Physics The Error Function and Stirling’s Formula The Error Function: x 2 The curve of the Gaussian function y e is called the bell-shaped graph. The error function is defined as the area under part of this curve: x 2 2 erf (x) et dt 1. . 0 There are other definitions of error functions. These are closely related integrals to the above one. 2. a) The normal or Gaussian distribution function. x t2 1 1 1 x P(, x) e 2 dt erf ( ) 2 2 2 2 Proof: Put t 2u and proceed, you might reach a step of x 1 2 P(0, x) eu du P(,x) P(,0) P(0,x) , where 0 1 x P(0, x) erf ( ) Here you can prove that 2 2 . This can be done by using the definition of error function in (1). 0 u2 I I e du Now you need to find P(,0) where . To find this integral you have to put u=x first, then u= y and multiply the two resulting integrals. Make the change of variables to polar coordinate you get R. I. Badran The Error Function Mathematical Physics 0 2 2 I 2 er rdr d 0 From this latter integral you get 1 I P(,0) 2 and 2 . 1 1 x P(, x) erf ( ) 2 2 2 Q. E. D. x 2 t 1 2 1 x 2.b P(0, x) e dt erf ( ) 2 0 2 2 (as proved earlier in 2.a). -
Notes on Calculus II Integral Calculus Miguel A. Lerma
Notes on Calculus II Integral Calculus Miguel A. Lerma November 22, 2002 Contents Introduction 5 Chapter 1. Integrals 6 1.1. Areas and Distances. The Definite Integral 6 1.2. The Evaluation Theorem 11 1.3. The Fundamental Theorem of Calculus 14 1.4. The Substitution Rule 16 1.5. Integration by Parts 21 1.6. Trigonometric Integrals and Trigonometric Substitutions 26 1.7. Partial Fractions 32 1.8. Integration using Tables and CAS 39 1.9. Numerical Integration 41 1.10. Improper Integrals 46 Chapter 2. Applications of Integration 50 2.1. More about Areas 50 2.2. Volumes 52 2.3. Arc Length, Parametric Curves 57 2.4. Average Value of a Function (Mean Value Theorem) 61 2.5. Applications to Physics and Engineering 63 2.6. Probability 69 Chapter 3. Differential Equations 74 3.1. Differential Equations and Separable Equations 74 3.2. Directional Fields and Euler’s Method 78 3.3. Exponential Growth and Decay 80 Chapter 4. Infinite Sequences and Series 83 4.1. Sequences 83 4.2. Series 88 4.3. The Integral and Comparison Tests 92 4.4. Other Convergence Tests 96 4.5. Power Series 98 4.6. Representation of Functions as Power Series 100 4.7. Taylor and MacLaurin Series 103 3 CONTENTS 4 4.8. Applications of Taylor Polynomials 109 Appendix A. Hyperbolic Functions 113 A.1. Hyperbolic Functions 113 Appendix B. Various Formulas 118 B.1. Summation Formulas 118 Appendix C. Table of Integrals 119 Introduction These notes are intended to be a summary of the main ideas in course MATH 214-2: Integral Calculus. -
Antiderivatives and the Area Problem
Chapter 7 antiderivatives and the area problem Let me begin by defining the terms in the title: 1. an antiderivative of f is another function F such that F 0 = f. 2. the area problem is: ”find the area of a shape in the plane" This chapter is concerned with understanding the area problem and then solving it through the fundamental theorem of calculus(FTC). We begin by discussing antiderivatives. At first glance it is not at all obvious this has to do with the area problem. However, antiderivatives do solve a number of interesting physical problems so we ought to consider them if only for that reason. The beginning of the chapter is devoted to understanding the type of question which an antiderivative solves as well as how to perform a number of basic indefinite integrals. Once all of this is accomplished we then turn to the area problem. To understand the area problem carefully we'll need to think some about the concepts of finite sums, se- quences and limits of sequences. These concepts are quite natural and we will see that the theory for these is easily transferred from some of our earlier work. Once the limit of a sequence and a number of its basic prop- erties are established we then define area and the definite integral. Finally, the remainder of the chapter is devoted to understanding the fundamental theorem of calculus and how it is applied to solve definite integrals. I have attempted to be rigorous in this chapter, however, you should understand that there are superior treatments of integration(Riemann-Stieltjes, Lesbeque etc..) which cover a greater variety of functions in a more logically complete fashion. -
German Operetta on Broadway and in the West End, 1900–1940
Downloaded from https://www.cambridge.org/core. IP address: 170.106.202.58, on 26 Sep 2021 at 08:28:39, subject to the Cambridge Core terms of use, available at https://www.cambridge.org/core/terms. https://www.cambridge.org/core/product/2CC6B5497775D1B3DC60C36C9801E6B4 Downloaded from https://www.cambridge.org/core. IP address: 170.106.202.58, on 26 Sep 2021 at 08:28:39, subject to the Cambridge Core terms of use, available at https://www.cambridge.org/core/terms. https://www.cambridge.org/core/product/2CC6B5497775D1B3DC60C36C9801E6B4 German Operetta on Broadway and in the West End, 1900–1940 Academic attention has focused on America’sinfluence on European stage works, and yet dozens of operettas from Austria and Germany were produced on Broadway and in the West End, and their impact on the musical life of the early twentieth century is undeniable. In this ground-breaking book, Derek B. Scott examines the cultural transfer of operetta from the German stage to Britain and the USA and offers a historical and critical survey of these operettas and their music. In the period 1900–1940, over sixty operettas were produced in the West End, and over seventy on Broadway. A study of these stage works is important for the light they shine on a variety of social topics of the period – from modernity and gender relations to new technology and new media – and these are investigated in the individual chapters. This book is also available as Open Access on Cambridge Core at doi.org/10.1017/9781108614306. derek b. scott is Professor of Critical Musicology at the University of Leeds. -
Error Functions
Error functions Nikolai G. Lehtinen April 23, 2010 1 Error function erf x and complementary er- ror function erfc x (Gauss) error function is 2 x 2 erf x = e−t dt (1) √π Z0 and has properties erf ( )= 1, erf (+ ) = 1 −∞ − ∞ erf ( x)= erf (x), erf (x∗) = [erf(x)]∗ − − where the asterisk denotes complex conjugation. Complementary error function is defined as ∞ 2 2 erfc x = e−t dt = 1 erf x (2) √π Zx − Note also that 2 x 2 e−t dt = 1 + erf x −∞ √π Z Another useful formula: 2 x − t π x e 2σ2 dt = σ erf Z0 r 2 "√2σ # Some Russian authors (e.g., Mikhailovskiy, 1975; Bogdanov et al., 1976) call erf x a Cramp function. 1 2 Faddeeva function w(x) Faddeeva (or Fadeeva) function w(x)(Fadeeva and Terent’ev, 1954; Poppe and Wijers, 1990) does not have a name in Abramowitz and Stegun (1965, ch. 7). It is also called complex error function (or probability integral)(Weide- man, 1994; Baumjohann and Treumann, 1997, p. 310) or plasma dispersion function (Weideman, 1994). To avoid confusion, we will reserve the last name for Z(x), see below. Some Russian authors (e.g., Mikhailovskiy, 1975; Bogdanov et al., 1976) call it a (complex) Cramp function and denote as W (x). Faddeeva function is defined as 2 2i x 2 2 2 w(x)= e−x 1+ et dt = e−x [1+erf(ix)] = e−x erfc ( ix) (3) √π Z0 ! − Integral representations: 2 2 i ∞ e−t dt 2ix ∞ e−t dt w(x)= = (4) π −∞ x t π 0 x2 t2 Z − Z − where x> 0. -
Two Fundamental Theorems About the Definite Integral
Two Fundamental Theorems about the Definite Integral These lecture notes develop the theorem Stewart calls The Fundamental Theorem of Calculus in section 5.3. The approach I use is slightly different than that used by Stewart, but is based on the same fundamental ideas. 1 The definite integral Recall that the expression b f(x) dx ∫a is called the definite integral of f(x) over the interval [a,b] and stands for the area underneath the curve y = f(x) over the interval [a,b] (with the understanding that areas above the x-axis are considered positive and the areas beneath the axis are considered negative). In today's lecture I am going to prove an important connection between the definite integral and the derivative and use that connection to compute the definite integral. The result that I am eventually going to prove sits at the end of a chain of earlier definitions and intermediate results. 2 Some important facts about continuous functions The first intermediate result we are going to have to prove along the way depends on some definitions and theorems concerning continuous functions. Here are those definitions and theorems. The definition of continuity A function f(x) is continuous at a point x = a if the following hold 1. f(a) exists 2. lim f(x) exists xœa 3. lim f(x) = f(a) xœa 1 A function f(x) is continuous in an interval [a,b] if it is continuous at every point in that interval. The extreme value theorem Let f(x) be a continuous function in an interval [a,b]. -
Global Minimax Approximations and Bounds for the Gaussian Q-Functionbysumsofexponentials 3
IEEE TRANSACTIONS ON COMMUNICATIONS 1 Global Minimax Approximations and Bounds for the Gaussian Q-Function by Sums of Exponentials Islam M. Tanash and Taneli Riihonen , Member, IEEE Abstract—This paper presents a novel systematic methodology The Gaussian Q-function has many applications in statis- to obtain new simple and tight approximations, lower bounds, tical performance analysis such as evaluating bit, symbol, and upper bounds for the Gaussian Q-function, and functions and block error probabilities for various digital modulation thereof, in the form of a weighted sum of exponential functions. They are based on minimizing the maximum absolute or relative schemes and different fading models [5]–[11], and evaluat- error, resulting in globally uniform error functions with equalized ing the performance of energy detectors for cognitive radio extrema. In particular, we construct sets of equations that applications [12], [13], whenever noise and interference or describe the behaviour of the targeted error functions and a channel can be modelled as a Gaussian random variable. solve them numerically in order to find the optimized sets of However, in many cases formulating such probabilities will coefficients for the sum of exponentials. This also allows for establishing a trade-off between absolute and relative error by result in complicated integrals of the Q-function that cannot controlling weights assigned to the error functions’ extrema. We be expressed in a closed form in terms of elementary functions. further extend the proposed procedure to derive approximations Therefore, finding tractable approximations and bounds for and bounds for any polynomial of the Q-function, which in the Q-function becomes a necessity in order to facilitate turn allows approximating and bounding many functions of the expression manipulations and enable its application over a Q-function that meet the Taylor series conditions, and consider the integer powers of the Q-function as a special case. -
3D Volumetric Modeling with Introspective Neural Networks
The Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19) 3D Volumetric Modeling with Introspective Neural Networks Wenlong Huang,*1 Brian Lai,*2 Weijian Xu,3 Zhuowen Tu3 1University of California, Berkeley 2University of California, Los Angeles 3University of California, San Diego Abstract Classification Decision Boundary In this paper, we study the 3D volumetric modeling problem by adopting the Wasserstein introspective neural networks method (WINN) that was previously applied to 2D static im- ages. We name our algorithm 3DWINN which enjoys the same properties as WINN in the 2D case: being simultane- Classification ously generative and discriminative. Compared to the existing Wasserstein 3D volumetric modeling approaches, 3DWINN demonstrates Distance competitive results on several benchmarks in both the genera- tion and the classification tasks. In addition to the standard in- ception score, the Frechet´ Inception Distance (FID) metric is also adopted to measure the quality of 3D volumetric genera- tions. In addition, we study adversarial attacks for volumetric Training Examples CNN Architecture Learned Distribution data and demonstrate the robustness of 3DWINN against ad- Synthesis versarial examples while achieving appealing results in both classification and generation within a single model. 3DWINN is a general framework and it can be applied to the emerging tasks for 3D object and scene modeling.1 Pseudo-negative Distribution Introduction The rich representation power of the deep convolutional neu- Figure 1: Diagram of the Wasserstein introspective neural ral networks (CNN) (LeCun et al. 1989), as a discrimina- networks (adapted from Figure 1 of (Lee et al. 2018)); the tive classifier, has led to a great leap forward for the im- upper figures indicate the gradual refinement over the clas- age classification and regression tasks (Krizhevsky 2009; sification decision boundary between training examples (cir- Szegedy et al. -
Aquaris X2 X2 Pro Complete User Manual
Aquaris X2 (X2 / X2 Pro) Complete User Manual Aquaris X2 / X2 Pro The BQ team would like to thank you for purchasing your new Aquaris X2 / X2 Pro. We hope you enjoy using it. Enjoy the fastest mobile network speeds with this unlocked smartphone thanks to 4G coverage. Its dual-SIM functionality (nano-SIM) means you can use two SIM cards at the same time, even if they are from different operators. You can browse the internet rapidly, check your email, enjoy games and apps (which can be acquired directly from the device), read e-books, transfer files via Bluetooth, record audio, watch films, take photos and record videos, listen to music, chat with your friends and family and enjoy your favourite social networks. It also comes with a fingerprint scanner, enabling you to add a digital fingerprint to unlock your smartphone, authorise purchases or sign in to an application. About this manual · To make sure that you use your smartphone correctly, please read this manual carefully before you start using it. · Some of the images and screenshots shown in this manual may differ slightly from those of the final product. Likewise, due to firmware updates, it is possible that some of the information in this manual does not correspond exactly to the operation of your device. · BQ shall not be held liable for any issues relating to performance or incompatibility resulting from modification of the registry settings by the user. Nor shall it be held liable for any incompatibility issues with third-party applications available through the app stores. -
Lecture 13 Gradient Methods for Constrained Optimization
Lecture 13 Gradient Methods for Constrained Optimization October 16, 2008 Lecture 13 Outline • Gradient Projection Algorithm • Convergence Rate Convex Optimization 1 Lecture 13 Constrained Minimization minimize f(x) subject x ∈ X • Assumption 1: • The function f is convex and continuously differentiable over Rn • The set X is closed and convex ∗ • The optimal value f = infx∈Rn f(x) is finite • Gradient projection algorithm xk+1 = PX[xk − αk∇f(xk)] starting with x0 ∈ X. Convex Optimization 2 Lecture 13 Bounded Gradients Theorem 1 Let Assumption 1 hold, and suppose that the gradients are uniformly bounded over the set X. Then, the projection gradient method generates the sequence {xk} ⊂ X such that • When the constant stepsize αk ≡ α is used, we have 2 ∗ αL lim inf f(xk) ≤ f + k→∞ 2 P • When diminishing stepsize is used with k αk = +∞, we have ∗ lim inf f(xk) = f . k→∞ Proof: We use projection properties and the line of analysis similar to that of unconstrained method. HWK 6 Convex Optimization 3 Lecture 13 Lipschitz Gradients • Lipschitz Gradient Lemma For a differentiable convex function f with Lipschitz gradients, we have for all x, y ∈ Rn, 1 k∇f(x) − ∇f(y)k2 ≤ (∇f(x) − ∇f(y))T (x − y), L where L is a Lipschitz constant. • Theorem 2 Let Assumption 1 hold, and assume that the gradients of f are Lipschitz continuous over X. Suppose that the optimal solution ∗ set X is not empty. Then, for a constant stepsize αk ≡ α with 0 2 < α < L converges to an optimal point, i.e., ∗ ∗ ∗ lim kxk − x k = 0 for some x ∈ X . -
Calculus Terminology
AP Calculus BC Calculus Terminology Absolute Convergence Asymptote Continued Sum Absolute Maximum Average Rate of Change Continuous Function Absolute Minimum Average Value of a Function Continuously Differentiable Function Absolutely Convergent Axis of Rotation Converge Acceleration Boundary Value Problem Converge Absolutely Alternating Series Bounded Function Converge Conditionally Alternating Series Remainder Bounded Sequence Convergence Tests Alternating Series Test Bounds of Integration Convergent Sequence Analytic Methods Calculus Convergent Series Annulus Cartesian Form Critical Number Antiderivative of a Function Cavalieri’s Principle Critical Point Approximation by Differentials Center of Mass Formula Critical Value Arc Length of a Curve Centroid Curly d Area below a Curve Chain Rule Curve Area between Curves Comparison Test Curve Sketching Area of an Ellipse Concave Cusp Area of a Parabolic Segment Concave Down Cylindrical Shell Method Area under a Curve Concave Up Decreasing Function Area Using Parametric Equations Conditional Convergence Definite Integral Area Using Polar Coordinates Constant Term Definite Integral Rules Degenerate Divergent Series Function Operations Del Operator e Fundamental Theorem of Calculus Deleted Neighborhood Ellipsoid GLB Derivative End Behavior Global Maximum Derivative of a Power Series Essential Discontinuity Global Minimum Derivative Rules Explicit Differentiation Golden Spiral Difference Quotient Explicit Function Graphic Methods Differentiable Exponential Decay Greatest Lower Bound Differential