Listing 1 - 10 of 377 | << page >> |
Sort by
|
Choose an application
Cette deuxième édition du livre « Analyse matricielle » est corrigée et augmentée d’un chapitre sur les matrices réelles positives et stochastiques. Cet ouvrage est consacré à l’étude de l’espace vectoriel Mn (K) des matrices carrées à coefficients réels ou complexes du point de vue algébrique et topologique, préalable nécessaire à tout cours d’analyse numérique. La synthèse réalisée par l’auteur permet aux étudiants d’approfondir leurs connaissances sur les espaces vectoriels normés et l’algèbre linéaire, des notions de base en algèbre linéaire et en topologie étant suffisantes pour la lecture de ce livre. Le public visé est celui des candidats à l’agrégation (interne et externe) et également celui des étudiants de licence et maîtrise de mathématiques. Chaque chapitre est suivi d’une série d’exercices corrigés. Les résultats classiques sont illustrés par des exemples qui peuvent trouver leur place dans les leçons d’oral des concours.
Choose an application
Matrix Theory - Classics and Advances examines matrix theory and its application in solving a series of problems related to natural phenomena and applied science. It consists of eleven chapters divided into two sections. Section 1, "Theory and Progress", discusses the classical problems of matrix theory and its contribution to different fields of pure mathematics. Section 2, "Applications", contains the research related to the application of matrix theory in applied science.
Choose an application
Choose an application
This book addresses both the basic and applied aspects of the finite iterative algorithm, CGLS iterative algorithm, and explicit algorithm to some linear matrix equations. The author presents the latest results in three parts: (1) We consider the finite iterative algorithm to the coupled transpose matrix equations and the coupled operator matrix equations with sub-matrix constrained. These two finite iterative algorithms are closely related and progressive. (2) We present MCGLS iterative algorithm for studying least squares problems to the generalized Sylvester-conjugate matrix equation, the generalized Sylvester-conjugate transpose matrix equation, and the coupled linear operator systems, respectively. (3) Compared with the previous two parts, we consider here the explicit solution to some linear matrix equations, which are the nonhomogeneous Yakubovich matrix equation, the nonhomogeneous Yakubovich transpose matrix equation, and the generalized Sylvester matrix equation, respectively. This book is intended for students, researchers, and professionals in the field of numerical algebra, linear matrix equations, nonlinear matrix equations, and control theory.
Choose an application
Choose an application
Random matrix theory has a long history, beginning in the first instance in multivariate statistics. It was used by Wigner to supply explanations for the important regularity features of the apparently random dispositions of the energy levels of heavy nuclei. The subject was further deeply developed under the important leadership of Dyson, Gaudin and Mehta, and other mathematical physicists. In the early 1990's, random matrix theory witnessed applications in string theory and deep connections with operator theory, and the integrable systems were established by Tracy and Widom. More recently,
Choose an application
The fundamental solutions (FS) satisfy the governing equations in a solution domain S, and then the numerical solutions can be found from the exterior and the interior boundary conditions on S. The resource nodes of FS are chosen outside S, distinctly from the case of the boundary element method (BEM). This method is called the method of fundamental solutions (MFS), which originated from Kupradze in 1963. The Laplace and the Helmholtz equations are studied in detail, and biharmonic equations and the Cauchy-Navier equation of linear elastostatics are also discussed. Moreover, better choices of source nodes are explored. The simplicity of numerical algorithms and high accuracy of numerical solutions are two remarkable advantages of the MFS. However, the ill-conditioning of the MFS is notorious, and the condition number (Cond) grows exponentially via the number of the unknowns used. In this book, the numerical algorithms are introduced and their characteristics are addressed. The main efforts are made to establish the theoretical analysis in errors and stability. The strict analysis (as well as choices of source nodes) in this book has provided the solid theoretical basis of the MFS, to grant it to become an effective and competent numerical method for partial differential equations (PDE). Based on some of our works published as journal papers, this book presents essential and important elements of the MFS. It is intended for researchers, graduated students, university students, computational experts, mathematicians and engineers.
Choose an application
The present monograph on matrix partial orders, appearing for the first time, is a unique presentation of many partial orders on matrices that have fascinated mathematicians for their beauty and applied scientists for their wide-ranging application potential. Except for the Lowner order, the partial orders considered are relatively new and came into being in the late 1970's. After a detailed introduction to generalized inverses and decompositions, the three basic partial orders - namely, the minus, the sharp and the star - and the corresponding one-sided orders are presented using various...
Choose an application
Compared to other books devoted to matrices, this volume is unique in covering the whole of a triptych consisting of algebraic theory, algorithmic problems and numerical applications, all united by the essential use and urge for development of matrix methods. This was the spirit of the 2nd International Conference on Matrix Methods and Operator Equations from 23-27 July 2007 in Moscow that was organized by Dario Bini, Gene Golub, Alexander Guterman, Vadim Olshevsky, Stefano Serra-Capizzano, Gilbert Strang and Eugene Tyrtyshnikov. Matrix methods provide the key to many problems in pure and appl
Choose an application
This book focuses on the behaviour of large random matrices. Standard results are covered, and the presentation emphasizes elementary operator theory and differential equations, so as to be accessible to graduate students and other non-experts. The introductory chapters review material on Lie groups and probability measures in a style suitable for applications in random matrix theory. Later chapters use modern convexity theory to establish subtle results about the convergence of eigenvalue distributions as the size of the matrices increases. Random matrices are viewed as geometrical objects with large dimension. The book analyzes the concentration of measure phenomenon, which describes how measures behave on geometrical objects with large dimension. To prove such results for random matrices, the book develops the modern theory of optimal transportation and proves the associated functional inequalities involving entropy and information. These include the logarithmic Sobolev inequality, which measures how fast some physical systems converge to equilibrium.
Listing 1 - 10 of 377 | << page >> |
Sort by
|