Courses on mathematical programming are now part of standard teaching programs of universities and institutes. The aim of this book is to introduce students of mathematics, economics, technology and other related subjects to the qualitative theory of mathematical programming in paired vector spaces. Prerequisite for the study of this book is only a basic knowledge of analysis, of elements of functional analysis and linear algebra. The application of elementary ideas of functional analysis is convenient for a more rigorous construction of proofs and for some generalizations of the finite dimensional theory on infinite dimensional Banach-spaces. An important feature of this book is the use of a principle of duality to formulate the theoretical basis of many different concrete programming problems. The main idea of the book is to present relations of duality and to construct a general theoretical basis for different special programming problems.

The aim of this book is to extend the understanding of the fundamental role of generalizations of Lie and related non-commutative and non-associative structures in Mathematics and Physics. This is a thematic volume devoted to the interplay between several rapidly exp- ding research ?elds in contemporary Mathematics and Physics, such as generali- tions of the main structures of Lie theory aimed at quantization and discrete and non-commutative extensions of differential calculus and geometry, non-associative structures, actions of groups and semi-groups, non-commutative dynamics, n- commutative geometry and applications in Physics and beyond. The speci?c ?elds covered by this volume include: * Applications of Lie, non-associative and non-commutative associative structures to generalizations of classical and quantum mechanics and non-linear integrable systems, operadic and group theoretical methods; * Generalizations and quasi-deformations of Lie algebras such as color and super Lie algebras, quasi-Lie algebras, Hom-Lie algebras, in?nite-dimensional Lie algebras of vector ?elds associated to Riemann surfaces, quasi-Lie algebras of Witt type and their central extensions and deformations important for in- grable systems, for conformal ? eld theory and for string theory; * Non-commutative deformation theory, moduli spaces and interplay with n- commutativegeometry,algebraicgeometryandcommutativealgebra,q-deformed differential calculi and extensions of homological methods and structures; * Crossed product algebras and actions of groups and semi-groups, graded rings and algebras, quantum algebras, twisted generalizations of coalgebras and Hopf algebra structures such as Hom-coalgebras, Hom-Hopf algebras, and super Hopf algebras and their applications to bosonisation, parastatistics, parabosonic and parafermionic algebras, orthoalgebas and root systems in quantum mechanics;

This is a self-contained introduction to algebraic curves over finite fields and geometric Goppa codes. There are four main divisions in the book. The first is a brief exposition of basic concepts and facts of the theory of error-correcting codes (Part I). The second is a complete presentation of the theory of algebraic curves, especially the curves defined over finite fields (Part II). The third is a detailed description of the theory of classical modular curves and their reduction modulo a prime number (Part III). The fourth (and basic) is the construction of geometric Goppa codes and the production of asymptotically good linear codes coming from algebraic curves over finite fields (Part IV). The theory of geometric Goppa codes is a fascinating topic where two extremes meet: the highly abstract and deep theory of algebraic (specifically modular) curves over finite fields and the very concrete problems in the engineering of information transmission. At the present time there are two essentially different ways to produce asymptotically good codes coming from algebraic curves over a finite field with an extremely large number of rational points. The first way, developed by M. A. Tsfasman, S. G. Vladut and Th. Zink [210], is rather difficult and assumes a serious acquaintance with the theory of modular curves and their reduction modulo a prime number. The second way, proposed recently by A.

Algorithms in algebraic geometry go hand in hand with software packages that implement them. Together they have established the modern field of computational algebraic geometry which has come to play a major role in both theoretical advances and applications. Over the past fifteen years, several excellent general purpose packages for computations in algebraic geometry have been developed, such as, CoCoA, Singular and Macaulay 2. While these packages evolve continuously, incorporating new mathematical advances, they both motivate and demand the creation of new mathematics and smarter algorithms.

