Content-Length: 13674 | pFad | http://planetmath.org/generalisedndimensionalriemannsum

Generalised N-dimensional Riemann Sum

Generalised N-dimensional Riemann Sum


Let I=[a1,b1]××[aN,bN] be an N-cell in N. For each j=1,,N, let aj=tj,0<<tj,N=bj be a partitionMathworldPlanetmathPlanetmath Pj of [aj,bj]. We define a partition P of I as

P:=P1××PN

Each partition P of I generates a subdivision of I (denoted by (Iν)ν) of the form

Iν=[t1,j,t1,j+1]××[tN,k,tN,k+1]

Let f:UM be such that IU, and let (Iν)ν be the corresponding subdivision of a partition P of I. For each ν, choose xνIν. Define

S(f,P):=νf(xν)μ(Iν)

As the Riemann sum of f corresponding to the partition P.

A partition Q of I is called a refinement of P if PQ.

Title Generalised N-dimensional Riemann Sum
Canonical name GeneralisedNdimensionalRiemannSum
Date of creation 2013-03-22 13:37:40
Last modified on 2013-03-22 13:37:40
Owner vernondalhart (2191)
Last modified by vernondalhart (2191)
Numerical id 4
Author vernondalhart (2191)
Entry type Definition
Classification msc 26B12








ApplySandwichStrip

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier!      Saves Data!


--- a PPN by Garber Painting Akron. With Image Size Reduction included!

Fetched URL: http://planetmath.org/generalisedndimensionalriemannsum

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy