| Author | : Victor Y. Pan |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 299 |
| Release | : 2012-12-06 |
| Genre | : Mathematics |
| ISBN | : 1461201292 |
This user-friendly, engaging textbook makes the material accessible to graduate students and new researchers who wish to study the rapidly exploding area of computations with structured matrices and polynomials. The book goes beyond research frontiers and, apart from very recent research articles, includes previously unpublished results.
| Author | : Vadim Olshevsky |
| Publisher | : American Mathematical Soc. |
| Total Pages | : 448 |
| Release | : 2003 |
| Genre | : Mathematics |
| ISBN | : 0821831771 |
One of the best known fast computational algorithms is the fast Fourier transform method. Its efficiency is based mainly on the special structure of the discrete Fourier transform matrix. Recently, many other algorithms of this type were discovered, and the theory of structured matrices emerged. This volume contains 22 survey and research papers devoted to a variety of theoretical and practical aspects of the design of fast algorithms for structured matrices and related issues. Included are several papers containing various affirmative and negative results in this direction. The theory of rational interpolation is one of the excellent sources providing intuition and methods to design fast algorithms. The volume contains several computational and theoretical papers on the topic. There are several papers on new applications of structured matrices, e.g., to the design of fast decoding algorithms, computing state-space realizations, relations to Lie algebras, unconstrained optimization, solving matrix equations, etc. The book is suitable for mathematicians, engineers, and numerical analysts who design, study, and use fast computational algorithms based on the theory of structured matrices.
| Author | : T. Kailath |
| Publisher | : SIAM |
| Total Pages | : 350 |
| Release | : 1999-01-01 |
| Genre | : Computers |
| ISBN | : 0898714311 |
This book deals with the combined issues of speed and numerical reliability in algorithm development.
| Author | : Dario Bini |
| Publisher | : Nova Biomedical Books |
| Total Pages | : 222 |
| Release | : 2001 |
| Genre | : Mathematics |
| ISBN | : |
Mathematicians from various countries assemble computational techniques that have developed and described over the past two decades to analyze matrices with structure, which are encountered in a wide variety of problems in pure and applied mathematics and in engineering. The 16 studies are on asymptotical spectral properties; algorithm design and analysis; issues specifically relating to structures, algebras, and polynomials; and image processing and differential equations. c. Book News Inc.
| Author | : T. Kailath |
| Publisher | : SIAM |
| Total Pages | : 351 |
| Release | : 1999-01-01 |
| Genre | : Computers |
| ISBN | : 9781611971354 |
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.
| Author | : Peter Arbenz |
| Publisher | : Nova Publishers |
| Total Pages | : 228 |
| Release | : 1998 |
| Genre | : Business & Economics |
| ISBN | : 9781560725947 |
Comprises 10 contributions that summarize the state of the art in the areas of high performance solutions of structured linear systems and structured eigenvalue and singular-value problems. Topics covered range from parallel solvers for sparse or banded linear systems to parallel computation of eigenvalues and singular values of tridiagonal and bidiagonal matrices. Specific paper topics include: the stable parallel solution of general narrow banded linear systems; efficient algorithms for reducing banded matrices to bidiagonal and tridiagonal form; a numerical comparison of look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems; and parallel CG-methods automatically optimized for PC and workstation clusters. Annotation copyrighted by Book News, Inc., Portland, OR
| Author | : Leslie Hogben |
| Publisher | : CRC Press |
| Total Pages | : 1838 |
| Release | : 2013-11-26 |
| Genre | : Mathematics |
| ISBN | : 1466507292 |
With a substantial amount of new material, the Handbook of Linear Algebra, Second Edition provides comprehensive coverage of linear algebra concepts, applications, and computational software packages in an easy-to-use format. It guides you from the very elementary aspects of the subject to the frontiers of current research. Along with revisions and
| Author | : Paola Boito |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 208 |
| Release | : 2012-03-13 |
| Genre | : Mathematics |
| ISBN | : 8876423818 |
Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a classical problem in symbolic-numeric computation. The first part of this book reviews the main results that have been proposed so far in the literature. As usual with polynomial computations, the polynomial GCD problem can be expressed in matrix form: the second part of the book focuses on this point of view and analyses the structure of the relevant matrices, such as Toeplitz, Toepliz-block and displacement structures. New algorithms for the computation of approximate polynomial GCD are presented, along with extensive numerical tests. The use of matrix structure allows, in particular, to lower the asymptotic computational cost from cubic to quadratic order with respect to polynomial degree.
| Author | : Dario Andrea Bini |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 439 |
| Release | : 2011-02-09 |
| Genre | : Mathematics |
| ISBN | : 3764389966 |
This cross-disciplinary volume brings together theoretical mathematicians, engineers and numerical analysts and publishes surveys and research articles related to topics such as fast algorithms, in which the late Georg Heinig made outstanding achievements.
