Werner Rheinboldt – författare
Visar alla böcker från författaren Werner Rheinboldt. Handla med fri frakt och snabb leverans.
33 produkter
33 produkter
Inbunden, Engelska, 2025
335 kr
Skickas inom 5-8 vardagar
Häftad, Engelska, 2025
188 kr
Skickas inom 5-8 vardagar
E-bok
PDF, Engelska, 2014988 kr
Läs direkt efter köp
Asymptotic Approximations of Integrals deals with the methods used in the asymptotic approximation of integrals. Topics covered range from logarithmic singularities and the summability method to the distributional approach and the Mellin transform technique for multiple integrals. Uniform asymptotic expansions via a rational transformation are also discussed, along with double integrals with a curve of stationary points. For completeness, classical methods are examined as well. Comprised of nine chapters, this volume begins with an introduction to the fundamental concepts of asymptotics, followed by a discussion on classical techniques used in the asymptotic evaluation of integrals, including Laplace''s method, Mellin transform techniques, and the summability method. Subsequent chapters focus on the elementary theory of distributions; the distributional approach; uniform asymptotic expansions; and integrals which depend on auxiliary parameters in addition to the asymptotic variable. The book concludes by considering double integrals and higher-dimensional integrals. This monograph is intended for graduate students and research workers in mathematics, physics, and engineering.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Computer Science and Applied Mathematics: Constrained Optimization and Lagrange Multiplier Methods focuses on the advancements in the applications of the Lagrange multiplier methods for constrained minimization. The publication first offers information on the method of multipliers for equality constrained problems and the method of multipliers for inequality constrained and nondifferentiable optimization problems. Discussions focus on approximation procedures for nondifferentiable and ill-conditioned optimization problems; asymptotically exact minimization in the methods of multipliers; duality framework for the method of multipliers; and the quadratic penalty function method. The text then examines exact penalty methods, including nondifferentiable exact penalty functions; linearization algorithms based on nondifferentiable exact penalty functions; differentiable exact penalty functions; and local and global convergence of Lagrangian methods. The book ponders on the nonquadratic penalty functions of convex programming. Topics include large scale separable integer programming problems and the exponential method of multipliers; classes of penalty functions and corresponding methods of multipliers; and convergence analysis of multiplier methods. The text is a valuable reference for mathematicians and researchers interested in the Lagrange multiplier methods.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Finite Element Solution of Boundary Value Problems: Theory and Computation provides an introduction to both the theoretical and computational aspects of the finite element method for solving boundary value problems for partial differential equations. This book is composed of seven chapters and begins with surveys of the two kinds of preconditioning techniques, one based on the symmetric successive overrelaxation iterative method for solving a system of equations and a form of incomplete factorization. The subsequent chapters deal with the concepts from functional analysis of boundary value problems. These topics are followed by discussions of the Ritz method, which minimizes the quadratic functional associated with a given boundary value problem over some finite-dimensional subspace of the original space of functions. Other chapters are devoted to direct methods, including Gaussian elimination and related methods, for solving a system of linear algebraic equations. The final chapter continues the analysis of preconditioned conjugate gradient methods, concentrating on applications to finite element problems. This chapter also looks into the techniques for reducing rounding errors in the iterative solution of finite element equations. This book will be of value to advanced undergraduates and graduates in the areas of numerical analysis, mathematics, and computer science, as well as for theoretically inclined workers in engineering and the physical sciences.
E-bok
PDF, Engelska, 2014763 kr
Läs direkt efter köp
Numerical Methods for Partial Differential Equations, Second Edition deals with the use of numerical methods to solve partial differential equations. In addition to numerical fluid mechanics, hopscotch and other explicit-implicit methods are also considered, along with Monte Carlo techniques, lines, fast Fourier transform, and fractional steps methods. Comprised of six chapters, this volume begins with an introduction to numerical calculation, paying particular attention to the classification of equations and physical problems, asymptotics, discrete methods, and dimensionless forms. Subsequent chapters focus on parabolic and hyperbolic equations, elliptic equations, and special topics ranging from singularities and shocks to Navier-Stokes equations and Monte Carlo methods. The final chapter discuss the general concepts of weighted residuals, with emphasis on orthogonal collocation and the Bubnov-Galerkin method. The latter procedure is used to introduce finite elements. This book should be a valuable resource for students and practitioners in the fields of computer science and applied mathematics.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Numerical Solution of Differential Equations is a 10-chapter text that provides the numerical solution and practical aspects of differential equations. After a brief overview of the fundamentals of differential equations, this book goes on presenting the principal useful discretization techniques and their theoretical aspects, along with geometrical and physical examples, mainly from continuum mechanics. Considerable chapters are devoted to the development of the techniques of the numerical solution of differential equations and their analysis. The remaining chapters explore the influential invention in computational mechanics-finite elements. Each chapter emphasizes the relationship among the analytic formulation of the physical event, the discretization techniques applied to it, the algebraic properties of the discrete systems created, and the properties of the digital computer. This book will be of great value to undergraduate and graduate mathematics and physics students.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Discrete Computational Structures describes discrete mathematical concepts that are important to computing, covering necessary mathematical fundamentals, computer representation of sets, graph theory, storage minimization, and bandwidth. The book also explains conceptual framework (Gorn trees, searching, subroutines) and directed graphs (flowcharts, critical paths, information network). The text discusses algebra particularly as it applies to concentrates on semigroups, groups, lattices, propositional calculus, including a new tabular method of Boolean function minimization. The text emphasizes combinatorics and probability. Examples show different techniques of the general process of enumerating objects. Combinatorics cover permutations, enumerators for combinations, Stirling numbers, cycle classes of permutations, partitions, and compositions. The book cites as example the interplay between discrete mathematics and computing using a system of distinct representatives (SDR) problem. The problem, originating from group theory, graph theory, and set theory can be worked out by the student with a network model involving computers to generate and analyze different scenarios. The book is intended for sophomore or junior level, corresponding to the course B3, "Introduction to Discrete Structures," in the ACM Curriculum 68, as well as for mathematicians or professors of computer engineering and advanced mathematics.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Mathematical Algorithms for Linear Regression discusses numerous fitting principles related to discrete linear approximations, corresponding numerical methods, and FORTRAN 77 subroutines. The book explains linear Lp regression, method of the lease squares, the Gaussian elimination method, the modified Gram-Schmidt method, the method of least absolute deviations, and the method of least maximum absolute deviation. The investigator can determine which observations can be classified as outliers (those with large errors) and which are not by using the fitting principle. The text describes the elimination of outliers and the selection of variables if too many or all of them are given by values. The clusterwise linear regression accounts if only a few of the relevant variables have been collected or are collectible, assuming that their number is small in relation to the number of observations. The book also examines linear Lp regression with nonnegative parameters, the Kuhn-Tucker conditions, the Householder transformations, and the branch-and-bound method. The text points out the method of least squares is mainly used for models with nonlinear parameters or for orthogonal distances. The book can serve and benefit mathematicians, students, and professor of calculus, statistics, or advanced mathematics.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science provides an introduction to the various aspects of theoretical computer science. Theoretical computer science is the mathematical study of models of computation. This text is composed of five parts encompassing 17 chapters, and begins with an introduction to the use of proofs in mathematics and the development of computability theory in the context of an extremely simple abstract programming language. The succeeding parts demonstrate the performance of abstract programming language using a macro expansion technique, along with presentations of the regular and context-free languages. Other parts deal with the aspects of logic that are important for computer science and the important theory of computational complexity, as well as the theory of NP-completeness. The closing part introduces the advanced recursion and polynomial-time computability theories, including the priority constructions for recursively enumerable Turing degrees. This book is intended primarily for undergraduate and graduate mathematics students.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Numerical Methods of Mathematical Optimization: With ALGOL and FORTRAN Programs reviews the theory and the practical application of the numerical methods of mathematical optimization. An ALGOL and a FORTRAN program was developed for each one of the algorithms described in the theoretical section. This should result in easy access to the application of the different optimization methods. Comprised of four chapters, this volume begins with a discussion on the theory of linear and nonlinear optimization, with the main stress on an easily understood, mathematically precise presentation. In addition to the theoretical considerations, several algorithms of importance to the numerical application of optimization theory are described. The next chapter explains the computer programs used in actual optimization, which have the form of procedures or subroutines. The book concludes with an analysis of ALGOL and FORTRAN, paying particular attention to their use in global optimization procedures as well as for the simplex and duoplex methods and the decomposition, Gomory, Beale, and Wolfe algorithms. This monograph will be helpful to students and practitioners of computer science and applied mathematics.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Computer Science and Applied Mathematics: Data Structures: Theory and Practice focuses on the processes, methodologies, principles, and approaches involved in data structures, including algorithms, decision trees, Boolean functions, lattices, and matrices. The book first offers information on set theory, functions, and relations, and graph theory. Discussions focus on linear formulas of digraphs, isomorphism of digraphs, basic definitions in the theory of digraphs, Boolean functions and forms, lattices, indexed sets, algebra of sets, and order pair and related concepts. The text then examines strings, trees, and paths and cycles in digraphs. Topics include algebra of strings, Markov algorithms, algebraic structures, languages and grammars, decision trees and decision tables, trees as grammatic markers, shortest path problems, and representation of prefix formulas. The publication ponders on digraphs of programs, arrays, pushdown stores, lists, and list structures, and organization of files. Concerns include scatter storage techniques, files and secondary storage, representation of digraphs as list structures, storage of arrays, and sparse matrices. The text is a valuable reference for computer science experts, mathematicians, and researchers interested in data structures.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Computer Arithmetic in Theory and Practice deals with computer arithmetic and the various implementations of the entire arithmetic package on diverse processors, including microprocessors. It illustrates the importance of theoretical development in the sound implementation of arithmetic on computers, and argues that such an implementation requires the establishment of various isomorphisms between different definitions of arithmetic operations. Comprised of seven chapters, this volume begins with an introduction to the theory of computer arithmetic by giving an axiomatic characterization of the essential properties of sets and subsets; complete lattices and complete subnets; screens and roundings; and arithmetic operations. The discussion then turns to the concepts of a ringoid and a vectoid as well as those of ordered or weakly ordered ringoids and vectoids; interval arithmetic; and floating-point arithmetic. The operations in interval spaces are defined by means of semimorphisms. The final chapter shows how to embed the five basic data types (integer, real, complex, real interval, and complex interval) together with the arithmetic operations that are defined for all of these types into existing higher programming languages. This book will be helpful to students and practitioners in the fields of computer science and applied mathematics.
E-bok
PDF, Engelska, 2014763 kr
Läs direkt efter köp
Social Issues in Computing provides information pertinent to the social implications of technology. This book presents the highly dynamic interaction between computers and society. Organized into 13 chapters, this book begins with an overview of the problems associated with computers and attempts to indicate some of the viewpoints, assumptions, and biases from which the discussion is undertaken. This text then examines in detail the effects of computers on society ad describes the extent of computer use. Other chapters consider the disparities in computer use between various countries, as well as the degree to which various countries are able to share in the market for computer products and services. This book discusses as well the factors that led to the rapid and widespread adoption of computers. The final chapter deals with the effects of automation, computers, and technology. This book is a valuable resource for computer science students and research workers.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Numerical Computation Using C is a four-chapter text guide for learning C language from the numerical analysis viewpoint. C is a general-purpose language that has been used in systems programming. The first chapter discusses the basic principles, logic, operators, functions, arrays, and structures of C language. The next two chapters deal with the uses of the so-called pointers in the C language, which is a variable that contains the address of some object in memory. These chapters also elaborate on several constructs to show how the use of C language can be fine-tuned. The last chapter highlights the practical aspects of C language. This book will be of value to computer scientists and mathematicians.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Probability, Statistics, and Queueing Theory: With Computer Science Applications focuses on the use of statistics and queueing theory for the design and analysis of data communication systems, emphasizing how the theorems and theory can be used to solve practical computer science problems. This book is divided into three parts. The first part discusses the basic concept of probability, probability distributions commonly used in applied probability, and important concept of a stochastic process. Part II covers the discipline of queueing theory, while Part III deals with statistical inference. This publication is designed as a junior-senior level textbook on applied probability and statistics with computer science applications, but is also a self-study book for practicing computer science (data processing) professionals.
E-bok
PDF, Engelska, 2014763 kr
Läs direkt efter köp
Computer Science and Applied Mathematics: Algorithm-Structured Computer Arrays and Networks: Architectures and Processes for Images, Percepts, Models, Information examines the parallel-array, pipeline, and other network multi-computers. This book describes and explores arrays and networks, those built, being designed, or proposed. The problems of developing higher-level languages for systems and designing algorithm, program, data flow, and computer structure are also discussed. This text likewise describes several sequences of successively more general attempts to combine the power of arrays with the flexibility of networks into structures that reflect and embody the flow of information through their processors. This publication is useful as a textbook or auxiliary textbook for students taking courses on computer architecture, parallel computers, arrays and networks, and image processing and pattern recognition.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Computer Science and Applied Mathematics: Introduction to Numerical Computations, Second Edition introduces numerical algorithms as they are used in practice. This edition covers the usual topics contained in introductory numerical analysis textbooks that include all of the well-known and most frequently used algorithms for interpolation and approximation, numerical differentiation and integration, solution of linear systems and nonlinear equations, and solving ordinary differential equations. A complete discussion of computer arithmetic, problems that arise in the computer evaluation of functions, and cubic spline interpolation are also provided. This text likewise discusses the Newton formulas for interpolation and adaptive methods for integration. The level of this book is suitable for advanced undergraduate students and readers with elementary mathematical background.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the respective primary memories of the computers (random access memory), or in a single shared memory. SIMD processors communicate through an interconnection network or the processors communicate through a common and shared memory. The text also investigates the case of external sorting in which the sequence to be sorted is bigger than the available primary memory. In this case, the algorithms used in external sorting is very similar to those used to describe internal sorting, that is, when the sequence can fit in the primary memory, The book explains that an algorithm can reach its optimum possible operating time for sorting when it is running on a particular set of architecture, depending on a constant multiplicative factor. The text is suitable for computer engineers and scientists interested in parallel algorithms.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Computer Science and Applied Mathematics: Numerical Analysis: A Second Course presents some of the basic theoretical results pertaining to the three major problem areas of numerical analysis—rounding error, discretization error, and convergence error. This book is organized into four main topics: mathematical stability and ill conditioning, discretization error, convergence of iterative methods, and rounding error. In these topics, this text specifically discusses the systems of linear algebraic equations, eigenvalues and eigenvectors, and differential and difference equations. The discretization error for initial and boundary value problems, systems of linear and nonlinear equations, and rounding error for Gaussian elimination are also elaborated. This publication is recommended for undergraduate level students and students taking a one-semester first-year graduate course for computer science and mathematics majors.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Computer Science and Applied Mathematics: Picture Languages: Formal Models for Picture Recognition treats pictorial pattern recognition from the formal standpoint of automata theory. This book emphasizes the capabilities and relative efficiencies of two types of automata—array automata and cellular array automata, with respect to various array recognition tasks. The array automata are simple processors that perform sequences of operations on arrays, while the cellular array automata are arrays of processors that operate on pictures in a highly parallel fashion, one processor per picture element. This compilation also reviews a collection of results on two-dimensional sequential and parallel array acceptors. Some of the analogous one-dimensional results and array grammars and their relation to acceptors are likewise covered in this text. This publication is suitable for researchers, professionals, and specialists interested in pattern recognition and automata theory.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Introduction to Probabilistic Automata deals with stochastic sequential machines, Markov chains, events, languages, acceptors, and applications. The book describes mathematical models of stochastic sequential machines (SSMs), stochastic input-output relations, and their representation by SSMs. The text also investigates decision problems and minimization-of-states problems arising from concepts of equivalence and coverings for SSMs. The book presents the theory of nonhomogeneous Markov chains and systems in mathematical terms, particularly in relation to asymptotic behavior, composition (direct sum or product), and decomposition. "Word functions," induced by Markov chains and valued Markov systems, involve characterization, equivalence, and representability by an underlying Markov chain or system. The text also discusses the closure properties of probabilistic languages, events and their relation to regular events, particularly with reference to definite, quasidefinite, and exclusive events. Probabilistic automata theory has applications in information theory, control, learning theory, pattern recognition, and time sharing in computer programming. Programmers, computer engineers, computer instructors, and students of computer science will find the collection highly valuable.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Operating Systems deals with the fundamental concepts and principles that govern the behavior of operating systems. Many issues regarding the structure of operating systems, including the problems of managing processes, processors, and memory, are examined. Various aspects of operating systems are also discussed, from input-output and files to security, protection, reliability, design methods, performance evaluation, and implementation methods. Comprised of 10 chapters, this volume begins with an overview of what constitutes an operating system, followed by a discussion on the definition and properties of the basic unit of computation within an operating system, the process. The reader is then introduced to processor allocation schemes as well as various classes of scheduling disciplines and their implementations; memory management functions; and virtual memory. Subsequent chapters focus on input-output and files; protection in an operating system; and design and implementation of an operating system. The book concludes by describing two operating systems to help the reader visualize how the major components of a system interact in a complete system: the Venus Operating System developed by MITRE Corp. and the SUE nucleus, designed at the University of Toronto. This monograph is intended for fourth-year undergraduates and first-year graduate students, as well as lecturers who plans to institute a course on operating systems.
E-bok
PDF, Engelska, 2014779 kr
Läs direkt efter köp
Perspectives in Computing, Vol. 17: Pascal-SC: A Computer Language for Scientific Computation focuses on the application of Pascal-SC, a programming language developed as an extension of standard Pascal, in scientific computation. The publication first elaborates on the introduction to Pascal-SC, a review of standard Pascal, and real floating-point arithmetic. Discussions focus on optimal scalar product, standard functions, real expressions, program structure, simple extensions, real floating-point arithmetic, vector and matrix arithmetic, and dynamic arrays. The text then examines functions and operators with arbitrary result types and solving problems with Pascal-SC. The book ponders on strings and text processing, dynamic arrays, and modules. Topics include declaration and use of modules, compatibility of static and dynamic arrays, dynamic result types of functions and operators, strings in procedures, functions, and operators, and declaration of string variables. The publication is a dependable reference for computer science experts and researchers interested in the application of Pascal-SC in scientific computation.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Numerical Method for Initial Value Problems in Ordinary Differential Equations deals with numerical treatment of special differential equations: stiff, stiff oscillatory, singular, and discontinuous initial value problems, characterized by large Lipschitz constants. The book reviews the difference operators, the theory of interpolation, first integral mean value theorem, and numerical integration algorithms. The text explains the theory of one-step methods, the Euler scheme, the inverse Euler scheme, and also Richardson''s extrapolation. The book discusses the general theory of Runge-Kutta processes, including the error estimation, and stepsize selection of the R-K process. The text evaluates the different linear multistep methods such as the explicit linear multistep methods (Adams-Bashforth, 1883), the implicit linear multistep methods (Adams-Moulton scheme, 1926), and the general theory of linear multistep methods. The book also reviews the existing stiff codes based on the implicit/semi-implicit, singly/diagonally implicit Runge-Kutta schemes, the backward differentiation formulas, the second derivative formulas, as well as the related extrapolation processes. The text is intended for undergraduates in mathematics, computer science, or engineering courses, andfor postgraduate students or researchers in related disciplines.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Elementary Linear Programming with Applications presents a survey of the basic ideas in linear programming and related areas. It also provides students with some of the tools used in solving difficult problems which will prove useful in their professional career. The text is comprised of six chapters. The Prologue gives a brief survey of operations research and discusses the different steps in solving an operations research problem. Chapter 0 gives a quick review of the necessary linear algebra. Chapter 1 deals with the basic necessary geometric ideas in Rn. Chapter 2 introduces linear programming with examples of the problems to be considered, and presents the simplex method as an algorithm for solving linear programming problems. Chapter 3 covers further topics in linear programming, including duality theory and sensitivity analysis. Chapter 4 presents an introduction to integer programming. Chapter 5 covers a few of the more important topics in network flows. Students of business, engineering, computer science, and mathematics will find the book very useful.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Algorithmic Graph Theory and Perfect Graphs provides an introduction to graph theory through practical problems. This book presents the mathematical and algorithmic properties of special classes of perfect graphs. Organized into 12 chapters, this book begins with an overview of the graph theoretic notions and the algorithmic design. This text then examines the complexity analysis of computer algorithm and explains the differences between computability and computational complexity. Other chapters consider the parameters and properties of a perfect graph and explore the class of perfect graphs known as comparability graph or transitively orientable graphs. This book discusses as well the two characterizations of triangulated graphs, one algorithmic and the other graph theoretic. The final chapter deals with the method of performing Gaussian elimination on a sparse matrix wherein an arbitrary choice of pivots may result in the filling of some zero positions with nonzeros. This book is a valuable resource for mathematicians and computer scientists.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Combinatorial Algorithms for Computers and Calculators, Second Edition deals with combinatorial algorithms for computers and calculators. Topics covered range from combinatorial families such as the random subset and k-subset of an n-set and Young tableaux, to combinatorial structures including the cycle structure of a permutation and the spanning forest of a graph. Newton forms of a polynomial and the composition of power series are also discussed. Comprised of 30 chapters, this volume begins with an introduction to combinatorial algorithms by considering the generation of all of the 2n subsets of the set {1, 2,...,n}. The discussion then turns to the random subset and k-subset of an n-set; next composition of n into k parts; and random composition of n into k parts. Subsequent chapters focus on sequencing, ranking, and selection algorithms in general combinatorial families; renumbering rows and columns of an array; the cycle structure of a permutation; and the permanent function. Sorting and network flows are also examined, along with the backtrack method and triangular numbering in partially ordered sets. This book will be of value to both students and specialists in the fields of applied mathematics and computer science.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Self-Validating Numerics for Function Space Problems describes the development of computational methods for solving function space problems, including differential, integral, and function equations. This seven-chapter text highlights three approaches, namely, the E-methods, ultra-arithmetic, and computer arithmetic. After a brief overview of the different self-validating approaches, this book goes on introducing the mathematical preliminaries consisting principally of fixed-point theorems and the computational context for the development of validating methods in function spaces. The subsequent chapters deals with the development and application of point of view of ultra-arithmetic and the constructs of function-space arithmetic spaces, such as spaces, bases, rounding, and approximate operations. These topics are followed by discussion of the iterative residual correction methods for function problems and the requirements of a programming language needed to make the tools and constructs of the methodology available in actual practice on a computer. The last chapter describes the techniques for adapting the methodologies to a computer, including the self-validating results for specific problems. This book will prove useful to mathematicians and advance mathematics students.
E-bok
PDF, Engelska, 2014979 kr
Läs direkt efter köp
Iterative Solution of Large Linear Systems describes the systematic development of a substantial portion of the theory of iterative methods for solving large linear systems, with emphasis on practical techniques. The focal point of the book is an analysis of the convergence properties of the successive overrelaxation (SOR) method as applied to a linear system where the matrix is "consistently ordered". Comprised of 18 chapters, this volume begins by showing how the solution of a certain partial differential equation by finite difference methods leads to a large linear system with a sparse matrix. The next chapter reviews matrix theory and the properties of matrices, as well as several theorems of matrix theory without proof. A number of iterative methods, including the SOR method, are then considered. Convergence theorems are also given for various iterative methods under certain assumptions on the matrix A of the system. Subsequent chapters deal with the eigenvalues of the SOR method for consistently ordered matrices; the optimum relaxation factor; nonstationary linear iterative methods; and semi-iterative methods. This book will be of interest to students and practitioners in the fields of computer science and applied mathematics.