ISBN: 978-1-84265-428-6
Publication Year: July 2007
Pages: 562
Binding: Hard Back
Dimension: 160mm x 240mm
Weight: 1000
Textbook
About the book
This book presents a systematic and in-depth treatment of some basic topics in approximation theory in an effort to emphasize the rich connections of different branches of analysis with this subject. It contains a good blend of both the classical as well as abstract topics in the domain and their interconnections as appropriate. The approach is from the very concrete to more and more abstract levels. In order to provide a historical perspective on the results, a section on notes is appended to each chapter with an extensive bibliography. Researchers will find several references to recent developments. Problems of varying degree of difficulty accompany each chapter. Some of these problems complement certain results from the text. The others, more challenging, are drawn from the contemporary research articles. Ample hints are provided for such problems. Primarily aimed at graduate students and teachers of mathematics, researchers interested in an introduction to the specific results or techniques of approximation theory will find this book very attractive.
Table of content
Density Theorems / Linear Chebyshev Approximation / Degree of Approximation / Interpolation / Fourier Series / Spline Functions / Orthogonal Polynomials / Best Approximation in Normed Linear Spaces / Bibliography / Symbols and Notation / Index.
ISBN: 978-1-84265-284-8
Publication Year: October 2007
Pages: 228
Binding: Hard Back
Dimension: 160mm x 240mm
Textbook
About the book
Tensors are not only necessary to characterize physical quantities but also to define the intrinsic properties of the medium. Tensors allow a degree of compactness to be introduced into the complex physical relationship so that relationship can be seen more clearly. Tensors can be considered as a most powerful language and mode of presentation for physical science. The aim of this book is to provide the reader a clear understanding of what the tensors are, their Algebra, Calculus and their applications? The book is divided into two parts. Part I covers the basic concepts of algebra and calculus of the tensor. Part II deals with the applications of tensors to various branches like Geometry, Mechanics, Elasticity, Electromagnetic Theory and Polarization.
Key Features
Problems and Exercises at the end of each chapter
Table of content
Preface / Part I: Algebra and Calculus: Transformations / Transformations and Second Rank Tensors / Cartesian Tensor of Rank Three / Isotropic Tensors / Part II: Geometrical Applications / Mechanics / Elasticity / Electromagnetic Theory / Polarization / Appendix A: Vector Notation and Formulae / Appendix B:Matrices and Determinant / Bibliography.
ISBN: 978-1-84265-389-0
Publication Year: December 2007
Pages: 452
Binding: Hard Back
Dimension: 185mm x 240mm
About the book
Important topics of undergraduate analysis is covered with no prerequisite necessary. All concepts are explained through large number of solved examples and with motivation. A good number of thoughts provoking exercises have been included so that student can master the ideas and concept given. Exhaustive Bibliography has been added for further reading on the subject.
Table of content
Preface / Introduction / Sequence and Series of Real Numbers / Functions of One Variable / The Riemann Integral / Riemann-Stieltjes Integral / Improper Integrals / Beta and Gamma Functions / Sequence and Series of Functions / Theory of Power Series / Function of Two Variables / Double and Triple Integrals / Line and Surface Integrals.
ISBN: 978-1-84265-204-6
Publication Year: December 2007
Pages: 172
Binding: Hard Back
Dimension: 160mm x 240mm
Textbook
About the book
Combinatorial Optimization: A First Course is designed for a one semester introductory graduate-level course for students of operations research, mathematics and computer science. In a self contained treatment requiring only some mathematical maturity, the topics covered include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths and network flows. Central to the exposition is the polyhedral viewpoint, a key principle underlying the successful integer-programming approach to combinatorial-optimization problems. These methods from a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.
Table of content
Shortest paths and trees / Polytopes, polyhedra, Farkasf lemma and linear programming / Matchings and covers in bipartite graphs / Mengerfs theorem, flows and circulations / Nonbipartite matching / Problems, algorithms and running time / Cliques, cocliques and colourings / Integer linear programming and totally unimodular matrices / Multicommodity flows and disjoint paths / Matroids / References / Name index / Subject index
ISBN: 978-1-84265-446-0
Publication Year: February 2008
Pages: 400
Binding: Hard Back
Dimension: 185mm x 240mm
Textbook
About the book
Coverage includes separation axioms, compact and paracompact spaces, connectedness, metrizability, uniform, proximity and function spaces, homotopy and bitopologies. Clear and entertaining style with an ample number of solved problems and exercises. The book leads to research level work starting with fundamentals. It serves as a text at M.Sc. and M.Phil. Levels.
Key Features
Style of presentation Many solved problems Class-tested material Full coverage of several topics Recent list in references Chapter on gBitopologiesh has not appeared in any text so far.