Skip to main content

The Gradient Operator, Covariant Differentiation, and the Divergence Theorem

  • Chapter
A Brief on Tensor Analysis

Part of the book series: Undergraduate Texts in Mathematics ((UTM))

  • 1504 Accesses

Abstract

Suppose that you had a topographical map of a piece of land and wanted to indicate at a spot P on the map the slope m of the land in a direction t. This could be done by drawing a vector m t from P, as indicated in Fig. 4.1. Obviously, if the terrain is smooth but not level, there is one direction from P in which the slope is a maximum. This is called the direction of steepest ascent.1 The associated vector is called the gradient of the elevation at P. If you draw a contour line through P, you will realize that the gradient at P must be ⊥ to this contour.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Simmonds, J.G. (1982). The Gradient Operator, Covariant Differentiation, and the Divergence Theorem. In: A Brief on Tensor Analysis. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-0141-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-0141-7_4

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4684-0143-1

  • Online ISBN: 978-1-4684-0141-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics