Let $\mathsf{TopVect}$ be the category of TVS over $\mathbb K\in \{\mathbb R, \mathbb C\}$ with continuous linear maps as morphisms.
Do the normed spaces or locally convex spaces form a reflective
subcategory of $\mathsf{TopVect}$? (in the latter case: do normed
spaces form a reflective s...
In numerical analysis, the Kahan summation algorithm (also known as compensated summation) significantly reduces the numerical error in the total obtained by adding a sequence of finite precision floating point numbers, compared to the obvious approach. This is done by keeping a separate running compensation (a variable to accumulate small errors).
In particular, simply summing n numbers in sequence has a worst-case error that grows proportional to n, and a root mean square error that grows as
n
{\displaystyle ...
Routing in delay-tolerant networking concerns itself with the ability to transport, or route, data from a source to a destination, which is a fundamental ability all communication networks must have. Delay- and disruption-tolerant networks (DTNs) are characterized by their lack of connectivity, resulting in a lack of instantaneous end-to-end paths. In these challenging environments, popular ad hoc routing protocols such as AODV and DSR fail to establish routes. This is due to these protocols trying to first establish a complete route and then, after the route has been established, forward the actual...
