Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
|
Your cart is empty |
|||
Books > Computing & IT > General theory of computing > Mathematical theory of computation
Computation is revolutionizing our world, even the inner world of the 'pure' mathematician. Mathematical methods - especially the notion of proof - that have their roots in classical antiquity have seen a radical transformation since the 1970s, as successive advances have challenged the priority of reason over computation. Like many revolutions, this one comes from within. Computation, calculation, algorithms - all have played an important role in mathematical progress from the beginning - but behind the scenes, their contribution was obscured in the enduring mathematical literature. To understand the future of mathematics, this fascinating book returns to its past, tracing the hidden history that follows the thread of computation. Along the way it invites us to reconsider the dialog between mathematics and the natural sciences, as well as the relationship between mathematics and computer science. It also sheds new light on philosophical concepts, such as the notions of analytic and synthetic judgment. Finally, it brings us to the brink of the new age, in which machine intelligence offers new ways of solving mathematical problems previously inaccessible. This book is the 2007 winner of the Grand Prix de Philosophie de l'Academie Francaise.
A Computational Approach to Statistical Learning gives a novel introduction to predictive modeling by focusing on the algorithmic and numeric motivations behind popular statistical methods. The text contains annotated code to over 80 original reference functions. These functions provide minimal working implementations of common statistical learning algorithms. Every chapter concludes with a fully worked out application that illustrates predictive modeling tasks using a real-world dataset. The text begins with a detailed analysis of linear models and ordinary least squares. Subsequent chapters explore extensions such as ridge regression, generalized linear models, and additive models. The second half focuses on the use of general-purpose algorithms for convex optimization and their application to tasks in statistical learning. Models covered include the elastic net, dense neural networks, convolutional neural networks (CNNs), and spectral clustering. A unifying theme throughout the text is the use of optimization theory in the description of predictive models, with a particular focus on the singular value decomposition (SVD). Through this theme, the computational approach motivates and clarifies the relationships between various predictive models. Taylor Arnold is an assistant professor of statistics at the University of Richmond. His work at the intersection of computer vision, natural language processing, and digital humanities has been supported by multiple grants from the National Endowment for the Humanities (NEH) and the American Council of Learned Societies (ACLS). His first book, Humanities Data in R, was published in 2015. Michael Kane is an assistant professor of biostatistics at Yale University. He is the recipient of grants from the National Institutes of Health (NIH), DARPA, and the Bill and Melinda Gates Foundation. His R package bigmemory won the Chamber's prize for statistical software in 2010. Bryan Lewis is an applied mathematician and author of many popular R packages, including irlba, doRedis, and threejs.
In the last decade, both scholars and practitioners have sought novel ways to address the problem of cybersecurity. Innovative outcomes have included applications such as blockchain as well as creative methods for cyber forensics, software development, and intrusion prevention. Accompanying these technological advancements, discussion on cyber matters at national and international levels has focused primarily on the topics of law, policy, and strategy. The objective of these efforts is typically to promote security by establishing agreements among stakeholders on regulatory activities. Varying levels of investment in cyberspace, however, comes with varying levels of risk; in some ways, this can translate directly to the degree of emphasis for pushing substantial change. At the very foundation or root of cyberspace systems and processes are tenets and rules governed by principles in mathematics. Topics such as encrypting or decrypting file transmissions, modeling networks, performing data analysis, quantifying uncertainty, measuring risk, and weighing decisions or adversarial courses of action represent a very small subset of activities highlighted by mathematics. To facilitate education and a greater awareness of the role of mathematics in cyber systems and processes, a description of research in this area is needed. Mathematics in Cyber Research aims to familiarize educators and young researchers with the breadth of mathematics in cyber-related research. Each chapter introduces a mathematical sub-field, describes relevant work in this field associated with the cyber domain, provides methods and tools, as well as details cyber research examples or case studies. Features One of the only books to bring together such a diverse and comprehensive range of topics within mathematics and apply them to cyber research. Suitable for college undergraduate students or educators that are either interested in learning about cyber-related mathematics or intend to perform research within the cyber domain. The book may also appeal to practitioners within the commercial or government industry sectors. Most national and international venues for collaboration and discussion on cyber matters have focused primarily on the topics of law, policy, strategy, and technology. This book is among the first to address the underpinning mathematics.
The Foundations of Computational Mathematics meetings are a platform for cross-fertilisation between numerical analysis, mathematics and computer science. This volume is a collection of articles based on plenary presentations, given at the 2011 meeting, by some of the world's foremost authorities in computational mathematics. The topics covered reflect the breadth of research within the area as well as the richness of interactions between seemingly unrelated branches of pure and applied mathematics. As a result this volume will be of interest to researchers in the field of computational mathematics and also to non-experts who wish to gain some insight into the state of the art in this active and significant field.
This book presents fundamental concepts of optimization problems and its real-world applications in various fields. The core concepts of optimization, formulations and solution procedures of various real-world problems are provided in an easy-to-read manner. The unique feature of this book is that it presents unified knowledge of the modelling of real-world decision-making problems and provides the solution procedure using the appropriate optimization techniques. The book will help students, researchers, and faculty members to understand the need for optimization techniques for obtaining optimal solution for the decision-making problems. It provides a sound knowledge of modelling of real-world problems using optimization techniques. It is a valuable compendium of several optimization techniques for solving real-world application problems using optimization software LINGO. The book is useful for academicians, practitioners, students and researchers in the field of OR. It is written in simple language with a detailed explanation of the core concepts of optimization techniques. Readers of this book will understand the formulation of real-world problems and their solution procedures obtained using the appropriate optimization techniques.
This book concentrates on mining networks, a subfield within data science. Data science uses scientific and computational tools to extract valuable knowledge from large data sets. Once data is processed and cleaned, it is analyzed and presented to support decision-making processes. Data science and machine learning tools have become widely used in companies of all sizes. Networks are often large-scale, decentralized, and evolve dynamically over time. Mining complex networks aim to understand the principles governing the organization and the behavior of such networks is crucial for a broad range of fields of study. Here are a few selected typical applications of mining networks: Community detection (which users on some social media platforms are close friends). Link prediction (who is likely to connect to whom on such platforms). Node attribute prediction (what advertisement should be shown to a given user of a particular platform to match their interests). Influential node detection (which social media users would be the best ambassadors of a specific product). This textbook is suitable for an upper-year undergraduate course or a graduate course in programs such as data science, mathematics, computer science, business, engineering, physics, statistics, and social science. This book can be successfully used by all enthusiasts of data science at various levels of sophistication to expand their knowledge or consider changing their career path. Jupiter notebooks (in Python and Julia) accompany the book and can be accessed on https://www.ryerson.ca/mining-complex-networks/. These not only contain all the experiments presented in the book, but also include additional material. Bogumil Kaminski is the Chairman of the Scientific Council for the Discipline of Economics and Finance at SGH Warsaw School of Economics. He is also an Adjunct Professor at the Data Science Laboratory at Ryerson University. Bogumil is an expert in applications of mathematical modeling to solving complex real-life problems. He is also a substantial open-source contributor to the development of the Julia language and its package ecosystem. Pawel Pralat is a Professor of Mathematics in Ryerson University, whose main research interests are in random graph theory, especially in modeling and mining complex networks. He is the Director of Fields-CQAM Lab on Computational Methods in Industrial Mathematics in The Fields Institute for Research in Mathematical Sciences and has pursued collaborations with various industry partners as well as the Government of Canada. He has written over 170 papers and three books with 130 plus collaborators. Francois Theberge holds a B.Sc. degree in applied mathematics from the University of Ottawa, a M.Sc. in telecommunications from INRS and a PhD in electrical engineering from McGill University. He has been employed by the Government of Canada since 1996 where he was involved in the creation of the data science team as well as the research group now known as the Tutte Institute for Mathematics and Computing. He also holds an adjunct professorial position in the Department of Mathematics and Statistics at the University of Ottawa. His current interests include relational-data mining and deep learning.
Covers computational methods in design and fluid dynamics with a focus on computational fluid dynamics Explains advanced material applications and manufacturing in labs using novel alloys and introduces properties in material Discusses fabrication of graphene reinforced magnesium metal matrix for orthopedic applications Illustrates simulation and optimization gear transmission, heat sink and heat exchangers application Provides unique problem-solution approach including solutions, methodology, experimental setup, and results validation
the handbook is a valuable reference to researchers from industry and academia, as well as Masters and PhD students around the globe working in the metaheuristics and applications domain includes contributions from a variety of academics/researchers in the field of metaheuristics
Focuses on the latest research in the field of differential equations in engineering applications Discusses the most recent research findings that are occurring across different institutions Identifies the gaps in the knowledge of differential equations Presents the most fruitful areas for further research in advanced processes Offers the most forthcoming studies in modeling and simulation along with real-world case studies
The aim of this book is to provide insight into Data Science and Artificial Learning Techniques based on Industry 4.0, conveys how Machine Learning & Data Science are becoming an essential part of industrial and academic research. Varying from healthcare to social networking and everywhere hybrid models for Data Science, Al, and Machine Learning are being used. The book describes different theoretical and practical aspects and highlights how new systems are being developed. Along with focusing on the research trends, challenges and future of AI in Data Science, the book explores the potential for integration of advanced AI algorithms, addresses the challenges of Data Science for Industry 4.0, covers different security issues, includes qualitative and quantitative research, and offers case studies with working models. This book also provides an overview of AI and Data Science algorithms for readers who do not have a strong mathematical background. Undergraduates, postgraduates, academicians, researchers, and industry professionals will benefit from this book and use it as a guide.
Physically Unclonable Functions (PUFs) translate unavoidable variations in certain parameters of materials, waves, or devices into random and unique signals. They have found many applications in the Internet of Things (IoT), authentication systems, FPGA industry, several other areas in communications and related technologies, and many commercial products. Statistical Trend Analysis of Physically Unclonable Functions first presents a review on cryptographic hardware and hardware-assisted cryptography. The review highlights PUF as a mega trend in research on cryptographic hardware design. Afterwards, the authors present a combined survey and research work on PUFs using a systematic approach. As part of the survey aspect, a state-of-the-art analysis is presented as well as a taxonomy on PUFs, a life cycle, and an established ecosystem for the technology. In another part of the survey, the evolutionary history of PUFs is examined, and strategies for further research in this area are suggested. In the research side, this book presents a novel approach for trend analysis that can be applied to any technology or research area. In this method, a text mining tool is used which extracts 1020 keywords from the titles of the sample papers. Then, a classifying tool classifies the keywords into 295 meaningful research topics. The popularity of each topic is then numerically measured and analyzed over the course of time through a statistical analysis on the number of research papers related to the topic as well as the number of their citations. The authors identify the most popular topics in four different domains; over the history of PUFs, during the recent years, in top conferences, and in top journals. The results are used to present an evolution study as well as a trend analysis and develop a roadmap for future research in this area. This method gives an automatic popularity-based statistical trend analysis which eliminates the need for passing personal judgments about the direction of trends, and provides concrete evidence to the future direction of research on PUFs. Another advantage of this method is the possibility of studying a whole lot of existing research works (more than 700 in this book). This book will appeal to researchers in text mining, cryptography, hardware security, and IoT.
Proof techniques in cryptography are very difficult to understand, even for students or researchers who major in cryptography. In addition, in contrast to the excessive emphases on the security proofs of the cryptographic schemes, practical aspects of them have received comparatively less attention. This book addresses these two issues by providing detailed, structured proofs and demonstrating examples, applications and implementations of the schemes, so that students and practitioners may obtain a practical view of the schemes. Seong Oun Hwang is a professor in the Department of Computer Engineering and director of Artificial Intelligence Security Research Center, Gachon University, Korea. He received the Ph.D. degree in computer science from the Korea Advanced Institute of Science and Technology (KAIST), Korea. His research interests include cryptography, cybersecurity, networks, and machine learning. Intae Kim is an associate research fellow at the Institute of Cybersecurity and Cryptology, University of Wollongong, Australia. He received the Ph.D. degree in electronics and computer engineering from Hongik University, Korea. His research interests include cryptography, cybersecurity, and networks. Wai Kong Lee is an assistant professor in UTAR (University Tunku Abdul Rahman), Malaysia. He received the Ph.D. degree in engineering from UTAR, Malaysia. In between 2009 - 2012, he served as an R&D engineer in several multinational companies including Agilent Technologies (now known as Keysight) in Malaysia. His research interests include cryptography engineering, GPU computing, numerical algorithms, Internet of Things (IoT) and energy harvesting.
The first edition of this award-winning book attracted a wide audience. This second edition is both a joy to read and a useful classroom tool. Unlike traditional textbooks, it requires no mathematical prerequisites and can be read around the mathematics presented. If used as a textbook, the mathematics can be prioritized, with a book both students and instructors will enjoy reading. Secret History: The Story of Cryptology, Second Edition incorporates new material concerning various eras in the long history of cryptology. Much has happened concerning the political aspects of cryptology since the first edition appeared. The still unfolding story is updated here. The first edition of this book contained chapters devoted to the cracking of German and Japanese systems during World War II. Now the other side of this cipher war is also told, that is, how the United States was able to come up with systems that were never broken. The text is in two parts. Part I presents classic cryptology from ancient times through World War II. Part II examines modern computer cryptology. With numerous real-world examples and extensive references, the author skillfully balances the history with mathematical details, providing readers with a sound foundation in this dynamic field. FEATURES Presents a chronological development of key concepts Includes the Vigenere cipher, the one-time pad, transposition ciphers, Jefferson's wheel cipher, Playfair cipher, ADFGX, matrix encryption, Enigma, Purple, and other classic methods Looks at the work of Claude Shannon, the origin of the National Security Agency, elliptic curve cryptography, the Data Encryption Standard, the Advanced Encryption Standard, public-key cryptography, and many other topics New chapters detail SIGABA and SIGSALY, successful systems used during World War II for text and speech, respectively Includes quantum cryptography and the impact of quantum computers
From the Foreword: "While large-scale machine learning and data mining have greatly impacted a range of commercial applications, their use in the field of Earth sciences is still in the early stages. This book, edited by Ashok Srivastava, Ramakrishna Nemani, and Karsten Steinhaeuser, serves as an outstanding resource for anyone interested in the opportunities and challenges for the machine learning community in analyzing these data sets to answer questions of urgent societal interest...I hope that this book will inspire more computer scientists to focus on environmental applications, and Earth scientists to seek collaborations with researchers in machine learning and data mining to advance the frontiers in Earth sciences." --Vipin Kumar, University of Minnesota Large-Scale Machine Learning in the Earth Sciences provides researchers and practitioners with a broad overview of some of the key challenges in the intersection of Earth science, computer science, statistics, and related fields. It explores a wide range of topics and provides a compilation of recent research in the application of machine learning in the field of Earth Science. Making predictions based on observational data is a theme of the book, and the book includes chapters on the use of network science to understand and discover teleconnections in extreme climate and weather events, as well as using structured estimation in high dimensions. The use of ensemble machine learning models to combine predictions of global climate models using information from spatial and temporal patterns is also explored. The second part of the book features a discussion on statistical downscaling in climate with state-of-the-art scalable machine learning, as well as an overview of methods to understand and predict the proliferation of biological species due to changes in environmental conditions. The problem of using large-scale machine learning to study the formation of tornadoes is also explored in depth. The last part of the book covers the use of deep learning algorithms to classify images that have very high resolution, as well as the unmixing of spectral signals in remote sensing images of land cover. The authors also apply long-tail distributions to geoscience resources, in the final chapter of the book.
An Image Processing Tour of College Mathematics aims to provide meaningful context for reviewing key topics of the college mathematics curriculum, to help students gain confidence in using concepts and techniques of applied mathematics, to increase student awareness of recent developments in mathematical sciences, and to help students prepare for graduate studies. The topics covered include a library of elementary functions, basic concepts of descriptive statistics, probability distributions of functions of random variables, definitions and concepts behind first- and second-order derivatives, most concepts and techniques of traditional linear algebra courses, an introduction to Fourier analysis, and a variety of discrete wavelet transforms - all of that in the context of digital image processing. Features Pre-calculus material and basic concepts of descriptive statistics are reviewed in the context of image processing in the spatial domain. Key concepts of linear algebra are reviewed both in the context of fundamental operations with digital images and in the more advanced context of discrete wavelet transforms. Some of the key concepts of probability theory are reviewed in the context of image equalization and histogram matching. The convolution operation is introduced painlessly and naturally in the context of naive filtering for denoising and is subsequently used for edge detection and image restoration. An accessible elementary introduction to Fourier analysis is provided in the context of image restoration. Discrete wavelet transforms are introduced in the context of image compression, and the readers become more aware of some of the recent developments in applied mathematics. This text helps students of mathematics ease their way into mastering the basics of scientific computer programming.
This book provides a clear understanding regarding the fundamentals of matrix and determinant from introduction to its real-life applications. The topic is considered one of the most important mathematical tools used in mathematical modelling. Matrix and Determinant: Fundamentals and Applications is a small self-explanatory and well synchronized book that provides an introduction to the basics along with well explained applications. The theories in the book are covered along with their definitions, notations, and examples. Illustrative examples are listed at the end of each covered topic along with unsolved comprehension questions, and real-life applications. This book provides a concise understanding of matrix and determinate which will be useful to students as well as researchers.
This book discusses an important area of numerical optimization, called interior-point method. This topic has been popular since the 1980s when people gradually realized that all simplex algorithms were not convergent in polynomial time and many interior-point algorithms could be proved to converge in polynomial time. However, for a long time, there was a noticeable gap between theoretical polynomial bounds of the interior-point algorithms and efficiency of these algorithms. Strategies that were important to the computational efficiency became barriers in the proof of good polynomial bounds. The more the strategies were used in algorithms, the worse the polynomial bounds became. To further exacerbate the problem, Mehrotra's predictor-corrector (MPC) algorithm (the most popular and efficient interior-point algorithm until recently) uses all good strategies and fails to prove the convergence. Therefore, MPC does not have polynomiality, a critical issue with the simplex method. This book discusses recent developments that resolves the dilemma. It has three major parts. The first, including Chapters 1, 2, 3, and 4, presents some of the most important algorithms during the development of the interior-point method around the 1990s, most of them are widely known. The main purpose of this part is to explain the dilemma described above by analyzing these algorithms' polynomial bounds and summarizing the computational experience associated with them. The second part, including Chapters 5, 6, 7, and 8, describes how to solve the dilemma step-by-step using arc-search techniques. At the end of this part, a very efficient algorithm with the lowest polynomial bound is presented. The last part, including Chapters 9, 10, 11, and 12, extends arc-search techniques to some more general problems, such as convex quadratic programming, linear complementarity problem, and semi-definite programming.
Businesses today are faced with a highly competitive market and fast-changing technologies. In order to meet demanding customers' needs, they rely on high quality software. A new field of study, soft computing techniques, is needed to estimate the efforts invested in component-based software. Component-Based Systems: Estimating Efforts Using Soft Computing Techniques is an important resource that uses computer-based models for estimating efforts of software. It provides an overview of component-based software engineering, while addressing uncertainty involved in effort estimation and expert opinions. This book will also instruct the reader how to develop mathematical models. This book is an excellent source of information for students and researchers to learn soft computing models, their applications in software management, and will help software developers, managers, and those in the industry to apply soft computing techniques to estimate efforts.
Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees. Features Designed to be especially useful for courses at the community-college level Ideal as a first- or second-year textbook for computer science majors, or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background, and to aid with the transition to abstract thinking Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode Includes an appendix on basic circuit design which provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbers Jon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a BA in Mathematics and Actuarial Science and a BSE in Chemical Engineering. Prior to returning to graduate school, he worked as both an environmental engineer and as an actuarial analyst. He graduated from Arizona State University in 2008 with a PhD in Mathematics, specializing in Geometric Mechanics. Since 2012, he has worked at Zayed University in Dubai. This is his second mathematics textbook.
Computational science is a rapidly growing multidisciplinary field concerned with the design, implementation, and use of mathematical models to analyze and solve real-world problems. It is an area of science that spans many disciplines and which involves the development of models and allows the use of computers to perform simulations or numerical analysis to understand problems that are computational and theoretical. Computational Science and its Applications provides an opportunity for readers to develop abilities to pose and solve problems that combine insights from one or more disciplines from the natural sciences with mathematical tools and computational skills. This requires a unique combination of applied and theoretical knowledge and skills. The topics covered in this edited book are applications of wavelet and fractals, modeling by partial differential equations on flat structure as well as on graphs and networks, computational linguistics, prediction of natural calamities and diseases like epilepsy seizure, heart attack, stroke, biometrics, modeling through inverse problems, interdisciplinary topics of physics, mathematics, and medical science, and modeling of terrorist attacks and human behavior. The focus of this book is not to educate computer specialists, but to provide readers with a solid understanding of basic science as well as an integrated knowledge on how to use essential methods from computational science. Features: Modeling of complex systems Cognitive computing systems for real-world problems Presentation of inverse problems in medical science and their numerical solutions Challenging research problems in many areas of computational science This book could be used as a reference book for researchers working in theoretical research as well as those who are doing modeling and simulation in such disciplines as physics, biology, geoscience, and mathematics, and those who have a background in computational science.
Businesses today are faced with a highly competitive market and fast-changing technologies. In order to meet demanding customers' needs, they rely on high quality software. A new field of study, soft computing techniques, is needed to estimate the efforts invested in component-based software. Component-Based Systems: Estimating Efforts Using Soft Computing Techniques is an important resource that uses computer-based models for estimating efforts of software. It provides an overview of component-based software engineering, while addressing uncertainty involved in effort estimation and expert opinions. This book will also instruct the reader how to develop mathematical models. This book is an excellent source of information for students and researchers to learn soft computing models, their applications in software management, and will help software developers, managers, and those in the industry to apply soft computing techniques to estimate efforts.
Optimization is the act of obtaining the "best" result under given circumstances. In design, construction, and maintenance of any engineering system, engineers must make technological and managerial decisions to minimize either the effort or cost required or to maximize benefits. There is no single method available for solving all optimization problems efficiently. Several optimization methods have been developed for different types of problems. The optimum-seeking methods are mathematical programming techniques (specifically, nonlinear programming techniques). Nonlinear Optimization: Models and Applications presents the concepts in several ways to foster understanding. Geometric interpretation: is used to re-enforce the concepts and to foster understanding of the mathematical procedures. The student sees that many problems can be analyzed, and approximate solutions found before analytical solutions techniques are applied. Numerical approximations: early on, the student is exposed to numerical techniques. These numerical procedures are algorithmic and iterative. Worksheets are provided in Excel, MATLAB (R), and Maple (TM) to facilitate the procedure. Algorithms: all algorithms are provided with a step-by-step format. Examples follow the summary to illustrate its use and application. Nonlinear Optimization: Models and Applications: Emphasizes process and interpretation throughout Presents a general classification of optimization problems Addresses situations that lead to models illustrating many types of optimization problems Emphasizes model formulations Addresses a special class of problems that can be solved using only elementary calculus Emphasizes model solution and model sensitivity analysis About the author: William P. Fox is an emeritus professor in the Department of Defense Analysis at the Naval Postgraduate School. He received his Ph.D. at Clemson University and has taught at the United States Military Academy and at Francis Marion University where he was the chair of mathematics. He has written many publications, including over 20 books and over 150 journal articles. Currently, he is an adjunct professor in the Department of Mathematics at the College of William and Mary. He is the emeritus director of both the High School Mathematical Contest in Modeling and the Mathematical Contest in Modeling.
Problem Solving is essential to solve real-world problems. Advanced Problem Solving with Maple: A First Course applies the mathematical modeling process by formulating, building, solving, analyzing, and criticizing mathematical models. It is intended for a course introducing students to mathematical topics they will revisit within their further studies. The authors present mathematical modeling and problem-solving topics using Maple as the computer algebra system for mathematical explorations, as well as obtaining plots that help readers perform analyses. The book presents cogent applications that demonstrate an effective use of Maple, provide discussions of the results obtained using Maple, and stimulate thought and analysis of additional applications. Highlights: The book's real-world case studies prepare the student for modeling applications Bridges the study of topics and applications to various fields of mathematics, science, and engineering Features a flexible format and tiered approach offers courses for students at various levels The book can be used for students with only algebra or calculus behind them About the authors: Dr. William P. Fox is an emeritus professor in the Department of Defense Analysis at the Naval Postgraduate School. Currently, he is an adjunct professor, Department of Mathematics, the College of William and Mary. He received his Ph.D. at Clemson University and has many publications and scholarly activities including twenty books and over one hundred and fifty journal articles. William C. Bauldry, Prof. Emeritus and Adjunct Research Prof. of Mathematics at Appalachian State University, received his PhD in Approximation Theory from Ohio State. He has published many papers on pedagogy and technology, often using Maple, and has been the PI of several NSF-funded projects incorporating technology and modeling into math courses. He currently serves as Associate Director of COMAP's Math Contest in Modeling (MCM). *Please note that the Maple package, "PSM", is now on the public area of the Maple Cloud. To access it: * From the web: 1. Go to the website https://maple.cloud 2. Click on "packages" in the left navigation pane 3. Click on "PSM" in the list of packages. 4. Click the "Download" button to capture the package. * From Maple: 1. Click on the Maple Cloud icon (far right in the Maple window toolbar). Or click on the Maple Cloud button on Maple's Start page to go to the website. 2. Click on the "packages" in the navigation pane 3. Click on "PSM" in the list of packages. The package then downloads into Maple directly.
This new work is an introduction to the numerical solution of the initial value problem for a system of ordinary differential equations. The first three chapters are general in nature, and chapters 4 through 8 derive the basic numerical methods, prove their convergence, study their stability and consider how to implement them effectively. The book focuses on the most important methods in practice and develops them fully, uses examples throughout, and emphasizes practical problem-solving methods.
Exact eigenvalues, eigenvectors, and principal vectors of operators with infinite dimensional ranges can rarely be found. Therefore, one must approximate such operators by finite rank operators, then solve the original eigenvalue problem approximately. Serving as both an outstanding text for graduate students and as a source of current results for research scientists, Spectral Computations for Bounded Operators addresses the issue of solving eigenvalue problems for operators on infinite dimensional spaces. From a review of classical spectral theory through concrete approximation techniques to finite dimensional situations that can be implemented on a computer, this volume illustrates the marriage of pure and applied mathematics. It contains a variety of recent developments, including a new type of approximation that encompasses a variety of approximation methods but is simple to verify in practice. It also suggests a new stopping criterion for the QR Method and outlines advances in both the iterative refinement and acceleration techniques for improving the accuracy of approximations. The authors illustrate all definitions and results with elementary examples and include numerous exercises. Spectral Computations for Bounded Operators thus serves as both an outstanding text for second-year graduate students and as a source of current results for research scientists. |
You may like...
Advanced Problem Solving Using Maple…
William P. Fox, William Bauldry
Paperback
R1,383
Discovery Miles 13 830
AI-based Metaheuristics for Information…
Apoorva S Shastri, Mangal Singh, …
Hardcover
R2,325
Discovery Miles 23 250
Data-Driven Science and Engineering…
Steven L. Brunton, J. Nathan Kutz
Hardcover
PCI Compliance - Understand and…
Branden Williams, James Adamson
Paperback
R1,344
Discovery Miles 13 440
Algorithm Design: A Methodological…
Patrick Bosc, Marc Guyomard, …
Paperback
R1,587
Discovery Miles 15 870
Mathematical Perspectives on Neural…
Paul Smolensky, Michael C. Mozer, …
Hardcover
R6,356
Discovery Miles 63 560
|