2009
DOI: 10.1007/s11075-009-9303-2
|View full text |Cite
|
Sign up to set email alerts
|

An adaptive algorithm for efficient computation of level curves of surfaces

Abstract: A new efficient algorithm for the computation of z = constant level curves of surfaces z = f (x, y) is proposed and tested on several examples. The set of z-level curves in a given rectangle of the (x, y)-plane is obtained by evaluating f on a first coarse square grid which is then adaptively refined by triangulation to eventually match a desired tolerance. Adaptivity leads to a considerable reduction in terms of evaluations of f with respect to uniform grid computation as in Matlab®'s contour. Furthermore, es… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 16 publications
(15 citation statements)
references
References 10 publications
0
15
0
Order By: Relevance
“…see [31]). Efficiency could also be increased if non-uniform grid is used in the parameter plane (for such methods see [32] and [33]). The convergence of the rightmost characteristic exponents were investigated for parameter combinations given in Table 1.…”
Section: Resultsmentioning
confidence: 99%
“…see [31]). Efficiency could also be increased if non-uniform grid is used in the parameter plane (for such methods see [32] and [33]). The convergence of the rightmost characteristic exponents were investigated for parameter combinations given in Table 1.…”
Section: Resultsmentioning
confidence: 99%
“…Thereafter, the approximate border of stability is obtained as a level curve of this 3-dimensional surface at 1. Note that the efficiency of this method can be increased if system parameters are computed sparsely far from the boundary of stability and with an increasing density close to the boundary of stability (for such methods see [7] and [4]). …”
Section: General Settingsmentioning
confidence: 99%
“…As outlined in [6], the algorithm of Matlab contour function is relatively simple. It is based on covering the region of interest by a uniform grid of points.…”
Section: Mapping the Zero Level Curvesmentioning
confidence: 99%