Hasil Pencarian  ::  Simpan CSV :: Kembali

"This clearly written, self-contained volume studies the basic equations of kinetic theory in all of space. It contains up-to-date, state-of-the-art treatments of initial-value problems for the major kinetic equations, including the Boltzmann equation (from rarefied gas dynamics) and the Vlasov-Poisson/Vlasov-Maxwell systems (from plasma physics). This is the only existing book to treat Boltzmann-type problems and Vlasov-type problems together. Although these equations describe very different phenomena, they share the same streaming term. The author proves that solutions starting from a given configuration at an initial time exist for all future times by imposing appropriate hypotheses on the initial values in several important cases. He emphasizes those questions that a mathematician would ask first: Is there a solution to this problem? Is it unique? Can it be numerically approximated? The topics treated include the study of the Boltzmann collision operator, the study of the initial-value problem for the Boltzmann equation with "small" and "near equilibrium" data, global smooth solvability of the initial-value problem for the Vlasov-Poisson system with smooth initial data of unrestricted size, conditions under which the initial-value problem for the Vlasov-Maxwell system has global-in-time solutions (in both the smooth and weak senses), and more."

"This book presents the first in-depth, complete, and unified theoretical discussion of the two most important classes of algorithms for solving matrix eigenvalue problems: QR-like algorithms for dense problems and Krylov subspace methods for sparse problems. The author discusses the theory of the generic GR algorithm, including special cases (for example, QR, SR, HR), and the development of Krylov subspace methods. Also addressed are a generic Krylov process and the Arnoldi and various Lanczos algorithms, which are obtained as special cases. The chapter on product eigenvalue problems provides further unification, showing that the generalized eigenvalue problem, the singular value decomposition problem, and other product eigenvalue problems can all be viewed as standard eigenvalue problems."

"This book presents, in a uniform way, several problems in applied mechanics, which are analysed using the matrix theory and the properties of eigenvalues and eigenvectors. It reveals that various problems and studies in mechanical engineering produce certain patterns that can be treated in a similar way. Accordingly, the same mathematical apparatus allows us to study not only mathematical structures such as quadratic forms, but also mechanics problems such as multibody rigid mechanics, continuum mechanics, vibrations, elastic and dynamic stability, and dynamic systems. In addition, the book explores a wealth of engineering applications. "

"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."

"First published in 1985, Lanczos Algorithms for Large Symmetric Eigenvalue Computations; Vol. I: Theory presents background material, descriptions, and supporting theory relating to practical numerical algorithms for the solution of huge eigenvalue problems. This book deals with "symmetric" problems. However, in this book, "symmetric" also encompasses numerical procedures for computing singular values and vectors of real rectangular matrices and numerical procedures for computing eigenelements of nondefective complex symmetric matrices.Although preserving orthogonality has been the golden rule in linear algebra, most of the algorithms in this book conform to that rule only locally, resulting in markedly reduced memory requirements. Additionally, most of the algorithms discussed separate the eigenvalue (singular value) computations from the corresponding eigenvector (singular vector) computations. This separation prevents losses in accuracy that can occur in methods which, in order to be able to compute further into the spectrum, use successive implicit deflation by computed eigenvector or singular vector approximations.This book continues to be useful to the mathematical, scientific, and engineering communities as a reservoir of information detailing the nonclassical side of Lanczos algorithms and as a presentation of what continues to be the most efficient methods for certain types of large-scale eigenvalue computations."

"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."

"This book describes, in a common framework, new and existing numerical methods for the analysis and solution of rank-deficient and discrete ill-posed problems. The emphasis is on insight into the stabilizing properties of the algorithms and on the efficiency and reliability of the computations. The setting is that of numerical linear algebra rather than abstract functional analysis, and the theoretical development is complemented with numerical examples and figures that illustrate the features of the various algorithms."