Journal Article10.1109/MCSE.1997.609839
Dynamical Systems and Numerical Analysis
TL;DR: In this article, the authors focus on the initial-value problem of nonlinear dynamics and provide a good introduction to the main ideas and results of the theory of dynamical systems.
read more
Abstract: T hat numerical analysis is an extremely useful tool for solving problems and exploring fundamental concepts comes as no surprise to any student of dynamical systems. However , preoccupation with learning the mathematical theory of nonlinear dynamics often precludes a deeper understanding of the variety of numerical methods available and prevents a proper appreciation of the possibilities and limitations of these methods. On the other hand, many numerical analysts spend a large part of their careers not realizing that they are actually solving problems of nonlinear dynamics and struggling with issues of dynamical-systems and chaos theory. Clearly, their work would benefit greatly from a closer familiarity with the main ideas and results of that theory. These are precisely the two scientific communities that Stuart and Hum-phries' book aims to address. Its purpose is evidently to help researchers in these communities get better acquainted with each other. It is a timely publication which, in my opinion, will appeal to many members of the two groups and succeed in achieving its purpose to a considerable extent. Of differential equations The book is exclusively concerned with the solution of the initial-value problem of ordinary differential equations, (1) with u(t) ∈ ޒ p , t > 0; and f : ޒ p → ޒ P where f is (at least) continuous and Lipschitz, so that a solution of Equation 1 exists and is unique. Since an analytical expression of this solution is hardly ever available, one attempts to solve Equation 1 numerically, by writing it as a dynamical system (2) with G : D → ޒ p. The solution of Equation 2 exists, if the U n 's remain bounded within D ⊆ ޒ p for all n, and is unique as long as G is single-valued. U n is, of course, the approximation of u(t n) at the nth time step, t n = n∆t, n = 0, 1, 2, …, and is expected to be increasingly accurate as ∆t → 0. Clearly, the two most crucial issues facing a researcher who attempts this approximation are convergence and stability of the numerical strategy adopted. Convergence here means the ability to determine bounds for the norm . of the error: (3) where c 1 , c 2 , and r are appropriate constants. Stability refers to one's capacity to control the effect of small perturbations on the particular method chosen. More precisely, let us …
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
TL;DR: This paper presents convergence properties of the Nelder--Mead algorithm applied to strictly convex functions in dimensions 1 and 2, and proves convergence to a minimizer for dimension 1, and various limited convergence results for dimension 2.
Lie-group methods
TL;DR: A survey of numerical integrators that respect Lie-group structure is given in this paper, highlighting theory, algorithmic issues, and a number of applications in the field of Lie group discretization.
Ergodicity for SDEs and approximations: Locally Lipschitz vector fields and degenerate noise
TL;DR: In this paper, the ergodicity of SDEs is established by using techniques from the theory of Markov chains on general state spaces, such as that expounded by Meyn-Tweedie.
797
Strong Convergence of Euler-Type Methods for Nonlinear Stochastic Differential Equations
TL;DR: In this paper, it was shown that an implicit variant of Euler-Maruyama converges if the diffusion coefficient is globally Lipschitz, but the drift coefficient satisfies only a one-sided Lipschnitz condition.
Low-storage, Explicit Runge-Kutta Schemes for the Compressible Navier-Stokes Equations
TL;DR: The derivation of low-storage, explicit Runge-Kutta (ERK) schemes has been performed in the context of integrating the compressible Navier-Stokes equations via direct numerical simulation, with results that can be nearly matched with existing full-storage methods.
617
References
Independent Component Analysis.
Seungjin Choi
- 01 Jan 2009
TL;DR: In this article, the independent component analysis (ICA) is used to find an estimate of an unmixing matrix Γ such that Γx has independent components in the IC model.
3.3K
Lie-group methods
TL;DR: A survey of numerical integrators that respect Lie-group structure is given in this paper, highlighting theory, algorithmic issues, and a number of applications in the field of Lie group discretization.
Ergodicity for SDEs and approximations: Locally Lipschitz vector fields and degenerate noise
TL;DR: In this paper, the ergodicity of SDEs is established by using techniques from the theory of Markov chains on general state spaces, such as that expounded by Meyn-Tweedie.
797
Low-storage, Explicit Runge-Kutta Schemes for the Compressible Navier-Stokes Equations
TL;DR: The derivation of low-storage, explicit Runge-Kutta (ERK) schemes has been performed in the context of integrating the compressible Navier-Stokes equations via direct numerical simulation, with results that can be nearly matched with existing full-storage methods.
617
Nonlinear observer design for one-sided Lipschitz systems
Masoud Abbaszadeh,Horacio J. Marquez +1 more
- 29 Jul 2010
TL;DR: In this article, the problem of state observer design for one-sided Lipschitz functions has been considered and a solution to the observer design problem is proposed in terms of nonlinear matrix inequalities which in turn are converted into numerically efficiently solvable linear matrix inequalities.
298