Algebra Commons^™

Lecture 13: A Low-Rank Factorization Framework For Building Scalable Algebraic Solvers And Preconditioners, X. Sherry Li

Mathematical Sciences Spring Lecture Series

Factorization based preconditioning algorithms, most notably incomplete LU (ILU) factorization, have been shown to be robust and applicable to wide ranges of problems. However, traditional ILU algorithms are not amenable to scalable implementation. In recent years, we have seen a lot of investigations using low-rank compression techniques to build approximate factorizations.
A key to achieving lower complexity is the use of hierarchical matrix algebra, stemming from the H-matrix research. In addition, the multilevel algorithm paradigm provides a good vehicle for a scalable implementation. The goal of this lecture is to give an overview of the various hierarchical matrix formats, such …

Lecture 11: The Road To Exascale And Legacy Software For Dense Linear Algebra, Jack Dongarra

Mathematical Sciences Spring Lecture Series

In this talk, we will look at the current state of high performance computing and look at the next stage of extreme computing. With extreme computing, there will be fundamental changes in the character of floating point arithmetic and data movement. In this talk, we will look at how extreme-scale computing has caused algorithm and software developers to change their way of thinking on implementing and program-specific applications.

Classification Results Of Hadamard Matrices, Gregory Allen Schmidt

Masters Theses

In 1893 Hadamard proved that for any n x n matrix A over the complex numbers, with all of its entries of absolute value less than or equal to 1, it necessarily follows that

|det(A)| ≤ n^n/2 [n raised to the power n divided by two],

with equality if and only if the rows of A are mutually orthogonal and the absolute value of each entry is equal to 1 (See [2], [3]). Such matrices are now appropriately identified as Hadamard matrices, which provides an active area of research in both theoretical and applied fields …

Linear Algebra, Daniel Scully

Math Faculty Publications

Table of Contents:

1. Systems of Linear Equations and Matrices

• Systems of Linear Equations
• Elementary Row Operations
• Row Reduction and Reduced Row-Echelon Form
• Solutions of Systems of Linear Equations
• Matrix Operations
• Matrix Inverses

2. Euclidean 2-Space and 3-Space

• Vectors in the Plane and in Space
• The Dot Product
• Cross Product
• Lines in Space
• Planes in Space

3. Determinants

• The Definition of Determinant
• Elementary Row Operations and the Determinant
• Elementary Matrices and the Determinant
• Applications of the Determinant

4. Vector Spaces and Subspaces

• Vector Spaces
• Subspaces
• Linear Dependence and Independence
• Basis and Dimension

5. Linear Transformations

• Definition of Linear Transformation
• The …

Distance In Matrices And Their Applications To Fuzzy Models And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of distance between any two m  n matrices. If the distance is 0 or m  n there is nothing interesting. When the distance happens to be a value t; 0 < t < m  n the study is both innovating and interesting. The three cases of study which is carried out in this book are 1. If the difference between two square matrices is large, will it imply the eigen values and eigen vectors of those matrices are distinct? Several open conjectures in this direction are given. 2. The difference between parity check matrix and the generator matrix for the same C(n, k) code is studied. This will help in detecting errors in storage systems as well as in cryptography.

The Complexity Of Linear Algebra, Leann Kay Christensen

Theses Digitization Project

This study examines the complexity of linear algebra. Complexity means how much work, or the number of calculations or time it takes to perform a task. As linear algebra is used more and more in different fields, it becomes useful to study ways of reducing the amount of work required to complete basic procedures.

Innovative Uses Of Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy, Indra Venkatbabu

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors bring out the innovative applications of matrices defined, described and developed by them. Here they do not include the natural product on matrices newly described and defined by them in the book on ‘natural product ×n on matrices’.

This book is organized into seven chapters. The first one is introductory in nature. In the second chapter authors give the unique and new way of analyzing the data which is time dependent. We construct three types of matrices called Average Time Dependent data matrix (ATD matrix), Refined Time Dependent Data matrix (RTD matrix) and Combined Effective Time …

Neutrosophic Super Matrices And Quasi Super Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors study neutrosophic super matrices. The concept of neutrosophy or indeterminacy happens to be one the powerful tools used in applications like FCMs and NCMs where the expert seeks for a neutral solution. Thus this concept has lots of applications in fuzzy neutrosophic models like NRE, NAM etc. These concepts will also find applications in image processing where the expert seeks for a neutral solution. Here we introduce neutrosophic super matrices and show that the sum or product of two neutrosophic matrices is not in general a neutrosophic super matrix. Another interesting feature of this book is …

Information-Preserving Structures: A General Framework For Quantum Zero-Error Information, Robin Blume-Kohout, Hui Khoon Ng, David Poulin, Lorenza Viola

Dartmouth Scholarship

Quantum systems carry information. Quantum theory supports at least two distinct kinds of information (classical and quantum), and a variety of different ways to encode and preserve information in physical systems. A system’s ability to carry information is constrained and defined by the noise in its dynamics. This paper introduces an operational framework, using information-preserving structures, to classify all the kinds of information that can be perfectly (i.e., with zero error) preserved by quantum dynamics. We prove that every perfectly preserved code has the same structure as a matrix algebra, and that preserved information can always be corrected. We …

Special Fuzzy Matrices For Social Scientists, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

This book is a continuation of the book, "Elementary fuzzy matrix and fuzzy models for socio-scientists" by the same authors. This book is a little advanced because we introduce a multi-expert fuzzy and neutrosophic models. It mainly tries to help social scientists to analyze any problem in which they need multi-expert systems with multi-models. To cater to this need, we have introduced new classes of fuzzy and neutrosophic special matrices. The first chapter is essentially spent on introducing the new notion of different types of special fuzzy and neutrosophic matrices, and the simple operations on them which are needed in …