{
"item_title" : "Dynamical Systems, Graphs, and Algorithms",
"item_author" : [" George Osipenko "],
"item_description" : "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.",
"item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/54/035/593/3540355936_b.jpg",
"price_data" : {
"retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Dynamical Systems, Graphs, and Algorithms
Overview
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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783540355939
- ISBN-10: 3540355936
- Publisher: Springer
- Publish Date: November 2006
- Dimensions: 9.28 x 6.28 x 0.46 inches
- Shipping Weight: 0.96 pounds
- Page Count: 288
Related Categories
