The major iterative algorithms based on functional iteration techniques for solving nonlinear matrix equations are described, analysed, and compared in this chapter. First, the basic concepts on ...
More

The major iterative algorithms based on functional iteration techniques for solving nonlinear matrix equations are described, analysed, and compared in this chapter. First, the basic concepts on fixed point iterations are recalled, then linearly convergent iterations are treated, and finally Newton’s iteration is considered.Less

FUNCTIONAL ITERATIONS

D. A. BiniG. LatoucheB. Meini

Published in print: 2005-02-03

The major iterative algorithms based on functional iteration techniques for solving nonlinear matrix equations are described, analysed, and compared in this chapter. First, the basic concepts on fixed point iterations are recalled, then linearly convergent iterations are treated, and finally Newton’s iteration is considered.

Some specialized structures are investigated in this chapter and some of the algorithms in previous chapters are adapted to the specific cases. Markov chains with limited displacement (non-skip-free ...
More

Some specialized structures are investigated in this chapter and some of the algorithms in previous chapters are adapted to the specific cases. Markov chains with limited displacement (non-skip-free processes) are solved by means of functional iterations and cyclic reduction. Markov chains of M/G/1-type are reduced to a special QBD process with infinite blocks and treated with cyclic reduction. Finally, three different algorithms for tree-like stochastic processes, relying on fixed point iterations, Newton’s iteration, and cyclic reduction, are introduced and analysed.Less

SPECIALIZED STRUCTURES

D. A. BiniG. LatoucheB. Meini

Published in print: 2005-02-03

Some specialized structures are investigated in this chapter and some of the algorithms in previous chapters are adapted to the specific cases. Markov chains with limited displacement (non-skip-free processes) are solved by means of functional iterations and cyclic reduction. Markov chains of M/G/1-type are reduced to a special QBD process with infinite blocks and treated with cyclic reduction. Finally, three different algorithms for tree-like stochastic processes, relying on fixed point iterations, Newton’s iteration, and cyclic reduction, are introduced and analysed.

The Kolmogorov-Arnold-Moser (KAM) theorem presents limits to the notion of chaos. This is the deepest result to date on this subject. This chapter starts with a review of Newton's method for solving ...
More

The Kolmogorov-Arnold-Moser (KAM) theorem presents limits to the notion of chaos. This is the deepest result to date on this subject. This chapter starts with a review of Newton's method for solving non-linear equations, itself the iteration of a function. It introduces a notion of distance from the fixed point of Newton's iteration, which is used to prove convergence for good initial conditions. This is then applied to a model problem, that of bringing a matrix to normal form. KAM theory for maps of the circle to itself is developed next. Amazingly, maps close to rational rotations are chaotic while those close to irrational rotations are not. A digression into number theory explores the connection to Diophantine equations. Finally, the chapter solves the Hamilton-Jacobi equation by Newton's iteration, establishing that there are small perturbations of integrable systems that are not chaotic.Less

KAM theory

S. G. Rajeev

Published in print: 2013-07-25

The Kolmogorov-Arnold-Moser (KAM) theorem presents limits to the notion of chaos. This is the deepest result to date on this subject. This chapter starts with a review of Newton's method for solving non-linear equations, itself the iteration of a function. It introduces a notion of distance from the fixed point of Newton's iteration, which is used to prove convergence for good initial conditions. This is then applied to a model problem, that of bringing a matrix to normal form. KAM theory for maps of the circle to itself is developed next. Amazingly, maps close to rational rotations are chaotic while those close to irrational rotations are not. A digression into number theory explores the connection to Diophantine equations. Finally, the chapter solves the Hamilton-Jacobi equation by Newton's iteration, establishing that there are small perturbations of integrable systems that are not chaotic.

This book begins with the ancient parts of classical mechanics: the variational principle, Lagrangian and Hamiltonian formalisms, and Poisson brackets. The simple pendulum provides a glimpse of the ...
More

This book begins with the ancient parts of classical mechanics: the variational principle, Lagrangian and Hamiltonian formalisms, and Poisson brackets. The simple pendulum provides a glimpse of the beauty of elliptic curves, which will also appear later in rigid body mechanics. Geodesics in Riemannian geometry are presented as an example of a Hamiltonian system. Conversely, the path of a non-relativistic particle is a geodesic in a metric that depends on the potential. Orbits around a black hole are found. Hamilton-Jacobi theory is discussed, showing a path towards quantum mechanics and a connection to the eikonal of optics. The three body problem is studied in detail, including small orbits around the Lagrange points. The dynamics of a charged particle in a magnetic field, especially a magnetic monopole, is studied in the Hamiltonian formalism. Spin is shown to be a classical phenomenon. Symplectic integrators that allow numerical solutions of mechanical systems are derived. A simplified version of Feigenbaum's theory of period doubling introduces chaos. Following a classification of Mobius transformations, this book studies chaos on the complex plane: Julia sets, Fatou sets, and the Mandelblot are explained. Newton's method for solution of non-linear equations is viewed as a dynamical system, allowing a novel approach to the reduction of matrices to canonical form. This is used as a stepping stone to the KAM theory of maps of a circle to itself, unravelling a connection to the Diophantine problem of number theory. KAM theory of the solution of the Hamilton-Jacobi equation using Newton's iteration concludes the book.Less

Advanced Mechanics : From Euler's Determinism to Arnold's Chaos

S. G. Rajeev

Published in print: 2013-07-25

This book begins with the ancient parts of classical mechanics: the variational principle, Lagrangian and Hamiltonian formalisms, and Poisson brackets. The simple pendulum provides a glimpse of the beauty of elliptic curves, which will also appear later in rigid body mechanics. Geodesics in Riemannian geometry are presented as an example of a Hamiltonian system. Conversely, the path of a non-relativistic particle is a geodesic in a metric that depends on the potential. Orbits around a black hole are found. Hamilton-Jacobi theory is discussed, showing a path towards quantum mechanics and a connection to the eikonal of optics. The three body problem is studied in detail, including small orbits around the Lagrange points. The dynamics of a charged particle in a magnetic field, especially a magnetic monopole, is studied in the Hamiltonian formalism. Spin is shown to be a classical phenomenon. Symplectic integrators that allow numerical solutions of mechanical systems are derived. A simplified version of Feigenbaum's theory of period doubling introduces chaos. Following a classification of Mobius transformations, this book studies chaos on the complex plane: Julia sets, Fatou sets, and the Mandelblot are explained. Newton's method for solution of non-linear equations is viewed as a dynamical system, allowing a novel approach to the reduction of matrices to canonical form. This is used as a stepping stone to the KAM theory of maps of a circle to itself, unravelling a connection to the Diophantine problem of number theory. KAM theory of the solution of the Hamilton-Jacobi equation using Newton's iteration concludes the book.