yOur goal in this paper is to discuss various issues we have encountered in trying to find and implement efficient solvers for a boundary integral equation (BIE) formulation of an iterative method for solving a recons...
详细信息
yOur goal in this paper is to discuss various issues we have encountered in trying to find and implement efficient solvers for a boundary integral equation (BIE) formulation of an iterative method for solving a reconstruction problem. We survey some methods from numerical linear algebra, which are relevant for the solution of this class of inverse problems. We motivate the use of our constructing algorithm, discuss its implementation and mention the use of preconditioned Krylov methods. (C) 2003 Elsevier B.V. All rights reserved.
My dissertation project addresses the integration of numerical linear algebra approaches to the field of computer graphics and visualization, especially physically-based Fluid Animations. I mainly focus on (matrix) de...
详细信息
ISBN:
(纸本)9781450370219
My dissertation project addresses the integration of numerical linear algebra approaches to the field of computer graphics and visualization, especially physically-based Fluid Animations. I mainly focus on (matrix) decomposition techniques with regard to spectral theory and related concepts. In many applications of Fluid Animations, in particular particle-based ones, these techniques are not consulted due to its irregular nature. However, the use of spectral-theoretic approaches leads to both theoretical insights and practical enhancements of the algorithm in terms of precision, efficiency, and stability. My research is conducted at the University of Stuttgart and at the Hochschule der Medien, Stuttgart, where I am a member of the joint graduate school Digital Media.
Data analysis is a process of inspecting and obtaining useful information from the data, with the goal of knowledge and scientific discovery. It brings together several disciplines in mathematics and computer science,...
详细信息
Data analysis is a process of inspecting and obtaining useful information from the data, with the goal of knowledge and scientific discovery. It brings together several disciplines in mathematics and computer science, including statistics, machine learning, database, data mining, and pattern recognition, to name just a few. A typical challenge with the current era of information technology is the availability of large volumes of data, together with “the curse of dimensionality”. From the computational point of view, such a challenge urges efficient algorithms that can scale with the size and the dimension of the data. numerical linear algebra lays a solid foundation for this task via its rich theory and elegant techniques. There are a large amount of examples which show that numerical linear algebra consists of a crucial ingredient in the process of data analysis. In this thesis, we elaborate on the above viewpoint via four problems, all of which have significant real-world applications. We propose efficient algorithms based on matrix techniques for solving each problem, with guaranteed low computational costs and high quality results. In the first scenario, a set of so called Lanczos vectors are used as an alternative to the principal eigenvectors/singular vectors in some processes of reducing the dimension of the data. The Lanczos vectors can be computed inexpensively, and they can be used to preserve the latent information of the data, resulting in a quality as good as by using eigenvectors/singular vectors. In the second scenario, we consider the construction of a nearest-neighbors graph. Under the framework of divide and conquer and via the use of the Lanczos procedure, two algorithms are designed with sub-quadratic (and close to linear) costs, way more efficient than existing practical algorithms when the data at hand are of very high dimension. In the third scenario, a matrix blocking algorithm for reordering and finding dense diagonal blocks of a sparse matr
Julian Code (https://***/EricDarve/numerical_linear_algebra)numerical linear algebra with Julia provides in-depth coverage of fundamental topics in numerical linear algebra, including how to solve dense and sparse lin...
详细信息
numerical linear algebra with Julia provides in-depth coverage of fundamental topics in numerical linear algebra, including how to solve dense and sparse linear systems, compute QR factorizations, compute the eigendecomposition of a matrix, and solve linear systems using iterative methods such as conjugate gradient. Julia computer code is provided along with implementations in Julia that illustrate concepts and allow readers to explore methods on their own.
Written in a friendly and approachable style, the book contains
Julia code to illustrate concepts and allow readers to explore methods on their own,
mathematical foundations and detailed descriptions of algorithms, and
illustrations and graphics that emphasize core concepts and demonstrate the algorithms.
This classic volume covers the fundamentals of two closely related topics: linear systems (linear equations and least-squares) and linear programming (optimizing a linear function subject to linear constraints). For e...
详细信息
ISBN:
(数字)9781611976571
ISBN:
(纸本)9781611976564
This classic volume covers the fundamentals of two closely related topics: linear systems (linear equations and least-squares) and linear programming (optimizing a linear function subject to linear constraints). For each problem class, stable and efficient numerical algorithms intended for a finite-precision environment are derived and analyzed. While linearalgebra and optimization have made huge advances since this book first appeared in 1991, the fundamental principles have not changed.
This book
provides a unified perspective and covers certain topics in a non-standard and interesting form;
includes material that can be difficult to find elsewhere—in particular, techniques for updating the LU factorization, descriptions of the simplex method applied to all-inequality form, and the analysis of what happens when using an approximate inverse to solve Ax=b;
enhances understanding through the inclusion of numerous exercises.
numerical linear algebra and Optimization is primarily a reference for students who want to learn about numerical techniques for solving linear systems and/or linear programming using the simplex method; however, Chapters 6, 7, and 8 can be used as the text for an upper-division course on linear least squares and linear programming.
Extreme scale supercomputers available before the end of this decade are expected to have 100 million to 1 billion computing cores. The power and energy efficiency issue has become one of the primary concerns of extre...
详细信息
Extreme scale supercomputers available before the end of this decade are expected to have 100 million to 1 billion computing cores. The power and energy efficiency issue has become one of the primary concerns of extreme scale high performance scientific computing. This paper surveys the research on saving power and energy for numerical linear algebra algorithms in high performance scientific computing on supercomputers around the world. We first stress the significance of numerical linear algebra algorithms in high performance scientific computing nowadays, followed by a background introduction on widely used numerical linear algebra algorithms and software libraries and benchmarks. We summarize commonly deployed power management techniques for reducing power and energy consumption in high performance computing systems by presenting power and energy models and two fundamental types of power management techniques: static and dynamic. Further, we review the research on saving power and energy for high performance numerical linear algebra algorithms from four aspects: profiling, trading off performance, static saving, and dynamic saving, and summarize state-of-the-art techniques for achieving power and energy efficiency in each category individually. Finally, we discuss potential directions of future work and summarize the paper. (C) 2014 Elsevier B.V. All rights reserved.
This survey provides an introduction to the use of randomization in the design of fast algorithms for numerical linear algebra. These algorithms typically examine only a subset of the input to solve basic problems app...
详细信息
This survey provides an introduction to the use of randomization in the design of fast algorithms for numerical linear algebra. These algorithms typically examine only a subset of the input to solve basic problems approximately, including matrix multiplication, regression and low-rank approximation. The survey describes the key ideas and gives complete proofs of the main results in the field. A central unifying idea is sampling the columns (or rows) of a matrix according to their squared lengths.
The mixed sensitivity minimization problem is revisited for a class of single-input-single-output unstable infinite dimensional plants with low order weights. It is shown that H controllers can be computed from the si...
详细信息
The mixed sensitivity minimization problem is revisited for a class of single-input-single-output unstable infinite dimensional plants with low order weights. It is shown that H controllers can be computed from the singularity conditions of a parameterized matrix whose dimension is the same as the order of the sensitivity weight. The result is applied to the design of H controllers with integral action. Connections with the so-called Hamiltonian approach are also established. Copyright (c) 2012 John Wiley & Sons, Ltd.
“A beautifully written textbook offering a distinctive and original treatment.” - Nicholas J. Higham, University of Manchester“Offers a rarely seen integration of computation and theory, illuminated by judiciously ...
详细信息
ISBN:
(数字)9781611977165
ISBN:
(纸本)9781611977158
“A beautifully written textbook offering a distinctive and original treatment.” - Nicholas J. Higham, University of Manchester
“Offers a rarely seen integration of computation and theory, illuminated by judiciously chosen examples.” - Ilse Ipsen, North Carolina State University
“Almost the perfect text to introduce graduate students to the subject.” - Daniel Szyld, Temple University
“An ideal book for a graduate course in numerical linear algebra.” - Suely Oliveira, University of Iowa
暂无评论