You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
The conventional numerical methods when applied to multidimensional problems suffer from the so-called "curse of dimensionality", that cannot be eliminated by using parallel architectures and high performance computing. The novel tensor numerical methods are based on a "smart" rank-structured tensor representation of the multivariate functions and operators discretized on Cartesian grids thus reducing solution of the multidimensional integral-differential equations to 1D calculations. We explain basic tensor formats and algorithms and show how the orthogonal Tucker tensor decomposition originating from chemometrics made a revolution in numerical analysis, relying on rigorous results from app...
During the last decade essential progress has been achieved in the analysis and implementation of multilevel/rnultigrid and domain decomposition methods to explore a variety of real world applications. An important trend in mod ern numerical simulations is the quick improvement of computer technology that leads to the well known paradigm (see, e. g. , [78,179]): high-performance computers make it indispensable to use numerical methods of almost linear complexity in the problem size N, to maintain an adequate scaling between the computing time and improved computer facilities as N increases. In the h-version of the finite element method (FEM), the multigrid iteration real izes an O(N) solver ...
The most difficult computational problems nowadays are those of higher dimensions. This research monograph offers an introduction to tensor numerical methods designed for the solution of the multidimensional problems in scientific computing. These methods are based on the rank-structured approximation of multivariate functions and operators by using the appropriate tensor formats. The old and new rank-structured tensor formats are investigated. We discuss in detail the novel quantized tensor approximation method (QTT) which provides function-operator calculus in higher dimensions in logarithmic complexity rendering super-fast convolution, FFT and wavelet transforms. This book suggests the co...
The tenth conference on The Mathematics of Finite Elements and Applications, MAFELAP 1999, was held at Brunel University during the period 22-25 June, 1999. This book seeks to highlight certain aspects of the state-of-the-art theory and applications of finite element methods of that time.This latest conference, in the MAFELAP series, followed the well established MAFELAP pattern of bringing together mathematicians, engineers and others interested in the field to discuss finite element techniques.In the MAFELAP context finite elements have always been interpreted in a broad and inclusive manner, including techniques such as finite difference, finite volume and boundary element methods as well as actual finite element methods. Twenty-six papers were carefully selected for this book out of the 180 presentations made at the conference, and all of these reflect this style and approach to finite elements. The increasing importance of modelling, in addition to numerical discretization, error estimation and adaptivity was also studied in MAFELAP 1999.
This volume presents the proceedings of the 11th Conference on Problems and Methods in Mathematical Physics (11th TMP), held in Chemnitz, March 25-28, 1999. The conference was dedicated to the memory of Siegfried Prössdorf, who made important contributions to the theory and numerical analysis of operator equations and their applications in mathematical physics and mechanics. The main part of the book comprises original research papers. The topics are ranging from integral and pseudodifferential equations, boundary value problems, operator theory, boundary element and wavelet methods, approximation theory and inverse problems to various concrete problems and applications in physics and engineering, and reflect Prössdorf's broad spectrum of research activities. The volume also contains articles describing the life and mathematical achievements of Siegfried Prössdorf and includes a list of his publications. The book is addressed to a wide audience in the mathematical and engineering sciences.
Domain decomposition is an active, interdisciplinary research area that is devoted to the development, analysis and implementation of coupling and decoupling strategies in mathematics, computational science, engineering and industry. A series of international conferences starting in 1987 set the stage for the presentation of many meanwhile classical results on substructuring, block iterative methods, parallel and distributed high performance computing etc. This volume contains a selection from the papers presented at the 15th International Domain Decomposition Conference held in Berlin, Germany, July 17-25, 2003 by the world's leading experts in the field. Its special focus has been on numerical analysis, computational issues,complex heterogeneous problems, industrial problems, and software development.
A thorough and elegant treatment of the theory of matrix functions and numerical methods for computing them, including an overview of applications, new and unpublished research results, and improved algorithms. Key features include a detailed treatment of the matrix sign function and matrix roots; a development of the theory of conditioning and properties of the Fre;chet derivative; Schur decomposition; block Parlett recurrence; a thorough analysis of the accuracy, stability, and computational cost of numerical methods; general results on convergence and stability of matrix iterations; and a chapter devoted to the f(A)b problem. Ideal for advanced courses and for self-study, its broad content, references and appendix also make this book a convenient general reference. Contains an extensive collection of problems with solutions and MATLAB implementations of key algorithms.
Optimal feedback control arises in different areas such as aerospace engineering, chemical processing, resource economics, etc. In this context, the application of dynamic programming techniques leads to the solution of fully nonlinear Hamilton-Jacobi-Bellman equations. This book presents the state of the art in the numerical approximation of Hamilton-Jacobi-Bellman equations, including post-processing of Galerkin methods, high-order methods, boundary treatment in semi-Lagrangian schemes, reduced basis methods, comparison principles for viscosity solutions, max-plus methods, and the numerical approximation of Monge-Ampère equations. This book also features applications in the simulation of ...
This book introduces the mathematical concepts that underpin computer graphics. It is written in an approachable way, without burdening readers with the skills of ow to do'things. The author discusses those aspects of mathematics that relate to the computer synthesis of images, and so gives users a better understanding of the limitations of computer graphics systems. Users of computer graphics who have no formal training and wish to understand the essential foundations of computer graphics systems will find this book very useful, as will mathematicians who want to understand how their subject is used in computer image synthesis. '