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

DOI10.1007/S10559-011-9314-6MaRDI QIDQ464895zbMATH OpenOpenAlexFDO

Authors 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

numerical examplesalgorithmfinite difference methodnumerical optimizationLyapunov stabilitysortingsystems 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) Finite difference and finite volume methods for ordinary differential equations (65L12) Numerical methods for initial value problems involving ordinary differential equations (65L05) Numerical investigation of stability of solutions to ordinary differential equations (65L07)

Recommendations

• Sorting-based calculation of zeroes and extrema of functions as applied to search and recognition. I
• scientific article; zbMATH DE number 3852313
• scientific article; zbMATH DE number 48856
• Study of dynamical systems from the viewpoint of complexity and computational capabilities
• Sorting-based calculation of zeros and extrema of functions as applied to search and recognition. II

Cites work

• scientific article; zbMATH DE number 5505201 (Why is no real title available?)
• scientific article; zbMATH DE number 3421804 (Why is no real title available?)
• scientific article; zbMATH DE number 3197530 (Why is no real title available?)
• Multiplicative stability criteria based on difference solutions of ordinary differential equations
• Parallel merge sort using comparison matrices. II
• Parallel merging sorting using comparison matrices. I
• Resolution of \(\mathbb{C}^3/H_{168}\)
• Sorting-based localization and stable computation of zeros of a polynomial. I.
• Sorting-based localization and stable computation of zeros of a polynomial. II.

Cited in

(3)

• Identification of the domain, ranges, and values of complex roots of a polynomial with complex coefficients based on stable address sorting
• Study of dynamical systems from the viewpoint of complexity and computational capabilities
• Sorting-based calculation of zeros and extrema of functions as applied to search and recognition. II

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464895)