We can define the area of a curved region by a process similar to that by which we determined the slope of a curve: approximation by what we know and a limit.
Plans2012 Presentation: Angular PDFs and FootSLAMsusannakaiser
This document discusses using map-based angular probability density functions (PDFs) as a prior map for the FootSLAM indoor navigation system. It describes how angular PDFs are generated from floor plan waypoints using a diffusion algorithm and mapped to FootSLAM's hexagon grid. Experimental results show that using a complete prior map leads to faster map convergence and better accuracy compared to not using a prior map. The influence of the prior map can be adjusted via a strengthening factor. Prior maps that are incomplete or contain errors still provide benefits over no prior map.
This document contains the yearly teaching plan for Mathematics Form 3 at Sekolah Menengah Kebangsaan Seri Kota, Melaka for 2013. It outlines the syllabus, learning areas, learning outcomes, and assessment criteria to be covered over 7 weeks from January to February 2013. The topics include lines and angles, polygons, circles, and statistics represented through pie charts. Several public holidays are noted during this period.
The HARVEST Programme evaluates feature detectors and descriptors through indirect and direct benchmarks. Indirect benchmarks measure repeatability and matching scores on the affine covariant testbed to evaluate how features persist across transformations. Direct benchmarks evaluate features on image retrieval tasks using the Oxford 5k dataset to measure real-world performance. VLBenchmarks provides software for easily running these benchmarks and reproducing published results. It allows comparing features and selecting the best for a given application.
1998 characterisation of multilayers by x ray reflectionpmloscholte
This document presents a theoretical model for characterizing multilayers using X-ray reflection. The model includes refraction effects and describes diffuse scattering from multilayers with roughened interfaces, including islands and miscut-induced steps. The model calculates X-ray intensity profiles that can be compared to experimental data to deduce the morphology of interfaces, such as mean island size and average step height. The model is applied to experimental data from a Si/Ge multilayer and results in values consistent with AFM images.
The trifocal tensor encapsulates the projective geometry relations between three views. It depends only on the relative pose between the three cameras and their internal parameters. The trifocal tensor can uniquely determine point and line correspondences between the three views and can be used to transfer points from a correspondence in two views to the corresponding point in the third view. It consists of three 3x3 matrices that relate image lines between the views and can induce homographies between views from lines in one of the images.
Bump Mapping Unparametrized Surfaces on the GPUBrooke Hodgman
Morten S. Mikkelsen
Naughty Dog Inc., USA
May 24, 2010
Original bump mapping is only dened for surfaces
with a known surface parametrization. In this paper
a new method, for the GPU, is proposed which does
not use such a given parametrization. To compute
the perturbed normal the only inputs used are the
surface position, the height value and the original
normal.
The method decouples bump mapping from the
primitive type which allows for a higher degree of
proceduralism in both generation of the height value
and the surface.
Conic sections such as ellipses, parabolas, and hyperbolas are formed by cutting a cone with planes.
An ellipse is defined as the locus of points where the sum of distances to two fixed foci is a constant equal to the major axis length. A parabola occurs when the cutting plane is parallel to the axis and side of the cone. For a hyperbola, the cutting plane is neither parallel to the axis nor side of the cone.
The ratio of distances from a point on the conic section to the fixed point and fixed line is called the eccentricity. Eccentricity is less than 1 for ellipses, 1 for parabolas, and greater than 1 for
Wireless Positioning using Ellipsoidal ConstraintsGiovanni Soldi
This master's thesis presents a new approach for indoor positioning, based on the notion of separating ellipsoids. In order to improve the position estimation algorithm, the technique is combined with the algorithm A*, being applied to binary maps of the examined buildings to take into account obstacles such as walls.
The combination of separating ellipsoids and A seems to promise an improvement over previous algorithms based on a probabilistic approaches.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
This document proposes a novel approach for region of interest (ROI) compression of multiband satellite images using a modified JPEG standard. It describes how to adaptively vary the quantization matrix from block to block and signal this to the decoder using unused slots in the JPEG Huffman tables. This allows up to 14 different quantization levels to be used within each color plane, enabling ROI compression. The method constructs modified Huffman codes to efficiently encode the adaptively quantized satellite image in a way that is compliant with the JPEG standard. Experimental results demonstrate ROI compression of satellite images using this approach.
This document discusses numerical discretisation methods for solving transport equations using finite volume methods on polyhedral meshes. It begins by defining discretisation as representing differential equations with algebraic expressions, usually in matrix form. It then discusses representing fields on computational meshes, integrating operators over cells, and representing spatial and temporal variation to create second-order accurate discretisations. The document focuses on a methodology for discretising operators like divergence, gradient, and time derivatives to build the discretised transport equation on polyhedral meshes in a way that generalizes to different cell types.
a way to specify points on a curve or surface (or part of one) using only the control points. The curve or surface can then be rendered at any precision. In addition, normal vectors can be calculated for surfaces automatically. You can use the points generated by an evaluator in many ways - to draw dots where the surface would be, to draw a wireframe version of the surface, or to draw a fully lighted, shaded, and even textured version.
Airfoil Design for Mars Aircraft Using Modified PARSEC Geometry RepresentationMasahiro Kanazaki
The document describes a study that used computational fluid dynamics and genetic algorithms to optimize airfoil designs for aircraft intended to fly on Mars. The study represented airfoils using a modified PARSEC method and evaluated designs based on their maximum lift-to-drag ratio. The optimization process produced designs with higher lift-to-drag ratios than the baseline design, achieving this through design changes like smaller leading edge radii, increased camber, and more relaxed upper surface pressure recovery. Visualization of the results provided insight into which design parameters most affected lift-to-drag ratio. The study demonstrated an efficient method for exploring unknown airfoil design problems to achieve higher performing designs for Mars aircraft.
Four Side Distance: A New Fourier Shape SignatureIJASCSE
This paper proposes a new shape signature called Four Side Distance (FSD) for content-based image retrieval. FSD extracts features based on the distances between boundary points of a shape and the four sides of the rectangle covering the shape, making it invariant to translation, scaling, and rotation. An experiment on the MPEG-7 database shows FSD achieves better average precision than other Fourier-based signatures like polar coordinate, complex coordinate, and chord length distance signatures.
This document provides an overview of different techniques for representing polygon meshes and parametric curves. It discusses explicit representations of polygon meshes using vertex and edge lists, as well as parametric cubic curves including Hermite, Bezier, and B-spline curves. It describes how each technique represents the geometry and constraints, and properties such as continuity and invariance. Key topics covered include representations of polygon meshes, Hermite curves defined by endpoints and tangents, Bezier curves defined by control points, and B-spline curves having local control and smooth joins.
The document discusses using CT scanning and 3D shape analysis to classify carbonate rock pores. It introduces CT scanning workflow and principles, showing how it provides 3D quantitative and qualitative pore structure data. Pore shapes are mathematically described using ellipsoid fitting of principal moments of inertia to calculate dimensions L, I, and S. Shape classes are then defined based on ratios of these dimensions. The analysis aims to better characterize carbonate reservoir heterogeneity at different scales.
1) The document is a set of lecture notes for a Calculus I class covering limits.
2) It introduces the concept of limits and the error-tolerance game used to determine limits. Common limit rules and examples of limits are presented, including direct substitution, limits of polynomials, and trigonometric limits.
3) The notes cover determining limits using algebra, such as limit laws for addition, subtraction, multiplication, division and powers. Exceptions and edge cases are discussed.
Lesson 24: Areas, Distances, the Integral (Section 041 slides)Mel Anthony Pepito
We can define the area of a curved region by a process similar to that by which we determined the slope of a curve: approximation by what we know and a limit.
This document contains notes from a Calculus I class lecture on the derivative. The lecture covered the definition of the derivative and examples of how it can be used to model rates of change in various contexts like velocity, population growth, and marginal costs. It also discussed properties of the derivative like how the derivative of a function relates to whether the function is increasing or decreasing over an interval.
1) The document is a section from a Calculus I class covering limits. It includes announcements, guidelines for homework, objectives, and a detailed explanation of the definition of a limit using examples and the error-tolerance game.
2) The error-tolerance game is used as a heuristic for students to understand limits, modeling the interplay between the error in a proposed limit and the tolerance of input values.
3) Precisely, a limit is defined as for every error value ε, there exists a tolerance δ such that if the input is within δ of the target, the output will be within ε of the proposed limit.
Using implicit differentiation we can treat relations which are not quite functions like they were functions. In particular, we can find the slopes of lines tangent to curves which are not graphs of functions.
Lesson 24: Areas, Distances, the Integral (Section 021 handout)Matthew Leingang
We can define the area of a curved region by a process similar to that by which we determined the slope of a curve: approximation by what we know and a limit.
Lesson 20: Derivatives and the Shapes of Curves (handout)Matthew Leingang
This document contains lecture notes on calculus from a Calculus I course. It covers determining the monotonicity of functions using the first derivative test. Key points include using the sign of the derivative to determine if a function is increasing or decreasing over an interval, and using the first derivative test to classify critical points as local maxima, minima, or neither. Examples are provided to demonstrate finding intervals of monotonicity for various functions and applying the first derivative test.
Lesson 26: The Fundamental Theorem of Calculus (handout)Matthew Leingang
1) The document discusses lecture notes on Section 5.4: The Fundamental Theorem of Calculus from a Calculus I course. 2) It covers stating and explaining the Fundamental Theorems of Calculus and using the first fundamental theorem to find derivatives of functions defined by integrals. 3) The lecture outlines the first fundamental theorem, which relates differentiation and integration, and gives examples of applying it.
This document contains lecture notes from a Calculus I class covering Section 5.3 on evaluating definite integrals. The notes discuss using the Evaluation Theorem to calculate definite integrals, writing derivatives as indefinite integrals, and interpreting definite integrals as the net change of a function over an interval. Examples are provided to demonstrate evaluating definite integrals using the midpoint rule approximation. Properties of integrals such as additivity and the relationship between definite and indefinite integrals are also outlined.
Abstract. This manuscript provides a brief introduction to Functional Analysis. It covers basic Hilbert and Banach space theory including Lebesgue spaces and their duals (no knowledge about Lebesgue integration is assumed).
This document covers several topics related to integration including:
1. The history of calculating areas, from early civilizations knowing formulas for basic shapes to Archimedes pioneering the method of exhaustion to calculate curved regions like circles.
2. The rectangle method, which divides regions into rectangles to estimate their total area, and how taking more rectangles leads to better approximations of exact areas.
3. The relationship between integration and finding areas, where the integral of a function is the area under its curve over an interval and the derivative of the area function is the bounding curve.
4. Properties of indefinite integrals like additivity and the substitution rule for performing integrals of composite functions.
Lesson 24: Areas, Distances, the Integral (Section 021 slides)Matthew Leingang
The document outlines methods for calculating the areas of various shapes, including curved regions. It discusses the work of ancient Greek mathematicians Euclid and Archimedes, who developed early techniques for finding areas. The document also describes the work of Cavalieri in the 1600s, who introduced a new approach using rectangles inscribed in curved regions. The goal is to introduce the concept of the definite integral as a limit of Riemann sums, allowing the calculation of areas of any shape bounded by a curve.
Lesson 24: Areas, Distances, the Integral (Section 021 slidesMel Anthony Pepito
We can define the area of a curved region by a process similar to that by which we determined the slope of a curve: approximation by what we know and a limit.
Uncountably many problems in life and nature can be expressed in terms of an optimization principle. We look at the process and find a few good examples.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
This document proposes a novel approach for region of interest (ROI) compression of multiband satellite images using a modified JPEG standard. It describes how to adaptively vary the quantization matrix from block to block and signal this to the decoder using unused slots in the JPEG Huffman tables. This allows up to 14 different quantization levels to be used within each color plane, enabling ROI compression. The method constructs modified Huffman codes to efficiently encode the adaptively quantized satellite image in a way that is compliant with the JPEG standard. Experimental results demonstrate ROI compression of satellite images using this approach.
This document discusses numerical discretisation methods for solving transport equations using finite volume methods on polyhedral meshes. It begins by defining discretisation as representing differential equations with algebraic expressions, usually in matrix form. It then discusses representing fields on computational meshes, integrating operators over cells, and representing spatial and temporal variation to create second-order accurate discretisations. The document focuses on a methodology for discretising operators like divergence, gradient, and time derivatives to build the discretised transport equation on polyhedral meshes in a way that generalizes to different cell types.
a way to specify points on a curve or surface (or part of one) using only the control points. The curve or surface can then be rendered at any precision. In addition, normal vectors can be calculated for surfaces automatically. You can use the points generated by an evaluator in many ways - to draw dots where the surface would be, to draw a wireframe version of the surface, or to draw a fully lighted, shaded, and even textured version.
Airfoil Design for Mars Aircraft Using Modified PARSEC Geometry RepresentationMasahiro Kanazaki
The document describes a study that used computational fluid dynamics and genetic algorithms to optimize airfoil designs for aircraft intended to fly on Mars. The study represented airfoils using a modified PARSEC method and evaluated designs based on their maximum lift-to-drag ratio. The optimization process produced designs with higher lift-to-drag ratios than the baseline design, achieving this through design changes like smaller leading edge radii, increased camber, and more relaxed upper surface pressure recovery. Visualization of the results provided insight into which design parameters most affected lift-to-drag ratio. The study demonstrated an efficient method for exploring unknown airfoil design problems to achieve higher performing designs for Mars aircraft.
Four Side Distance: A New Fourier Shape SignatureIJASCSE
This paper proposes a new shape signature called Four Side Distance (FSD) for content-based image retrieval. FSD extracts features based on the distances between boundary points of a shape and the four sides of the rectangle covering the shape, making it invariant to translation, scaling, and rotation. An experiment on the MPEG-7 database shows FSD achieves better average precision than other Fourier-based signatures like polar coordinate, complex coordinate, and chord length distance signatures.
This document provides an overview of different techniques for representing polygon meshes and parametric curves. It discusses explicit representations of polygon meshes using vertex and edge lists, as well as parametric cubic curves including Hermite, Bezier, and B-spline curves. It describes how each technique represents the geometry and constraints, and properties such as continuity and invariance. Key topics covered include representations of polygon meshes, Hermite curves defined by endpoints and tangents, Bezier curves defined by control points, and B-spline curves having local control and smooth joins.
The document discusses using CT scanning and 3D shape analysis to classify carbonate rock pores. It introduces CT scanning workflow and principles, showing how it provides 3D quantitative and qualitative pore structure data. Pore shapes are mathematically described using ellipsoid fitting of principal moments of inertia to calculate dimensions L, I, and S. Shape classes are then defined based on ratios of these dimensions. The analysis aims to better characterize carbonate reservoir heterogeneity at different scales.
1) The document is a set of lecture notes for a Calculus I class covering limits.
2) It introduces the concept of limits and the error-tolerance game used to determine limits. Common limit rules and examples of limits are presented, including direct substitution, limits of polynomials, and trigonometric limits.
3) The notes cover determining limits using algebra, such as limit laws for addition, subtraction, multiplication, division and powers. Exceptions and edge cases are discussed.
Lesson 24: Areas, Distances, the Integral (Section 041 slides)Mel Anthony Pepito
We can define the area of a curved region by a process similar to that by which we determined the slope of a curve: approximation by what we know and a limit.
This document contains notes from a Calculus I class lecture on the derivative. The lecture covered the definition of the derivative and examples of how it can be used to model rates of change in various contexts like velocity, population growth, and marginal costs. It also discussed properties of the derivative like how the derivative of a function relates to whether the function is increasing or decreasing over an interval.
1) The document is a section from a Calculus I class covering limits. It includes announcements, guidelines for homework, objectives, and a detailed explanation of the definition of a limit using examples and the error-tolerance game.
2) The error-tolerance game is used as a heuristic for students to understand limits, modeling the interplay between the error in a proposed limit and the tolerance of input values.
3) Precisely, a limit is defined as for every error value ε, there exists a tolerance δ such that if the input is within δ of the target, the output will be within ε of the proposed limit.
Using implicit differentiation we can treat relations which are not quite functions like they were functions. In particular, we can find the slopes of lines tangent to curves which are not graphs of functions.
Lesson 24: Areas, Distances, the Integral (Section 021 handout)Matthew Leingang
We can define the area of a curved region by a process similar to that by which we determined the slope of a curve: approximation by what we know and a limit.
Lesson 20: Derivatives and the Shapes of Curves (handout)Matthew Leingang
This document contains lecture notes on calculus from a Calculus I course. It covers determining the monotonicity of functions using the first derivative test. Key points include using the sign of the derivative to determine if a function is increasing or decreasing over an interval, and using the first derivative test to classify critical points as local maxima, minima, or neither. Examples are provided to demonstrate finding intervals of monotonicity for various functions and applying the first derivative test.
Lesson 26: The Fundamental Theorem of Calculus (handout)Matthew Leingang
1) The document discusses lecture notes on Section 5.4: The Fundamental Theorem of Calculus from a Calculus I course. 2) It covers stating and explaining the Fundamental Theorems of Calculus and using the first fundamental theorem to find derivatives of functions defined by integrals. 3) The lecture outlines the first fundamental theorem, which relates differentiation and integration, and gives examples of applying it.
This document contains lecture notes from a Calculus I class covering Section 5.3 on evaluating definite integrals. The notes discuss using the Evaluation Theorem to calculate definite integrals, writing derivatives as indefinite integrals, and interpreting definite integrals as the net change of a function over an interval. Examples are provided to demonstrate evaluating definite integrals using the midpoint rule approximation. Properties of integrals such as additivity and the relationship between definite and indefinite integrals are also outlined.
Abstract. This manuscript provides a brief introduction to Functional Analysis. It covers basic Hilbert and Banach space theory including Lebesgue spaces and their duals (no knowledge about Lebesgue integration is assumed).
This document covers several topics related to integration including:
1. The history of calculating areas, from early civilizations knowing formulas for basic shapes to Archimedes pioneering the method of exhaustion to calculate curved regions like circles.
2. The rectangle method, which divides regions into rectangles to estimate their total area, and how taking more rectangles leads to better approximations of exact areas.
3. The relationship between integration and finding areas, where the integral of a function is the area under its curve over an interval and the derivative of the area function is the bounding curve.
4. Properties of indefinite integrals like additivity and the substitution rule for performing integrals of composite functions.
Lesson 24: Areas, Distances, the Integral (Section 021 slides)Matthew Leingang
The document outlines methods for calculating the areas of various shapes, including curved regions. It discusses the work of ancient Greek mathematicians Euclid and Archimedes, who developed early techniques for finding areas. The document also describes the work of Cavalieri in the 1600s, who introduced a new approach using rectangles inscribed in curved regions. The goal is to introduce the concept of the definite integral as a limit of Riemann sums, allowing the calculation of areas of any shape bounded by a curve.
Lesson 24: Areas, Distances, the Integral (Section 021 slidesMel Anthony Pepito
We can define the area of a curved region by a process similar to that by which we determined the slope of a curve: approximation by what we know and a limit.
Uncountably many problems in life and nature can be expressed in terms of an optimization principle. We look at the process and find a few good examples.
This document discusses key concepts in calculus including differentiation, integration, graphing functions, and calculating total vs net distance. It defines the derivative as the rate of change of a variable and outlines differentiation rules. Integration is defined as the area under a curve and the fundamental theorem of calculus is explained. Graphing techniques are outlined including finding zeros, critical points, concavity, and inflection points. Total distance is defined as the absolute distance traveled regardless of path while net distance is the displacement from the original position.
This document provides instructions on how to construct and use various types of scales including plain, diagonal, vernier, comparative, and cord scales. Plain scales can be used to measure dimensions up to a single decimal place, while diagonal and vernier scales allow for measurements up to two decimals. Examples are given for how to draw scales with specific representative factors and measure or represent given distances on each type of scale. Formulas are also provided for calculating representative factors from an object's actual and drawn dimensions.
Lesson 25: Areas and Distances; The Definite IntegralMatthew Leingang
Thus begins the second "half" of calculus—in which we attempt to find areas of curved regions. Like with derivatives, we use a limiting process starting from things we know (areas of rectangles) and finer and finer approximations.
Here are the steps to solve this problem:
1) Given: Scale ratio = 1 cm = 1 m
2) To read decimeter, each cm on the scale must represent 10 dm = 1 m
3) So each cm is divided into 10 equal parts
4) Each part represents 1 dm
5) Label the scale accordingly
Therefore, the scale is drawn with each cm divided into 10 equal parts and each part labelled as 1 dm.
At times it is useful to consider a function whose derivative is a given function. We look at the general idea of reversing the differentiation process and its applications to rectilinear motion.
This document provides guidance on developing effective lesson plans for calculus instructors. It recommends starting by defining specific learning objectives and assessments. Examples should be chosen carefully to illustrate concepts and engage students at a variety of levels. The lesson plan should include an introductory problem, definitions, theorems, examples, and group work. Timing for each section should be estimated. After teaching, the lesson can be improved by analyzing what was effective and what needs adjustment for the next time. Advanced preparation is key to looking prepared and ensuring students learn.
Streamlining assessment, feedback, and archival with auto-multiple-choiceMatthew Leingang
Auto-multiple-choice (AMC) is an open-source optical mark recognition software package built with Perl, LaTeX, XML, and sqlite. I use it for all my in-class quizzes and exams. Unique papers are created for each student, fixed-response items are scored automatically, and free-response problems, after manual scoring, have marks recorded in the same process. In the first part of the talk I will discuss AMC’s many features and why I feel it’s ideal for a mathematics course. My contributions to the AMC workflow include some scripts designed to automate the process of returning scored papers
back to students electronically. AMC provides an email gateway, but I have written programs to return graded papers via the DAV protocol to student’s dropboxes on our (Sakai) learning management systems. I will also show how graded papers can be archived, with appropriate metadata tags, into an Evernote notebook.
This document discusses electronic grading of paper assessments using PDF forms. Key points include:
- Various tools for creating fillable PDF forms using LaTeX packages or desktop software.
- Methods for stamping completed forms onto scanned documents including using pdftk or overlaying in TikZ.
- Options for grading on tablets or desktops including GoodReader, PDFExpert, Adobe Acrobat.
- Extracting data from completed forms can be done in Adobe Acrobat or via command line with pdftk.
Integration by substitution is the chain rule in reverse.
NOTE: the final location is section specific. Section 1 (morning) is in SILV 703, Section 11 (afternoon) is in CANT 200
Lesson 26: The Fundamental Theorem of Calculus (slides)Matthew Leingang
g(x) represents the area under the curve of f(t) between 0 and x.
.
x
What can you say about g? 2 4 6 8 10f
The First Fundamental Theorem of Calculus
Theorem (First Fundamental Theorem of Calculus)
Let f be a con nuous func on on [a, b]. Define the func on F on [a, b] by
∫ x
F(x) = f(t) dt
a
Then F is con nuous on [a, b] and differentiable on (a, b) and for all x in (a, b),
F′(x
Lesson 26: The Fundamental Theorem of Calculus (slides)Matthew Leingang
The document discusses the Fundamental Theorem of Calculus, which has two parts. The first part states that if a function f is continuous on an interval, then the derivative of the integral of f is equal to f. This is proven using Riemann sums. The second part relates the integral of a function f to the integral of its derivative F'. Examples are provided to illustrate how the area under a curve relates to these concepts.
Lesson 27: Integration by Substitution (handout)Matthew Leingang
This document contains lecture notes on integration by substitution from a Calculus I class. It introduces the technique of substitution for both indefinite and definite integrals. For indefinite integrals, the substitution rule is presented, along with examples of using substitutions to evaluate integrals involving polynomials, trigonometric, exponential, and other functions. For definite integrals, the substitution rule is extended and examples are worked through both with and without first finding the indefinite integral. The document emphasizes that substitution often simplifies integrals and makes them easier to evaluate.
This document contains notes from a calculus class lecture on evaluating definite integrals. It discusses using the evaluation theorem to evaluate definite integrals, writing derivatives as indefinite integrals, and interpreting definite integrals as the net change of a function over an interval. The document also contains examples of evaluating definite integrals, properties of integrals, and an outline of the key topics covered.
Lesson 24: Areas and Distances, The Definite Integral (slides)Matthew Leingang
We can define the area of a curved region by a process similar to that by which we determined the slope of a curve: approximation by what we know and a limit.
At times it is useful to consider a function whose derivative is a given function. We look at the general idea of reversing the differentiation process and its applications to rectilinear motion.
This document contains lecture notes from a Calculus I class discussing optimization problems. It begins with announcements about upcoming exams and courses the professor is teaching. It then presents an example problem about finding the rectangle of a fixed perimeter with the maximum area. The solution uses calculus techniques like taking the derivative to find the critical points and determine that the optimal rectangle is a square. The notes discuss strategies for solving optimization problems and summarize the key steps to take.
The document discusses curve sketching of functions by analyzing their derivatives. It provides:
1) A checklist for graphing a function which involves finding where the function is positive/negative/zero, its monotonicity from the first derivative, and concavity from the second derivative.
2) An example of graphing the cubic function f(x) = 2x^3 - 3x^2 - 12x through analyzing its derivatives.
3) Explanations of the increasing/decreasing test and concavity test to determine monotonicity and concavity from a function's derivatives.
The document contains lecture notes on curve sketching from a Calculus I class. It discusses using the first and second derivative tests to determine properties of a function like monotonicity, concavity, maxima, minima, and points of inflection in order to sketch the graph of the function. It then provides an example of using these tests to sketch the graph of the cubic function f(x) = 2x^3 - 3x^2 - 12x.
Lesson 20: Derivatives and the Shapes of Curves (slides)Matthew Leingang
This document contains lecture notes on derivatives and the shapes of curves from a Calculus I class taught by Professor Matthew Leingang at New York University. The notes cover using derivatives to determine the intervals where a function is increasing or decreasing, classifying critical points as maxima or minima, using the second derivative to determine concavity, and applying the first and second derivative tests. Examples are provided to illustrate finding intervals of monotonicity for various functions.
The Mean Value Theorem is the most important theorem in calculus. It is the first theorem which allows us to infer information about a function from information about its derivative. From the MVT we can derive tests for the monotonicity (increase or decrease) and concavity of a function.
There are various reasons why we would want to find the extreme (maximum and minimum values) of a function. Fermat's Theorem tells us we can find local extreme points by looking at critical points. This process is known as the Closed Interval Method.
There are various reasons why we would want to find the extreme (maximum and minimum values) of a function. Fermat's Theorem tells us we can find local extreme points by looking at critical points. This process is known as the Closed Interval Method.
We cover the inverses to the trigonometric functions sine, cosine, tangent, cotangent, secant, cosecant, and their derivatives. The remarkable fact is that although these functions and their inverses are transcendental (complicated) functions, the derivatives are algebraic functions. Also, we meet my all-time favorite function: arctan.
Getting Started with AWS - Enterprise Landing Zone for Terraform Learning & D...Chris Wahl
Recording: https://youtu.be/PASG0NTKUQA?si=1Ih7O9z0Lk0IzX9n
Welcome innovators! In this comprehensive tutorial, you will learn how to get started with AWS Cloud and Terraform to build an enterprise-like landing zone for a secure, low-cost environment to develop with Terraform. We'll guide you through setting up AWS Control Tower, Identity and Access Management, and creating a sandbox account, ensuring you have a safe and controlled area for learning and development. You'll also learn about budget management, single sign-on setup, and using AWS organizations for policy management. Plus, dive deep into Terraform basics, including setting up state management, migrating local state to remote state, and making resource modifications using your new infrastructure as code skills. Perfect for beginners looking to master AWS and Terraform essentials!
William Maclyn Murphy McRae, a logistics expert with 9+ years of experience, is known for optimizing supply chain operations and consistently exceeding industry standards. His strategic approach, combined with hands-on execution, has streamlined distribution processes, reduced lead times, and consistently delivered exceptional results.
Leadership u automatizaciji: RPA priče iz prakse!UiPathCommunity
Dobrodošli na "AI Powered Automation Leadership Talks", online događaj koji okuplja senior lidere i menadžere iz različitih industrija kako bi podelili svoja iskustva, izazove i strategije u oblasti RPA (Robotic Process Automation). Ovaj događaj pruža priliku da zavirite u način razmišljanja ljudi koji donose ključne odluke u automatizaciji i liderstvu.
📕 Kroz panel diskusiju sa tri izuzetna stručnjaka, istražićemo:
Kako uspešno započeti i skalirati RPA projekte u organizacijama.
Koji su najveći izazovi u implementaciji RPA-a i kako ih prevazići.
Na koje načine automatizacija menja radne procese i pomaže timovima da ostvare više.
Bez obzira na vaše iskustvo sa UiPath-om ili RPA uopšte, ovaj događaj je osmišljen kako bi bio koristan svima – od menadžera do tehničkih lidera, i svima koji žele da unaprede svoje razumevanje automatizacije.
Pridružite nam se i iskoristite ovu jedinstvenu priliku da naučite od onih koji vode automatizaciju u svojim organizacijama. Pripremite svoja pitanja i inspiraciju za sledeće korake u vašoj RPA strategiji!
GDG Cloud Southlake #40: Brandon Stokes: How to Build a Great ProductJames Anderson
How to Build a Great Product
Being a tech entrepreneur is about providing a remarkable product or service that serves the needs of its customers better, faster, and cheaper than anything else. The goal is to "make something people want" which we call, product market fit.
But how do we get there? We'll explore the process of taking an idea to product market fit (PMF), how you know you have true PMF, and how your product strategies differ pre-PMF from post-PMF.
Brandon is a 3x founder, 1x exit, ex-banker & corporate strategist, car dealership owner, and alumnus of Techstars & Y Combinator. He enjoys building products and services that impact people for the better.
Brandon has had 3 different careers (banking, corporate finance & strategy, technology) in 7 different industries; Investment Banking, CPG, Media & Entertainment, Telecommunications, Consumer application, Automotive, & Fintech/Insuretech.
He's an idea to revenue leader and entrepreneur that helps organizations build products and processes, hire talent, test & iterate quickly, collect feedback, and grow in unregulated and heavily regulated industries.
UiPath Automation Developer Associate Training Series 2025 - Session 1DianaGray10
Welcome to UiPath Automation Developer Associate Training Series 2025 - Session 1.
In this session, we will cover the following topics:
Introduction to RPA & UiPath Studio
Overview of RPA and its applications
Introduction to UiPath Studio
Variables & Data Types
Control Flows
You are requested to finish the following self-paced training for this session:
Variables, Constants and Arguments in Studio 2 modules - 1h 30m - https://academy.uipath.com/courses/variables-constants-and-arguments-in-studio
Control Flow in Studio 2 modules - 2h 15m - https:/academy.uipath.com/courses/control-flow-in-studio
⁉️ For any questions you may have, please use the dedicated Forum thread. You can tag the hosts and mentors directly and they will reply as soon as possible.
FinTech is reshaping the way businesses handle payments, risk management, and financial operations. From AI-driven fraud detection to blockchain-powered security, the right FinTech solutions can streamline processes, reduce costs, and improve decision-making. This guide explores 10 essential FinTech tools that help businesses stay ahead in an increasingly digital economy.
Discover how digital payments, credit risk management, treasury solutions, AI, blockchain, and RegTech can enhance efficiency, security, and profitability.
Read now to learn how businesses are leveraging FinTech for smarter financial management!
Predictive vs. Preventive Maintenance — Which One is Right for Your FactoryDiagsense ltd
Efficient maintenance is the backbone of any manufacturing operation. It ensures that machinery runs smoothly, minimizes downtime and optimizes overall productivity. Earlier, factories have relied on preventive maintenance but with advancements in technology, Manufacturing PdM Solutions is gaining traction. The question is—which one is the right fit for your factory? Let’s break it down.
5 Best Agentic AI Frameworks for 2025.pdfSoluLab1231
AI chatbots use generative AI to develop answers from a single interaction. When someone asks a question, the chatbot responds using a natural language process (NLP). Agentic AI, the next wave of artificial intelligence, goes beyond this by solving complicated multistep problems on its way by using advanced reasoning and iterative planning. Additionally, it is expected to improve operations and productivity across all sectors.
How to teach M365 Copilot and M365 Copilot Chat prompting to your colleagues. Presented at the Advanced Learning Institute's "Internal Communications Strategies with M365" event on February 27, 2025. Intended audience: Internal Communicators, User Adoption Specialists, IT.
5 Must-Use AI Tools to Supercharge Your Productivity!
AI is changing the game! 🚀 From research to creativity and coding, here are 5 powerful AI tools you should try.
NotebookLM
📚 NotebookLM – Your AI Research Assistant
✅ Organizes & summarizes notes
✅ Generates insights from multiple sources
✅ Ideal for students, researchers & writers
📝 Boost your productivity with smarter note-taking!
Napkin.ai
🎨 Napkin.ai – The Creativity Booster
✅ Connects and organizes ideas
✅ Perfect for writers, designers & entrepreneurs
✅ Acts as your AI-powered brainstorming partner
💡 Unleash your creativity effortlessly!
DeepSeek
🔍 DeepSeek – Smarter AI Search
✅ Delivers deeper & more precise search results
✅ Analyzes large datasets for better insights
✅ Ideal for professionals & researchers
🔎 Find what you need—faster & smarter!
ChatGPT
💬 ChatGPT – Your AI Chat Assistant
✅ Answers questions, writes content & assists in coding
✅ Helps businesses with customer support
✅ Boosts learning & productivity
🤖 From content to coding—ChatGPT does it all!
Devin AI
💻 Devin AI – AI for Coders
✅ Writes, debugs & optimizes code
✅ Assists developers at all skill levels
✅ Makes coding faster & more efficient
👨💻 Let AI be your coding partner!
🚀 AI is transforming the way we work!
DevOps iş təhlükəsizliyi sizi maraqlandırır? İstər developer, istər təhlükəsizlik mühəndisi, istərsə də DevOps həvəskarı olun, bu tədbir şəbəkələşmək, biliklərinizi bölüşmək və DevSecOps sahəsində ən son təcrübələri öyrənmək üçün mükəmməl fürsətdir!
Bu workshopda DevOps infrastrukturlarının təhlükəsizliyini necə artırmaq barədə danışacayıq. DevOps sistemləri qurularkən avtomatlaşdırılmış, yüksək əlçatan və etibarlı olması ilə yanaşı, həm də təhlükəsizlik məsələləri nəzərə alınmalıdır. Bu səbəbdən, DevOps komandolarının təhlükəsizliyə yönəlmiş praktikalara riayət etməsi vacibdir.
Bedrock Data Automation (Preview): Simplifying Unstructured Data ProcessingZilliz
Bedrock Data Automation (BDA) is a cloud-based service that simplifies the process of extracting valuable insights from unstructured content—such as documents, images, video, and audio. Come learn how BDA leverages generative AI to automate the transformation of multi-modal data into structured formats, enabling developers to build applications and automate complex workflows with greater speed and accuracy.
Computational Photography: How Technology is Changing Way We Capture the WorldHusseinMalikMammadli
📸 Computational Photography (Computer Vision/Image): How Technology is Changing the Way We Capture the World
Heç düşünmüsünüzmü, müasir smartfonlar və kameralar necə bu qədər gözəl görüntülər yaradır? Bunun sirri Computational Fotoqrafiyasında(Computer Vision/Imaging) gizlidir—şəkilləri çəkmə və emal etmə üsulumuzu təkmilləşdirən, kompüter elmi ilə fotoqrafiyanın inqilabi birləşməsi.
DealBook of Ukraine: 2025 edition | AVentures CapitalYevgen Sysoyev
The DealBook is our annual overview of the Ukrainian tech investment industry. This edition comprehensively covers the full year 2024 and the first deals of 2025.
UiPath Document Understanding - Generative AI and Active learning capabilitiesDianaGray10
This session focus on Generative AI features and Active learning modern experience with Document understanding.
Topics Covered:
Overview of Document Understanding
How Generative Annotation works?
What is Generative Classification?
How to use Generative Extraction activities?
What is Generative Validation?
How Active learning modern experience accelerate model training?
Q/A
❓ If you have any questions or feedback, please refer to the "Women in Automation 2025" dedicated Forum thread. You can find there extra details and updates.
DevNexus - Building 10x Development Organizations.pdfJustin Reock
Developer Experience is Dead! Long Live Developer Experience!
In this keynote-style session, we’ll take a detailed, granular look at the barriers to productivity developers face today and modern approaches for removing them. 10x developers may be a myth, but 10x organizations are very real, as proven by the influential study performed in the 1980s, ‘The Coding War Games.’
Right now, here in early 2025, we seem to be experiencing YAPP (Yet Another Productivity Philosophy), and that philosophy is converging on developer experience. It seems that with every new method, we invent to deliver products, whether physical or virtual, we reinvent productivity philosophies to go alongside them.
But which of these approaches works? DORA? SPACE? DevEx? What should we invest in and create urgency behind today so we don’t have the same discussion again in a decade?
AI Trends and Fun Demos – Sotheby’s Rehoboth PresentationEthan Holland
Ethan B. Holland explores the impact of artificial intelligence on real estate and digital transformation. Covering key AI trends such as multimodal AI, agency, co-pilots, and AI-powered computer usage, the document highlights how emerging technologies are reshaping industries. It includes real-world demonstrations of AI in action, from automated real estate insights to AI-generated voice and video applications. With expertise in digital transformation, Ethan shares insights from his work optimizing workflows with AI tools, automation, and large language models. This presentation is essential for professionals seeking to understand AI’s role in business, automation, and real estate.
AI Trends and Fun Demos – Sotheby’s Rehoboth PresentationEthan Holland
Lesson 24: Areas and Distances, The Definite Integral (handout)
1. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Sec on 5.1–5.2
Areas and Distances, The Definite
Integral
V63.0121.001: Calculus I
Professor Ma hew Leingang
New York University
April 25, 2011
.
.
Notes
Announcements
Quiz 5 on Sec ons
4.1–4.4 April 28/29
Final Exam Thursday May
12, 2:00–3:50pm
cumula ve
loca on TBD
old exams on common
website
.
.
Notes
Objectives from Section 5.1
Compute the area of a region by
approxima ng it with rectangles
and le ng the size of the
rectangles tend to zero.
Compute the total distance
traveled by a par cle by
approxima ng it as distance =
(rate)( me) and le ng the me
intervals over which one
approximates tend to zero.
.
.
. 1
.
2. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Objectives from Section 5.2
Compute the definite integral
using a limit of Riemann sums
Es mate the definite integral
using a Riemann sum (e.g.,
Midpoint Rule)
Reason with the definite integral
using its elementary proper es.
.
.
Notes
Outline
Area through the Centuries
Euclid
Archimedes
Cavalieri
Generalizing Cavalieri’s method
Analogies
Distances
Other applica ons
The definite integral as a limit
Es ma ng the Definite Integral
Proper es of the integral
Comparison Proper es of the Integral
.
.
Notes
Easy Areas: Rectangle
Defini on
The area of a rectangle with dimensions ℓ and w is the product
A = ℓw.
w
.
ℓ
It may seem strange that this is a defini on and not a theorem but
. we have to start somewhere.
.
. 2
.
3. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Easy Areas: Parallelogram
By cu ng and pas ng, a parallelogram can be made into a rectangle.
h
.
So b b
Fact
The area of a parallelogram of base width b and height h is
A = bh
.
.
Notes
Easy Areas: Triangle
By copying and pas ng, a triangle can be made into a parallelogram.
h
.
b
So
Fact
The area of a triangle of base width b and height h is
1
A = bh
. 2
.
Notes
Easy Areas: Other Polygons
Any polygon can be triangulated, so its area can be found by
summing the areas of the triangles:
.
.
.
.
. 3
.
4. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Hard Areas: Curved Regions
.
???
.
.
.
Notes
Meet the mathematician: Archimedes
Greek (Syracuse), 287 BC
– 212 BC (a er Euclid)
Geometer
Weapons engineer
.
.
Notes
Archimedes and the Parabola
1 1
64 64
1
1 1
8 8
1 1
64 64
.
Archimedes found areas of a sequence of triangles inscribed in a
parabola.
1 1 1 1 1
A=1+2· +4· + ··· = 1 + + + ··· + n + ···
8 64 4 16 4
.
.
. 4
.
5. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Summing a geometric series
Fact
For any number r and any posi ve integer n,
(1 − r)(1 + r + r2 + · · · + rn ) = 1 − rn+1 .
Proof.
(1 − r)(1 + r + r2 + · · · + rn )
= (1 + r + r2 + · · · + rn ) − r(1 + r + r2 + · · · + rn )
= (1 + r + r2 + · · · + rn ) − (r + r2 + r3 · · · + rn + rn+1 )
= 1 − rn+1
.
.
Notes
Summing a geometric series
Fact
For any number r and any posi ve integer n,
(1 − r)(1 + r + r2 + · · · + rn ) = 1 − rn+1 .
Corollary
1 − rn+1
1 + r + · · · + rn =
1−r
.
.
Notes
Summing the series
We need to know the value of the series
1 1 1
1+ + + ··· + n + ···
4 16 4
Using the corollary,
1 1 1 1 − (1/4)n+1 1 4
1+ + + ··· + n = → 3 = as n → ∞.
4 16 4 1 − 1/4 /4 3
.
.
. 5
.
6. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Cavalieri
Italian,
1598–1647
Revisited
the area
problem
with a
different
perspec ve
.
.
Notes
Cavalieri’s method
Divide up the interval into pieces and
y = x2 measure the area of the inscribed
rectangles:
1
L2 =
8
1 4 5
L3 = + =
27 27 27
1 4 9 14
L4 = + + =
. 64 64 64 64
1 4 9 16 30
0 1 L5 = + + + =
125 125 125 125 125
Ln =?
.
.
Notes
The Square Pyramidial Numbers
Fact
Let n be a posi ve integer. Then
n(n − 1)(2n − 1)
1 + 22 + 32 + · · · + (n − 1)2 =
6
This formula was known to the Arabs and discussed by Fibonacci in
his book Liber Abaci.
.
.
. 6
.
7. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
What is Ln? 1
Divide the interval [0, 1] into n pieces. Then each has width . The
n
rectangle over the ith interval and under the parabola has area
( )2
1 i−1 (i − 1)2
· = .
n n n3
So
1 22 (n − 1)2 1 + 22 + 32 + · · · + (n − 1)2
Ln = 3
+ 3 + ··· + 3
=
n n n n3
So
n(n − 1)(2n − 1) 1
Ln = →
6n3 3
. as n → ∞.
.
Notes
Cavalieri’s method for different functions
Try the same trick with f(x) = x3 . We have
( ) ( ) ( )
1 1 1 2 1 n−1
Ln = · f + ·f + ··· + · f
n n n n n n
1 1 1 23 1 (n − 1)3
= · 3 + · 3 + ··· + ·
n n n n n n3
1 + 23 + 33 + · · · + (n − 1)3
=
n4
n2 (n − 1)2 1
= →
4n4 4
as n → ∞.
.
.
Notes
Nicomachus’s Theorem
Fact (Nicomachus 1st c. CE, Aryabhata 5th c., Al-Karaji 11th c.)
1 + 23 + 33 + · · · + (n − 1)3 = [1 + 2 + · · · + (n − 1)]2
[1 ]2
= 2 n(n − 1)
.
.
. 7
.
8. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Cavalieri’s method with different heights
1 13 1 23 1 n3
Rn = · 3 + · 3 + ··· + · 3
n n n n n n
13 + 23 + 33 + · · · + n3
=
n4
1 [1 ]2
= 4 2 n(n + 1)
n
n2 (n + 1)2 1
. = →
4n4 4
as n → ∞.
So even though the rectangles overlap, we s ll get the same answer.
.
.
Notes
Outline
Area through the Centuries
Euclid
Archimedes
Cavalieri
Generalizing Cavalieri’s method
Analogies
Distances
Other applica ons
The definite integral as a limit
Es ma ng the Definite Integral
Proper es of the integral
Comparison Proper es of the Integral
.
.
Notes
Cavalieri’s method in general
Problem
Let f be a posi ve func on defined
on the interval [a, b]. Find the
area between x = a, x = b, y = 0,
and y = f(x).
.
. x x
x0 x1. . . xi . . xn−1 n
.
.
. 8
.
9. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Cavalieri’s method in general
For each posi ve integer n, divide up the interval into n pieces. Then
b−a
∆x = . For each i between 1 and n, let xi be the ith step
n
between a and b.
x0 = a
b−a
x1 = x0 + ∆x = a +
n
b−a
x2 = x1 + ∆x = a + 2 · ...
n
b−a
xi = a + i · ...
n
. b−a
. x x
x0 x1. . . xi . . xn−1 n xn = a + n · =b
n
.
.
Notes
Forming Riemann Sums
Choose ci to be a point in the ith interval [xi−1 , xi ]. Form the
Riemann sum
∑
n
Sn = f(c1 )∆x + f(c2 )∆x + · · · + f(cn )∆x = f(ci )∆x
i=1
Thus we approximate area under a curve by a sum of areas of
rectangles.
.
.
Notes
Forming Riemann sums
We have many choices of representa ve points to approximate the
area in each subinterval.
…even random points!
. x
.
.
. 9
.
10. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Theorem of the Day
Theorem
If f is a con nuous func on on
[a, b] or has finitely many jump M15 = 7.49968
discon nui es, then
{ n }
∑
lim Sn = lim f(ci )∆x
n→∞ n→∞
i=1
exists and is the same value no . x
ma er what choice of ci we make.
.
.
Notes
Analogies
The Tangent Problem The Area Problem (Ch. 5)
(Ch. 2–4) Want the area of a curved
Want the slope of a curve region
Only know the slope of Only know the area of
lines polygons
Approximate curve with a Approximate region with
line polygons
Take limit over be er and Take limit over be er and
be er approxima ons be er approxima ons
.
.
Notes
Outline
Area through the Centuries
Euclid
Archimedes
Cavalieri
Generalizing Cavalieri’s method
Analogies
Distances
Other applica ons
The definite integral as a limit
Es ma ng the Definite Integral
Proper es of the integral
Comparison Proper es of the Integral
.
.
. 10
.
11. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Distances
Just like area = length × width, we have
distance = rate × me.
So here is another use for Riemann sums.
.
.
Notes
Application: Dead Reckoning
.
.
Notes
Computing position by Dead Reckoning
Example
A sailing ship is cruising back and forth along a channel (in a straight
line). At noon the ship’s posi on and velocity are recorded, but
shortly therea er a storm blows in and posi on is impossible to
measure. The velocity con nues to be recorded at thirty-minute
intervals.
.
.
. 11
.
12. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Computing position by Dead Reckoning
Example
Time 12:00 12:30 1:00 1:30 2:00
Speed (knots) 4 8 12 6 4
Direc on E E E E W
Time 2:30 3:00 3:30 4:00
Speed 3 3 5 9
Direc on W E E E
Es mate the ship’s posi on at 4:00pm.
.
.
Notes
Solution
Solu on
We es mate that the speed of 4 knots (nau cal miles per hour) is
maintained from 12:00 un l 12:30. So over this me interval the
ship travels ( )( )
4 nmi 1
hr = 2 nmi
hr 2
We can con nue for each addi onal half hour and get
distance = 4 × 1/2 + 8 × 1/2 + 12 × 1/2
+ 6 × 1/2 − 4 × 1/2 − 3 × 1/2 + 3 × 1/2 + 5 × 1/2 = 15.5
. So the ship is 15.5 nmi east of its original posi on.
.
Notes
Analysis
This method of measuring posi on by recording velocity was
necessary un l global-posi oning satellite technology became
widespread
If we had velocity es mates at finer intervals, we’d get be er
es mates.
If we had velocity at every instant, a limit would tell us our
exact posi on rela ve to the last me we measured it.
.
.
. 12
.
13. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Other uses of Riemann sums
Anything with a product!
Area, volume
Anything with a density: Popula on, mass
Anything with a “speed:” distance, throughput, power
Consumer surplus
Expected value of a random variable
.
.
Notes
Outline
Area through the Centuries
Euclid
Archimedes
Cavalieri
Generalizing Cavalieri’s method
Analogies
Distances
Other applica ons
The definite integral as a limit
Es ma ng the Definite Integral
Proper es of the integral
Comparison Proper es of the Integral
.
.
Notes
The definite integral as a limit
Defini on
If f is a func on defined on [a, b], the definite integral of f from a to
b is the number
∫ b ∑n
f(x) dx = lim f(ci ) ∆x
a ∆x→0
i=1
.
.
. 13
.
14. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Notation/Terminology
∫ b ∑
n
f(x) dx = lim f(ci ) ∆x
a ∆x→0
i=1
∫
— integral sign (swoopy S)
f(x) — integrand
a and b — limits of integra on (a is the lower limit and b the
upper limit)
dx — ??? (a parenthesis? an infinitesimal? a variable?)
The process of compu ng an integral is called integra on or
quadrature
.
.
Notes
The limit can be simplified
Theorem
If f is con nuous on [a, b] or if f has only finitely many jump
discon nui es, then f is integrable on [a, b]; that is, the definite
∫ b
integral f(x) dx exists.
a
So we can find the integral by compu ng the limit of any sequence
of Riemann sums that we like,
.
.
Example
∫ 3
Notes
Find x dx
0
Solu on
3 3i
For any n we have ∆x = and for each i between 0 and n, xi = .
n n
For each i, take xi to represent the func on on the ith interval. So
∫ 3 ∑n ∑ ( 3i ) ( 3 )
n
x dx = lim Rn = lim f(xi ) ∆x = lim
0 n→∞ n→∞
i=1
n→∞
i=1
n n
9 ∑
n
9 n(n + 1) 9
= lim i = lim 2 · = ·1
n→∞ n2 n→∞ n 2 2
i=1
.
.
. 14
.
15. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Example
∫ 3
Notes
Find x2 dx
0
Solu on
.
.
Example
∫ 3
Notes
Find x3 dx
0
Solu on
.
.
Notes
Outline
Area through the Centuries
Euclid
Archimedes
Cavalieri
Generalizing Cavalieri’s method
Analogies
Distances
Other applica ons
The definite integral as a limit
Es ma ng the Definite Integral
Proper es of the integral
Comparison Proper es of the Integral
.
.
. 15
.
16. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Estimating the Definite Integral
Example
∫ 1
4
Es mate dx using M4 .
0 1 + x2
Solu on
1 1 3
We have x0 = 0, x1 = , x2 = , x3 = , x4 = 1.
4 2 4
1 3 5 7
So c1 = , c2 = , c3 = , c4 = .
8 8 8 8
.
.
Notes
Estimating the Definite Integral
Example
∫ 1
4
Es mate dx using M4 .
0 1 + x2
Solu on
( )
1 4 4 4 4
M4 = + + +
4 1 + (1/8)2 1 + (3/8)2 1 + (5/8)2 1 + (7/8)2
( )
1 4 4 4 4
= + + +
4 65/64 73/64 89/64 113/64
64 64 64 64
= + + + ≈ 3.1468
65 73 89 113
.
.
Notes
Estimating the Definite Integral
Example
∫ 1
4
Es mate dx using L4 and R4
0 1 + x2
Answer
.
.
. 16
.
17. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Estimating the Definite Integral
Example
∫ 1
4
Es mate dx using L4 and R4
0 1 + x2
Answer
.
.
Notes
Outline
Area through the Centuries
Euclid
Archimedes
Cavalieri
Generalizing Cavalieri’s method
Analogies
Distances
Other applica ons
The definite integral as a limit
Es ma ng the Definite Integral
Proper es of the integral
Comparison Proper es of the Integral
.
.
Notes
Properties of the integral
Theorem (Addi ve Proper es of the Integral)
Let f and g be integrable func ons on [a, b] and c a constant. Then
∫ b
1. c dx = c(b − a)
∫a b ∫ b ∫ b
2. [f(x) + g(x)] dx = f(x) dx + g(x) dx.
∫a b ∫ b a a
3. cf(x) dx = c f(x) dx.
∫a b a
∫ b ∫ b
4. [f(x) − g(x)] dx = f(x) dx − g(x) dx.
a a a
.
.
. 17
.
18. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Proofs
Proofs.
When integra ng a constant func on c, each Riemann sum
equals c(b − a).
A Riemann sum for f + g equals a Riemann sum for f plus a
Riemann sum for g. Using the sum rule for limits, the integral
of a sum is the sum of the integrals.
Di o for constant mul ples
Di o for differences
.
.
Example
∫ 3
Notes
( 3 )
Find x − 4.5x2 + 5.5x + 1 dx
0
Solu on
.
.
Notes
More Properties of the Integral
Conven ons: ∫ ∫
a b
f(x) dx = − f(x) dx
b a
∫ a
f(x) dx = 0
a
This allows us to have
Theorem
∫ c ∫ b ∫ c
5. f(x) dx = f(x) dx + f(x) dx for all a, b, and c.
a a b
.
.
. 18
.
19. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Illustrating Property 5
Theorem
∫ c ∫ b ∫ c
5. f(x) dx = f(x) dx + f(x) dx for all a, b, and c.
a a b
y
∫ b ∫ c
f(x) dx f(x) dx
a b
.
a c x
b
.
.
Notes
Illustrating Property 5
Theorem
∫ c ∫ b ∫ c
5. f(x) dx = f(x) dx + f(x) dx for all a, b, and c.
a a b
y
∫ ∫ c
c
f(x) dx f(x) dx =
b∫
a b
− f(x) dx
. c
a c x
b
.
.
Notes
Using the Properties
Example
Suppose f and g are func ons
with ∫
4 Find∫
f(x) dx = 4 5
(a) [2f(x) − g(x)] dx
∫0 5
∫0 5
f(x) dx = 7
(b) f(x) dx.
∫0 5 4
g(x) dx = 3.
0
.
.
. 19
.
20. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Solu on
.
.
Notes
Outline
Area through the Centuries
Euclid
Archimedes
Cavalieri
Generalizing Cavalieri’s method
Analogies
Distances
Other applica ons
The definite integral as a limit
Es ma ng the Definite Integral
Proper es of the integral
Comparison Proper es of the Integral
.
.
Notes
Comparison Properties of the Integral
Theorem
Let f and g be integrable func ons on [a, b].
∫ b
6. If f(x) ≥ 0 for all x in [a, b], then f(x) dx ≥ 0
a
∫ b ∫ b
7. If f(x) ≥ g(x) for all x in [a, b], then f(x) dx ≥ g(x) dx
a a
8. If m ≤ f(x) ≤ M for all x in [a, b], then
∫ b
m(b − a) ≤ f(x) dx ≤ M(b − a)
a
.
.
. 20
.
21. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Notes
Integral of a nonnegative function is nonnegative
Proof.
If f(x) ≥ 0 for all x in [a, b], then for
any number of divisions n and choice
of sample points {ci }:
∑
n ∑
n
Sn = f(ci ) ∆x ≥ 0 · ∆x = 0
i=1 ≥0 i=1
. x
Since Sn ≥ 0 for all n, the limit of {Sn } is nonnega ve, too:
∫ b
f(x) dx = lim Sn ≥ 0
a n→∞
≥0
.
.
Notes
The integral is “increasing”
Proof.
Let h(x) = f(x) − g(x). If f(x) ≥ g(x)
for all x in [a, b], then h(x) ≥ 0 for all f(x)
x in [a, b]. So by the previous h(x) g(x)
property
∫ b
h(x) dx ≥ 0 . x
a
This means that
∫ b ∫ b ∫ b ∫ b
f(x) dx − g(x) dx = (f(x) − g(x)) dx = h(x) dx ≥ 0
a a a a
.
.
Notes
Bounding the integral
Proof.
If m ≤ f(x) ≤ M on for all x in [a, b], then by
y
the previous property
∫ b ∫ b ∫ b M
m dx ≤ f(x) dx ≤ M dx
a a a f(x)
By Property 8, the integral of a constant
func on is the product of the constant and m
the width of the interval. So:
∫ b . x
m(b − a) ≤ f(x) dx ≤ M(b − a) a b
a
.
.
. 21
.
22. . V63.0121.001: Calculus I Sec on 5.1–5.2: Areas, Distances, Integral
. . April 25, 2011
Example Notes
∫ 2
1
Es mate dx using the comparison proper es.
1 x
Solu on
.
.
Notes
Summary
We can compute the area of a curved region with a limit of
Riemann sums
We can compute the distance traveled from the velocity with a
limit of Riemann sums
Many other important uses of this process.
.
.
Notes
Summary
The definite integral is a limit of Riemann Sums
The definite integral can be es mated with Riemann Sums
The definite integral can be distributed across sums and
constant mul ples of func ons
The definite integral can be bounded using bounds for the
func on
.
.
. 22
.