Computation of a simple bifurcation point using one singular value decomposition nearby (Q1362831)

From MaRDI portal





scientific article; zbMATH DE number 1045486
Language Label Description Also known as
default for all languages
No label defined
    English
    Computation of a simple bifurcation point using one singular value decomposition nearby
    scientific article; zbMATH DE number 1045486

      Statements

      Computation of a simple bifurcation point using one singular value decomposition nearby (English)
      0 references
      0 references
      0 references
      2 February 1998
      0 references
      A direct method to locate simple bifurcation points of a system of nonlinear parameter dependent equations \(G(x,t)=0\), \(G:D_G\subset \mathbb{R}^n\times \mathbb{R}\to\mathbb{R}^n\) is developed. This method requires a good choice of an initial point \((x^{(0)},t^{(0)})\) only. Auxiliary vectors are defined then automatically on the base of the usage of a singular value decomposition of the Jacobian matrix \(G'(x^{(0)}, t^{(0)})\) near the simple bifurcation point. The suggested approach preserves the advantages of the method of \textit{V. Janovský} [Computing 43, No. 1, 27-36 (1989; Zbl 0695.65033)] by using one LU factorization in each iteration, but also improves it by providing a set of auxiliary vectors which always produces a well-conditioned bordered matrix. The quadratic convergence for the extended system proposed by \textit{G. Pönisch} [Computing 35, 277-294 (1985; Zbl 0569.65041)] is guaranteed.
      0 references
      direct method
      0 references
      simple bifurcation points
      0 references
      singular value decomposition
      0 references
      Jacobian matrix
      0 references
      LU factorization
      0 references
      bordered matrix
      0 references
      quadratic convergence
      0 references

      Identifiers