Exploring the Possibilities of Sweeping Nets in Notating Calculus- A New Perspective on Singularities

Abstract

The paper proposes a method for approximating surfacing singularities of saddle maps using a sweeping net. The method involves constructing a densified sweeping subnet for each individual vertex of the saddle map, and then combining each subnet to create a complete approximation of the singularities. The authors also define two functions $f_1$ and $f_2$, which are used to calculate the charge density for each subnet. The resulting densified sweeping subnet closely approximates the surfacing saddle map near a circular region.

Author's Profile

Parker Emmerson
Antioch College

Analytics

Added to PP
2023-12-27

Downloads
50 (#98,939)

6 months
46 (#94,488)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?