BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Dynamical Systems, Graphs, and Algorithms

Dynamical Systems, Graphs, and Algorithms

Dynamical Systems, Graphs, and Algorithms
Stock photo: cover may vary

Dynamical Systems, Graphs, and Algorithms Paperback / softback - 2006

by George Osipenko

Add to wish list
  • New
  • Paperback
New

Description

Paperback / softback. New. This book describes a family of algorithms for studying the global structure of systems. By a finite covering of the phase space we construct a directed graph with vertices corresponding to cells of the covering and edges corresponding to admissible transitions.
Ask the seller a question Add to wish list
A$106.02
A$19.40 Delivery to USA
Standard delivery: 14 to 21 days
More delivery options
Ships from The Saint Bookstore (Merseyside, United Kingdom)

Details

  • Title Dynamical Systems, Graphs, and Algorithms
  • Author George Osipenko
  • Binding Paperback
  • Edition 1st
  • Condition New
  • Pages 288
  • Volumes 1
  • Language ENG
  • Publisher Springer, Berlin
  • Publication date 2006-11-06
  • Illustrated Yes
  • Features Illustrated, Index, Table of Contents
  • Bookseller's Inventory # B9783540355939
  • ISBN 9783540355939 / 3540355936
  • Weight 0.96 lbs (0.44 kg)
  • Dimensions 9.28 x 6.28 x 0.46 in (23.57 x 15.95 x 1.17 cm)
  • Category Mathematics
  • Library of Congress Catalogue Number 2006930097
  • Dewey Decimal Code 515.39
  • Quantity available 10

About The Saint Bookstore Merseyside, United Kingdom

Biblio member since 2018

The Saint Bookstore specialises in hard to find titles & also offers delivery worldwide for reasonable rates.

Terms of Sale: Refunds or Returns: A full refund of the price paid will be given if returned within 30 days in undamaged condition. If the product is faulty, we may send a replacement.

Browse books from The Saint Bookstore

Reader reviews for Dynamical Systems, Graphs, and Algorithms

From the publisher

This book describes a family of algorithms for studying the global structure of systems. By a finite covering of the phase space we construct a directed graph with vertices corresponding to cells of the covering and edges corresponding to admissible transitions. The method is used, among other things, to locate the periodic orbits and the chain recurrent set, to construct the attractors and their basins, to estimate the entropy, and more.

tracking-