The test vectors on either side of the boundary are called boundary values.

In the example above there are boundary values at 0,1 and 12,13 and each should be tested.

See that article for an example which uses boundary values.

Now, the above reduction step is applied to the partitions only after its boundary values are popped from the stack.

Therefore, we push the upper and lower boundary values of the first partition onto the stack.

These are precisely the points at which one is guaranteed to obtain the desired boundary values: as .

It is essential to consider boundary values of Sobolev functions.

A consecutive fine grid simulation uses this data as lateral boundary values.

Taking the boundary values of both sides and their normal derivative yields 2 equations.

On the datalink screen Trainer had to run the theorem's equations with different boundary values.