Author: Darrell A. Turkington
Publisher: Cambridge University Press
ISBN: 1107032008
Category : Business & Economics
Languages : en
Pages : 281
Book Description
This book studies the mathematics behind matrix calculus and the applications of matrix calculus in statistics and econometrics.
Generalized Vectorization, Cross-Products, and Matrix Calculus
Author: Darrell A. Turkington
Publisher: Cambridge University Press
ISBN: 1107032008
Category : Business & Economics
Languages : en
Pages : 281
Book Description
This book studies the mathematics behind matrix calculus and the applications of matrix calculus in statistics and econometrics.
Publisher: Cambridge University Press
ISBN: 1107032008
Category : Business & Economics
Languages : en
Pages : 281
Book Description
This book studies the mathematics behind matrix calculus and the applications of matrix calculus in statistics and econometrics.
Scalar, Vector, and Matrix Mathematics
Author: Dennis S. Bernstein
Publisher: Princeton University Press
ISBN: 0691176531
Category : Mathematics
Languages : en
Pages : 1593
Book Description
The essential reference book on matrices—now fully updated and expanded, with new material on scalar and vector mathematics Since its initial publication, this book has become the essential reference for users of matrices in all branches of engineering, science, and applied mathematics. In this revised and expanded edition, Dennis Bernstein combines extensive material on scalar and vector mathematics with the latest results in matrix theory to make this the most comprehensive, current, and easy-to-use book on the subject. Each chapter describes relevant theoretical background followed by specialized results. Hundreds of identities, inequalities, and facts are stated clearly and rigorously, with cross-references, citations to the literature, and helpful comments. Beginning with preliminaries on sets, logic, relations, and functions, this unique compendium covers all the major topics in matrix theory, such as transformations and decompositions, polynomial matrices, generalized inverses, and norms. Additional topics include graphs, groups, convex functions, polynomials, and linear systems. The book also features a wealth of new material on scalar inequalities, geometry, combinatorics, series, integrals, and more. Now more comprehensive than ever, Scalar, Vector, and Matrix Mathematics includes a detailed list of symbols, a summary of notation and conventions, an extensive bibliography and author index with page references, and an exhaustive subject index. Fully updated and expanded with new material on scalar and vector mathematics Covers the latest results in matrix theory Provides a list of symbols and a summary of conventions for easy and precise use Includes an extensive bibliography with back-referencing plus an author index
Publisher: Princeton University Press
ISBN: 0691176531
Category : Mathematics
Languages : en
Pages : 1593
Book Description
The essential reference book on matrices—now fully updated and expanded, with new material on scalar and vector mathematics Since its initial publication, this book has become the essential reference for users of matrices in all branches of engineering, science, and applied mathematics. In this revised and expanded edition, Dennis Bernstein combines extensive material on scalar and vector mathematics with the latest results in matrix theory to make this the most comprehensive, current, and easy-to-use book on the subject. Each chapter describes relevant theoretical background followed by specialized results. Hundreds of identities, inequalities, and facts are stated clearly and rigorously, with cross-references, citations to the literature, and helpful comments. Beginning with preliminaries on sets, logic, relations, and functions, this unique compendium covers all the major topics in matrix theory, such as transformations and decompositions, polynomial matrices, generalized inverses, and norms. Additional topics include graphs, groups, convex functions, polynomials, and linear systems. The book also features a wealth of new material on scalar inequalities, geometry, combinatorics, series, integrals, and more. Now more comprehensive than ever, Scalar, Vector, and Matrix Mathematics includes a detailed list of symbols, a summary of notation and conventions, an extensive bibliography and author index with page references, and an exhaustive subject index. Fully updated and expanded with new material on scalar and vector mathematics Covers the latest results in matrix theory Provides a list of symbols and a summary of conventions for easy and precise use Includes an extensive bibliography with back-referencing plus an author index
Kronecker Products and Matrix Calculus with Applications
Author: Alexander Graham
Publisher: Courier Dover Publications
ISBN: 0486824179
Category : Mathematics
Languages : en
Pages : 145
Book Description
Enhanced by many worked examples, problems, and solutions, this in-depth text is suitable for undergraduates and presents a great deal of information previously only available in specialized and hard-to-find texts. 1981 edition.
Publisher: Courier Dover Publications
ISBN: 0486824179
Category : Mathematics
Languages : en
Pages : 145
Book Description
Enhanced by many worked examples, problems, and solutions, this in-depth text is suitable for undergraduates and presents a great deal of information previously only available in specialized and hard-to-find texts. 1981 edition.
Mathematical Analysis and Optimization for Economists
Author: Michael J. Panik
Publisher: CRC Press
ISBN: 1000408841
Category : Mathematics
Languages : en
Pages : 343
Book Description
In Mathematical Analysis and Optimization for Economists, the author aims to introduce students of economics to the power and versatility of traditional as well as contemporary methodologies in mathematics and optimization theory; and, illustrates how these techniques can be applied in solving microeconomic problems. This book combines the areas of intermediate to advanced mathematics, optimization, and microeconomic decision making, and is suitable for advanced undergraduates and first-year graduate students. This text is highly readable, with all concepts fully defined, and contains numerous detailed example problems in both mathematics and microeconomic applications. Each section contains some standard, as well as more thoughtful and challenging, exercises. Solutions can be downloaded from the CRC Press website. All solutions are detailed and complete. Features Contains a whole spectrum of modern applicable mathematical techniques, many of which are not found in other books of this type. Comprehensive and contains numerous and detailed example problems in both mathematics and economic analysis. Suitable for economists and economics students with only a minimal mathematical background. Classroom-tested over the years when the author was actively teaching at the University of Hartford. Serves as a beginner text in optimization for applied mathematics students. Accompanied by several electronic chapters on linear algebra and matrix theory, nonsmooth optimization, economic efficiency, and distance functions available for free on www.routledge.com/9780367759018.
Publisher: CRC Press
ISBN: 1000408841
Category : Mathematics
Languages : en
Pages : 343
Book Description
In Mathematical Analysis and Optimization for Economists, the author aims to introduce students of economics to the power and versatility of traditional as well as contemporary methodologies in mathematics and optimization theory; and, illustrates how these techniques can be applied in solving microeconomic problems. This book combines the areas of intermediate to advanced mathematics, optimization, and microeconomic decision making, and is suitable for advanced undergraduates and first-year graduate students. This text is highly readable, with all concepts fully defined, and contains numerous detailed example problems in both mathematics and microeconomic applications. Each section contains some standard, as well as more thoughtful and challenging, exercises. Solutions can be downloaded from the CRC Press website. All solutions are detailed and complete. Features Contains a whole spectrum of modern applicable mathematical techniques, many of which are not found in other books of this type. Comprehensive and contains numerous and detailed example problems in both mathematics and economic analysis. Suitable for economists and economics students with only a minimal mathematical background. Classroom-tested over the years when the author was actively teaching at the University of Hartford. Serves as a beginner text in optimization for applied mathematics students. Accompanied by several electronic chapters on linear algebra and matrix theory, nonsmooth optimization, economic efficiency, and distance functions available for free on www.routledge.com/9780367759018.
Convex Optimization & Euclidean Distance Geometry
Author: Jon Dattorro
Publisher: Meboo Publishing USA
ISBN: 0976401304
Category : Mathematics
Languages : en
Pages : 776
Book Description
The study of Euclidean distance matrices (EDMs) fundamentally asks what can be known geometrically given onlydistance information between points in Euclidean space. Each point may represent simply locationor, abstractly, any entity expressible as a vector in finite-dimensional Euclidean space.The answer to the question posed is that very much can be known about the points;the mathematics of this combined study of geometry and optimization is rich and deep.Throughout we cite beacons of historical accomplishment.The application of EDMs has already proven invaluable in discerning biological molecular conformation.The emerging practice of localization in wireless sensor networks, the global positioning system (GPS), and distance-based pattern recognitionwill certainly simplify and benefit from this theory.We study the pervasive convex Euclidean bodies and their various representations.In particular, we make convex polyhedra, cones, and dual cones more visceral through illustration, andwe study the geometric relation of polyhedral cones to nonorthogonal bases biorthogonal expansion.We explain conversion between halfspace- and vertex-descriptions of convex cones,we provide formulae for determining dual cones,and we show how classic alternative systems of linear inequalities or linear matrix inequalities and optimality conditions can be explained by generalized inequalities in terms of convex cones and their duals.The conic analogue to linear independence, called conic independence, is introducedas a new tool in the study of classical cone theory; the logical next step in the progression:linear, affine, conic.Any convex optimization problem has geometric interpretation.This is a powerful attraction: the ability to visualize geometry of an optimization problem.We provide tools to make visualization easier.The concept of faces, extreme points, and extreme directions of convex Euclidean bodiesis explained here, crucial to understanding convex optimization.The convex cone of positive semidefinite matrices, in particular, is studied in depth.We mathematically interpret, for example,its inverse image under affine transformation, and we explainhow higher-rank subsets of its boundary united with its interior are convex.The Chapter on "Geometry of convex functions",observes analogies between convex sets and functions:The set of all vector-valued convex functions is a closed convex cone.Included among the examples in this chapter, we show how the real affinefunction relates to convex functions as the hyperplane relates to convex sets.Here, also, pertinent results formultidimensional convex functions are presented that are largely ignored in the literature;tricks and tips for determining their convexityand discerning their geometry, particularly with regard to matrix calculus which remains largely unsystematizedwhen compared with the traditional practice of ordinary calculus.Consequently, we collect some results of matrix differentiation in the appendices.The Euclidean distance matrix (EDM) is studied,its properties and relationship to both positive semidefinite and Gram matrices.We relate the EDM to the four classical axioms of the Euclidean metric;thereby, observing the existence of an infinity of axioms of the Euclidean metric beyondthe triangle inequality. We proceed byderiving the fifth Euclidean axiom and then explain why furthering this endeavoris inefficient because the ensuing criteria (while describing polyhedra)grow linearly in complexity and number.Some geometrical problems solvable via EDMs,EDM problems posed as convex optimization, and methods of solution arepresented;\eg, we generate a recognizable isotonic map of the United States usingonly comparative distance information (no distance information, only distance inequalities).We offer a new proof of the classic Schoenberg criterion, that determines whether a candidate matrix is an EDM. Our proofrelies on fundamental geometry; assuming, any EDM must correspond to a list of points contained in some polyhedron(possibly at its vertices) and vice versa.It is not widely known that the Schoenberg criterion implies nonnegativity of the EDM entries; proved here.We characterize the eigenvalues of an EDM matrix and then devisea polyhedral cone required for determining membership of a candidate matrix(in Cayley-Menger form) to the convex cone of Euclidean distance matrices (EDM cone); \ie,a candidate is an EDM if and only if its eigenspectrum belongs to a spectral cone for EDM^N.We will see spectral cones are not unique.In the chapter "EDM cone", we explain the geometric relationship betweenthe EDM cone, two positive semidefinite cones, and the elliptope.We illustrate geometric requirements, in particular, for projection of a candidate matrixon a positive semidefinite cone that establish its membership to the EDM cone. The faces of the EDM cone are described,but still open is the question whether all its faces are exposed as they are for the positive semidefinite cone.The classic Schoenberg criterion, relating EDM and positive semidefinite cones, isrevealed to be a discretized membership relation (a generalized inequality, a new Farkas''''''''-like lemma)between the EDM cone and its ordinary dual. A matrix criterion for membership to the dual EDM cone is derived thatis simpler than the Schoenberg criterion.We derive a new concise expression for the EDM cone and its dual involvingtwo subspaces and a positive semidefinite cone."Semidefinite programming" is reviewedwith particular attention to optimality conditionsof prototypical primal and dual conic programs,their interplay, and the perturbation method of rank reduction of optimal solutions(extant but not well-known).We show how to solve a ubiquitous platonic combinatorial optimization problem from linear algebra(the optimal Boolean solution x to Ax=b)via semidefinite program relaxation.A three-dimensional polyhedral analogue for the positive semidefinite cone of 3X3 symmetricmatrices is introduced; a tool for visualizing in 6 dimensions.In "EDM proximity"we explore methods of solution to a few fundamental and prevalentEuclidean distance matrix proximity problems; the problem of finding that Euclidean distance matrix closestto a given matrix in the Euclidean sense.We pay particular attention to the problem when compounded with rank minimization.We offer a new geometrical proof of a famous result discovered by Eckart \& Young in 1936 regarding Euclideanprojection of a point on a subset of the positive semidefinite cone comprising all positive semidefinite matriceshaving rank not exceeding a prescribed limit rho.We explain how this problem is transformed to a convex optimization for any rank rho.
Publisher: Meboo Publishing USA
ISBN: 0976401304
Category : Mathematics
Languages : en
Pages : 776
Book Description
The study of Euclidean distance matrices (EDMs) fundamentally asks what can be known geometrically given onlydistance information between points in Euclidean space. Each point may represent simply locationor, abstractly, any entity expressible as a vector in finite-dimensional Euclidean space.The answer to the question posed is that very much can be known about the points;the mathematics of this combined study of geometry and optimization is rich and deep.Throughout we cite beacons of historical accomplishment.The application of EDMs has already proven invaluable in discerning biological molecular conformation.The emerging practice of localization in wireless sensor networks, the global positioning system (GPS), and distance-based pattern recognitionwill certainly simplify and benefit from this theory.We study the pervasive convex Euclidean bodies and their various representations.In particular, we make convex polyhedra, cones, and dual cones more visceral through illustration, andwe study the geometric relation of polyhedral cones to nonorthogonal bases biorthogonal expansion.We explain conversion between halfspace- and vertex-descriptions of convex cones,we provide formulae for determining dual cones,and we show how classic alternative systems of linear inequalities or linear matrix inequalities and optimality conditions can be explained by generalized inequalities in terms of convex cones and their duals.The conic analogue to linear independence, called conic independence, is introducedas a new tool in the study of classical cone theory; the logical next step in the progression:linear, affine, conic.Any convex optimization problem has geometric interpretation.This is a powerful attraction: the ability to visualize geometry of an optimization problem.We provide tools to make visualization easier.The concept of faces, extreme points, and extreme directions of convex Euclidean bodiesis explained here, crucial to understanding convex optimization.The convex cone of positive semidefinite matrices, in particular, is studied in depth.We mathematically interpret, for example,its inverse image under affine transformation, and we explainhow higher-rank subsets of its boundary united with its interior are convex.The Chapter on "Geometry of convex functions",observes analogies between convex sets and functions:The set of all vector-valued convex functions is a closed convex cone.Included among the examples in this chapter, we show how the real affinefunction relates to convex functions as the hyperplane relates to convex sets.Here, also, pertinent results formultidimensional convex functions are presented that are largely ignored in the literature;tricks and tips for determining their convexityand discerning their geometry, particularly with regard to matrix calculus which remains largely unsystematizedwhen compared with the traditional practice of ordinary calculus.Consequently, we collect some results of matrix differentiation in the appendices.The Euclidean distance matrix (EDM) is studied,its properties and relationship to both positive semidefinite and Gram matrices.We relate the EDM to the four classical axioms of the Euclidean metric;thereby, observing the existence of an infinity of axioms of the Euclidean metric beyondthe triangle inequality. We proceed byderiving the fifth Euclidean axiom and then explain why furthering this endeavoris inefficient because the ensuing criteria (while describing polyhedra)grow linearly in complexity and number.Some geometrical problems solvable via EDMs,EDM problems posed as convex optimization, and methods of solution arepresented;\eg, we generate a recognizable isotonic map of the United States usingonly comparative distance information (no distance information, only distance inequalities).We offer a new proof of the classic Schoenberg criterion, that determines whether a candidate matrix is an EDM. Our proofrelies on fundamental geometry; assuming, any EDM must correspond to a list of points contained in some polyhedron(possibly at its vertices) and vice versa.It is not widely known that the Schoenberg criterion implies nonnegativity of the EDM entries; proved here.We characterize the eigenvalues of an EDM matrix and then devisea polyhedral cone required for determining membership of a candidate matrix(in Cayley-Menger form) to the convex cone of Euclidean distance matrices (EDM cone); \ie,a candidate is an EDM if and only if its eigenspectrum belongs to a spectral cone for EDM^N.We will see spectral cones are not unique.In the chapter "EDM cone", we explain the geometric relationship betweenthe EDM cone, two positive semidefinite cones, and the elliptope.We illustrate geometric requirements, in particular, for projection of a candidate matrixon a positive semidefinite cone that establish its membership to the EDM cone. The faces of the EDM cone are described,but still open is the question whether all its faces are exposed as they are for the positive semidefinite cone.The classic Schoenberg criterion, relating EDM and positive semidefinite cones, isrevealed to be a discretized membership relation (a generalized inequality, a new Farkas''''''''-like lemma)between the EDM cone and its ordinary dual. A matrix criterion for membership to the dual EDM cone is derived thatis simpler than the Schoenberg criterion.We derive a new concise expression for the EDM cone and its dual involvingtwo subspaces and a positive semidefinite cone."Semidefinite programming" is reviewedwith particular attention to optimality conditionsof prototypical primal and dual conic programs,their interplay, and the perturbation method of rank reduction of optimal solutions(extant but not well-known).We show how to solve a ubiquitous platonic combinatorial optimization problem from linear algebra(the optimal Boolean solution x to Ax=b)via semidefinite program relaxation.A three-dimensional polyhedral analogue for the positive semidefinite cone of 3X3 symmetricmatrices is introduced; a tool for visualizing in 6 dimensions.In "EDM proximity"we explore methods of solution to a few fundamental and prevalentEuclidean distance matrix proximity problems; the problem of finding that Euclidean distance matrix closestto a given matrix in the Euclidean sense.We pay particular attention to the problem when compounded with rank minimization.We offer a new geometrical proof of a famous result discovered by Eckart \& Young in 1936 regarding Euclideanprojection of a point on a subset of the positive semidefinite cone comprising all positive semidefinite matriceshaving rank not exceeding a prescribed limit rho.We explain how this problem is transformed to a convex optimization for any rank rho.
Complex-Valued Matrix Derivatives
Author: Are Hjørungnes
Publisher: Cambridge University Press
ISBN: 1139498045
Category : Technology & Engineering
Languages : en
Pages : 271
Book Description
In this complete introduction to the theory of finding derivatives of scalar-, vector- and matrix-valued functions with respect to complex matrix variables, Hjørungnes describes an essential set of mathematical tools for solving research problems where unknown parameters are contained in complex-valued matrices. The first book examining complex-valued matrix derivatives from an engineering perspective, it uses numerous practical examples from signal processing and communications to demonstrate how these tools can be used to analyze and optimize the performance of engineering systems. Covering un-patterned and certain patterned matrices, this self-contained and easy-to-follow reference deals with applications in a range of areas including wireless communications, control theory, adaptive filtering, resource management and digital signal processing. Over 80 end-of-chapter exercises are provided, with a complete solutions manual available online.
Publisher: Cambridge University Press
ISBN: 1139498045
Category : Technology & Engineering
Languages : en
Pages : 271
Book Description
In this complete introduction to the theory of finding derivatives of scalar-, vector- and matrix-valued functions with respect to complex matrix variables, Hjørungnes describes an essential set of mathematical tools for solving research problems where unknown parameters are contained in complex-valued matrices. The first book examining complex-valued matrix derivatives from an engineering perspective, it uses numerous practical examples from signal processing and communications to demonstrate how these tools can be used to analyze and optimize the performance of engineering systems. Covering un-patterned and certain patterned matrices, this self-contained and easy-to-follow reference deals with applications in a range of areas including wireless communications, control theory, adaptive filtering, resource management and digital signal processing. Over 80 end-of-chapter exercises are provided, with a complete solutions manual available online.
Iterative Methods for Sparse Linear Systems
Author: Yousef Saad
Publisher: SIAM
ISBN: 0898715342
Category : Mathematics
Languages : en
Pages : 537
Book Description
Mathematics of Computing -- General.
Publisher: SIAM
ISBN: 0898715342
Category : Mathematics
Languages : en
Pages : 537
Book Description
Mathematics of Computing -- General.
A Primer on Scientific Programming with Python
Author: Hans Petter Langtangen
Publisher: Springer
ISBN: 3662498871
Category : Computers
Languages : en
Pages : 942
Book Description
The book serves as a first introduction to computer programming of scientific applications, using the high-level Python language. The exposition is example and problem-oriented, where the applications are taken from mathematics, numerical calculus, statistics, physics, biology and finance. The book teaches "Matlab-style" and procedural programming as well as object-oriented programming. High school mathematics is a required background and it is advantageous to study classical and numerical one-variable calculus in parallel with reading this book. Besides learning how to program computers, the reader will also learn how to solve mathematical problems, arising in various branches of science and engineering, with the aid of numerical methods and programming. By blending programming, mathematics and scientific applications, the book lays a solid foundation for practicing computational science. From the reviews: Langtangen ... does an excellent job of introducing programming as a set of skills in problem solving. He guides the reader into thinking properly about producing program logic and data structures for modeling real-world problems using objects and functions and embracing the object-oriented paradigm. ... Summing Up: Highly recommended. F. H. Wild III, Choice, Vol. 47 (8), April 2010 Those of us who have learned scientific programming in Python ‘on the streets’ could be a little jealous of students who have the opportunity to take a course out of Langtangen’s Primer.” John D. Cook, The Mathematical Association of America, September 2011 This book goes through Python in particular, and programming in general, via tasks that scientists will likely perform. It contains valuable information for students new to scientific computing and would be the perfect bridge between an introduction to programming and an advanced course on numerical methods or computational science. Alex Small, IEEE, CiSE Vol. 14 (2), March /April 2012 “This fourth edition is a wonderful, inclusive textbook that covers pretty much everything one needs to know to go from zero to fairly sophisticated scientific programming in Python...” Joan Horvath, Computing Reviews, March 2015
Publisher: Springer
ISBN: 3662498871
Category : Computers
Languages : en
Pages : 942
Book Description
The book serves as a first introduction to computer programming of scientific applications, using the high-level Python language. The exposition is example and problem-oriented, where the applications are taken from mathematics, numerical calculus, statistics, physics, biology and finance. The book teaches "Matlab-style" and procedural programming as well as object-oriented programming. High school mathematics is a required background and it is advantageous to study classical and numerical one-variable calculus in parallel with reading this book. Besides learning how to program computers, the reader will also learn how to solve mathematical problems, arising in various branches of science and engineering, with the aid of numerical methods and programming. By blending programming, mathematics and scientific applications, the book lays a solid foundation for practicing computational science. From the reviews: Langtangen ... does an excellent job of introducing programming as a set of skills in problem solving. He guides the reader into thinking properly about producing program logic and data structures for modeling real-world problems using objects and functions and embracing the object-oriented paradigm. ... Summing Up: Highly recommended. F. H. Wild III, Choice, Vol. 47 (8), April 2010 Those of us who have learned scientific programming in Python ‘on the streets’ could be a little jealous of students who have the opportunity to take a course out of Langtangen’s Primer.” John D. Cook, The Mathematical Association of America, September 2011 This book goes through Python in particular, and programming in general, via tasks that scientists will likely perform. It contains valuable information for students new to scientific computing and would be the perfect bridge between an introduction to programming and an advanced course on numerical methods or computational science. Alex Small, IEEE, CiSE Vol. 14 (2), March /April 2012 “This fourth edition is a wonderful, inclusive textbook that covers pretty much everything one needs to know to go from zero to fairly sophisticated scientific programming in Python...” Joan Horvath, Computing Reviews, March 2015
Numerical Methods for Large Eigenvalue Problems
Author: Yousef Saad
Publisher: SIAM
ISBN: 9781611970739
Category : Mathematics
Languages : en
Pages : 292
Book Description
This revised edition discusses numerical methods for computing eigenvalues and eigenvectors of large sparse matrices. It provides an in-depth view of the numerical methods that are applicable for solving matrix eigenvalue problems that arise in various engineering and scientific applications. Each chapter was updated by shortening or deleting outdated topics, adding topics of more recent interest, and adapting the Notes and References section. Significant changes have been made to Chapters 6 through 8, which describe algorithms and their implementations and now include topics such as the implicit restart techniques, the Jacobi-Davidson method, and automatic multilevel substructuring.
Publisher: SIAM
ISBN: 9781611970739
Category : Mathematics
Languages : en
Pages : 292
Book Description
This revised edition discusses numerical methods for computing eigenvalues and eigenvectors of large sparse matrices. It provides an in-depth view of the numerical methods that are applicable for solving matrix eigenvalue problems that arise in various engineering and scientific applications. Each chapter was updated by shortening or deleting outdated topics, adding topics of more recent interest, and adapting the Notes and References section. Significant changes have been made to Chapters 6 through 8, which describe algorithms and their implementations and now include topics such as the implicit restart techniques, the Jacobi-Davidson method, and automatic multilevel substructuring.
The Finite Volume Method in Computational Fluid Dynamics
Author: F. Moukalled
Publisher: Springer
ISBN: 3319168746
Category : Technology & Engineering
Languages : en
Pages : 799
Book Description
This textbook explores both the theoretical foundation of the Finite Volume Method (FVM) and its applications in Computational Fluid Dynamics (CFD). Readers will discover a thorough explanation of the FVM numerics and algorithms used for the simulation of incompressible and compressible fluid flows, along with a detailed examination of the components needed for the development of a collocated unstructured pressure-based CFD solver. Two particular CFD codes are explored. The first is uFVM, a three-dimensional unstructured pressure-based finite volume academic CFD code, implemented within Matlab. The second is OpenFOAM®, an open source framework used in the development of a range of CFD programs for the simulation of industrial scale flow problems. With over 220 figures, numerous examples and more than one hundred exercise on FVM numerics, programming, and applications, this textbook is suitable for use in an introductory course on the FVM, in an advanced course on numerics, and as a reference for CFD programmers and researchers.
Publisher: Springer
ISBN: 3319168746
Category : Technology & Engineering
Languages : en
Pages : 799
Book Description
This textbook explores both the theoretical foundation of the Finite Volume Method (FVM) and its applications in Computational Fluid Dynamics (CFD). Readers will discover a thorough explanation of the FVM numerics and algorithms used for the simulation of incompressible and compressible fluid flows, along with a detailed examination of the components needed for the development of a collocated unstructured pressure-based CFD solver. Two particular CFD codes are explored. The first is uFVM, a three-dimensional unstructured pressure-based finite volume academic CFD code, implemented within Matlab. The second is OpenFOAM®, an open source framework used in the development of a range of CFD programs for the simulation of industrial scale flow problems. With over 220 figures, numerous examples and more than one hundred exercise on FVM numerics, programming, and applications, this textbook is suitable for use in an introductory course on the FVM, in an advanced course on numerics, and as a reference for CFD programmers and researchers.