scientific article; zbMATH DE number 3967808

From MaRDI portal
Publication:3734983





[For the entire collection see Zbl 0556.00012.] Many problems arising in applications can be described by systems of nonlinear equations \(G(x,t)=0\), \(G:D_ G\subset {\mathbb{R}}^ n\times {\mathbb{R}}^ 1\to {\mathbb{R}}^ 1\). The vector \(x\in {\mathbb{R}}^ n\) denotes the variables of the problem while \(t\in {\mathbb{R}}^ 1\) plays the role of an extra parameter which is of special interest. In these problems there are of interest the turning points of the solution path characterizing certain critical states of the system. Often it is also desirable to have a pointwise approximation of the path near to the turning point or over the whole basic interval. In this paper a number of effective methods for computing turning points is described, analyzed, and compared with other methods known from literature.











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 Q3734983)