No catches, no fine print just unadulterated book loving, with your favourite books saved to your own digital bookshelf.
New members get entered into our monthly draw to win £100 to spend in your local bookshop Plus lots lots more…Find out more
See below for a selection of the latest books from Number systems category. Presented with a red border are the Number systems books that have been lovingly read and reviewed by the experts at Lovereading. With expert reading recommendations made by people with a passion for books and some unique features Lovereading will help you find great Number systems books and those from many more genres to read that will keep you inspired and entertained. And it's all free!
Regression Analysis and Its Application: A Data-Oriented Approach answers the need for researchers and students who would like a better understanding of classical regression analysis. Useful either as a textbook or as a reference source, this book bridges the gap between the purely theoretical coverage of regression analysis and its practical application. The book presents regression analysis in the general context of data analysis. Using a teach-by-example format, it contains ten major data sets along with several smaller ones to illustrate the common characteristics of regression data and properties of statistics that are employed in regression analysis. The book covers model misspecification, residual analysis, multicollinearity, and biased regression estimators. It also focuses on data collection, model assumptions, and the interpretation of parameter estimates. Complete with an extensive bibliography, Regression Analysis and Its Application is suitable for statisticians, graduate and upper-level undergraduate students, and research scientists in biometry, business, ecology, economics, education, engineering, mathematics, physical sciences, psychology, and sociology. In addition, data collection agencies in the government and private sector will benefit from the book.
A revised and expanded advanced-undergraduate/graduate text (first ed., 1978) about optimization algorithms for problems that can be formulated on graphs and networks. This edition provides many new applications and algorithms while maintaining the classic foundations on which contemporary algorithm
The material of this book stems from the idea of integrating a classic concept of Fibonacci numbers with commonly available digital tools including a computer spreadsheet, Maple, Wolfram Alpha, and the graphing calculator. This integration made it possible to introduce a number of new concepts such as: Generalized golden ratios in the form of cycles represented by the strings of real numbers; Fibonacci-like polynomials the roots that define those cycles dependence on a parameter; the directions of the cycles described in combinatorial terms of permutations with rises, as the parameter changes on the number line; Fibonacci sieves of order k; (r, k)-sections of Fibonacci numbers; and polynomial generalizations of Cassinis, Catalans, and other identities for Fibonacci numbers.The development of these concepts was motivated by considering the difference equation f_(n+1)=af_n+bf_(n-1),f_0=f_1=1, and, by taking advantage of capabilities of the modern-day digital tools, exploring the behavior of the ratios f_(n+1)/f_n as n increases. The initial use of a spreadsheet can demonstrate that, depending on the values of a and b, the ratios can either be attracted by a number (known as the Golden Ratio in the case a = b = 1) or by the strings of numbers (cycles) of different lengths. In general, difference equations, both linear and non-linear ones serve as mathematical models in radio engineering, communication, and computer architecture research. In mathematics education, commonly available digital tools enable the introduction of mathematical complexity of the behavior of these models to different groups of students through the modern-day combination of argument and computation.The book promotes experimental mathematics techniques which, in the digital age, integrate intuition, insight, the development of mathematical models, conjecturing, and various ways of justification of conjectures. The notion of technology-immune/technology-enabled problem solving is introduced as an educational analogue of the notion of experimental mathematics. In the spirit of John Dewey, the book provides many collateral learning opportunities enabled by experimental mathematics techniques. Likewise, in the spirit of George Polya, the book champions carrying out computer experimentation with mathematical concepts before offering their formal demonstration.The book can be used in secondary mathematics teacher education programs, in undergraduate mathematics courses for students majoring in mathematics, computer science, electrical and mechanical engineering, as well as in other mathematical programs that study difference equations in the broad context of discrete mathematics.
Concise but thorough and systematic, this categorical discussion of the real number system presents a series of step-by-step axioms, each illustrated by examples. The highly accessible text is suitable for readers at varying levels of knowledge and experience: advanced high school students and college undergraduates as well as prospective high school and college instructors. The abundance of examples and the wealth of exercises—more than 300, all with answers provided—make this a particularly valuable book for self-study. The first two chapters examine fields and ordered fields, followed by an introduction to natural numbers and mathematical induction. Subsequent chapters explore composite and prime numbers, integers and rational numbers, congruences and finite fields, and polynomials and rational functions. Additional topics include intervals and absolute value, the axiom of completeness, roots and rational exponents, exponents and logarithms, and decimal expansions. A helpful Appendix concludes the text.
In the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods with emphasis on the algebraic structure of linear iteration, which is usually ignored in other literature. The necessary amount of work increases dramatically with the size of systems, so one has to search for algorithms that most efficiently and accurately solve systems of, e.g., several million equations. The choice of algorithms depends on the special properties the matrices in practice have. An important class of large systems arises from the discretization of partial differential equations. In this case, the matrices are sparse (i.e., they contain mostly zeroes) and well-suited to iterative algorithms. The first edition of this book grew out of a series of lectures given by the author at the Christian-Albrecht University of Kiel to students of mathematics. The second edition includes quite novel approaches.
Finite element methods for approximating partial differential equations have reached a high degree of maturity, and are an indispensible tool in science and technology. This textbook aims at providing a thorough introduction to the construction, analysis, and implementation of finite element methods for model problems arising in continuum mechanics. The first part of the book discusses elementary properties of linear partial differential equations along with their basic numerical approximation, the functional-analytical framework for rigorously establishing existence of solutions, and the construction and analysis of basic finite element methods. The second part is devoted to the optimal adaptive approximation of singularities and the fast iterative solution of linear systems of equations arising from finite element discretizations. In the third part, the mathematical framework for analyzing and discretizing saddle-point problems is formulated, corresponding finte element methods are analyzed, and particular applications including incompressible elasticity, thin elastic objects, electromagnetism, and fluid mechanics are addressed. The book includes theoretical problems and practical projects for all chapters, and an introduction to the implementation of finite element methods.
Written by a team of leading experts in the field, this volume presents a self-contained account of the theory, techniques and results in metric type spaces (in particular in G-metric spaces); that is, the text approaches this important area of fixed point analysis beginning from the basic ideas of metric space topology. The text is structured so that it leads the reader from preliminaries and historical notes on metric spaces (in particular G-metric spaces) and on mappings, to Banach type contraction theorems in metric type spaces, fixed point theory in partially ordered G-metric spaces, fixed point theory for expansive mappings in metric type spaces, generalizations, present results and techniques in a very general abstract setting and framework. Fixed point theory is one of the major research areas in nonlinear analysis. This is partly due to the fact that in many real world problems fixed point theory is the basic mathematical tool used to establish the existence of solutions to problems which arise naturally in applications. As a result, fixed point theory is an important area of study in pure and applied mathematics and it is a flourishing area of research.
The signals from digital electrical engineering are modeled by discrete time and real time functions, whose values are binary n-tuples and which are also called signals. The asynchronous circuits, representing the devices that work with such signals, are modeled by Boolean autonomous deterministic regular asynchronous systems, shortly by asynchronous flows. The attribute Boolean' vaguely refers to the binary Boole algebra; autonomous' means that there is no input; deterministic' means the existence of a unique state function; and regular' indicates the existence of a Boolean function that iterates its coordinates independently on each other (ie: asynchronously). Strong analogies exist with the real, usual dynamical systems. The purpose of this research monograph is to study the periodicity of the signals and of their values, as well as the periodicity of the asynchronous flows. The monograph addresses systems theory and computer science that apply to researchers, but it is also interesting to those that study periodicity itself. From this last perspective, the signals may be thought of as functions with many finite values. At the same time, the asynchronous flows may be considered as special cases of variable structure systems. The bibliography consists of works of real, dynamical systems that produce analogies.