Numerical continuation of solution at singular points of codimension one (Q267551): Difference between revisions

Algorithms for discrete parametric continuation in a neighborhood of the simple cusp point of codimension one and for finding all the branches in the simple bifurcation point of codimension one are developed. An additional advantage is that the algorithm for finding all branches in the simple bifurcation point uses the standard QR matrix factorization procedure. An algorithm for passing through simple cusp points is proposed.