Hasil Pencarian  ::  Simpan CSV :: Kembali

"This unique book addresses advanced linear algebra from a perspective in which invariant subspaces are the central notion and main tool. It contains comprehensive coverage of geometrical, algebraic, topological, and analytic properties of invariant subspaces. The text lays clear mathematical foundations for linear systems theory and contains a thorough treatment of analytic perturbation theory for matrix functions."

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

"Here is a book that provides the classical foundations of invariant imbedding, a concept that provided the first indication of the connection between transport theory and the Riccati Equation. The reprinting of this classic volume was prompted by a revival of interest in the subject area because of its uses for inverse problems. The major part of the book consists of applications of the invariant imbedding method to specific areas that are of interest to engineers, physicists, applied mathematicians, and numerical analysts. A large set of problems can be found at the end of each chapter. Numerous problems on apparently disparate matters such as Riccati equations, continued fractions, functional equations, and Laplace transforms are included. The exercises present the reader with "real-life" situations. The material is accessible to a general audience, however, the authors do not hesitate to state, and even to prove, a rigorous theorem when one is available. To keep the original flavor of the book, very few changes were made to the manuscript; typographical errors were corrected and slight changes in word order were made to reduce ambiguities."

"This book is the first to pay special attention to the combined issues of speed and numerical reliability in algorithm development. These two requirements have often been regarded as competitive, so much so that the design of fast and numerically reliable algorithms for large-scale structured systems of linear equations, in many cases, remains a significant open issue. Fast Reliable Algorithms for Matrices with Structure helps bridge this gap by providing the reader with recent contributions written by leading experts in the field.The authors deal with both the theory and the practice of fast numerical algorithms for large-scale structured linear systems. Each chapter covers in detail different aspects of the most recent trends in the theory of fast algorithms, with emphasis on implementation and application issues. Both direct and iterative methods are covered.This book is not merely a collection of articles. The editors have gone to considerable lengths to blend the individual papers into a consistent presentation. Each chapter exposes the reader to some of the most recent research while providing enough background material to put the work into proper context."

"This self-contained introduction to the behavior of several spectral characteristics of large Toeplitz band matrices is the first systematic presentation of a relatively large body of knowledge. Covering everything from classic results to the most recent developments, Spectral Properties of Banded Toeplitz Matrices is an important resource. The spectral characteristics include determinants, eigenvalues and eigenvectors, pseudospectra and pseudomodes, singular values, norms, and condition numbers. Toeplitz matrices emerge in many applications and the literature on them is immense. They remain an active field of research with many facets, and the material on banded ones until now has primarily been found in research papers."