Numerical analysis Books
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Scientific Computing in Electrical Engineering SCEE 2008
a huge range and FREE tracked UK delivery on ALL orders.
£161.99
World Scientific Publishing Co Pte Ltd Finite Element Method, The: Its Fundamentals And
Book SynopsisThis Finite Element Method offers a fundamental and practical introduction to the finite element method, its variants, and their applications in engineering. Every concept is introduced in the simplest possible setting, while maintaining a level of treatment that is as rigorous as possible without being unnecessarily abstract. Various finite elements in one, two, and three space dimensions are introduced, and their applications to elliptic, parabolic, hyperbolic, and nonlinear equations and to solid mechanics, fluid mechanics, and porous media flow problems are addressed. The variants include the control volume, multipoint flux approximation, nonconforming, mixed, discontinuous, characteristic, adaptive, and multiscale finite element methods. Illustrative computer programs in Fortran and C++ are described. An extensive set of exercises are provided in each chapter. This book serves as a text a for one-semester course for upper-level undergraduates and beginning graduate students and as a professional reference for engineers, mathematicians, and scientists.Table of ContentsOne-Dimensional Model Problems; Two-Dimensional Model Problems; General Variational Formulation; One-Dimensional Elements and Their Properties; Two-Dimensional Elements and Their Properties; Three-Dimensional Elements and Their Properties; Finite Elements for Transient and Nonlinear Problems; Application to Solid Mechanics; Application to Fluid Mechanics; Application to Porous Media Flow; Other Finite Element Methods.
£67.50
John Wiley & Sons Inc Algorithmic Problem Solving
Book Synopsis* Novel approach to the mathematics of problem solving, in particular how to do logical calculations. * Many of the problems are well-known from (mathematical) puzzle books. * The solution method in the book is new and more relevant to the true nature of problem solving in the modern IT-dominated world.Table of ContentsPreface xi PART I Algorithmic Problem Solving 1 CHAPTER 1 – Introduction 3 1.1 Algorithms 3 1.2 Algorithmic Problem Solving 4 1.3 Overview 5 1.4 Bibliographic Remarks 6 CHAPTER 2 – Invariants 7 2.1 Chocolate Bars 10 2.1.1 The Solution 10 2.1.2 The Mathematical Solution 11 2.2 Empty Boxes 16 2.2.1 Review 19 2.3 The Tumbler Problem 22 2.3.1 Non-deterministic Choice 23 2.4 Tetrominoes 24 2.5 Summary 30 2.6 Bibliographic Remarks 34 CHAPTER 3 – Crossing a River 35 3.1 Problems 36 3.2 Brute Force 37 3.2.1 Goat, Cabbage and Wolf 37 3.2.2 State-Space Explosion 39 3.2.3 Abstraction 41 3.3 Nervous Couples 42 3.3.1 What Is the Problem? 42 3.3.2 Problem Structure 43 3.3.3 Denoting States and Transitions 44 3.3.4 Problem Decomposition 45 3.3.5 A Review 48 3.4 Rule of Sequential Composition 50 3.5 The Bridge Problem 54 3.6 Conditional Statements 63 3.7 Summary 65 3.8 Bibliographic Remarks 65 CHAPTER 4 – Games 67 4.1 Matchstick Games 67 4.2 Winning Strategies 69 4.2.1 Assumptions 69 4.2.2 Labelling Positions 70 4.2.3 Formulating Requirements 72 4.3 Subtraction-Set Games 74 4.4 Sums of Games 78 4.4.1 A Simple Sum Game 79 4.4.2 Maintain Symmetry! 81 4.4.3 More Simple Sums 82 4.4.4 Evaluating Positions 83 4.4.5 Using the Mex Function 87 4.5 Summary 91 4.6 Bibliographic Remarks 92 CHAPTER 5 – Knights and Knaves 95 5.1 Logic Puzzles 95 5.2 Calculational Logic 96 5.2.1 Propositions 96 5.2.2 Knights and Knaves 97 5.2.3 Boolean Equality 98 5.2.4 Hidden Treasures 100 5.2.5 Equals for Equals 101 5.3 Equivalence and Continued Equalities 102 5.3.1 Examples of the Associativity of Equivalence 104 5.3.2 On Natural Language 105 5.4 Negation 106 5.4.1 Contraposition 109 5.4.2 Handshake Problems 112 5.4.3 Inequivalence 113 5.5 Summary 117 5.6 Bibliographic Remarks 117 CHAPTER 6 – Induction 119 6.1 Example Problems 120 6.2 Cutting the Plane 123 6.3 Triominoes 126 6.4 Looking for Patterns 128 6.5 The Need for Proof 129 6.6 From Verification to Construction 130 6.7 Summary 134 6.8 Bibliographic Remarks 134 CHAPTER 7 – Fake-Coin Detection 137 7.1 Problem Formulation 137 7.2 Problem Solution 139 7.2.1 The Basis 139 7.2.2 Induction Step 139 7.2.3 The Marked-Coin Problem 140 7.2.4 The Complete Solution 141 7.3 Summary 146 7.4 Bibliographic Remarks 146 CHAPTER 8 – The Tower of Hanoi 147 8.1 Specification and Solution 147 8.1.1 The End of the World! 147 8.1.2 Iterative Solution 148 8.1.3 Why? 149 8.2 Inductive Solution 149 8.3 The Iterative Solution 153 8.4 Summary 156 8.5 Bibliographic Remarks 156 CHAPTER 9 – Principles of Algorithm Design 157 9.1 Iteration, Invariants and Making Progress 158 9.2 A Simple Sorting Problem 160 9.3 Binary Search 163 9.4 Sam Loyd’s Chicken-Chasing Problem 166 9.4.1 Cornering the Prey 170 9.4.2 Catching the Prey 174 9.4.3 Optimality 176 9.5 Projects 177 9.6 Summary 178 9.7 Bibliographic Remarks 180 CHAPTER 10 – The Bridge Problem 183 10.1 Lower and Upper Bounds 183 10.2 Outline Strategy 185 10.3 Regular Sequences 187 10.4 Sequencing Forward Trips 189 10.5 Choosing Settlers and Nomads 193 10.6 The Algorithm 196 10.7 Summary 199 10.8 Bibliographic Remarks 200 CHAPTER 11 – Knight’s Circuit 201 11.1 Straight-Move Circuits 202 11.2 Supersquares 206 11.3 Partitioning the Board 209 11.4 Summary 216 11.5 Bibliographic Remarks 218 PART II Mathematical Techniques 219 CHAPTER 12 – The Language of Mathematics 221 12.1 Variables, Expressions and Laws 222 12.2 Sets 224 12.2.1 The Membership Relation 224 12.2.2 The Empty Set 224 12.2.3 Types/Universes 224 12.2.4 Union and Intersection 225 12.2.5 Set Comprehension 225 12.2.6 Bags 227 12.3 Functions 227 12.3.1 Function Application 228 12.3.2 Binary Operators 230 12.3.3 Operator Precedence 230 12.4 Types and Type Checking 232 12.4.1 Cartesian Product and Disjoint Sum 233 12.4.2 Function Types 235 12.5 Algebraic Properties 236 12.5.1 Symmetry 237 12.5.2 Zero and Unit 238 12.5.3 Idempotence 239 12.5.4 Associativity 240 12.5.5 Distributivity/Factorisation 241 12.5.6 Algebras 243 12.6 Boolean Operators 244 12.7 Binary Relations 246 12.7.1 Reflexivity 247 12.7.2 Symmetry 248 12.7.3 Converse 249 12.7.4 Transitivity 249 12.7.5 Anti-symmetry 251 12.7.6 Orderings 252 12.7.7 Equality 255 12.7.8 Equivalence Relations 256 12.8 Calculations 257 12.8.1 Steps in a Calculation 259 12.8.2 Relations between Steps 260 12.8.3 ‘‘If’’ and ‘‘Only If’’ 262 12.9 Exercises 264 CHAPTER 13 – Boolean Algebra 267 13.1 Boolean Equality 267 13.2 Negation 269 13.3 Disjunction 270 13.4 Conjunction 271 13.5 Implication 274 13.5.1 Definitions and Basic Properties 275 13.5.2 Replacement Rules 276 13.6 Set Calculus 279 13.7 Exercises 281 CHAPTER 14 – Quantifiers 285 14.1 DotDotDot and Sigmas 285 14.2 Introducing Quantifier Notation 286 14.2.1 Summation 287 14.2.2 Free and Bound Variables 289 14.2.3 Properties of Summation 291 14.2.4 Warning 297 14.3 Universal and Existential Quantification 297 14.3.1 Universal Quantification 298 14.3.2 Existential Quantification 300 14.4 Quantifier Rules 301 14.4.1 The Notation 302 14.4.2 Free and Bound Variables 303 14.4.3 Dummies 303 14.4.4 Range Part 303 14.4.5 Trading 304 14.4.6 Term Part 304 14.4.7 Distributivity Properties 304 14.5 Exercises 306 CHAPTER 15 – Elements of Number Theory 309 15.1 Inequalities 309 15.2 Minimum and Maximum 312 15.3 The Divides Relation 315 15.4 Modular Arithmetic 316 15.4.1 Integer Division 316 15.4.2 Remainders and Modulo Arithmetic 320 15.5 Exercises 322 CHAPTER 16 – Relations, Graphs and Path Algebras 325 16.1 Paths in a Directed Graph 325 16.2 Graphs and Relations 328 16.2.1 Relation Composition 330 16.2.2 Union of Relations 332 16.2.3 Transitive Closure 334 16.2.4 Reflexive Transitive Closure 338 16.3 Functional and Total Relations 339 16.4 Path-Finding Problems 341 16.4.1 Counting Paths 341 16.4.2 Frequencies 343 16.4.3 Shortest Distances 344 16.4.4 All Paths 345 16.4.5 Semirings and Operations on Graphs 347 16.5 Matrices 351 16.6 Closure Operators 353 16.7 Acyclic Graphs 354 16.7.1 Topological Ordering 355 16.8 Combinatorics 357 16.8.1 Basic Laws 358 16.8.2 Counting Choices 359 16.8.3 Counting Paths 361 16.9 Exercises 366 Solutions to Exercises 369 References 405 Index 407
£41.75
John Wiley & Sons Inc The Elements of Integration and Lebesgue Measure
Book SynopsisDesigned to present the chief results of the Lebesgue theory of integration, this textbook provides students with detailed coverage of the main ideas of the Lebesgue measure. The approach is particularly well suited for students of analysis, probability and statistics.Table of ContentsTHE ELEMENTS OF INTEGRATION. Measurable Functions. Measures. The Integral. Integrable Functions. The Lebesgue Spaces Lp. Modes of Convergence. Decomposition of Measures. Generation of Measures. Product Measures. THE ELEMENTS OF LEBESGUE MEASURE. Volumes of Cells and Intervals. The Outer Measure. Measurable Sets. Examples of Measurable Sets. Approximation of Measurable Sets. Additivity and Nonadditivity. Nonmeasurable and Non-Borel Sets. References. Index.
£126.85
John Wiley & Sons Inc Theoretical Fluid Dynamics
Book SynopsisThis introduction to a wide range of theoretical studies in fluid dynamics, covers a great deal of material and offers updated information on topics such as stability and turbulence. It surveys nearly the entire field of classical fluid dynamics and discusses the various conceptual and analytical models of fluid flow.Trade Review"I know of no other modern book in theoretical fluid dynamics that covers so much material so well." (Physics Today, November 1998)Table of ContentsReview of Basic Concepts and Equations of Fluid Dynamics. Dynamics of Inviscid Incompressible Fluid Flows. Dynamics of Inviscid Compressible Fluid Flows. Dynamics of Viscous Fluid Flows. Hydrodynamic Stability. Dynamics of Turbulence. Bibliography. Index.
£177.26
Wiley Numerical Methods for Engineering Applications
Book SynopsisState-of-the-art numerical methods for solving complex engineering problems Great strides in computer technology have been made in the years since the popular first edition of this book was published. Several excellent software packages now help engineers solve complex problems.Table of ContentsShort Review of Linear Algebra. Interpolation. Integration. Ordinary Differential Equations: I. Initial Value Problems. Ordinary Differential Equations: II. Boundary Value Problems. Partial Differential Equations: I. Parabolic Equations. Partial Differential Equations: II. Elliptic Equations. Partial Differential Equations: III. Hyperbolic Equations. Appendices. Index.
£140.35
Wiley-Blackwell Theory of Differentiation
Book SynopsisThis text presents the theory of differentiation in a unified form. Several problems of differentiation theory are resolved, new ones presented, and past and present developments in the field covered. It includes all aspects of various kinds of derivates and derivatives.Table of ContentsPartial table of contents: A UNIFIED THEORY OF UNILATERIAL DERIVATES. Definitions, Notations, and Preliminary Results. Some Fundamental Theorems on Unilateral Derivates. A THEORY OF SOME NEW DERIVATIVES. Existence of New Derivatives. Calculus of New Derivatives. THEORY OF NEW DERIVATIVES (CONTINUED). Monotonicity and Other Properties in Terms of New Derivatives. Properties of New Derivatives and New Derivability Sets. Denjoy and Perron Integrals Corresponding to New Derivatives. SOME DIRECT APPLICATIONS OF THE THEORY OF NEW DERIVATIVES. Derivates and Derivability of Symmetric, Quasismooth and Smooth Functions. Strong Derivates and Strong Derivative. UNIFIED AXIOMATIC THEORIES OF GENERALIZED DERIVATIVES. A Unified Theory of Generalized Derivatives. A Unified Theory of Generalized New Derivatives. References. Indexes.
£188.06
John Wiley & Sons Inc The Finite Element Method in Electromagnetics
Book SynopsisUseful in analyzing electromagnetic problems in a variety of engineering circumstances, the finite element method is a powerful simulation technique. This book explains the method's processes and techniques in careful, meticulous prose. It covers not only essential finite element method theory, but also its latest developments and applications.Table of ContentsPreface xix Preface to the First Edition xxiii Preface to the Second Edition xxvii 1 Basic Electromagnetic Theory 1 1.1 Brief Review of Vector Analysis 2 1.2 Maxwell's Equations 4 1.3 Scalar and Vector Potentials 6 1.4 Wave Equations 7 1.5 Boundary Conditions 8 1.6 Radiation Conditions 11 1.7 Fields in an Infinite Homogeneous Medium 11 1.8 Huygen's Principle 13 1.9 Radar Cross Sections 14 1.10 Summary 15 2 Introduction to the Finite Element Method 17 2.1 Classical Methods for Boundary-Value Problems 17 2.2 Simple Example 21 2.3 Basic Steps of the Finite Element Method 27 2.4 Alternative Presentation of the Finite Element Formulation 34 2.5 Summary 36 3 One-Dimensional Finite Element Analysis 39 3.1 Boundary-Value Problem 39 3.2 Variational Formulation 40 3.3 Finite Element Analysis 42 3.4 Plane-Wave Reflection by a Metal-Backed Dielectric Slab 53 3.5 Scattering by a Smooth, Convex Impedance Cylinder 59 3.6 Higher-Order Elements 62 3.7 Summary 74 4 Two-Dimensional Finite Element Analysis 77 4.1 Boundary-Value Problem 77 4.2 Variational Formulation 79 4.3 Finite Element Analysis 81 4.4 Application to Electrostatic Problems 98 4.5 Application to Magnetostatic Problems 103 4.6 Application to Quasistatic Problems: Analysis of Multiconductor Transmission Lines 105 4.7 Application to Time-Harmonic Problems 109 4.8 Higher-Order Elements 128 4.9 Isoparametric Elements 144 4.10 Summary 149 5 Three-Dimensional Finite Element Analysis 151 5.1 Boundary-Value Problem 151 5.2 Variational Formulation 152 5.3 Finite Element Analysis 153 5.4 Higher-Order Elements 160 5.5 Isoparametric Elements 162 5.6 Application to Electrostatic Problems 168 5.7 Application to Magnetostatic Problems 169 5.8 Application to Time-Harmonic Field Problems 176 5.9 Summary 188 6 Variational Principles for Electromagnetics 191 6.1 Standard Variational Principle 192 6.2 Modified Variational Principle 197 6.3 Generalized Variational Principle 201 6.4 Variational Principle for Anisotrpic Medium 203 6.5 Variational Principle for Resistive Sheets 207 6.6 Concluding Remarks 209 7 Eigenvalue Problems: Waveguides and Cavities 211 7.1 Scalar Formulations for Closed Waveguides 212 7.2 Vector Formulations for Closed Waveguides 225 7.3 Open Waveguides 235 7.4 Three-Dimensional Cavities 238 7.5 Summary 239 8 Vector Finite Elements 243 8.1 Two-Dimensional Edge Elements 244 8.2 Waveguide Problem Revisited 256 8.3 Three-Dimensional Edge Elements 259 8.4 Cavity Problem Revisited 270 8.5 Waveguide Discontinuities 274 8.6 Higher-Order Interpolatory Vector Elements 278 8.7 Higher-Order Hierarchical Vector Elements 293 8.8 Computational Issues 305 8.9 Summary 309 9 Absorbing Boundary Conditions 315 9.1 Two-Dimensional Absorbing Boundary Conditions 316 9.2 Three-Dimensional Absorbing Boundary Conditions 323 9.3 Scattering Analysis Using Absorbing Boundary Conditons 328 9.4 Adaptive Absorbing Boundary Conditons 339 9.5 Fictitious Absorbers 348 9.6 Perfectly Matched Layers 350 9.7 Application of PML to Body-of-Revolutions Problems 368 9.8 Summary 371 10 Finite Element-Boundary Integral Methods 379 10.1 Scattering by Two-Dimensional Cavity-Backed Apertures 381 10.2 Scattering by Two-Dimensional Cylindrical Structures 399 10.3 Scattering by Three-Dimensional Cavity-Backed Apertures 411 10.4 Radiation by Microstrip Patch Antennas in a Cavity 425 10.5 Scattering by General Three-Dimensional Bodies 430 10.6 Solution of the Finite Element-Boundary Integral System 436 10.7 Symmetric Finite Element-Boundary Integral Formulations 447 10.8 Summary 462 11 Finite Element-Eigenfunction Expansion Methods 469 11.1 Waveguide Port Boundary Conditions 470 11.2 Open-Region Scattering 487 11.3 Coupled Basis Functions: The Unimoment Method 494 11.4 Finite Element-Extended Boundary Condition Method 502 11.5 Summary 509 12 Finite Element Analysis in the Time Domain 513 12.1 Finite Element Formulation and Temporal Excitation 514 12.2 Time-Domain Discretization 518 12.3 Stability Analysis 523 12.4 Modeling of Dispersive Media 529 12.5 Truncation via Absorbing Boundary Conditions 538 12.6 Truncation via Perfectly Matched Layers 541 12.7 Truncation via Boundary Integral Equations 551 12.8 Time-Domain Wqaveguide Port Boundary Conditions 562 12.9 Hybrid Field-Circuit Analysis 569 12.10 Dual-Field Domain Decomposition and Element-Level Methods 587 12.11 Discontinuous Galerkin Time-Domain Methods 605 12.12 Summary 625 13 Finite Element Analysis of Periodic Structures 637 13.1 Finite Element Formulation for a Unit Cell 638 13.2 Scattering by One-Dimensional Periodic Structures: Frequency-Domain Analysis 651 13.3 Scattering by One-Dimensional Periodic Structures: Time-Domain Analysis 656 13.4 Scattering by Two-Dimensional Periodic Structures: Frequency-Domain Analysis 663 13.5 Scattering by Two-Dimensonal Periodic Structures: Time-Domain Analysis 670 13.6 Analysis of Angular Periodic Strctures 678 13.7 Summary 682 14 Domain Decompsition for Large-Scale Analysis 687 14.1 Schwarz Methods 688 14.2 Schur Complement Methods 693 14.3 FETI-DP Method for Low-Frequency Problems 705 14.4 FETI-DP Method for High-Frequency Problems 728 14.5 Noncomformal FETI-DP Method Based on Cement Elements 743 14.6 Application of Second-Order Transmission Conditions 753 14.7 Summary 760 15 Solution of Finite Element Equations 767 15.1 Decomposition Methods 769 15.2 Conjugate Gradient Methods 778 15.3 Solution of Eigenvalue Problems 791 15.4 Fast Frequency-Sweep Computation 797 15.5 Summary 803 Appendix A: Basic Vector Identities and Integral Theorems 809 Appendix B: The Ritz Procedure for Complex-Valued Problems 813 Appendix C: Green's Functions 817 Appendix D: Singular Integral Evaluation 825 Appendix E: Some Special Functions 829 Index 837
£137.66
Society for Industrial & Applied Mathematics,U.S. Iterative Methods for Linear Systems: Theory and
Book SynopsisSystems of linear equations are ubiquitous in numerical analysis and scientific computing. and iterative methods are indispensable for the numerical treatment of such systems. This book offers a rigorous introduction to fundamental iterative methods for systems of linear algebraic equations. The book distinguishes itself from other texts on the topic by providing a straightforward yet comprehensive analysis of the Krylov subspace methods, approaching the development and analysis of algorithms from various perspectives, and going beyond the standard description of iterative methods by connecting them in a natural way to the idea of preconditioning. The book supplements standard texts on numerical mathematics for first-year graduate and advanced undergraduate courses and is suitable for advanced graduate classes covering numerical linear algebra and Krylov subspace and multigrid iterative methods. It will be useful to researchers interested in numerical linear algebra and engineers who use iterative methods for solving large algebraic systems.Table of ContentsList of figures; List of algorithms; Preface; 1. Krylov subspace methods; 2. Toeplitz matrices and preconditioners; 3. Multigrid preconditioners; 4. Preconditioners by space decomposition; 5. Some applications; Bibliography; Index.
£81.60
ISTE Ltd and John Wiley & Sons Inc Meshing, Geometric Modeling and Numerical
Book SynopsisTriangulations, and more precisely meshes, are at the heart of many problems relating to a wide variety of scientific disciplines, and in particular numerical simulations of all kinds of physical phenomena. In numerical simulations, the functional spaces of approximation used to search for solutions are defined from meshes, and in this sense these meshes play a fundamental role. This strong link between the meshes and functional spaces leads us to consider advanced simulation methods in which the meshes are adapted to the behaviors of the underlying physical phenomena. This book presents the basic elements of this meshing vision.Table of ContentsForeword 9 Introduction 11 Chapter 1 Finite Elements and Shape Functions 15 1.1. Basic concepts 15 1.2. Shape functions, complete elements 18 1.2.1. Generic expression of shape functions 18 1.2.2. Explicit expression for degrees 1–3 22 1.3. Shape functions, reduced elements 26 1.3.1. Simplices, triangles and tetrahedra 27 1.3.2. Tensor elements, quadrilateral and hexahedral elements 31 1.3.3. Other elements, prisms and pyramids 48 1.4. Shape functions, rational elements 49 1.4.1. Rational triangle with a degree of 2 or arbitrary degree 49 1.4.2. Rational quadrilateral of an arbitrary degree 50 1.4.3. General case, B-splines or Nurbs elements 50 Chapter 2 Lagrange and Bézier Interpolants 53 2.1. Lagrange–Bézier analogy 54 2.2. Lagrange functions expressed in Bézier forms 55 2.2.1. The case of tensors, natural coordinates 55 2.2.2. Simplicial case, barycentric coordinates 63 2.3. Bézier polynomials expressed in Lagrangian form 66 2.4. Application to curves 66 2.4.1. Bézier expression for a Lagrange curve 67 2.4.2. Lagrangian expression for a Bézier curve 70 2.5. Application to patches 71 2.5.1. Bézier expression for a patch in Lagrangian form 71 2.5.2. Lagrangian expression for a patch in Bézier form 73 2.6. Reduced elements 74 2.6.1. The tensor case, Bézier expression for a reduced Lagrangian patch 74 2.6.2. The tensor case, definition of reduced Bézier patches 82 2.6.3. The tensor case, Lagrangian expression of a reduced Bézier patch 90 2.6.4. The case of simplices 92 Chapter 3 Geometric Elements and Geometric Validity 95 3.1. Two-dimensional elements 96 3.2. Surface elements 105 3.3. Volumetric elements 105 3.4. Control points based on nodes 111 3.5. Reduced elements 115 3.5.1. Simplices, triangles and tetrahedra 115 3.5.2. Tensor elements, quadrilaterals and hexahedra 116 3.5.3. Other elements, prisms and pyramids 120 3.6. Rational elements 121 3.6.1. Shift from Lagrange rationals to Bézier rationals 121 3.6.2. Degree 2, working on the (arc of a) circle 121 3.6.3. Application to the analysis of rational elements 123 3.6.4. On the use of rational elements or more 138 Chapter 4 Triangulation 141 4.1. Triangulation, definitions, basic concepts and natural entities 142 4.1.1. Definitions and basic concepts 142 4.1.2. Natural entities 145 4.1.3. A ball (topological) of a vertex 145 4.1.4 A shell of a k-face 145 4.1.5 The ring of a k-face 146 4.2. Topology and local topological modifications 146 4.2.1. Flipping an edge in two dimensions 148 4.2.2. Flipping a face in three dimensions 148 4.2.3. Flipping an edge in three dimensions 148 4.2.4. Other flips? 150 4.3. Enriched data structures 151 4.3.1. Minimal structure 151 4.3.2. Enriched structure 152 4.4. Construction of natural entities 153 4.5. Triangulation, construction methods 156 4.6. The incremental method, a generic method 159 4.6.1. Naive triangulation 160 4.6.2. Delaunay triangulation 163 Chapter 5 Delaunay Triangulation 165 5.1. History 166 5.2. Definitions and properties 168 5.3. The incremental method for Delaunay 175 5.4. Other methods of construction 181 5.5. Variants 186 5.6. Anisotropy 188 Chapter 6 Triangulation and Constraints 193 6.1. Triangulation of a domain 194 6.1.1. Triangulation of a domain in two dimensions 195 6.1.2. Triangulation of a domain in three dimensions 202 6.2. Delaunay Triangulation “Delaunay admissibility” 214 6.3. Triangulation of a variety 219 6.4. Topological invariants (triangles and tetrahedra) 222 Chapter 7 Geometric Modeling: Methods 233 7.1. Implicit or explicit form (CAD), starting from an analytical definition 234 7.1.1. Modeling an implicit curve, continuous → discrete 234 7.1.2. Modeling a parametric curve 237 7.1.3. Modeling an implicit surface 238 7.1.4. Modeling of a parametric surface 242 7.2. Starting from a discretization or triangulation, discrete → continuous 246 7.2.1. Case of a curve 247 7.2.2. The case of a surface 253 7.3. Starting from a point cloud, discrete → discrete 278 7.3.1. The case of a curve in two dimensions 278 7.3.2. The case of a surface 283 7.4. Extraction of characteristic points and characteristic lines 302 Chapter 8 Geometric Modeling: Examples 305 8.1. Geometric modeling of parametric patches 306 8.2. Characteristic lines of a discrete surface 311 8.3. Parametrization of a surface patch through unfolding 311 8.4. Geometric simplification of a surface triangulation 324 8.5. Geometric support for a discrete surface 325 8.6. Discrete reconstruction of a digitized object or environment 330 Chapter 9 A Few Basic Algorithms and Formulae 343 9.1. Subdivision of an entity (De Casteljau) 344 9.1.1. Subdivision of a curve 344 9.1.2. Subdivision of a patch 345 9.2. Computing control coefficients (higher order elements) 348 9.3. Algorithms for the insertion of a point (Delaunay) 351 9.3.1. Classic algorithm 352 9.3.2. Modified algorithms 355 9.4. Construction of neighboring relationships, balls and shells 357 9.4.1. Neighboring relationships 357 9.4.2. Construction of the ball of a vertex 359 9.4.3. Construction of the shell of an edge 361 9.5. Localization problems 363 9.5.1. Triangulations or simplicial meshes 363 9.5.2. Other meshes 367 9.6. Some formulae 367 Conclusions and Perspectives 369 Bibliography 371 Index 377
£125.06
ISTE Ltd and John Wiley & Sons Inc Geometric and Topological Mesh Feature Extraction
Book SynopsisThree-dimensional surface meshes are the most common discrete representation of the exterior of a virtual shape. Extracting relevant geometric or topological features from them can simplify the way objects are looked at, help with their recognition, and facilitate description and categorization according to specific criteria. This book adopts the point of view of discrete mathematics, the aim of which is to propose discrete counterparts to concepts mathematically defined in continuous terms. It explains how standard geometric and topological notions of surfaces can be calculated and computed on a 3D surface mesh, as well as their use for shape analysis. Several applications are also detailed, demonstrating that each of them requires specific adjustments to fit with generic approaches. The book is intended not only for students, researchers and engineers in computer science and shape analysis, but also numerical geologists, anthropologists, biologists and other scientists looking for practical solutions to their shape analysis, understanding or recognition problems.Table of ContentsPreface ix Introduction xi Chapter 1. Geometric Features based on Curvatures 1 1.1. Introduction 1 1.2. Some mathematical reminders of the differential geometry of surfaces 2 1.2.1. Fundamental forms and normal curvature 2 1.2.2. Principal curvatures and shape index 5 1.2.3. Principal directions and lines of curvature 6 1.2.4. Weingarten equations and shape operator 9 1.2.5. Practical computation of differential parameters 12 1.2.6. Euler’s theorem 13 1.2.7. Meusnier’s theorem 15 1.2.8. Local approximation of the surface 16 1.2.9. Focal surfaces 17 1.3. Computation of differential parameters on a discrete 3D mesh 19 1.3.1. Introduction 19 1.3.2. Some notations 19 1.3.3. Computing normal vectors 20 1.3.4. Locally fitting a parametric surface 22 1.3.5. Discrete differential geometry operators 22 1.3.6. Integrating 2D curvatures 28 1.3.7. Tensor of curvature: Taubin’s formula 28 1.3.8. Tensor of curvature based on the normal cycle theory 30 1.3.9. Integral estimators 34 1.3.10. Processing unstructured 3D point clouds 38 1.3.11. Discussion of the methods 38 1.4. Feature line extraction 46 1.4.1. Introduction 46 1.4.2. Lines of curvature 47 1.4.3. Crest/ridge lines 55 1.4.4. Feature lines based on homotopic thinning 79 1.5. Region-based approaches 84 1.5.1. Mesh segmentation 84 1.5.2. Shape description based on graphs 87 1.6. Conclusion 98 Chapter 2. Topological Features 99 2.1. Mathematical background 99 2.1.1. A topological view on surfaces 100 2.1.2. Algebraic topology 103 2.2. Computation of global topological features 106 2.2.1. Connected components and genus 106 2.2.2. Homology groups 107 2.3. Combining geometric and topological features 111 2.3.1. Persistent homology 112 2.3.2. Reeb graph and Morse–Smale complex 115 2.3.3. Homology generators 118 2.3.4. Measuring holes 121 2.4. Conclusion 128 Chapter 3. Applications 131 3.1. Introduction 131 3.2. Medicine: lines of curvature for polyp detection in virtual colonoscopy 131 3.3. Paleo-anthropology: crest/ridge lines for shape analysis of human fossils 133 3.4. Geology: extraction of fracture lines on virtual outcrops 137 3.5. Planetary science: detection of feature lines for the extraction of impact craters on asteroids and rocky planets 140 3.6. Botany: persistent homology to recover the branching structure of plants 143 Conclusion 145 References 149 Index 169
£125.06
ISTE Ltd and John Wiley & Sons Inc Earthquake Statistical Analysis through
Book SynopsisEarthquake occurrence modeling is a rapidly developing research area. This book deals with its critical issues, ranging from theoretical advances to practical applications. The introductory chapter outlines state-of-the-art earthquake modeling approaches based on stochastic models. Chapter 2 presents seismogenesis in association with the evolving stress field. Chapters 3 to 5 present earthquake occurrence modeling by means of hidden (semi-)Markov models and discuss associated characteristic measures and relative estimation aspects. Further comparisons, the most important results and our concluding remarks are provided in Chapters 6 and 7.Table of ContentsList of Abbreviations ix List of Symbols xi Preface xv Introduction xix Chapter 1. Fundamentals on Stress Changes 1 1.1. Introduction 1 1.2. Stress interaction 4 1.3. Stress changes calculation 12 1.4. Modeling of Coulomb stress changes for different faulting types 15 1.4.1.ΔCS for strike-slip faulting 15 1.4.2.ΔCS for dip-slip faulting 16 1.5. Seismicity triggered by stress transfer 21 1.5.1. Triggering of strong earthquakes 21 1.5.2. Aftershock triggering 23 1.5.3. Triggering of mining seismicity 28 1.6. Discussion on stress interaction 31 Chapter 2. Hidden Markov Models 35 2.1. Introduction 35 2.2. Hidden Markov framework 37 2.3. Seismotectonic regime and seismicity data 42 2.4. Application to earthquake occurrences 44 2.4.1. Two hidden states and three observation types 45 2.4.2. Three hidden states and three observation types 48 2.4.3. Model selection and simulation 50 2.4.4. Steps number for the first earthquake occurrence 53 2.5. Conclusion 54 Chapter 3. Hidden Markov Renewal Models 57 3.1. Introduction 57 3.2. Semi-Markov framework 58 3.3. Hidden Markov renewal framework 65 3.4. Modeling earthquakes in Greece 66 3.4.1. Hitting times and earthquake occurrence numbers 69 3.5. Conclusion 73 Chapter 4. Hitting Time Intensity 75 4.1. Introduction 75 4.2. DTIHT for semi-Markov chains 76 4.2.1. Statistical estimation of the DTIHT 78 4.3. DTIHT for hidden Markov renewal chains 83 4.3.1. Statistical estimation of the DTIHT 85 4.4. Conclusion 87 Chapter 5. Models Comparison 89 5.1. Introduction 89 5.2. Markov framework 90 5.2.1. HMM case 92 5.2.2. HMRM case 92 5.3. Markov renewal framework 93 5.3.1. HMM case 95 5.3.2. HMRM case 96 5.4. Conclusion 97 Discussion & Concluding Remarks 99 Appendices 105 Appendix 1 107 Appendix 2 113 Appendix 3 117 References 119 Index 137
£125.06
ISTE Ltd and John Wiley & Sons Inc Advanced Numerical Methods with Matlab 2:
Book SynopsisThe purpose of this book is to introduce and study numerical methods basic and advanced ones for scientific computing. This last refers to the implementation of appropriate approaches to the treatment of a scientific problem arising from physics (meteorology, pollution, etc.) or of engineering (mechanics of structures, mechanics of fluids, treatment signal, etc.). Each chapter of this book recalls the essence of the different methods resolution and presents several applications in the field of engineering as well as programs developed under Matlab software.Table of ContentsPreface ix Part 1. Solving Equations 1 Chapter 1. Solving Nonlinear Equations 3 1.1 Introduction 3 1.2 Separating the roots 3 1.3 Approximating a separated root 4 1.3.1 Bisection method (or dichotomy method) 4 1.3.2 Fixed-point method 6 1.3.3 First convergence criterion 7 1.3.4 Iterative stopping criteria.8 1.3.5 Second convergence criterion (local criterion) 9 1.3.6 Newton’s method (or the method of tangents) 10 1.3.7 Secant method 12 1.3.8 Regula falsi method (or false position method) 17 1.4 Order of an iterative process.19 1.5 Using Matlab 19 1.5.1 Finding the roots of polynomials 19 1.5.2 Bisection method 21 1.5.3 Newton’s method 22 Chapter 2. Numerically Solving Differential Equations 25 2.1 Introduction 25 2.2 Cauchy problem and discretization 27 2.3 Euler’s method 30 2.3.1 Interpretation 30 2.3.2 Convergence 30 2.4 One-step Runge–Kutta method 31 2.4.1 Second-order Runge–Kutta method 32 2.4.2 Fourth-order Runge–Kutta method 33 2.5 Multi-step Adams methods 36 2.5.1 Open Adams methods 36 2.5.2 Closed Adams formulas 39 2.6 Predictor–Corrector method.41 2.7 Using Matlab 43 Part 2. Solving PDEs 47 Chapter 3. Finite Difference Methods 49 3.1 Introduction 49 3.2 Presentation of the finite difference method 51 3.2.1 Convergence, consistency and stability 53 3.2.2 Courant–Friedrichs–Lewy condition 56 3.2.3 Von Neumann stability analysis 57 3.3 Hyperbolic equations 58 3.3.1 Key results 59 3.3.2 Numerical schemes for solving the transport equation 63 3.3.3 Wave equation 66 3.3.4 Burgers equation 68 3.4 Elliptic equations 72 3.4.1 Poisson equation 72 3.5 Parabolic equations 74 3.5.1 Heat equation 74 3.6 Using Matlab 76 Chapter 4. Finite Element Method 83 4.1 Introduction 83 4.2 One-dimensional finite element methods 83 4.3 Two-dimensional finite element methods 88 4.4 General procedure of the method 93 4.5 Finite element method for computing elastic structures 93 4.5.1 Linear elasticity 93 4.5.2 Variational formulation of the linear elasticity problem 97 4.5.3 Planar linear elasticity problems 99 4.5.4 Applying the finite element method to planar problems 101 4.5.5 Axisymmetric problems.105 4.5.6 Three-dimensional problems 107 4.6 Using Matlab 107 4.6.1 Solving Poisson’s equation 108 4.6.2 Solving the heat equation.111 4.6.3 Computing structures 112 Chapter 5. Finite Volume Methods 117 5.1 Introduction 117 5.2 Finite volume method (FVM) 118 5.2.1 Conservation properties of the method 118 5.2.2 The stages of the method.119 5.2.3 Convergence 120 5.2.4 Consistency 120 5.2.5 Stability 120 5.3 Advection schemes 121 5.3.1 Two-dimensional FVM. 126 5.3.2 Convection-diffusion equation 129 5.3.3 Central differencing scheme 131 5.3.4 Upwind (decentered) scheme 133 5.3.5 Hybrid scheme 136 5.3.6 Power-law scheme 136 5.3.7 QUICK scheme 137 5.3.8 Higher-order schemes 139 5.3.9 Unsteady one-dimensional convection-diffusion Equation 140 5.3.10 Explicit scheme 142 5.3.11 Crank–Nicolson scheme.142 5.3.12 Implicit scheme 143 5.4 Using Matlab 144 Chapter 6. Meshless Methods. 147 6.1 Introduction 147 6.2 Limitations of the FEM and motivation of meshless methods 148 6.3 Examples of meshless methods148 6.3.1 Advantages of meshless methods 149 6.3.2 Disadvantages of meshless methods150 6.3.3 Comparison of the finite element method and meshless methods 151 6.4 Basis of meshless methods 151 6.4.1 Approximations 151 6.4.2 Kernel (weight) functions.152 6.4.3 Completeness 152 6.4.4 Partition of unity 152 6.5 Meshless method (EFG) 153 6.5.1 Theory 153 6.5.2 Moving Least-Squares Approximation 153 6.6 Application of the meshless method to elasticity 163 6.6.1 Formulation of static linear elasticity 163 6.6.2 Imposing essential boundary conditions 165 6.7 Numerical examples 170 6.7.1 Fixed-free beam 170 6.7.2 Compressed block 171 6.8 Using Matlab 173 Part 3. Appendices 179 Appendix 1181 Appendix 2189 Bibliography 195 Index 199
£125.06
ISTE Ltd and John Wiley & Sons Inc Finite Element Method
Book SynopsisThis book offers an in-depth presentation of the finite element method, aimed at engineers, students and researchers in applied sciences.The description of the method is presented in such a way as to be usable in any domain of application. The level of mathematical expertise required is limited to differential and matrix calculus.The various stages necessary for the implementation of the method are clearly identified, with a chapter given over to each one: approximation, construction of the integral forms, matrix organization, solution of the algebraic systems and architecture of programs. The final chapter lays the foundations for a general program, written in Matlab, which can be used to solve problems that are linear or otherwise, stationary or transient, presented in relation to applications stemming from the domains of structural mechanics, fluid mechanics and heat transfer.Table of ContentsIntroduction 1 0.1 The finite element method 1 0.1.1 General remarks 1 0.1.2 Historical evolution of the method 2 0.1.3 State of the art 3 0.2 Object and organization of the book 3 0.2.1 Teaching the finite element method 3 0.2.2 Objectives of the book 4 0.2.3 Organization of the book 4 0.3 Numerical modeling approach 6 0.3.1 General aspects 6 0.3.2 Physical model 7 0.3.3 Mathematical model 9 0.3.4 Numerical model 10 0.3.5 Computer model 13 Bibliography 16 Conference proceedings 17 Monographs 18 Periodicals 19 Chapter 1. Approximations with finite elements 21 1.0 Introduction 21 1.1 General remarks 21 1.1.1 Nodal approximation 21 1.1.2 Approximations with finite elements 28 1.2 Geometrical definition of the elements 33 1.2.1 Geometrical nodes 33 1.2.2 Rules for the partition of a domain into elements 33 1.2.3 Shapes of some classical elements 35 1.2.4 Reference elements 37 1.2.5 Shapes of some classical reference elements 41 1.2.6 Node and element definition tables 44 1.3 Approximation based on a reference element 45 1.3.1 Expression of the approximate function u(x) 45 1.3.2 Properties of approximate function u(x) 49 1.4 Construction of functions N (ξ ) and N (ξ ) 54 1.4.1 General method of construction 54 1.4.2 Algebraic properties of functions N and N 59 1.5 Transformation of derivation operators 61 1.5.1 General remarks 61 1.5.2 First derivatives 62 1.5.3 Second derivatives 65 1.5.4 Singularity of the Jacobian matrix 68 1.6 Computation of functions N, their derivatives and the Jacobian matrix 72 1.6.1 General remarks 72 1.6.2 Explicit forms for N 73 1.7 Approximation errors on an element 75 1.7.1 Notions of approximation errors 75 1.7.2 Error evaluation technique 80 1.7.3 Improving the precision of approximation 83 1.8 Example of application: rainfall problem 89 Bibliography 95 Chapter 2. Various types of elements 97 2.0 Introduction 97 2.1 List of the elements presented in this chapter 97 2.2 One-dimensional elements 99 2.2.1 Linear element (two nodes, C0) 99 2.2.2 High-precision Lagrangian elements: (continuity C0) 101 2.2.3 High-precision Hermite elements 105 2.2.4 General elements 109 2.3 Triangular elements (two dimensions) 111 2.3.1 Systems of coordinates 111 2.3.2 Linear element (triangle, three nodes, C0) 113 2.3.3 High-precision Lagrangian elements (continuity C0) 115 2.3.4 High-precision Hermite elements 123 2.4 Quadrilateral elements (two dimensions) 127 2.4.1 Systems of coordinates 127 2.4.2 Bilinear element (quadrilateral, 4 nodes, C0) 128 2.4.3 High-precision Lagrangian elements 129 2.4.4 High-precision Hermite element 134 2.5 Tetrahedral elements (three dimensions) 137 2.5.1 Systems of coordinates 137 2.5.2 Linear element (tetrahedron, four nodes, C0) 139 2.5.3 High-precision Lagrangian elements (continuity C0) 140 2.5.4 High-precision Hermite elements 142 2.6 Hexahedric elements (three dimensions) 143 2.6.1 Trilinear element (hexahedron, eight nodes, C0) 143 2.6.2 High-precision Lagrangian elements (continuity C0) 144 2.6.3 High-precision Hermite elements 150 2.7 Prismatic elements (three dimensions) 150 2.7.1 Element with six nodes (prism, six nodes, C0) 150 2.7.2 Element with 15 nodes (prism, 15 nodes, C0) 151 2.8 Pyramidal element (three dimensions) 152 2.8.1 Element with five nodes 152 2.9 Other elements 153 2.9.1 Approximation of vectorial values 153 2.9.2 Modifications of the elements 155 2.9.3 Elements with a variable number of nodes 156 2.9.4 Superparametric elements 158 2.9.5 Infinite elements 158 Bibliography 160 Chapter 3. Integral formulation 161 3.0 Introduction 161 3.1 Classification of physical systems 163 3.1.1 Discrete and continuous systems 163 3.1.2 Equilibrium, eigenvalue and propagation problems 164 3.2 Weighted residual method 172 3.2.1 Residuals 172 3.2.2 Integral forms 173 3.3 Integral transformations 174 3.3.1 Integration by parts 174 3.3.2 Weak integral form 177 3.3.3 Construction of additional integral forms 179 3.4 Functionals 182 3.4.1 First variation 182 3.4.2 Functional associated with an integral form 183 3.4.3 Stationarity principle 187 3.4.4 Lagrange multipliers and additional functionals 188 3.5 Discretization of integral forms 194 3.5.1 Discretization of W 194 3.5.2 Approximation of the functions u 197 3.5.3 Choice of the weighting functions ψ 198 3.5.4 Discretization of a functional (Ritz method) 205 3.5.5 Properties of the systems of equations 208 3.6 List of PDEs and weak expressions 209 3.6.1 Scalar field problems 210 3.6.2 Solid mechanics 213 3.6.3 Fluid mechanics 217 Bibliography 229 Chapter 4. Matrix presentation of the finite element method 231 4.0 Introduction 231 4.1 The finite element method 231 4.1.1 Finite element approach 231 4.1.2 Conditions for convergence of the solution 243 4.1.3 Patch test 256 4.2 Discretized elementary integral forms We 264 4.2.1 Matrix expression of We 264 4.2.2 Case of a nonlinear operator L 267 4.2.3 Integral form We on the reference element 269 4.2.4 A few classic forms of We and of elementary matrices 274 4.3 Techniques for calculating elementary matrices 274 4.3.1 Explicit calculation for a triangular element (Poisson’s equation) 274 4.3.2 Explicit calculation for a quadrangular element (Poisson’s equation) 279 4.3.3 Organization of the calculation of the elementary matrices by numerical integration 280 4.3.4 Calculation of the elementary matrices: linear problems 282 4.4 Assembly of the global discretized form W 297 4.4.1 Assembly by expansion of the elementary matrices 298 4.4.2 Assembly in structural mechanics 303 4.5 Technique of assembly 305 4.5.1 Stages of assembly 305 4.5.2 Rules of assembly 305 4.5.3 Example of a subprogram for assembly 307 4.5.4 Construction of the localization table LOCE 308 4.6 Properties of global matrices 310 4.6.1 Band structure 310 4.6.2 Symmetry 314 4.6.3 Storage methods 314 4.7 Global system of equations 318 4.7.1 Expression of the system of equations 318 4.7.2 Introduction of the boundary conditions 318 4.7.3 Reactions 321 4.7.4 Transformation of variables 321 4.7.5 Linear relations between variables 323 4.8 Example of application: Poisson’s equation 324 4.9 Some concepts about convergence, stability and error calculation 329 4.9.1 Notations 329 4.9.2 Properties of the exact solution 330 4.9.3 Properties of the solution obtained by the finite element method 331 4.9.4 Stability and locking 334 4.9.5 One-dimensional exact finite elements 337 Bibliography 343 Chapter 5. Numerical Methods 345 5.0 Introduction 345 5.1 Numerical integration 346 5.1.1 Introduction 346 5.1.2 One-dimensional numerical integration 348 5.1.3 Two-dimensional numerical integration 360 5.1.4 Numerical integration in three dimensions 368 5.1.5 Precision of integration 372 5.1.6 Choice of number of integration points 375 5.1.7 Numerical integration codes 379 5.2 Solving systems of linear equations 384 5.2.1 Introduction 384 5.2.2 Gaussian elimination method 385 5.2.3 Decomposition 391 5.2.4 Adaptation of algorithm (5.44) to the case of a matrix stored by the skyline method 399 5.3 Solution of nonlinear systems 404 5.3.1 Introduction 404 5.3.2 Substitution method 407 5.3.3 Newton–Raphson method 411 5.3.4 Incremental (or step-by-step) method 420 5.3.5 Changing of independent variables 421 5.3.6 Solution strategy 424 5.3.7 Convergence of an iterative method 426 5.4 Resolution of unsteady systems 429 5.4.1 Introduction 429 5.4.2 Direct integration methods for first-order systems 431 5.4.3 Modal superposition method for first-order systems 463 5.4.4 Methods for direct integration of second-order systems 466 5.4.5 Modal superposition method for second-order systems 476 5.5 Methods for calculating the eigenvalues and eigenvectors 480 5.5.1 Introduction 480 5.5.2 Recap of some properties of eigenvalue problems 481 5.5.3 Methods for calculating the eigenvalues 488 Bibliography 502 Chapter 6. Programming technique 505 6.0 Introduction 505 6.1 Functional blocks of a finite element program 506 6.2 Description of a typical problem 507 6.3 General programs 508 6.3.1 Possibilities of general programs 508 6.3.2 Modularity 511 6.4 Description of the finite element code 512 6.4.1 Introduction 512 6.4.2 General organization 513 6.4.3 Description of tables and variables 517 6.5 Library of elementary finite element method programs 521 6.5.1 Functional blocks 521 6.5.2 List of thermal elements 530 6.5.3 List of elastic elements 538 6.5.4 List of elements for fluid mechanics 545 6.6 Examples of application 549 6.6.1 Heat transfer problems 550 6.6.2 Planar elastic problems 558 6.6.3 Fluid flow problems 566 Appendix. Sparse solver 577 7.0 Introduction 577 7.1 Methodology of the sparse solver 578 7.1.1 Assembly of matrices in sparse form: row-by-row format 579 7.1.2 Permutation using the “minimum degree” algorithm 584 7.1.3 Modified column–column storage format 587 7.1.4 Symbolic factorization 589 7.1.5 Numerical factorization 590 7.1.6 Solution of the system by descent/ascent 592 7.2 Numerical examples 593 Bibliography 595 Index 597
£211.46
ISTE Ltd and John Wiley & Sons Inc Numerical Methods for Inverse Problems
Book SynopsisThis book studies methods to concretely address inverse problems. An inverse problem arises when the causes that produced a given effect must be determined or when one seeks to indirectly estimate the parameters of a physical system. The author uses practical examples to illustrate inverse problems in physical sciences. He presents the techniques and specific methods chosen to solve inverse problems in a general domain of application, choosing to focus on a small number of methods that can be used in most applications. This book is aimed at readers with a mathematical and scientific computing background. Despite this, it is a book with a practical perspective. The methods described are applicable, have been applied, and are often illustrated by numerical examples.Trade Review"The book is very carefully written, in a reader-friendly style. It can be considered as an introductory textbook for the theory of ill-posed problems and their numerical solution." (Mathematical Reviews/MathSciNet 11/05/2017)Table of ContentsPreface ix Part 1. Introduction and Examples 1 Chapter 1. Overview of Inverse Problems 3 1.1. Direct and inverse problems 3 1.2. Well-posed and ill-posed problems 4 Chapter 2. Examples of Inverse Problems 9 2.1. Inverse problems in heat transfer 10 2.2. Inverse problems in hydrogeology 13 2.3. Inverse problems in seismic exploration 16 2.4. Medical imaging 21 2.5. Other examples 25 Part 2. Linear Inverse Problems 29 Chapter 3. Integral Operators and Integral Equations 31 3.1. Definition and first properties 31 3.2. Discretization of integral equations 36 3.2.1. Discretization by quadrature–collocation 36 3.2.2. Discretization by the Galerkin method 39 3.3. Exercises 42 Chapter 4. Linear Least Squares Problems – Singular Value Decomposition 45 4.1. Mathematical properties of least squares problems 45 4.1.1. Finite dimensional case 50 4.2. Singular value decomposition for matrices 52 4.3. Singular value expansion for compact operators 57 4.4. Applications of the SVD to least squares problems 60 4.4.1. The matrix case 60 4.4.2. The operator case 63 4.5. Exercises 65 Chapter 5. Regularization of Linear Inverse Problems 71 5.1. Tikhonov’s method 72 5.1.1. Presentation 72 5.1.2. Convergence 73 5.1.3. The L-curve 81 5.2. Applications of the SVE 83 5.2.1. SVE and Tikhonov’s method 84 5.2.2. Regularization by truncated SVE 85 5.3. Choice of the regularization parameter 88 5.3.1. Morozov’s discrepancy principle 88 5.3.2. The L-curve 91 5.3.3. Numerical methods 92 5.4. Iterative methods 94 5.5. Exercises 98 Part 3. Nonlinear Inverse Problems 103 Chapter 6. Nonlinear Inverse Problems – Generalities 105 6.1. The three fundamental spaces 106 6.2. Least squares formulation 111 6.2.1. Difficulties of inverse problems 114 6.2.2. Optimization, parametrization, discretization 114 6.3. Methods for computing the gradient – the adjoint state method 116 6.3.1. The finite difference method 116 6.3.2. Sensitivity functions 118 6.3.3. The adjoint state method 119 6.3.4. Computation of the adjoint state by the Lagrangian 120 6.3.5. The inner product test 123 6.4. Parametrization and general organization 123 6.5. Exercises 125 Chapter 7. Some Parameter Estimation Examples 127 7.1. Elliptic equation in one dimension 127 7.1.1. Computation of the gradient 128 7.2. Stationary diffusion: elliptic equation in two dimensions 129 7.2.1. Computation of the gradient: application of the general method 132 7.2.2. Computation of the gradient by the Lagrangian 134 7.2.3. The inner product test 135 7.2.4. Multiscale parametrization 135 7.2.5. Example 136 7.3. Ordinary differential equations 137 7.3.1. An application example 144 7.4. Transient diffusion: heat equation 147 7.5. Exercises 152 Chapter 8. Further Information 155 8.1. Regularization in other norms 155 8.1.1. Sobolev semi-norms 155 8.1.2. Bounded variation regularization norm 157 8.2. Statistical approach: Bayesian inversion 157 8.2.1. Least squares and statistics 158 8.2.2. Bayesian inversion 160 8.3. Other topics 163 8.3.1. Theoretical aspects: identifiability 163 8.3.2. Algorithmic differentiation . 163 8.3.3. Iterative methods and large-scale problems 164 8.3.4. Software 164 Appendices 167 Appendix 1 169 Appendix 2 183 Appendix 3 193 Bibliography 205 Index 213
£125.06
De Gruyter Dynamic Calculus and Equations on Time Scales
Book SynopsisThe latest advancements in time scale calculus are the focus of this book. New types of time-scale integral transforms are discussed in the book, along with how they can be used to solve dynamic equations. Novel numerical techniques for partial dynamic equations on time scales are described. New time scale inequalities for exponentially convex functions are introduced as well.
£145.50
De Gruyter Fuzzy Clustering Algorithms
£126.35
De Gruyter Mathematical Computing and Sustainability
£143.45
De Gruyter Quantum Unmanned Aerial Vehicle
Book Synopsis
£152.95
De Gruyter Mathematics of Deep Learning
£56.52
De Gruyter Error Freed CFD Mathematics
£121.12
Walter de Gruyter Realzeitrechner-Modelle
£95.00
New India Publishing Agency Numerical Methods and Models in Earth Science
Book Synopsis
£26.90
New India Publishing Agency Numerical Methods
Book SynopsisThe book serves as an introductory course for undergraduate and graduate students in engineering, science, and mathematics, encompassing all disciplines. It addresses key topics, such as numerical computation, linear systems of equations, algebraic and transcendental equation solutions, numerical differentiation, finite differences and interpolation, curve fitting, regression and correlation, numerical integration, and ordinary and partial differential equation solutions. The books language is simple and easy to understand, presented in a systematic and student-friendly manner, with a focus on numerical problem-solving. The balance between theory and practical examples is well-maintained. Each concept is supported by examples, which are unavailable in other books, helping students to better understand and remember the material. Exercise questions are provided at the end of each chapter for further practice.
£67.62
New India Publishing Agency Numerical Methods and Models in Earth Science
Book SynopsisUnderstanding earth systems and its dynamic behavior requires objective insights into the complex observational data sets and their interrelationships. Drawing meaningful inferences from such data is not always an easy task as the deterministic relationships between various geological variables often remain obscured. These interrelationships need to be determined empirically through the analysis of a large set of data and validated through numerical simulations. The ever widening horizon of techniques of numerical analysis and simulation now provides a good number of tools to aid the interpretation. However, due to the inherent complexity of earth science data, expert supervision is required at all stages of analysis from collection to dissemination. This ensures that the most appropriate methodology is adopted and the results remain consistent with the geological principles. Discussions on these practical issues often lie beyond the scope of textbooks and this is precisely where this book is placed. In this book eminent geoscientists present their experiences in analyzing and managing earth science data as well as in designing numerical models to simulate earth processes. Apart from giving a discourse of their own approach towards a particular research problem they also discuss at length the relative merits of alternative methodologies. These seven authoritative articles, richly illustrated, will be a valuable resource for research students and professionals interested in research and teaching in various branches of earth science like, tectonics, GPS geodesy, sedimentology, geographical information science, and evolutionary biology.Table of Contents1. Active deformation in the Darjiling-Sikkim Himalaya based on 2000-2004 geodetic global positioning system measurements. 2. Preliminary results of a study of crustal deformation in the Himalayan Frontal zone in North Bengal using GPS Geodesy. 3. Spatial and temporal variations of the strain fields in orogenic belts: an analysis based on kinematic models. 4. Grain size distribution patterns of some rivers in the light of three model distributions. 5. Estimation of shape changes of skull roof bones in Benthosuchus Sushkini, a Temnospondyl amphibian from the Triassic of Russia. 6. Spatial mathematical models for mineral potential mapping. 7. Enterprise GIS in Geological Survey of India.
£51.14
Oxford University Press Finite Element Methods for Maxwells Equations
Book SynopsisSince the middle of the last century, computing power has increased sufficiently that the direct numerical approximation of Maxwell''s equations is now an increasingly important tool in science and engineering. Parallel to the increasing use of numerical methods in computational electromagnetism there has also been considerable progress in the mathematical understanding of the properties of Maxwell''s equations relevant to numerical analysis. The aim of this book is to provide an up to date and sound theoretical foundation for finite element methods in computational electromagnetism. The emphasis is on finite element methods for scattering problems that involve the solution of Maxwell''s equations on infinite domains. Suitable variational formulations are developed and justified mathematically. An error analysis of edge finite element methods that are particularly well suited to Maxwell''s equations is the main focus of the book. The methods are justified for Lipschitz polyhedral domaiTrade Review... well-written ... a valuable reference for specialists interested in the mathematical theory of Maxwell's equations relevant to numerical analysis. * Zentralblatt MATH *Table of ContentsAPPENDIX
£175.00
Oxford University Press SpectralHP Element Methods for Computational Fluid Dynamics
Book SynopsisSpectral methods have long been popular in direct and large eddy simulation of turbulent flows, but their use in areas with complex-geometry computational domains has historically been much more limited. More recently the need to find accurate solutions to the viscous flow equations around complex configurations has led to the development of high-order discretisation procedures on unstructured meshes, which are also recognised as more efficient for solution of time-dependent oscillatory solutions over long time periods. Here Karniadakis and Sherwin present a much-updated and expanded version of their successful first edition covering the recent and significant progress in multi-domain spectral methods at both the fundamental and application level. Containing over 50% new material, including discontinuous Galerkin methods, non-tensorial nodal spectral element methods in simplex domains, and stabilisation and filtering techniques, this text aims to introduce a wider audience to the use oTrade ReviewThe book contains a large amount of material, including a number of exercises, examples and figures. The book will be helpful to specialists coming into contact with CFD, applied and numerical mathematicians, engineers, physicists and specialists in climate and ocean modeling. It can also be recommended for advanced students of these disciplines. * EMS Newsletter *This book will probably help popularize the spectral/hp element method. Not only should it be recommended to researchers working on spectral/hp methods but it should also be on the wish list of all those who are interested in computational fluid dynamics. * Jean-Luc Guermond, Mathematical Reviews *Table of ContentsIntroduction ; Fundamental concepts in one dimension ; Multi-dimensional expansion bases ; Multi-dimensional formulations ; Diffusion equation ; Advection and advection-diffusion ; Non-conforming elements ; Algorithms for incompressible flows ; Incompressible flow simulations:verification and validation ; Hyperbolic conservation laws ; Appendices ; Jacobi polynomials ; Gauss-Type integration ; Collocation differentiation ; Co discontinuous expansion bases ; Characteristic flux decomposition ; References ; Index
£173.38
Oxford University Press DATADRIVEN MODELING SCIENTIFIC COMP C Methods for Complex Systems Big Data
Book SynopsisThe burgeoning field of data analysis is expanding at an incredible pace due to the proliferation of data collection in almost every area of science. The enormous data sets now routinely encountered in the sciences provide an incentive to develop mathematical techniques and computational algorithms that help synthesize, interpret and give meaning to the data in the context of its scientific setting. A specific aim of this book is to integrate standard scientific computing methods with data analysis. By doing so, it brings together, in a self-consistent fashion, the key ideas from: statistics, time-frequency analysis, and low-dimensional reductions The blend of these ideas provides meaningful insight into the data sets one is faced with in every scientific subject today, including those generated from complex dynamical systems. This is a particularly exciting field and much of the final part of the book is driven by intuitive examples from it, showing how the three areas can be used inTrade ReviewThe book allows methods for dealing with large data to be explained in a logical process suitable for both undergraduate and post-graduate students ... With sport performance analysis evolving into deal with big data, the book forms a key bridge between mathematics and sport science * John Francis, University of Worcester *Table of ContentsI BASIC COMPUTATIONS AND VISUALIZATION; II DIFFERENTIAL AND PARTIAL DIFFERENTIAL EQUATIONS; III COMPUTATIONAL METHODS FOR DATA ANALYSIS; IV SCIENTIFIC APPLICATIONS
£145.57
Oxford University Press Integrable Systems
Book SynopsisThis textbook is designed to give graduate students an understanding of integrable systems via the study of Riemann surfaces, loop groups, and twistors. The book has its origins in a series of lecture courses given by the authors, all of whom are internationally known mathematicians and renowned expositors. It is written in an accessible and informal style, and fills a gap in the existing literature. The introduction by Nigel Hitchin addresses the meaning of integrability: how do we recognize an integrable system? His own contribution then develops connections with algebraic geometry, and includes an introduction to Riemann surfaces, sheaves, and line bundles. Graeme Segal takes the Kortewegde Vries and nonlinear Schrödinger equations as central examples, and explores the mathematical structures underlying the inverse scattering transform. He explains the roles of loop groups, the Grassmannian, and algebraic curves. In the final part of the book, Richard Ward explores the connection beTrade ReviewThe subject of the book is fascinating and written versions of the lecture series are nicley presented and preserve well the informal spirit of the lectures. This is a very useful book for graduate students and for mathematicians (or physicists) from other fields interested in the topic. * EMS *The lecturers cover an enormous amount of material, ranging from algeraic geometry and the theory of Riemann surfaces to loop groups, connections, Yang-Mills equations and twister theory. However despite this wide range, the book is surprisingly self-contained and readable. * Bulletin of the London Mathematical Society *Table of Contents1. Introduction ; 2. Riemann surfaces and integrable systems ; 3. Integrable systems and inverse scattering ; 4. Integrable systems and twistors ; Index
£49.49
Oxford University Press A Posteriori Error Estimation Techniques for Finite Element Methods
Book SynopsisSelf-adaptive discretization methods are now an indispensable tool for the numerical solution of partial differential equations that arise from physical and technical applications. The aim is to obtain a numerical solution within a prescribed tolerance using a minimal amount of work. The main tools in achieving this goal are a posteriori error estimates which give global and local information on the error of the numerical solution and which can easily be computed from the given numerical solution and the data of the differential equation. This book reviews the most frequently used a posteriori error estimation techniques and applies them to a broad class of linear and nonlinear elliptic and parabolic equations. Although there are various approaches to adaptivity and a posteriori error estimation, they are all based on a few common principles. The main aim of the book is to elaborate these basic principles and to give guidelines for developing adaptive schemes for new problems. ChaptersTrade ReviewError control and adaptive solution algorithms for finite element approximation are a key concern of every practitioner. The present text, written by a leading authority in the field who has made many important contributions, will be valuable for theoreticians and practitioners alike. * Mark Ainsworth, Professor of Applied Mathematics, Brown University *Table of Contents1. A Simple Model Problem ; 2. Implementation ; 3. Auxiliary Results ; 4. Linear Elliptic Equations ; 5. Nonlinear Elliptic Equations ; 6. Parabolic Equations
£173.38
Bloomsbury Publishing (UK) Guide to Analysis Mathematical Guides
Book SynopsisMARY HART is a lecturer in Pure Mathematics at Sheffield University
£77.89
Springer Functional Equations and How to Solve Them
Book SynopsisAn historical introduction.- Functional equations with two variables.- Functional equations with one variable.- Miscellaneous methods for functional equations.- Some closing heuristics.- Appendix: Hamel bases.- Hints and partial solutions to problems.Trade ReviewFrom the reviews: "This book is devoted to functional equations of a special type, namely to those appearing in competitions … . The book contains many solved examples and problems at the end of each chapter. … The book has 130 pages, 5 chapters and an appendix, a Hints/Solutions section, a short bibliography and an index. … The book will be valuable for instructors working with young gifted students in problem solving seminars." (EMS Newsletter, June, 2008)Table of ContentsAn historical introduction.- Functional equations with two variables.- Functional equations with one variable.- Miscellaneous methods for functional equations.- Some closing heuristics.- Appendix: Hamel bases.- Hints and partial solutions to problems.
£52.24
Springer New York Number Theory
Book SynopsisThis book deals with several aspects of what is now called "explicit number theory." The local aspect, global aspect, and the third aspect is the theory of zeta and L-functions.Trade ReviewFrom the reviews:"Cohen (Université Bordeaux I, France), an instant classic, uniquely bridges the gap between old-fashioned, naive treatments and the many modern books available that develop the tools just mentioned … . Summing Up: Recommended. … Upper-division undergraduates through faculty." (D. V. Feldman, CHOICE, Vol. 45 (5), January, 2008)"The book deals with aspects of ‘explicit number theory’. … The central theme … is the solution of Diophantine equations. … It combines an interesting ‘philosophy’ of the subject with an encyclopedic grasp of detail. The extension of the author’s reach via the contributed chapters is a good idea. Perhaps it is the start of a trend, as the subject grows more and more. … It will undoubtedly be mined by instructors for their graduate courses, particularly for the purpose of including some recently-proved content." (R. C. Baker, Mathematical Reviews, Issue 2008 e)“This is the second volume of a highly impressive two-volume textbook on Diophantine analysis. … readers are presented with an almost overwhelming amount of material. This … text book is bound to become an important reference for students and researchers alike.” (C. Baxa, Monatshefte für Mathematik, Vol. 157 (2), June, 2009)Table of ContentsAnalytic Tools.- Bernoulli Polynomials and the Gamma Function.- Dirichlet Series and L-Functions.- p-adic Gamma and L-Functions.- Modern Tools.- Applications of Linear Forms in Logarithms.- Rational Points on Higher-Genus Curves.- The Super-Fermat Equation.- The Modular Approach to Diophantine Equations.- Catalan’s Equation.
£44.99
Springer New York Matrix Analysis
Book SynopsisThis book presents a substantial part of matrix analysis that is functional analytic in spirit. Topics covered include the theory of majorization, variational principles for eigenvalues, operator monotone and convex functions, and perturbation of matrix functions and matrix inequalities.Trade ReviewR. Bhatia Matrix Analysis "A highly readable and attractive account of the subject. The book is a must for anyone working in matrix analysis; it can be recommended to graduate students as well as to specialists."—ZENTRALBLATT MATH "There is an ample selection of exercises carefully positioned throughout the text. In addition each chapter includes problems of varying difficulty in which themes from the main text are extended."—MATHEMATICAL REVIEWSTable of ContentsI A Review of Linear Algebra.- I.1 Vector Spaces and Inner Product Spaces.- I.2 Linear Operators and Matrices.- I.3 Direct Sums.- I.4 Tensor Products.- I.5 Symmetry Classes.- I.6 Problems.- I.7 Notes and References.- II Majorisation and Doubly Stochastic Matrices.- II.1 Basic Notions.- II. 2 Birkhoff’s Theorem.- II.3 Convex and Monotone Functions.- II.4 Binary Algebraic Operations and Majorisation.- II.5 Problems.- II.6 Notes and References.- III Variational Principles for Eigenvalues.- III.1 The Minimax Principle for Eigenvalues.- III.2 Weyl’s Inequalities.- III.3 Wielandt’s Minimax Principle.- III.4 Lidskii’s Theorems.- III. 5 Eigenvalues of Real Parts and Singular Values.- III.6 Problems.- III.7 Notes and References.- IV Symmetric Norms.- IV.l Norms on ?n.- IV.2 Unitarily Invariant Norms on Operators on ?n.- IV.3 Lidskii’s Theorem (Third Proof).- IV.4 Weakly Unitarily Invariant Norms.- IV.5 Problems.- IV.6 Notes and References.- V Operator Monotone and Operator Convex Functions.- V.1 Definitions and Simple Examples.- V.2 Some Characterisations.- V.3 Smoothness Properties.- V.4 Loewner’s Theorems.- V.5 Problems.- V.6 Notes and References.- VI Spectral Variation of Normal Matrices.- VI. 1 Continuity of Roots of Polynomials.- VI. 2 Hermitian and Skew-Hermitian Matrices.- VI. 3 Estimates in the Operator Norm.- VI. 4 Estimates in the Frobenius Norm.- VI. 5 Geometry and Spectral Variation: the Operator Norm.- VI. 6 Geometry and Spectral Variation: wui Norms.- VI. 7 Some Inequalities for the Determinant.- VI. 8 Problems.- VI. 9 Notes and References.- VII Perturbation of Spectral Subspaces of Normal Matrices.- VII. 1 Pairs of Subspaces.- VII. 2 The Equation AX — XB = Y.- VII. 3 Perturbation of Eigenspaces.- VII. 4 A Perturbation Bound for Eigenvalues.- VII. 5 Perturbation of the Polar Factors.- VII. 6 Appendix: Evaluating the (Fourier) constants.- VII. 7 Problems.- VII. 8 Notes and References.- VIII Spectral Variation of Nonnormal Matrices.- VIII. 1 General Spectral Variation Bounds.- VIII. 4 Matrices with Real Eigenvalues.- VIII. 5 Eigenvalues with Symmetries.- VIII. 6 Problems.- VIII. 7 Notes and References.- IX A Selection of Matrix Inequalities.- IX. 1 Some Basic Lemmas.- IX. 2 Products of Positive Matrices.- IX. 3 Inequalities for the Exponential Function.- IX. 4 Arithmetic-Geometric Mean Inequalities.- IX. 5 Schwarz Inequalities.- IX. 6 The Lieb Concavity Theorem.- IX. 7 Operator Approximation.- IX. 8 Problems.- IX. 9 Notes and References.- X Perturbation of Matrix Functions.- X. 1 Operator Monotone Functions.- X. 2 The Absolute Value.- X. 3 Local Perturbation Bounds.- X. 4 Appendix: Differential Calculus.- X. 5 Problems.- X. 6 Notes and References.- References.
£53.99
Springer New York Computational Statistics Statistics and Computing
Book SynopsisComputational inference is based on an approach to statistical methods that uses modern computational power to simulate distributional properties of estimators and test statistics.Trade ReviewFrom the reviews:“This is a book that covers many of the computational issues that statisticians will encounter as part of their research and applied work. … The writing in the book is quite clear and the author has done a good job providing the essence of each topic. … Overall, I think this is an excellent book. … This book will give a graduate student a good overview of the field. There are exercises provided for each chapter together with some solutions.” (Michael J. Evans, Mathematical Reviews, Issue 2011 b)“This book is a superior treatment of the important subject of statistical computing. I strongly recommend this book to anyone who analyzes data using either a commercial statistical software package or statistical computer programs written by the user or someone else. Thus this book is important not only for data oriented statisticians but for econometricians, psychometricians, political methodologists and biometricians as well. … All terms in this work including computing terms are clearly defined.” (Melvin Hinich, Technometrics, Vol. 53 (1), February, 2011)“I greatly appreciated the author’s command of both numerical and statistical computing … . The book also contains many exercises that substantiate the concepts, with solutions and hints in the appendix, an extensive bibliography, and a link to further literature and notes. The target readership includes undergraduates, postgraduates in statistics and allied fields such as computer science and mathematics, scientific research workers, and practitioners of statistics and numerical techniques. … I strongly recommend it for all scientific libraries.” (Soubhik Chakraborty, ACM Computing Reviews, October, 2010)“This book has a very large scope in that … it covers the dual fields of computational statistics and of statistical computing. … must-read for all students and researchers engaging into any kind of serious statistical programming. … is well-written, in a lively and personal style. … a reference book that should appear in the shortlist of any computational statistics/statistical computing graduate course as well as on the shelves of any researchers supporting his or her statistical practice with a significant dose of computing backup.” (Christian P. Robert, Statistical and Computation, Vol. 21, 2011)Table of ContentsPreliminaries.- Mathematical and Statistical Preliminaries.- Statistical Computing.- Computer Storage and Arithmetic.- Algorithms and Programming.- Approximation of Functions and Numerical Quadrature.- Numerical Linear Algebra.- Solution of Nonlinear Equations and Optimization.- Generation of Random Numbers.- Methods of Computational Statistics.- Graphical Methods in Computational Statistics.- Tools for Identification of Structure in Data.- Estimation of Functions.- Monte Carlo Methods for Statistical Inference.- Data Randomization, Partitioning, and Augmentation.- Bootstrap Methods.- Exploring Data Density and Relationships.- Estimation of Probability Density Functions Using Parametric Models.- Nonparametric Estimation of Probability Density Functions.- Statistical Learning and Data Mining.- Statistical Models of Dependencies.
£104.49
Cambridge University Press Numerical Simulation of Unsteady Flows and Transition to Turbulence
Book SynopsisThis volume represents the findings of the first test cases considered by ERCOFTAC (European Research Consortium on Flow Turbulence and Combustion). The workshop, held in Lausanne, Switzerland, in 1990, studied five test cases which represent the interests of both the academic and industrial groups.Table of ContentsPreface; Invited lecture: Developments in computational modelling turbulent flow; Test case T1: S-shaped duct; Test case T2: Array of cylinders; Invited lecture: Transition description and prediction; Test case T3: Free stream turbulence; Invited lecture: On recent numerical simulations of compressible Navier-Stokes flows; Test cases T4-T5: Confined axisymmetric jet.
£74.99
Cambridge University Press A Short Introduction to Numerical Analysis
Book SynopsisThis short book sets out the principles of the methods commonly employed in obtaining numerical solutions to mathematical equations.Table of ContentsPreface; 1. The role of numerical analysis in science and engineering; 2. Iteration; 3. Interpolation; 4. Numerical integration and differentiation; 5. Numerical solution of ordinary differential equations; 6. Problems reducible to simultaneous equations; 7. Solution of linear algebraic equations; Index.
£36.99
Cambridge University Press Radial Basis Functions Theory and Implementations 12 Cambridge Monographs on Applied and Computational Mathematics Series Number 12
Book SynopsisA comprehensive bibliography rounds off what will prove a very valuable work.Trade Review"A must read for anyone making direct use of this tool, and a must browse for anyone interested in keeping up with the state of the art in multivariate approximation theory in general." Computing ReviewsTable of ContentsPreface; 1. Introduction; 2. Summary of methods and applications; 3. General methods for approximation and interpolation; 4. Radial basis function approximation on infinite grids; 5. Radial basis functions on scattered data; 6. Radial basis functions with compact support; 7. Implementations; 8. Least squares methods; 9. Wavelet methods with radial basis functions; 10. Further results and open problems; Appendix; Bibliography; Index.
£57.94
Cambridge University Press Interval Methods for Systems of Equations 37 Encyclopedia of Mathematics and its Applications Series Number 37
Book SynopsisAn interval is a natural way of specifying a number that is specified only within certain tolerances. Interval analysis consists of the tools and methods needed to solve linear and nonlinear systems of equations in the presence of data uncertainties. Applications include the sensitivity analysis of solutions of equations depending on parameters, the solution of global nonlinear problems, and the verification of results obtained by finite-precision arithmetic. In this book emphasis is laid on those aspects of the theory which are useful in actual computations. On the other hand, the theory is developed with full mathematical rigour. In order to keep the book self-contained, various results from linear algebra (Perron-Frobenius theory, M- and H- matrices) and analysis (existence of solutions to nonlinear systems) are proved, often from a novel and more general viewpoint. An extensive bibliography is included.Table of ContentsPreface; Symbol index; 1. Basic properties of interval arithmetic; 2. Enclosures for the range of a function; 3. Matrices and sublinear mappings; 4. The solution of square linear systems of equations; 5. Nonlinear systems of equations; 6. Hull computation; References; Author index; Subject index.
£50.99
Cambridge University Press Numerical Methods in Fluid Dynamics Initial and Initial BoundaryValue Problems
Book SynopsisHere is an introduction to numerical methods for partial differential equations with particular reference to those that are of importance in fluid dynamics. The author gives a thorough and rigorous treatment of the techniques, beginning with the classical methods and leading to a discussion of modern developments. For easier reading and use, many of the purely technical results and theorems are given separately from the main body of the text. The presentation is intended for graduate students in applied mathematics, engineering and physical sciences who have a basic knowledge of partial differential equations.Table of Contents1. Introduction; 2. Parabolic equations; 3. Hyperbolic equations; 4. Hyperbolic conservation laws; 5. Stability in the presence of boundaries.
£47.99
Cambridge University Press Scattered Data Approximation 17 Cambridge Monographs on Applied and Computational Mathematics Series Number 17
Book SynopsisA complete self-contained introduction to the theory of scattered data approximation. Written with graduates and researchers in mind, the text brings together much of the necessary background material into a single treatment and provides students with complete proofs to the theory developed within.Trade ReviewReview of the hardback: ' … designed as a comprehensive and self-contained introduction to the field of multivariate scattered data approximation … The book offers an interesting reading for both the beginner and the specialist … throughout its variety of topics and its careful exposition, this book will appeal to everyone interested in the theory and numerical applications of meshless methods for scattered data approximation.' Zentralblatt MATHReview of the hardback: 'I highly recommend it for a graduate course on multivariate approximation theory, computer-aided geometric design, and meshless methods for partial differential equations.' Numerical AlgorithmsTable of Contents1. Applications and motivations; 2. Hear spaces and multivariate polynomials; 3. Local polynomial reproduction; 4. Moving least squares; 5. Auxiliary tools from analysis and measure theory; 6. Positive definite functions; 7. Completely monotine functions; 8. Conditionally positive definite functions; 9. Compactly supported functions; 10. Native spaces; 11. Error estimates for radial basis function interpolation; 12. Stability; 13. Optimal recovery; 14. Data structures; 15. Numerical methods; 16. Generalised interpolation; 17. Interpolation on spheres and other manifolds.
£60.99
Cambridge University Press Highly Oscillatory Problems 366 London Mathematical Society Lecture Note Series Series Number 366
Book SynopsisThe first book to approach high oscillation as a subject of its own, Highly Oscillatory Problems begins a new dialogue and lays the groundwork for future research. It ensues from the six-month programme held at the Newton Institute of Mathematical Sciences, which was the first time that different specialists in highly oscillatory research, from diverse areas of mathematics and applications, had been brought together for a single intellectual agenda. This ground-breaking volume consists of eight review papers by leading experts in subject areas of active research, with an emphasis on computation: numerical Hamiltonian problems, highly oscillatory quadrature, rapid approximation of functions, high frequency wave propagation, numerical homogenization, discretization of the wave equation, high frequency scattering and the solution of elliptic boundary value problems.Table of ContentsPreface; 1. Oscillations over long times in numerical Hamiltonian systems E. Hairer and C. Lubich; 2. Highly oscillatory quadrature D. Huybrechs and S. Olver; 3. Rapid function approximation by modified Fourier series D. Huybrechs and S. Olver; 4. Approximation of high frequency wave propagation M. Motamed and O. Runborg; 5. Wavelet-based numerical homogenization B. Engquist and O. Runborg; 6. Plane wave methods for approximating the time harmonic wave equation T. Luostari, T. Huttunen and P. Monk; 7. Boundary integral methods in high frequency scattering S. N. Chandler-Wilde and I. G. Graham; 8. Novel analytical and numerical methods for elliptic boundary value problems A. S. Fokas and E. A. Spence.
£53.99
Cambridge University Press Probit Analysis
Book SynopsisOriginally published in 1947, this classic study by D. J. Finney was the first to examine and explain a branch of statistical method widely used in connection with the biological assay of insecticides, fungicides, drugs, vitamins, etc. It standardized the computations and terminology and made its use easier for a biologist without statistical expertise, whilst also outlining the underlying mathematical theory. Finney had made several important contributions to the method in the past, and his own results are also included. The book contains a foreword by the influential insecticidal chemist Dr F. Tattersfield.Table of ContentsList of examples; Foreword; Preface; 1. Introductory; 2. Quantal responses and the dosage-response curve; 3. The estimation of the median effective dose; 4. The maximum likelihood solution; 5. The comparison of effectiveness; 6. Adjustments for natural mortality; 7. Factorial experiments; 8. The toxic action of mixtures of poison; 9. Miscellaneous problems; 10. Graded responses; Appendix 1. The computing of probit analyses; Appendix 2. Mathematical basis of the probit method; References; Tables; Index of authors; Index of subjects.
£46.26
Cambridge University Press Numerical Methods of Statistics
Book SynopsisThis book explains how computer software is designed to perform the tasks required for sophisticated statistical analysis. For statisticians, it examines the nitty-gritty computational problems behind statistical methods. For mathematicians and computer scientists, it looks at the application of mathematical tools to statistical problems. The first half of the book offers a basic background in numerical analysis that emphasizes issues important to statisticians. The next several chapters cover a broad array of statistical tools, such as maximum likelihood and nonlinear regression. The author also treats the application of numerical tools; numerical integration and random number generation are explained in a unified manner reflecting complementary views of Monte Carlo methods. Each chapter contains exercises that range from simple questions to research problems. Most of the examples are accompanied by demonstration and source code available from the author''s website. New in this secondTrade ReviewReview from the previous edition '… an excellent tool both for self-study and for classroom teaching. It summarizes the state of the art well and provides a solid basis, through the programs that go with the book, for numerical experimentation and further development. All in all, this is a good book to have … I recommend it.' D. Denteneer, Mathematics of ComputingReview from the previous edition: '… this book grew out of notes for a statistical computing course … The goal of this course was to prepare the doctoral students with the computing tools needed for statistical research. I very much liked this book and recommend it for this use.' Jaromir Antoch, Zentralblatt für MathematikReview from the previous edition: '… a really nice introduction to numerical analysis. All the classical subjects of a numerical analysis course are discussed in a surprisingly short and clear way … When adapting the examples, the first half of the book can be used as a numerical analysis course for any other discipline …' Adhemar Bultheel, Bulletin of the Belgian Mathematical SocietyReview from the previous edition: '… an extremely readable book. This would be an excellent book for a graduate-level course in statistical computing.' Journal of the American Statistical AssociationTable of Contents1. Algorithms and computers; 2. Computer arithmetic; 3. Matrices and linear equations; 4. More methods for solving linear equations; 5. Least squares; 6. Eigenproblems; 7. Functions: interpolation, smoothing and approximation; 8. Introduction to optimization and nonlinear equations; 9. Maximum likelihood and nonlinear regression; 10. Numerical integration and Monte Carlo methods; 11. Generating random variables from other distributions; 12. Statistical methods for integration and Monte Carlo; 13. Markov chain Monte Carlo methods; 14. Sorting and fast algorithms.
£60.10
Cambridge University Press Acta Numerica 1993 Volume 2 Acta Numerica Series Number 2
Book SynopsisContinuing the tradition established with the 1992 volume, 1993's Acta Numerica presents six invited papers on a broad range of topics from numerical analysis. Papers treat each topic at a level intelligible by any numerical analyst from graduate student to professional. Highlights include advances in numerical techniques such as finite elements and multigrid methods, stability analysis for initial value problems, graphical problems such as path following and multivariate splines, and a lengthy paper on parallel methods in linear algebra. This volume will be an essential reference for any practising numerical analyst.Trade ReviewReview of the hardback: 'Acta Numerica is a fine achievement and I think we can expect to see it for many years to come. It sets itself laudable and important goals and has, to a large extent, achieve them. I believe that the volumes are of enormous benefit to our subject … The editorial board should be applauded for having the vision and drive necessary to create and sustain such a high quality publication … No mathematics library is complete without this annual publication, and I urge everyone working in numerical mathematics and scientific computing to read it.' Andrew Stuart, SIAM ReviewTable of Contents1. Continuation and path following Eugene L. Allgower and Kurt Georg; 2. Multivariate piecewise polynomials C. De Boor; 3. Parallel numerical linear algebra James W. Demmel, Michael T. Heath and Henk A. van der Vorst; 4. Linear stability analysis in the numerical solution of initial value problems J. L. M. van Dorsselaer, J. F. B. M. Kraaijevanger and M. N. Spijker; 5. Finite element solution of the Navier–Stokes equations Michael Fortin; 6. Old and new convergence proofs for multigrid methods Harry Yserentant.
£32.42
Cambridge University Press ACTA Numerica 1997
Book SynopsisActa Numerica is an annual volume presenting substantive survey articles in numerical analysis and scientific computing. The subjects and authors are chosen so as to report the most important developments in the subject in a manner accessible to the wider community of professionals with an interest in scientific computing.Trade ReviewReview of the hardback: 'Acta Numerica is a fine achievement and I think we can expect to see it for many years to come. It sets itself laudable and important goals and has, to a large extent, achieve them. I believe that the volumes are of enormous benefit to our subject … The editorial board should be applauded for having the vision and drive necessary to create and sustain such a high quality publication … No mathematics library is complete without this annual publication, and I urge everyone working in numerical mathematics and scientific computing to read it.' Andrew Stuart, SIAM ReviewReview of the hardback: 'Acta Numerica is a cross between a journal and a book. As a regular publication containing contributions from a variety of authors, it is similar to a journal in style. However, it is case-bound and the survey articles are written by invited authors, all of whom are expected to be leaders in the field of numerical mathematics and scientific computing.' The Mathematical GazetteReview of the hardback: 'This and the other volumes of the series provide an excellent way to learn about current research in a wide variety of areas in numerical analysis and scientific computation.' Mathematics of ComputationTable of Contents1. Constructing cubature formulae: the science behind the art Ronald Cools; 2. Wavelet and multiscale methods for operator equations Wolfgang Dahmen; 3. A new version of the Fast Multipole Method for the Laplace equation in three dimensions Leslie Greengard and Vladimir Rohklin; 4. Lanczos-type solvers for nonsymmetric linear systems of equations Martin H. Gutknecht; 5. Numerical solution of multivariate polynomial systems by homotopy continuation methods T. Y. Li; 6. Numerical solution of highly oscillatory ordinary differential equations Linda R. Petzold, Laurent O. Jay and Jeng Yen; 7. Computational methods for semiclassical and quantum transport in semiconductor devices Christian Ringhofer; 8. Complexity theory and numerical analysis Steve Smale.
£999.99
Cambridge University Press ACTA Numerica 1998
Book SynopsisActa Numerica is an annual volume presenting substantive survey articles in numerical analysis and scientific computing. The subjects and authors are chosen so as to report the most important developments in the subject in a manner accessible to all professionals in scientific computing.Trade ReviewReview of the hardback: 'Acta Numerica is a fine achievement and I think we can expect to see it for many years to come. It sets itself laudable and important goals and has, to a large extent, achieve them. I believe that the volumes are of enormous benefit to our subject … The editorial board should be applauded for having the vision and drive necessary to create and sustain such a high quality publication … No mathematics library is complete without this annual publication, and I urge everyone working in numerical mathematics and scientific computing to read it.' Andrew Stuart, SIAM ReviewTable of Contents1. Monte Carlo and quasi-Monte Carlo methods Russel E. Caflish; 2. Nonlinear approximation Ronald A. DeVore; 3. Relative Perturbation results for matrix eigenvalues and singular values Ilse C. F. Ipsen; 4. Stability for time-dependent differential equations Heinz-Otto Kreiss and Jens Lorenz; 5. Direct search algorithms for optimization calculations M. J. D. Powell; 6. Choice of norms for data fitting and function approximation G. A. Watson.
£999.99
Cambridge University Press Acta Numerica 1999 Volume 8 Acta Numerica Series Number 8
Book SynopsisNumerical analysis is the subject of applied mathematics concerned mainly with using computers in evaluating or approximating mathematical models. As such, it is crucial to all applications of mathematics in science and engineering, as well as being an important discipline on its own. Acta Numerica surveys annually the most important developments in numerical analysis and scientific computing. The subjects and authors of the substantive survey articles are chosen by a distinguished international editorial board so as to report the most important developments in the subject in a manner accessible to the wider community of professionals with an interest in scientific computing.Trade ReviewReview of the hardback: 'Acta Numerica is a fine achievement and I think we can expect to see it for many years to come. It sets itself laudable and important goals and has, to a large extent, achieve them. I believe that the volumes are of enormous benefit to our subject … The editorial board should be applauded for having the vision and drive necessary to create and sustain such a high quality publication … No mathematics library is complete without this annual publication, and I urge everyone working in numerical mathematics and scientific computing to read it.' Andrew Stuart, SIAM ReviewTable of Contents1. Numerical relativity: challenges for computational science Gregory B. Cook and Saul A. Teukolsky; 2. Radiation boundary conditions for the numerical simulation of waves Thomas Hagstrom; 3. Numerical methods in tomography Frank Natterer; 4. Approximation theory of the MLP model in neural networks Allan Pinkus; 5. An introduction to numerical methods for stochastic differential equations Eckhard Platen; 6. Computation of pseudospectra Lloyd N. Trefethen.
£32.42