Hasil Pencarian  ::  Simpan CSV :: Kembali

"This book provides a comprehensive treatment of the theory of polynomials in a complex variable with matrix coefficients. Basic matrix theory can be viewed as the study of the special case of polynomials of first degree; the theory developed in Matrix Polynomials is a natural extension of this case to polynomials of higher degree. It has applications in many areas, such as differential equations, systems theory, the Wieneropf technique, mechanics and vibrations, and numerical analysis. Although there have been significant advances in some quarters, this work remains the only systematic development of the theory of matrix polynomials."

"This book introduces the numerical technique of polynomial continuation, which is used to compute solutions to systems of polynomial equations. Originally published in 1987, it remains a useful starting point for the reader interested in learning how to solve practical problems without advanced mathematics. Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems is easy to understand, requiring only a knowledge of undergraduate-level calculus and simple computer programming. The book is also practical; it includes descriptions of various industrial-strength engineering applications and offers Fortran code for polynomial solvers on an associated Web page. It provides a resource for high-school and undergraduate mathematics projects."

"Originally presented as lectures, the theme of this volume is that one studies orthogonal polynomials and special functions not for their own sake, but to be able to use them to solve problems. The author presents problems suggested by the isometric embedding of projective spaces in other projective spaces, by the desire to construct large classes of univalent functions, by applications to quadrature problems, and theorems on the location of zeros of trigonometric polynomials. There are also applications to combinatorial problems, statistics, and physical problems."

"In many important areas of scientific computing, polynomials in one or more variables are employed in the mathematical modeling of real-life phenomena; yet most of classical computer algebra assumes exact rational data. This book is the first comprehensive treatment of the emerging area of numerical polynomial algebra, an area that falls between classical numerical analysis and classical computer algebra but, surprisingly, has received little attention so far.The author introduces a conceptual framework that permits the meaningful solution of various algebraic problems with multivariate polynomial equations whose coefficients have some indeterminacy; for this purpose, he combines approaches of both numerical linear algebra and commutative algebra. For the application scientist, Numerical Polynomial Algebra provides both a survey of polynomial problems in scientific computing that may be solved numerically and a guide to their numerical treatment. In addition, the book provides both introductory sections and novel extensions of numerical analysis and computer algebra, making it accessible to the reader with expertise in either one of these areas."

"The book develops the classical Chebyshev's approach which gives analytical representation for the solution in terms of Riemann surfaces. The techniques born in the remote (at the first glance) branches of mathematics such as complex analysis, Riemann surfaces and Teichmüller theory, foliations, braids, topology are applied to approximation problems. The key feature of this book is the usage of beautiful ideas of contemporary mathematics for the solution of applied problems and their effective numerical realization. This is one of the few books where the computational aspects of the higher genus Riemann surfaces are illuminated. Effective work with the moduli spaces of algebraic curves provides wide opportunities for numerical experiments in mathematics and theoretical physics.​"

"Biased towards functional methods, this work presents a polynomial approach to Linear Algebra. Using the shift operator as a central object it makes linear algebra a suitable introduction to other areas of mathematics, particularly operator theory."

"In this brief the authors discuss some important subclasses of polynomial optimization models arising from various applications, with a focus on approximations algorithms with guaranteed worst case performance analysis. The brief presents a clear view of the basic ideas underlying the design of such algorithms and the benefits are highlighted by illustrative examples showing the possible applications."

"Starting with matrices over the integers, part 1 of this book provides a measured introduction to such groups, two finitely generated abelian groups are isomorphic if and only if their invariant factor sequences are identical. The analogous theory of matrix similarity over a field is then developed in part 2 starting with matrices having polynomial entries, two matrices over a field are similar if and only if their rational canonical forms are equal. Under certain conditions each matrix is similar to a diagonal or nearly diagonal matrix, namely its Jordan form."

"This book presents different approaches to a rigorous unified description of quantum fields and gravity. It contains a carefully selected cross-section of lively discussions which took place in autumn 2010 at the fifth conference "Quantum field theory and gravity, conceptual and mathematical advances in the search for a unified framework" in Regensburg, Germany. In the tradition of the other proceedings covering this series of conferences, a special feature of this book is the exposition of a wide variety of approaches, with the intention to facilitate a comparison. "