This volume reflects the workshop a oeSoftware for Algebraic Geometrya held in the week from 23 to 27 October 2006, as the second workshop in the thematic year on Applications of Algebraic Geometry at the IMA. The papers in this volume describe the software packages Bertini, PHClab, Gfan, DEMiCs, SYNAPS, TrIm, Gambit, ApaTools, and the application of Risa/Asir to a conjecture on multiple zeta values. They offer the reader a broad view of current trends in computational algebraic geometry through software development and applications.

There exists a vast literature on numerical methods of linear algebra. In our bibliography list, which is by far not complete, we included some monographs on the subject [46], [15], [32], [39], [11], [21]. The present book is devoted to the theory of algorithms for a single problem of linear algebra, namely, for the problem of solving systems of linear equations with non-full-rank matrix of coefficients. The solution of this problem splits into many steps, the detailed discussion of which are interest ing problems on their own (bidiagonalization of matrices, computation of singular values and eigenvalues, procedures of deflation of singular values, etc. ). Moreover, the theory of algorithms for solutions of the symmetric eigenvalues problem is closely related to the theory of solv ing linear systems (Householder's algorithms of bidiagonalization and tridiagonalization, eigenvalues and singular values, etc. ). It should be stressed that in this book we discuss algorithms which to computer programs having the virtue that the accuracy of com lead putations is guaranteed. As far as the final program product is con cerned, this means that the user always finds an unambiguous solution of his problem. This solution might be of two kinds: 1. Solution of the problem with an estimate of errors, where abso lutely all errors of input data and machine round-offs are taken into account. 2.

Clifford analysis, a branch of mathematics that has been developed since about 1970, has important theoretical value and several applications. In this book, the authors introduce many properties of regular functions and generalized regular functions in real Clifford analysis, as well as harmonic functions in complex Clifford analysis. It covers important developments in handling the incommutativity of multiplication in Clifford algebra, the definitions and computations of high-order singular integrals, boundary value problems, and so on. In addition, the book considers harmonic analysis and boundary value problems in four kinds of characteristic fields proposed by Luogeng Hua for complex analysis of several variables. The great majority of the contents originate in the authors' investigations, and this new monograph will be interesting for researchers studying the theory of functions.

Introduction In the last few years a few monographs dedicated to the theory of topolog ical rings have appeared [Warn27], [Warn26], [Wies 19], [Wies 20], [ArnGM]. Ring theory can be viewed as a particular case of Z-algebras. Many general results true for rings can be extended to algebras over commutative rings. In topological algebra the structure theory for two classes of topological algebras is well developed: Banach algebras; and locally compact rings. The theory of Banach algebras uses results of Banach spaces, and the theory of locally compact rings uses the theory of LCA groups. As far as the author knows, the first papers on the theory of locally compact rings were [Pontr1]' [J1], [J2], [JT], [An], lOt], [K1]' [K2]' [K3], [K4], [K5], [K6]. Later two papers, [GS1,GS2]appeared, which contain many results concerning locally compact rings. This book can be used in two w.ays. It contains all necessary elementary results from the theory of topological groups and rings. In order to read these parts of the book the reader needs to know only elementary facts from the theories of groups, rings, modules, topology. The book consists of two parts.

This book is intended to provide a reasonably self-contained account of a major portion of the general theory of rings and modules suitable as a text for introductory and more advanced graduate courses. We assume the famil iarity with rings usually acquired in standard undergraduate algebra courses. Our general approach is categorical rather than arithmetical. The continuing theme of the text is the study of the relationship between the one-sided ideal structure that a ring may possess and the behavior of its categories of modules. Following a brief outline of set-theoretic and categorical foundations, the text begins with the basic definitions and properties of rings, modules and homomorphisms and ranges through comprehensive treatments of direct sums, finiteness conditions, the Wedderburn-Artin Theorem, the Jacobson radical, the hom and tensor functions, Morita equivalence and duality, de composition theory of injective and projective modules, and semi perfect and perfect rings. In this second edition we have included a chapter containing many of the classical results on artinian rings that have hdped to form the foundation for much of the contemporary research on the representation theory of artinian rings and finite dimensional algebras. Both to illustrate the text and to extend it we have included a substantial number of exercises covering a wide spectrum of difficulty. There are, of course" many important areas of ring and module theory that the text does not touch upon."

1 Grundlagen.- 1.1 Allgemeine Grundlagen.- 1.1.1 Ziele und Aufgaben.- 1.1.2 Methoden.- 1.1.3 Geschichte und Einordnung.- 1.1.3.1 Geschichte der Bauwerksvermessung.- 1.1.3.2 Geschichte des Vermessungswesens.- 1.1.3.3 Geschichte der Architekturphotogrammetrie.- 1.1.4 Rechtliche Grundlagen und Rahmenbedingungen.- 1.1.4.1 Internationale Vereinbarungen und Organisationen.- 1.1.4.2 Baugesetzbuch, Denkmalpflegegesetze, Vermessungsgesetze.- 1.2 Messgroessen und Masseinheiten.- 1.2.1 Strecken.- 1.2.2 Winkel.- 1.3 Bezugssysteme und Koordinaten.- 1.3.1 Bezugsflachen.- 1.3.2 Koordinaten.- 1.3.3 Koordinatensysteme.- 1.3.3.1 Polarkoordinaten.- 1.3.3.2 Lokale Koordinatensysteme.- 1.3.3.3 Regionale Koordinatensysteme.- 1.3.3.4 Globale Koordinatensysteme.- 1.3.3.5 Geographische Koordinaten.- 1.3.3.6 Geozentrische Koordinaten.- 1.3.4 Koordinatentransformationen.- 1.3.4.1 Translation (2D).- 1.3.4.2 Massstabslose Transformation (2D).- 1.3.4.3 AEhnlichkeitstransformation (2D).- 1.3.4.4 Vereinfachte AEhnlichkeitstransformation mit 2 Passpunkten (2D).- 1.3.4.5 Affintransformation (2D).- 1.3.4.6 Weitere ebene Koordinatentransformationen.- 1.3.4.7 Raumliche Koordinatentransformation (3D).- 1.3.5 Festpunktfelder.- 1.3.5.1 Netz trigonometrischer Punkte zur Lagedefinition.- 1.3.5.2 Hoehennetz.- 1.3.6 Vermessungsnetze fur die Bauwerksvermessung.- 1.3.6.1 Netzdesign.- 1.3.6.2 Vermarkung.- 1.3.6.3 Design und Fertigung von Punktsignalisierungen.- 1.3.6.4 Auswahl naturlicher Passpunkte.- 1.3.6.5 Schnurnetz zur temporaren Vermarkung.- 1.3.6.6 Punktubersichten und Einmessskizzen.- 1.4 Fehlerlehre und Statistik.- 1.4.1 Fehlerarten und ihre Wirkung.- 1.4.1.1 Zufallige Fehler.- 1.4.1.2 Systematische Fehler.- 1.4.1.3 Grobe Fehler.- 1.4.2 Fehlerfortpflanzung und Ausgleichsrechnung.- 1.4.3 Rechenscharfe und Rundung.- 1.4.4 Toleranzen im Bauwesen.- 2 Dokumentation von Gebauden und Ensembles.- 2.1 Amtliche Dokumentation.- 2.1.1 Katasterunterlagen.- 2.1.2 Amtliche Karten.- 2.1.3 Lageplan.- 2.1.4 Geoinformationssysteme (GIS).- 2.2 Plane.- 2.2.1 Grundriss.- 2.2.2 Schnitt.- 2.2.3 Ansicht.- 2.2.4 Detaildarstellungen.- 2.2.5 Massstabe und Detaillierungsgrad.- 2.2.6 Materialien und Aufbewahrung.- 2.3 3D-Beschreibungen.- 2.3.1 CAD-Modell.- 2.3.2 Animation.- 2.3.3 Virtual Reality.- 2.3.4 Augmented Reality.- 2.4 Fotografie.- 2.4.1 Analoge Fotografie.- 2.4.1.1 Fotografisches Material.- 2.4.1.2 Kameras.- 2.4.1.3 Objektive.- 2.4.1.4 Licht.- 2.4.1.5 Belichtung.- 2.4.1.6 Archivierungen von Fotomaterialien.- 2.4.2 Digitale Bilder.- 2.4.2.1 Flachensensoren.- 2.4.2.2 Zeilenkameras.- 2.4.2.3 Spezialkameras.- 2.4.3 Scannen analoger Fotovorlagen.- 2.4.4 Digitale Bildverarbeitung.- 2.5 Textliche und hybride Beschreibungen.- 2.5.1 Raumbuch.- 2.5.2 Hypertext Dokumente.- 2.5.3 Informationssystem.- 2.6 Archivierung digitaler Daten.- 2.6.1 Datentrager.- 2.6.2 Datenformate.- 2.6.2.1 Texte.- 2.6.2.2 Datenbanken.- 2.6.2.3 Vektordaten.- 2.6.2.4 Rasterdaten.- 2.6.2.5 Hypermedia.- 3 Erfassung von Messelementen.- 3.1 Messprinzipien.- 3.1.1 Vom-Grossen-ins-Kleine.- 3.1.2 UEberbestimmungen.- 3.1.3 Vermeidung von systematischen Fehlern.- 3.2 Gerate und Instrumente.- 3.2.1 Bauteile, Kleingerate und Zubehoer.- 3.2.1.1 Lote und Libellen.- 3.2.1.2 Fernrohr.- 3.2.1.3 Stative.- 3.2.1.4 Fluchtstab.- 3.2.1.5 Nivellierlatten und Kleingerat.- 3.2.1.6 Aufstellen eines Instruments.- 3.2.2 Winkelmessung.- 3.2.2.1 Bestimmung rechter Winkel.- 3.2.2.2 Theodolit.- 3.2.2.3 Satzmessung.- 3.2.2.4 Berechnung von Richtungswinkeln aus Koordinaten.- 3.2.3 Streckenmessung.- 3.2.3.1 Streckenmessung mit dem Messband.- 3.2.3.2 Optische Streckenmessung.- 3.2.3.3 Elektro-optische Entfernungsmessung (EDM).- 3.2.4 Hoehenmessung.- 3.2.4.1 Einfache Werkzeuge.- 3.2.4.2 Nivellement.- 3.2.4.3 Rotationslaser.- 3.3 Beschaffung einer Vermessungsausrustung.- 4 Messverfahren.- 4.1 Schrittskizze.- 4.2 Handaufmass.- 4.3 Punktbestimmung ohne Theodolit.- 4.3.1 Bogenschlag.- 4.3.2 Einbindeverfahren.- 4.3.3 Orthogonalverfahren.- 4.3.4

Control theory represents an attempt to codify, in mathematical terms, the principles and techniques used in the analysis and design of control systems. Algebraic geometry may, in an elementary way, be viewed as the study of the structure and properties of the solutions of systems of algebraic equations. The aim of these notes is to provide access to the methods of algebraic geometry for engineers and applied scientists through the motivated context of control theory. I began the development of these notes over fifteen years ago with a series of lectures given to the Control Group at the Lund Institute of Technology in Sweden. Over the following years, I presented the material in courses at Brown several times and must express my appreciation for the feedback (sic ) received from the students. I have attempted throughout to strive for clarity, often making use of constructive methods and giving several proofs of a particular result. Since algebraic geometry draws on so many branches of mathematics and can be dauntingly abstract, it is not easy to convey its beauty and utility to those interested in applications. I hope at least to have stirred the reader to seek a deeper understanding of this beauty and utility in control theory. The first volume dea1s with the simplest control systems (i. e. single input, single output linear time-invariant systems) and with the simplest algebraic geometry (i. e. affine algebraic geometry).

Metagraphs and Their Applications is a presentation of metagraph theory and its applications that begins by defining a metagraph and its uses. They are more complex than a simple graph structure, but they allow for representation and analysis of more complex systems. The material contained in this book is presented in two parts. The first develops the theoretical results with the emphasis on the development of a metagraph algebra. In the second part of the book, four promising applications of metagraphs are examined: modeling of data relations; the modeling of decision models; the modeling of decision rules; and the modeling of workflow tasks. Hence, the theoretical results in the initial chapters lay the foundation for the application areas in the second part of the book. The book concludes by examining several possible extensions of this work.

The aim of this book is to present a substantial part of matrix analysis that is functional analytic in spirit. Much of this will be of interest to graduate students and research workers in operator theory, operator algebras, mathematical physics and numerical analysis. The book can be used as a basic text for graduate courses on advanced linear algebra and matrix analysis. It can also be used as supplementary text for courses in operator theory and numerical analysis. Among topics covered are the theory of majorization, variational principles for eigenvalues, operator monotone and convex functions, perturbation of matrix functions and matrix inequalities. Much of this is presented for the first time in a unified way in a textbook. The reader will learn several powerful methods and techniques of wide applicability, and see connections with other areas of mathematics. A large selection of matrix inequalities will make this book a valuable reference for students and researchers who are working in numerical analysis, mathematical physics and operator theory.

This is an English translation of the now classic "Algèbre Locale - Multiplicités" originally published by Springer as LNM 11, in several editions since 1965. It gives a short account of the main theorems of commutative algebra, with emphasis on modules, homological methods and intersection multiplicities ("Tor-formula"). Many modifications to the original French text have been made by the author for this English edition: they make the text easier to read, without changing its intended informal character.

A look at solving problems in three areas of classical elementary mathematics: equations and systems of equations of various kinds, algebraic inequalities, and elementary number theory, in particular divisibility and diophantine equations. In each topic, brief theoretical discussions are followed by carefully worked out examples of increasing difficulty, and by exercises which range from routine to rather more challenging problems. While it emphasizes some methods that are not usually covered in beginning university courses, the book nevertheless teaches techniques and skills which are useful beyond the specific topics covered here. With approximately 330 examples and 760 exercises.

Structured matrices serve as a natural bridge between the areas of algebraic computations with polynomials and numerical matrix computations, allowing cross-fertilization of both fields. This book covers most fundamental numerical and algebraic computations with Toeplitz, Hankel, Vandermonde, Cauchy, and other popular structured matrices. Throughout the computations, the matrices are represented by their compressed images, called displacements, enabling both a unified treatment of various matrix structures and dramatic saving of computer time and memory. The resulting superfast algorithms allow further dramatic parallel acceleration using FFT and fast sine and cosine transforms. Included are specific applications to other fields, in particular, superfast solutions to: various fundamental problems of computer algebra; the tangential Nevanlinna--Pick and matrix Nehari problems The primary intended readership for this work includes researchers, algorithm designers, and advanced graduate students in the fields of computations with structured matrices, computer algebra, and numerical rational interpolation. The book goes beyond research frontiers and, apart from very recent research articles, includes yet unpublished results. To serve a wider audience, the presentation unfolds systematically and is written in a user-friendly engaging style. Only some preliminary knowledge of the fundamentals of linear algebra is required. This makes the material accessible to graduate students and new researchers who wish to study the rapidly exploding area of computations with structured matrices and polynomials. Examples, tables, figures, exercises, extensive bibliography, and index lend this text toclassroom use or self-study.

The theme of this book is operator theory on C*-algebras. The main novel tool employed is the concept of local multipliers. Originally devised by Elliott and Pedersen in the 1970's in order to study derivations and automorphisms, local multipliers of C*-algebras were developed into a powerful device by the present authors in the 1990's. The book serves two purposes. The first part provides the reader - specialist and advanced graduate student alike - with a thorough introduction to the theory of local multipliers. Only a minimal knowledge of algebra and analysis is required, as the prerequisites in both non-commutative ring theory and basic C*-algebra theory are presented in the first chapter. In the second part, local multipliers are used to obtain a wealth of information on various classes of operators on C*-algebras, including (groups of) automorphisms, derivations, elementary operators, Lie isomorphisms and Lie derivations, as well as others. Many of the results appear in print for the first time. The authors have made an effort to avoid intricate technicalities thus some of the results are not pushed to their utmost generality. Several open problems are discussed, and hints for further developments are given.

to Group Rings by Cesar Polcino Milies Instituto de Matematica e Estatistica, Universidade de sao Paulo, sao Paulo, Brasil and Sudarshan K. Sehgal Department of Mathematical and Statistical Sciences, University of Alberta, Edmonton. Canada SPRINGER-SCIENCE+BUSINESS MEDIA, B.V. A c.I.P. Catalogue record for this book is available from the Library of Congress. ISBN 978-1-4020-0239-7 ISBN 978-94-010-0405-3 (eBook) DOI 10.1007/978-94-010-0405-3 Printed an acid-free paper AII Rights Reserved (c) 2002 Springer Science+Business Media Dordrecht Originally published by Kluwer Academic Publishers in 2002 Softcover reprint ofthe hardcover Ist edition 2002 No part of the material protected by this copyright notice may be reproduced or utilized in any form or by any means, electronic or mechanical, inc1uding photocopying, recording Of by any information storage and retrieval system, without written permis sion from the copyright owner. Contents Preface ix 1 Groups 1 1.1 Basic Concepts . . . . . . . . . . . . 1 1.2 Homomorphisms and Factor Groups 10 1.3 Abelian Groups . 18 1.4 Group Actions, p-groups and Sylow Subgroups 21 1.5 Solvable and Nilpotent Groups 27 1.6 FC Groups .

The mathematical theory of wavelets is less than 15 years old, yet already wavelets have become a fundamental tool in many areas of applied mathematics and engineering. This introduction to wavelets assumes a basic background in linear algebra (reviewed in Chapter 1) and real analysis at the undergraduate level. Fourier and wavelet analyses are first presented in the finite-dimensional context, using only linear algebra. Then Fourier series are introduced in order to develop wavelets in the infinite-dimensional, but discrete context. Finally, the text discusses Fourier transform and wavelet theory on the real line. The computation of the wavelet transform via filter banks is emphasized, and applications to signal compression and numerical differential equations are given. This text is ideal for a topics course for mathematics majors, because it exhibits and emerging mathematical theory with many applications. It also allows engineering students without graduate mathematics prerequisites to gain a practical knowledge of wavelets.

The most difficult computational problems nowadays are those of higher dimensions. This research monograph offers an introduction to tensor numerical methods designed for the solution of the multidimensional problems in scientific computing. These methods are based on the rank-structured approximation of multivariate functions and operators by using the appropriate tensor formats. The old and new rank-structured tensor formats are investigated. We discuss in detail the novel quantized tensor approximation method (QTT) which provides function-operator calculus in higher dimensions in logarithmic complexity rendering super-fast convolution, FFT and wavelet transforms. This book suggests the constructive recipes and computational schemes for a number of real life problems described by the multidimensional partial differential equations. We present the theory and algorithms for the sinc-based separable approximation of the analytic radial basis functions including Green's and Helmholtz kernels. The efficient tensor-based techniques for computational problems in electronic structure calculations and for the grid-based evaluation of long-range interaction potentials in multi-particle systems are considered. We also discuss the QTT numerical approach in many-particle dynamics, tensor techniques for stochastic/parametric PDEs as well as for the solution and homogenization of the elliptic equations with highly-oscillating coefficients. Contents Theory on separable approximation of multivariate functions Multilinear algebra and nonlinear tensor approximation Superfast computations via quantized tensor approximation Tensor approach to multidimensional integrodifferential equations

This book features selected papers from The Seventh International Conference on Research and Education in Mathematics that was held in Kuala Lumpur, Malaysia from 25 - 27th August 2015. With chapters devoted to the most recent discoveries in mathematics and statistics and serve as a platform for knowledge and information exchange between experts from academic and industrial sectors, it covers a wide range of topics, including numerical analysis, fluid mechanics, operation research, optimization, statistics and game theory. It is a valuable resource for pure and applied mathematicians, statisticians, engineers and scientists, and provides an excellent overview of the latest research in mathematical sciences.

Vertex algebra was introduced by Boreherds, and the slightly revised notion "vertex oper- ator algebra" was formulated by Frenkel, Lepowsky and Meurman, in order to solve the problem of the moonshine representation of the Monster group - the largest sporadie group. On the one hand, vertex operator algebras ean be viewed as extensions of eertain infinite-dimensional Lie algebras such as affine Lie algebras and the Virasoro algebra. On the other hand, they are natural one-variable generalizations of commutative associative algebras with an identity element. In a certain sense, Lie algebras and commutative asso- ciative algebras are reconciled in vertex operator algebras. Moreover, some other algebraie structures, such as integral linear lattiees, Jordan algebras and noncommutative associa- tive algebras, also appear as subalgebraic structures of vertex operator algebras. The axioms of vertex operator algebra have geometrie interpretations in terms of Riemman spheres with punctures. The trace functions of a certain component of vertex operators enjoy the modular invariant properties. Vertex operator algebras appeared in physies as the fundamental algebraic structures of eonformal field theory, whieh plays an important role in string theory and statistieal meehanies. Moreover,eonformalfieldtheoryreveals animportantmathematiealproperty,the so called "mirror symmetry" among Calabi-Yau manifolds. The general correspondence between vertex operator algebras and Calabi-Yau manifolds still remains mysterious. Ever since the first book on vertex operator algebras by Frenkel, Lepowsky and Meur- man was published in 1988, there has been a rapid development in vertex operator su- peralgebras, which are slight generalizations of vertex operator algebras.

Accurate and efficient computer algorithms for factoring matrices, solving linear systems of equations, and extracting eigenvalues and eigenvectors. Regardless of the software system used, the book describes and gives examples of the use of modern computer software for numerical linear algebra. It begins with a discussion of the basics of numerical computations, and then describes the relevant properties of matrix inverses, factorisations, matrix and vector norms, and other topics in linear algebra. The book is essentially self- contained, with the topics addressed constituting the essential material for an introductory course in statistical computing. Numerous exercises allow the text to be used for a first course in statistical computing or as supplementary text for various courses that emphasise computations.

This book presents the state-of-the-art research on the teaching and learning of linear algebra in the first year of university, in an international perspective. It provides university teachers in charge of linear algebra courses with a wide range of information from works including theoretical and experimental issues.

This book presents tensors and tensor analysis as primary mathematical tools for engineering and engineering science students and researchers. The discussion is based on the concepts of vectors and vector analysis in three-dimensional Euclidean space, and although it takes the subject matter to an advanced level, the book starts with elementary geometrical vector algebra so that it is suitable as a first introduction to tensors and tensor analysis. Each chapter includes a number of problems for readers to solve, and solutions are provided in an Appendix at the end of the text. Chapter 1 introduces the necessary mathematical foundations for the chapters that follow, while Chapter 2 presents the equations of motions for bodies of continuous material. Chapter 3 offers a general definition of tensors and tensor fields in three-dimensional Euclidean space. Chapter 4 discusses a new family of tensors related to the deformation of continuous material. Chapter 5 then addresses constitutive equations for elastic materials and viscous fluids, which are presented as tensor equations relating the tensor concept of stress to the tensors describing deformation, rate of deformation and rotation. Chapter 6 investigates general coordinate systems in three-dimensional Euclidean space and Chapter 7 shows how the tensor equations discussed in chapters 4 and 5 are presented in general coordinates. Chapter 8 describes surface geometry in three-dimensional Euclidean space, Chapter 9 includes the most common integral theorems in two- and three-dimensional Euclidean space applied in continuum mechanics and mathematical physics.