Hasil Pencarian  ::  Simpan CSV :: Kembali

"Large-scale problems of engineering and scientific computing often require solutions of eigenvalue and related problems. This book gives a unified overview of theory, algorithms, and practical software for eigenvalue problems. It organizes this large body of material to make it accessible for the first time to the many nonexpert users who need to choose the best state-of-the-art algorithms and software for their problems. Using an informal decision tree, just enough theory is introduced to identify the relevant mathematical structure that determines the best algorithm for each problem.The algorithms and software at the "leaves" of the decision tree range from the classical QR algorithm, which is most suitable for small dense matrices, to iterative algorithms for very large generalized eigenvalue problems. Algorithms are presented in a unified style as templates, with different levels of detail suitable for readers ranging from beginning students to experts. The authors' comprehensive treatment includes a treasure of further bibliographic information."

"This book is a guide to understanding and using the software package ARPACK to solve large algebraic eigenvalue problems. The software described is based on the implicitly restarted Arnoldi method, which has been heralded as one of the three most important advances in large scale eigenanalysis in the past ten years. The book explains the acquisition, installation, capabilities, and detailed use of the software for computing a desired subset of the eigenvalues and eigenvectors of large (sparse) standard or generalized eigenproblems. It also discusses the underlying theory and algorithmic background at a level that is accessible to the general practitioner."

"In this book, which focuses on the use of iterative methods for solving large sparse systems of linear equations, templates are introduced to meet the needs of both the traditional user and the high-performance specialist. Templates, a description of a general algorithm rather than the executable object or source code more commonly found in a conventional software library, offer whatever degree of customization the user may desire. Templates offer three distinct advantages: they are general and reusable; they are not language specific; and they exploit the expertise of both the numerical analyst, who creates a template reflecting in-depth knowledge of a specific numerical technique, and the computational scientist, who then provides "value-added" capability to the general template description, customizing it for specific needs. For each template that is presented, the authors provide: a mathematical description of the flow of algorithm; discussion of convergence and stopping criteria to use in the iteration; suggestions for applying a method to special matrix types; advice for tuning the template; tips on parallel implementations; and hints as to when and why a method is useful."

"This book contains an exposition of several results related with direct and converse theorems in the theory of approximation by algebraic polynomials in a finite interval. In addition, some facts concerning trigonometric approximation that are necessary for motivation and comparisons are included. The selection of papers that are referenced and discussed document some trends in polynomial approximation from the 1950s to the present day."

"Many physical problems are most naturally described by systems of differential and algebraic equations. This book describes some of the places where differential-algebraic equations (DAE's) occur. The basic mathematical theory for these equations is developed and numerical methods are presented and analyzed. Examples drawn from a variety of applications are used to motivate and illustrate the concepts and techniques. This classic edition, originally published in 1989, is the only general DAE book available. It not only develops guidelines for choosing different numerical methods, it is the first book to discuss DAE codes, including the popular DASSL code. An extensive discussion of backward differentiation formulas details why they have emerged as the most popular and best understood class of linear multistep methods for general DAE's. New to this edition is a chapter that brings the discussion of DAE software up to date. The objective of this monograph is to advance and consolidate the existing research results for the numerical solution of DAE's. The authors present results on the analysis of numerical methods, and also show how these results are relevant for the solution of problems from applications. They develop guidelines for problem formulation and effective use of the available mathematical software and provide extensive references for further study."