scientific article; zbMATH DE number 1014834

From MaRDI portal
Publication:4338536





On a two-dimensional parameter area \(R\) a continuous real function \(f\) be given. The zero curve of this function has to be found. The algorithm introduced has a standard architecture: It consists of two parts: a searching phase, where a set of zeros has to be indicated, which is dense enough to hit every occurring part of the solution curves, and a pursuit phase, which has to calculate all these parts. The searching phase deals with a partition of the parameter area into a set of rectangular parts. The edges of these rectangles are searched for zeroes of the function \(f\), which have to be written into a list. The pursuit phase is based on a similar idea: Starting with a zero of the list there has to be defined a (small) square such that the zero is on the edge of the square. If there only exists one more zero on that edge, it has to be the next point of the curve; if there are several, the size of the square has to be reduced. The authors show several examples, how their algorithm works. Different types of zero curves in a plane or on a surface in the 3-space are calculated and displayed.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4338536)