Numerical computation of nonsimple turning points and cusps (Q796264): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct method for the determination of non-simple turning points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deflation Techniques and Block-Elimination Algorithms for Solving Bordered Singular Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton-Like Pseudo-Arclength Methods for Computing Simple Turning Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite dimensional approximation of nonlinear problems. II: Limit points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of Extrapolation Processes in Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometrically Isolated Nonisolated Solutions and Their Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3908398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Calculation of Turning Points of Nonlinear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Convergence of Operator Approximations at Turning Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing turning points of curves implicitly defined by nonlinear equations depending on a parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A locally parameterized continuation process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical computation of nonsimple turning points and cusps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the computation of Hopf bifurcation points in comparison with other methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical computation of branch points in ordinary differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-simple Turning Points and Cusps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339191 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:26, 14 June 2024

scientific article
Language Label Description Also known as
English
Numerical computation of nonsimple turning points and cusps
scientific article

    Statements

    Numerical computation of nonsimple turning points and cusps (English)
    0 references
    0 references
    0 references
    1985
    0 references
    A method is developed for the numerical computation of a double turning point corresponding to a cusp catastrophe of a nonlinear operator equation depending on two parameters. An augmented system containing the original equation is introduced, for which the cusp point is an isolated solution. An efficient implementation of Newton's method in the finite- dimensional case is presented. Results are given for some chemical engineering problems and this direct method is compared with some other techniques to locate cusp points.
    0 references
    nonsimple turning points
    0 references
    cusps
    0 references
    isolated solution
    0 references
    Newton's method
    0 references

    Identifiers