Numerical sorting-based optimization as applied to general differential and nonlinear equations

DOI10.1007/s10559-011-9314-6zbMath1302.65150OpenAlexW1996579557MaRDI QIDQ464895

Ya. E. Romm, I. V. Zaika

Publication date: 30 October 2014

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-011-9314-6

zbMATH Keywords

algorithmsortingfinite difference methodnumerical examplesLyapunov stabilitynumerical optimizationsystems of ordinary differential equationsapproximate solution of systems of nonlinear equationsparallel localization of extremastability under perturbation of parameters

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Nonlinear ordinary differential equations and systems (34A34) Stability of solutions to ordinary differential equations (34D20) Numerical methods for initial value problems involving ordinary differential equations (65L05) Numerical investigation of stability of solutions to ordinary differential equations (65L07) Finite difference and finite volume methods for ordinary differential equations (65L12)

Related Items (1)

Identification of the domain, ranges, and values of complex roots of a polynomial with complex coefficients based on stable address sorting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resolution of \(\mathbb{C}^3/H_{168}\)
• Parallel merging sorting using comparison matrices. I
• Parallel merge sort using comparison matrices. II
• Sorting-based localization and stable computation of zeros of a polynomial. II.
• Sorting-based localization and stable computation of zeros of a polynomial. I.
• Multiplicative stability criteria based on difference solutions of ordinary differential equations

This page was built for publication: Numerical sorting-based optimization as applied to general differential and nonlinear equations