You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Revised and updated, the third edition of Golub and Van Loan's classic text in computer science provides essential information about the mathematical background and algorithmic skills required for the production of numerical software. This new edition includes thoroughly revised chapters on matrix multiplication problems and parallel matrix computations, expanded treatment of CS decomposition, an updated overview of floating point arithmetic, a more accurate rendition of the modified Gram-Schmidt process, and new material devoted to GMRES, QMR, and other methods designed to handle the sparse unsymmetric linear system problem.
Here is an overview of modern computational stabilization methods for linear inversion, with applications to a variety of problems in audio processing, medical imaging, tomography, seismology, astronomy, and other areas. Rank-deficient problems involve matrices that are either exactly or nearly rank deficient. Such problems often arise in connection with noise suppression and other problems where the goal is to suppress unwanted disturbances of the given measurements. Discrete ill-posed problems arise in connection with the numerical treatment of inverse problems, where one typically wants to compute information about some interior properties using exterior measurements. Examples of inverse ...
This volume is the first in a self-contained five-volume series devoted to matrix algorithms. It focuses on the computation of matrix decompositions--that is, the factorization of matrices into products of similar ones. The first two chapters provide the required background from mathematics and computer science needed to work effectively in matrix computations. The remaining chapters are devoted to the LU and QR decompositions--their computation and applications. The singular value decomposition is also treated, although algorithms for its computation will appear in the second volume of the series. The present volume contains 65 algorithms formally presented in pseudocode. Other volumes in t...
This revised edition provides the mathematical background and algorithmic skills required for the production of numerical software. It includes rewritten and clarified proofs and derivations, as well as new topics such as Arnoldi iteration, and domain decomposition methods.
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. This book also addresses a generic Krylov process and the Arnoldi and various Lanczos algorithms, which are obtained as special cases. Theoretical and computational exercises guide students, step by step, to the results. Downloadable MATLAB programs, compiled by the author, are available on a supplementary Web site. Readers of this book are expected to be familiar with the basic ideas of linear algebra and to have had some experience with matrix computations. Ideal for graduate students, or as a reference book for researchers and users of eigenvalue codes.
LAPACK95 is a Fortran 95 interface to the Fortran 77 LAPACK library. It is relevant for anyone who writes in the Fortran 95 language and needs reliable software for basic numerical linear algebra. It improves upon the original user-interface to the LAPACK package, taking advantage of the considerable simplifications that Fortran 95 allows. LAPACK95 Users' Guide provides an introduction to the design of the LAPACK95 package, a detailed description of its contents, reference manuals for the leading comments of the routines, and example programs.
The NATO Advanced Study Institute on "Algorithms for continuous optimiza tion: the state of the art" was held September 5-18, 1993, at II Ciocco, Barga, Italy. It was attended by 75 students (among them many well known specialists in optimiza tion) from the following countries: Belgium, Brasil, Canada, China, Czech Republic, France, Germany, Greece, Hungary, Italy, Poland, Portugal, Rumania, Spain, Turkey, UK, USA, Venezuela. The lectures were given by 17 well known specialists in the field, from Brasil, China, Germany, Italy, Portugal, Russia, Sweden, UK, USA. Solving continuous optimization problems is a fundamental task in computational mathematics for applications in areas of engineering...
This volume presents the proceedings of the First International workshop on Parallel Scientific Computing, PARA '94, held in Lyngby, Denmark in June 1994. It reports interdisciplinary work done by mathematicians, scientists and engineers working on large-scale computational problems in discussion with computer science specialists in the field of parallel methods and the efficient exploitation of modern high-performance computing resources. The 53 full refereed papers provide a wealth of new results: an up-to-date overview on high-speed computing facilities, including different parallel and vector computers as well as workstation clusters, is given and the most important numerical algorithms, with a certain emphasis on computational linear algebra, are investigated.
This volume presents the refereed proceedings of the Guangzhou International Symposium on Computational Mathematics, held at the Zhongshan University, People's Republic of China. Nearly 90 international mathematicians examine numerical optimization methods, wavelet analysis, computational approximation, numerical solutions of differential and integral equations, numerical linear algebra, inverse and ill-posed problems, geometric modelling, and signal and image processing and their applications.