Описание: This book presents computer programming as a key method for solving mathematical problems. The book was inspired by the Springer book TCSE 6: A Primer on Scientific Programming with Python (by Langtangen), but the style is more accessible and concise, in keeping with the needs of engineering students.
Описание: This book presents computer programming as a key method for solving mathematical problems. The book was inspired by the Springer book TCSE 6: A Primer on Scientific Programming with Python (by Langtangen), but the style is more accessible and concise, in keeping with the needs of engineering students.
Описание: Partial differential equations are one of the most used widely forms of mathematics in science and engineering. Two fractional PDEs can be considered, fractional in time, and fractional in space. These two volumes are directed to the development and use of SFPDEs, with the discussion divided into an introduction to Algorithms and Computer Coding in R and applications from classical integer PDEs.
Автор: Luciano M Barone Название: Scintific programming: C-Language,Algorithms and Models in Science ISBN: 9814513407 ISBN-13(EAN): 9789814513401 Издательство: World Scientific Publishing Рейтинг: Цена: 36432.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The book teaches a student to model a scientific problem and write a computer program in C language to solve that problem. To do that, the book first introduces the student to the basics of C language, dealing with all syntactical aspects, but without the pedantic content of a typical programming language manual. Then the book describes and discusses many algorithms commonly used in scientific applications (e.g. searching, graphs, statistics, equation solving, Monte Carlo methods etc.).This important book fills a gap in current available bibliography. There are many manuals for programming in C, but they never explain programming technicalities to solve a given problem. This book illustrates many relevant algorithms and shows how to translate them in a working computer program.
Автор: G?nter Mayer Название: Interval Analysis: and Automatic Result Verification ISBN: 3110500639 ISBN-13(EAN): 9783110500639 Издательство: Walter de Gruyter Рейтинг: Цена: 22305.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
This self-contained text is a step-by-step introduction and a complete overview of interval computation and result verification, a subject whose importance has steadily increased over the past many years. The author, an expert in the field, gently presents the theory of interval analysis through many examples and exercises, and guides the reader from the basics of the theory to current research topics in the mathematics of computation.
Contents
Preliminaries
Real intervals
Interval vectors, interval matrices
Expressions, P-contraction, ε-inflation
Linear systems of equations
Nonlinear systems of equations
Eigenvalue problems
Automatic differentiation
Complex intervals
Автор: Christian Cachin; Rachid Guerraoui; Lu?s Rodrigues Название: Introduction to Reliable and Secure Distributed Programming ISBN: 3642423272 ISBN-13(EAN): 9783642423277 Издательство: Springer Рейтинг: Цена: 6951.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Failures may range from crashes to adversarial attacks by malicious processes.Cachin, Guerraoui, and Rodrigues present an introductory description of fundamental distributed programming abstractions together with algorithms to implement them in distributed systems, where processes are subject to crashes and malicious attacks.
Автор: Dobrushkin, Vladimir A. Название: Methods in algorithmic analysis ISBN: 1138118044 ISBN-13(EAN): 9781138118041 Издательство: Taylor&Francis Рейтинг: Цена: 12707.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Explores the Impact of the Analysis of Algorithms on Many Areas within and beyond Computer Science A flexible, interactive teaching format enhanced by a large selection of examples and exercises
Developed from the author's own graduate-level course, Methods in Algorithmic Analysis presents numerous theories, techniques, and methods used for analyzing algorithms. It exposes students to mathematical techniques and methods that are practical and relevant to theoretical aspects of computer science.
After introducing basic mathematical and combinatorial methods, the text focuses on various aspects of probability, including finite sets, random variables, distributions, Bayes' theorem, and Chebyshev inequality. It explores the role of recurrences in computer science, numerical analysis, engineering, and discrete mathematics applications. The author then describes the powerful tool of generating functions, which is demonstrated in enumeration problems, such as probabilistic algorithms, compositions and partitions of integers, and shuffling. He also discusses the symbolic method, the principle of inclusion and exclusion, and its applications. The book goes on to show how strings can be manipulated and counted, how the finite state machine and Markov chains can help solve probabilistic and combinatorial problems, how to derive asymptotic results, and how convergence and singularities play leading roles in deducing asymptotic information from generating functions. The final chapter presents the definitions and properties of the mathematical infrastructure needed to accommodate generating functions.
Accompanied by more than 1,000 examples and exercises, this comprehensive, classroom-tested text develops students' understanding of the mathematical methodology behind the analysis of algorithms. It emphasizes the important relation between continuous (classical) mathematics and discrete mathematics, which is the basis of computer science.
Автор: Florentin Smarandache, Said Broumi Название: Neutrosophic Graph Theory and Algorithms ISBN: 1799813134 ISBN-13(EAN): 9781799813132 Издательство: Mare Nostrum (Eurospan) Рейтинг: Цена: 35897.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Graph theory is a specific concept that has numerous applications throughout many industries. Despite the advancement of this technique, graph theory can still yield ambiguous and imprecise results. In order to cut down on these indeterminate factors, neutrosophic logic has emerged as an applicable solution that is gaining significant attention in solving many real-life decision-making problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistency, and indeterminacy. However, empirical research on this specific graph set is lacking. Neutrosophic Graph Theory and Algorithms is a collection of innovative research on the methods and applications of neutrosophic sets and logic within various fields including systems analysis, economics, and transportation. While highlighting topics including linear programming, decision-making methods, and homomorphism, this book is ideally designed for programmers, researchers, data scientists, mathematicians, designers, educators, researchers, academicians, and students seeking current research on the various methods and applications of graph theory.
Автор: Cormen, Thomas H., E Название: Introduction to algorithms 3 ed. ISBN: 0262033844 ISBN-13(EAN): 9780262033848 Издательство: Random House (USA) Рейтинг: Цена: 16553.00 р. Наличие на складе: Нет в наличии.
Описание: A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-base flow.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
