Focusing on special matrices and matrices which are in some sense `near’ to structured matrices, this volume covers a broad range of topics of current interest in numerical linear algebra. Exploitation of these less obvious structural properties can be of great importance in the design of efficient numerical methods, for example algorithms for matrices with low-rank block structure, matrices with decay, and structured tensor computations. Applications range from quantum chemistry to queuing theory. Structured matrices arise frequently in applications. Examples include banded and sparse matrices, Toeplitz-type matrices, and matrices with semi-separable or quasi-separable structure, as well as Hamiltonian and symplectic matrices. The associated literature is enormous, and many efficient algorithms have been developed for solving problems involving such matrices. The text arose from a C.I.M.E. course held in Cetraro (Italy) in June 2015 which aimed to present this fast growing field to young researchers, exploiting the expertise of five leading lecturers with different theoretical and application perspectives.

This book presents prospective, industrially proven methods and software solutions for storing, processing, and viewing multimedia content on digital cameras, camcorders, TV, and mobile devices. Most of the algorithms described here are implemented as systems on chip firmware or as software products and have low computational complexity and memory consumption. In the four parts of the book, which contains a total of 16 chapters, the authors address solutions for the conversion of images and videos by super-resolution, depth estimation and control and mono-to-stereo (2D to 3D) conversion; display applications by video editing; the real-time detection of sport episodes; and the generation and reproduction of natural effects. The practical principles of machine learning are illustrated using technologies such as image classification as a service, mobile user profiling, and automatic view planning with dictionary-based compressed sensing in magnetic resonance imaging. The implementation of these technologies in mobile devices is discussed in relation to algorithms using a depth camera based on a colour-coded aperture, the animated graphical abstract of an image, a motion photo, and approaches and methods for iris recognition on mobile platforms. The book reflects the authors’ practical experience in the development of algorithms for industrial R&D and the commercialization of technologies. Explains digital techniques for digital cameras, camcorders, TV, mobile devices; Offers essential algorithms for the processing pipeline in multimedia devices and accompanying software tools; Features advanced topics on data processing, addressing current technology challenges.

The volume features high-quality papers based on the presentations at the ICOSAHOM 2020+1 on spectral and high order methods. The carefully reviewed articles cover state of the art topics in high order discretizations of partial differential equations. The volume presents a wide range of topics including the design and analysis of high order methods, the development of fast solvers on modern computer architecture, and the application of these methods in fluid and structural mechanics computations.

This book is primarily intended as a research monograph that could also be used in graduate courses for the design of parallel algorithms in matrix computations. It assumes general but not extensive knowledge of numerical linear algebra, parallel architectures, and parallel programming paradigms. The book consists of four parts: (I) Basics; (II) Dense and Special Matrix Computations; (III) Sparse Matrix Computations; and (IV) Matrix functions and characteristics. Part I deals with parallel programming paradigms and fundamental kernels, including reordering schemes for sparse matrices. Part II is devoted to dense matrix computations such as parallel algorithms for solving linear systems, linear least squares, the symmetric algebraic eigenvalue problem, and the singular-value decomposition. It also deals with the development of parallel algorithms for special linear systems such as banded ,Vandermonde ,Toeplitz ,and block Toeplitz systems. Part III addresses sparse matrix computations: (a) the development of parallel iterative linear system solvers with emphasis on scalable preconditioners, (b) parallel schemes for obtaining a few of the extreme eigenpairs or those contained in a given interval in the spectrum of a standard or generalized symmetric eigenvalue problem, and (c) parallel methods for computing a few of the extreme singular triplets. Part IV focuses on the development of parallel algorithms for matrix functions and special characteristics such as the matrix pseudospectrum and the determinant. The book also reviews the theoretical and practical background necessary when designing these algorithms and includes an extensive bibliography that will be useful to researchers and students alike. The book brings together many existing algorithms for the fundamental matrix computations that have a proven track record of efficient implementation in terms of data locality and data transfer on state-of-the-art systems, as well as several algorithms that are presented for the first time, focusing on the opportunities for parallelism and algorithm robustness.

This book gathers selected contributions presented at the INdAM Meeting Structured Matrices in Numerical Linear Algebra: Analysis, Algorithms and Applications, held in Cortona, Italy on September 4-8, 2017. Highlights cutting-edge research on Structured Matrix Analysis, it covers theoretical issues, computational aspects, and applications alike. The contributions, written by authors from the foremost international groups in the community, trace the main research lines and treat the main problems of current interest in this field. The book offers a valuable resource for all scholars who are interested in this topic, including researchers, PhD students and post-docs.

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.

Part of a four-volume set, this book constitutes the refereed proceedings of the 7th International Conference on Computational Science, ICCS 2007, held in Beijing, China in May 2007. The papers cover a large volume of topics in computational science and related areas, from multiscale physics to wireless networks, and from graph theory to tools for program development.

Tensors for Data Processing: Theory, Methods and Applications presents both classical and state-of-the-art methods on tensor computation for data processing, covering computation theories, processing methods, computing and engineering applications, with an emphasis on techniques for data processing. This reference is ideal for students, researchers and industry developers who want to understand and use tensor-based data processing theories and methods. As a higher-order generalization of a matrix, tensor-based processing can avoid multi-linear data structure loss that occurs in classical matrix-based data processing methods. This move from matrix to tensors is beneficial for many diverse application areas, including signal processing, computer science, acoustics, neuroscience, communication, medical engineering, seismology, psychometric, chemometrics, biometric, quantum physics and quantum chemistry. - Provides a complete reference on classical and state-of-the-art tensor-based methods for data processing - Includes a wide range of applications from different disciplines - Gives guidance for their application

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.