![]() |
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
|
Your cart is empty |
||
|
Books > Science & Mathematics > Mathematics > Algebra > General
The parabolic partial differential equations model one of the most important processes in the real-world: diffusion. Whether it is the diffusion of energy in space-time, the diffusion of species in ecology, the diffusion of chemicals in biochemical processes, or the diffusion of information in social networks, diffusion processes are ubiquitous and crucial in the physical and natural world as well as our everyday lives. This book is self-contained and covers key topics such as the Lp theory and Schauder theory, maximum principle, comparison principle, regularity and uniform estimates, initial-boundary value problems of semilinear parabolic scalar equations and weakly coupled parabolic systems, the upper and lower solutions method, monotone properties and long-time behaviours of solutions, convergence of solutions and stability of equilibrium solutions, global solutions and finite time blowup. It also touches on periodic boundary value problems, free boundary problems, and semigroup theory. The book covers major theories and methods of the field, including topics that are useful but hard to find elsewhere. This book is based on tried and tested teaching materials used at the Harbin Institute of Technology over the past ten years. Special care was taken to make the book suitable for classroom teaching as well as for self-study among graduate students. About the Author: Mingxin Wang is Professor of Mathematics at Harbin Institute of Technology, China. He has published ten monographs and textbooks and 260 papers. He is also a supervisor of 30 PhD students.
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.
The Yang-Mills theory of gauge interactions is a prime example of interdisciplinary mathematics and advanced physics. Its historical development is a fascinating window into the ongoing struggle of mankind to understand nature. The discovery of gauge fields and their properties is the most formidable landmark of modern physics. The expression of the gauge field strength as the curvature associated to a given connection, places quantum field theory in the same geometrical footing as the gravitational field of general relativity which is naturally written in geometrical terms. The understanding of such geometrical property may help one day to write a unified field theory starting from symmetry principles. Of course, there are remarkable differences between the standard gauge fields and the gravitational field, which must be understood by mathematicians and physicists before attempting such unification. In particular, it is important to understand why gravitation is not a standard gauge field. This book presents an account of the geometrical properties of gauge field theory, while trying to keep the equilibrium between mathematics and physics. At the end we will introduce a similar approach to the gravitational field.
Algebra & Geometry: An Introduction to University Mathematics, Second Edition provides a bridge between high school and undergraduate mathematics courses on algebra and geometry. The author shows students how mathematics is more than a collection of methods by presenting important ideas and their historical origins throughout the text. He incorporates a hands-on approach to proofs and connects algebra and geometry to various applications. The text focuses on linear equations, polynomial equations, and quadratic forms. The first few chapters cover foundational topics, including the importance of proofs and a discussion of the properties commonly encountered when studying algebra. The remaining chapters form the mathematical core of the book. These chapters explain the solutions of different kinds of algebraic equations, the nature of the solutions, and the interplay between geometry and algebra. New to the second edition Several updated chapters, plus an all-new chapter discussing the construction of the real numbers by means of approximations by rational numbers Includes fifteen short 'essays' that are accessible to undergraduate readers, but which direct interested students to more advanced developments of the material Expanded references Contains chapter exercises with solutions provided online at www.routledge.com/9780367563035
Linear algebra is an extremely versatile and useful subject. It rewards those who study it with powerful computational tools, lessons about how mathematical theory is built, examples for later study in other classes, and much more. Functional Linear Algebra is a unique text written to address the need for a one-term linear algebra course where students have taken only calculus. It does not assume students have had a proofs course. The text offers the following approaches: More emphasis is placed on the idea of a linear function, which is used to motivate the study of matrices and their operations. This should seem natural to students after the central role of functions in calculus. Row reduction is moved further back in the semester and vector spaces are moved earlier to avoid an artificial feeling of separation between the computational and theoretical aspects of the course. Chapter 0 offers applications from engineering and the sciences to motivate students by revealing how linear algebra is used. Vector spaces are developed over R, but complex vector spaces are discussed in Appendix A.1. Computational techniques are discussed both by hand and using technology. A brief introduction to Mathematica is provided in Appendix A.2. As readers work through this book, it is important to understand the basic ideas, definitions, and computational skills. Plenty of examples and problems are provided to make sure readers can practice until the material is thoroughly grasped. Author Dr. Hannah Robbins is an associate professor of mathematics at Roanoke College, Salem, VA. Formerly a commutative algebraist, she now studies applications of linear algebra and assesses teaching practices in calculus. Outside the office, she enjoys hiking and playing bluegrass bass.
The book presents qualitative results for different classes of fractional equations, including fractional functional differential equations, fractional impulsive differential equations, and fractional impulsive functional differential equations, which have not been covered by other books. It manifests different constructive methods by demonstrating how these techniques can be applied to investigate qualitative properties of the solutions of fractional systems. Since many applications have been included, the demonstrated techniques and models can be used in training students in mathematical modeling and in the study and development of fractional-order models.
Iterative processes are the tools used to generate sequences approximating solutions of equations describing real life problems. Intended for researchers in computational sciences and as a reference book for advanced computational method in nonlinear analysis, this book is a collection of the recent results on the convergence analysis of numerical algorithms in both finite-dimensional and infinite-dimensional spaces and presents several applications and connections with fixed point theory. It contains an abundant and updated bibliography and provides comparisons between various investigations made in recent years in the field of computational nonlinear analysis. The book also provides recent advancements in the study of iterative procedures and can be used as a source to obtain the proper method to use in order to solve a problem. The book assumes a basic background in Mathematical Statistics, Linear Algebra and Numerical Analysis and may be used as a self-study reference or as a supplementary text for an advanced course in Biosciences or Applied Sciences. Moreover, the newest techniques used to study the dynamics of iterative methods are described and used in the book and they are compared with the classical ones.
The book reviews inequalities for weighted entry sums of matrix powers. Applications range from mathematics and CS to pure sciences. It unifies and generalizes several results for products and powers of sesquilinear forms derived from powers of Hermitian, positive-semidefinite, as well as nonnegative matrices. It shows that some inequalities are valid only in specific cases. How to translate the Hermitian matrix results into results for alternating powers of general rectangular matrices? Inequalities that compare the powers of the row and column sums to the row and column sums of the matrix powers are refined for nonnegative matrices. Lastly, eigenvalue bounds and derive results for iterated kernels are improved.
Scientific Computing with MATLAB (R), Second Edition improves students' ability to tackle mathematical problems. It helps students understand the mathematical background and find reliable and accurate solutions to mathematical problems with the use of MATLAB, avoiding the tedious and complex technical details of mathematics. This edition retains the structure of its predecessor while expanding and updating the content of each chapter. The book bridges the gap between problems and solutions through well-grouped topics and clear MATLAB example scripts and reproducible MATLAB-generated plots. Students can effortlessly experiment with the scripts for a deep, hands-on exploration. Each chapter also includes a set of problems to strengthen understanding of the material.
This work is at the crossroads of a number of mathematical areas, including algebraic geometry, several complex variables, differential geometry, and representation theory. It is the first book to cover complex tori, among the simplest of complex manifolds, which are important to research in the above areas. The book gives a systematic approach to the theory, presents new results, and includes an up-to-date bibliography.
This book deals with analytic treatments of Markov processes. Symmetric Dirichlet forms and their associated Markov processes are important and powerful tools in the theory of Markov processes and their applications. The theory is well studied and used in various fields. In this monograph, we intend to generalize the theory to non-symmetric and time dependent semi-Dirichlet forms. By this generalization, we can cover the wide class of Markov processes and analytic theory which do not possess the dual Markov processes. In particular, under the semi-Dirichlet form setting, the stochastic calculus is not well established yet. In this monograph, we intend to give an introduction to such calculus. Furthermore, basic examples different from the symmetric cases are given. The text is written for graduate students, but also researchers.
This book intends to provide material for a graduate course on computational commutative algebra and algebraic geometry, highlighting potential applications in cryptography. Also, the topics in this book could form the basis of a graduate course that acts as a segue between an introductory algebra course and the more technical topics of commutative algebra and algebraic geometry.This book contains a total of 124 exercises with detailed solutions as well as an important number of examples that illustrate definitions, theorems, and methods. This is very important for students or researchers who are not familiar with the topics discussed. Experience has shown that beginners who want to take their first steps in algebraic geometry are usually discouraged by the difficulty of the proposed exercises and the absence of detailed answers. Therefore, exercises (and their solutions) as well as examples occupy a prominent place in this course.This book is not designed as a comprehensive reference work, but rather as a selective textbook. The many exercises with detailed answers make it suitable for use in both a math or computer science course.
This book intends to provide material for a graduate course on computational commutative algebra and algebraic geometry, highlighting potential applications in cryptography. Also, the topics in this book could form the basis of a graduate course that acts as a segue between an introductory algebra course and the more technical topics of commutative algebra and algebraic geometry.This book contains a total of 124 exercises with detailed solutions as well as an important number of examples that illustrate definitions, theorems, and methods. This is very important for students or researchers who are not familiar with the topics discussed. Experience has shown that beginners who want to take their first steps in algebraic geometry are usually discouraged by the difficulty of the proposed exercises and the absence of detailed answers. Therefore, exercises (and their solutions) as well as examples occupy a prominent place in this course.This book is not designed as a comprehensive reference work, but rather as a selective textbook. The many exercises with detailed answers make it suitable for use in both a math or computer science course.
The Study Guide & Intervention Workbook contains two worksheets for every lesson in the Student Edition. Helps students: Preview the concepts of the lesson, Practice the skills of the lesson, and catch up if they miss a class. Tier 2 RtI (Response to Intervention) addresses students' needs up to one year below grade level.
Drawing on rich classroom observations of educators teaching in China and the U.S., this book details an innovative and effective approach to teaching algebra at the elementary level, namely, "teaching through example-based problem solving" (TEPS). Recognizing young children's particular cognitive and developmental capabilities, this book powerfully argues for the importance of infusing algebraic thinking into early grade mathematics teaching and illustrates how this has been achieved by teachers in U.S. and Chinese contexts. Documenting best practice and students' responses to example-based instruction, the text demonstrates that this TEPS approach - which involves the use of worked examples, representations, and deep questions - helps students learn and master fundamental mathematical ideas, making it highly effective in developing algebraic readiness and mathematical understanding. This text will benefit post-graduate students, researchers, and academics in the fields of mathematics, STEM, and elementary education, as well as algebra research more broadly. Those interested in teacher education, classroom practice, and developmental and cognitive psychology will also find this volume of interest.
Multivariable Calculus with Mathematica is a textbook addressing the calculus of several variables. Instead of just using Mathematica to directly solve problems, the students are encouraged to learn the syntax and to write their own code to solve problems. This not only encourages scientific computing skills but at the same time stresses the complete understanding of the mathematics. Questions are provided at the end of the chapters to test the student's theoretical understanding of the mathematics, and there are also computer algebra questions which test the student's ability to apply their knowledge in non-trivial ways. Features Ensures that students are not just using the package to directly solve problems, but learning the syntax to write their own code to solve problems Suitable as a main textbook for a Calculus III course, and as a supplementary text for topics scientific computing, engineering, and mathematical physics Written in a style that engages the students' interest and encourages the understanding of the mathematical ideas
This introduction to cryptography employs a programming-oriented approach to study the most important cryptographic schemes in current use and the main cryptanalytic attacks against them. Discussion of the theoretical aspects, emphasizing precise security definitions based on methodological tools such as complexity and randomness, and of the mathematical aspects, with emphasis on number-theoretic algorithms and their applications to cryptography and cryptanalysis, is integrated with the programming approach, thus providing implementations of the algorithms and schemes as well as examples of realistic size. A distinctive feature of the author's approach is the use of Maple as a programming environment in which not just the cryptographic primitives but also the most important cryptographic schemes are implemented following the recommendations of standards bodies such as NIST, with many of the known cryptanalytic attacks implemented as well. The purpose of the Maple implementations is to let the reader experiment and learn, and for this reason the author includes numerous examples. The book discusses important recent subjects such as homomorphic encryption, identity-based cryptography and elliptic curve cryptography. The algorithms and schemes which are treated in detail and implemented in Maple include AES and modes of operation, CMAC, GCM/GMAC, SHA-256, HMAC, RSA, Rabin, Elgamal, Paillier, Cocks IBE, DSA and ECDSA. In addition, some recently introduced schemes enjoying strong security properties, such as RSA-OAEP, Rabin-SAEP, Cramer--Shoup, and PSS, are also discussed and implemented. On the cryptanalysis side, Maple implementations and examples are used to discuss many important algorithms, including birthday and man-in-the-middle attacks, integer factorization algorithms such as Pollard's rho and the quadratic sieve, and discrete log algorithms such as baby-step giant-step, Pollard's rho, Pohlig--Hellman and the index calculus method. This textbook is suitable for advanced undergraduate and graduate students of computer science, engineering and mathematics, satisfying the requirements of various types of courses: a basic introductory course; a theoretically oriented course whose focus is on the precise definition of security concepts and on cryptographic schemes with reductionist security proofs; a practice-oriented course requiring little mathematical background and with an emphasis on applications; or a mathematically advanced course addressed to students with a stronger mathematical background. The main prerequisite is a basic knowledge of linear algebra and elementary calculus, and while some knowledge of probability and abstract algebra would be helpful, it is not essential because the book includes the necessary background from these subjects and, furthermore, explores the number-theoretic material in detail. The book is also a comprehensive reference and is suitable for self-study by practitioners and programmers."
In the 2012-13 academic year, the Mathematical Sciences Research Institute, Berkeley, hosted programs in Commutative Algebra (Fall 2012 and Spring 2013) and Noncommutative Algebraic Geometry and Representation Theory (Spring 2013). There have been many significant developments in these fields in recent years; what is more, the boundary between them has become increasingly blurred. This was apparent during the MSRI program, where there were a number of joint seminars on subjects of common interest: birational geometry, D-modules, invariant theory, matrix factorizations, noncommutative resolutions, singularity categories, support varieties, and tilting theory, to name a few. These volumes reflect the lively interaction between the subjects witnessed at MSRI. The Introductory Workshops and Connections for Women Workshops for the two programs included lecture series by experts in the field. The volumes include a number of survey articles based on these lectures, along with expository articles and research papers by participants of the programs. Volume 2 focuses on the most recent research.
A Thorough Guide to Elementary Matrix Algebra and Implementation in R Basics of Matrix Algebra for Statistics with R provides a guide to elementary matrix algebra sufficient for undertaking specialized courses, such as multivariate data analysis and linear models. It also covers advanced topics, such as generalized inverses of singular and rectangular matrices and manipulation of partitioned matrices, for those who want to delve deeper into the subject. The book introduces the definition of a matrix and the basic rules of addition, subtraction, multiplication, and inversion. Later topics include determinants, calculation of eigenvectors and eigenvalues, and differentiation of linear and quadratic forms with respect to vectors. The text explores how these concepts arise in statistical techniques, including principal component analysis, canonical correlation analysis, and linear modeling. In addition to the algebraic manipulation of matrices, the book presents numerical examples that illustrate how to perform calculations by hand and using R. Many theoretical and numerical exercises of varying levels of difficulty aid readers in assessing their knowledge of the material. Outline solutions at the back of the book enable readers to verify the techniques required and obtain numerical answers. Avoiding vector spaces and other advanced mathematics, this book shows how to manipulate matrices and perform numerical calculations in R. It prepares readers for higher-level and specialized studies in statistics.
Mathematical Models of Plant-Herbivore Interactions addresses mathematical models in the study of practical questions in ecology, particularly factors that affect herbivory, including plant defense, herbivore natural enemies, and adaptive herbivory, as well as the effects of these on plant community dynamics. The result of extensive research on the use of mathematical modeling to investigate the effects of plant defenses on plant-herbivore dynamics, this book describes a toxin-determined functional response model (TDFRM) that helps explains field observations of these interactions. This book is intended for graduate students and researchers interested in mathematical biology and ecology.
This volume offers a gradual exposition to matrix theory as a subject of linear algebra. It presents both the theoretical results in generalized matrix inverses and the applications. The book is as self-contained as possible, assuming no prior knowledge of matrix theory and linear algebra. The book first addresses the basic definitions and concepts of an arbitrary generalized matrix inverse with special reference to the calculation of {i,j,...,k} inverse and the Moore-Penrose inverse. Then, the results of LDL* decomposition of the full rank polynomial matrix are introduced, along with numerical examples. Methods for calculating the Moore-Penrose's inverse of rational matrix are presented, which are based on LDL* and QDR decompositions of the matrix. A method for calculating the A(2)T;S inverse using LDL* decomposition using methods is derived as well as the symbolic calculation of A(2)T;S inverses using QDR factorization. The text then offers several ways on how the introduced theoretical concepts can be applied in restoring blurred images and linear regression methods, along with the well-known application in linear systems. The book also explains how the computation of generalized inverses of matrices with constant values is performed. It covers several methods, such as methods based on full-rank factorization, Leverrier-Faddeev method, method of Zhukovski, and variations of the partitioning method.
After being an open question for sixty years the Tarski conjecture was answered in the affirmative by Olga Kharlampovich and Alexei Myasnikov and independently by Zlil Sela. Both proofs involve long and complicated applications of algebraic geometry over free groups as well as an extension of methods to solve equations in free groups originally developed by Razborov. This book is an examination of the material on the general elementary theory of groups that is necessary to begin to understand the proofs. This material includes a complete exposition of the theory of fully residually free groups or limit groups as well a complete description of the algebraic geometry of free groups. Also included are introductory material on combinatorial and geometric group theory and first-order logic. There is then a short outline of the proof of the Tarski conjectures in the manner of Kharlampovich and Myasnikov.
Based on and enriched by the long-term teaching experience of the authors, this volume covers the major themes of mathematics in engineering and technical specialties. The book addresses the elements of linear algebra and analytic geometry, differential calculus of a function of one variable, and elements of higher algebra. On each theme the authors first present short theoretical overviews and then go on to give problems to be solved. The authors provide the solutions to some typical, relatively difficult problems and guidelines for solving them. The authors consider the development of the self-dependent thinking ability of students in the construction of problems and indicate which problems are relatively difficult. The book is geared so that some of the problems presented can be solved in class, and others are meant to be solved independently. An extensive, explanatory solution of at least one typical problem is included, with emphasis on applications, formulas, and rules. This volume is primarily addressed to advanced students of engineering and technical specialties as well as to engineers/technicians and instructors of mathematics. Key features: Presents the theoretical background necessary for solving problems, including definitions, rules, formulas, and theorems on the particular theme Provides an extended solution of at least one problem on every theme and guidelines for solving some difficult problems Selects problems for independent study as well as those for classroom time, taking into account the similarity of both sets of problems Differentiates relatively difficult problems from others for those who want to study mathematics more deeply Provides answers to the problems within the text rather than at the back of the book, enabling more direct verification of problem solutions Presents a selection of problems and solutions that are very interesting not only for the students but also for professor-teacher staff
This book presents a unified algebraic approach to stabilization problems of linear boundary control systems with no assumption on finite-dimensional approximations to the original systems, such as the existence of the associated Riesz basis. A new proof of the stabilization result for linear systems of finite dimension is also presented, leading to an explicit design of the feedback scheme. The problem of output stabilization is discussed, and some interesting results are developed when the observability or the controllability conditions are not satisfied.
Geometric algebra is still treated as an obscure branch of algebra and most books have been written by competent mathematicians in a very abstract style. This restricts the readership of such books especially by programmers working in computer graphics, who simply want guidance on algorithm design. Geometric algebra provides a unified algebraic system for solving a wide variety of geometric problems. John Vince reveals the beauty of this algebraic framework and communicates to the reader new and unusual mathematical concepts using colour illustrations, tabulations, and easy-to-follow algebraic proofs. The book includes many worked examples to show how the algebra works in practice and is essential reading for anyone involved in designing 3D geometric algorithms. |
You may like...
Additive Number Theory of Polynomials…
Gove W. Effinger, David R. Hayes
Hardcover
R1,326
Discovery Miles 13 260
Video Workbook with the Math Coach for…
Jamie Blair, John Tobey, …
Paperback
R1,469
Discovery Miles 14 690
|