The book provides an introduction of very recent results about the tensors and mainly focuses on the authors' work and perspective. A systematic description about how to extend the numerical linear algebra to the numerical multi-linear algebra is also delivered in this book. The authors design the neural network model for the computation of the rank-one approximation of real tensors, a normalization algorithm to convert some nonnegative tensors to plane stochastic tensors and a probabilistic algorithm for locating a positive diagonal in a nonnegative tensors, adaptive randomized algorithms for computing the approximate tensor decompositions, and the QR type method for computing U-eigenpairs of complex tensors. This book could be used for the Graduate course, such as Introduction to Tensor. Researchers may also find it helpful as a reference in tensor research.

The book provides an introduction of very recent results about the tensors and mainly focuses on the authors' work and perspective. A systematic description about how to extend the numerical linear algebra to the numerical multi-linear algebra is also delivered in this book. The authors design the neural network model for the computation of the rank-one approximation of real tensors, a normalization algorithm to convert some nonnegative tensors to plane stochastic tensors and a probabilistic algorithm for locating a positive diagonal in a nonnegative tensors, adaptive randomized algorithms for computing the approximate tensor decompositions, and the QR type method for computing U-eigenpairs of complex tensors. This book could be used for the Graduate course, such as Introduction to Tensor. Researchers may also find it helpful as a reference in tensor research.

This book begins with the fundamentals of the generalized inverses, then moves to more advanced topics. It presents a theoretical study of the generalization of Cramer's rule, determinant representations of the generalized inverses, reverse order law of the generalized inverses of a matrix product, structures of the generalized inverses of structured matrices, parallel computation of the generalized inverses, perturbation analysis of the generalized inverses, an algorithmic study of the computational methods for the full-rank factorization of a generalized inverse, generalized singular value decomposition, imbedding method, finite method, generalized inverses of polynomial matrices, and generalized inverses of linear operators. This book is intended for researchers, postdocs, and graduate students in the area of the generalized inverses with an undergraduate-level understanding of linear algebra.

This book addresses selected topics in the theory of generalized inverses. Following a discussion of the "reverse order law" problem and certain problems involving completions of operator matrices, it subsequently presents a specific approach to solving the problem of the reverse order law for {1} -generalized inverses. Particular emphasis is placed on the existence of Drazin invertible completions of an upper triangular operator matrix; on the invertibility and different types of generalized invertibility of a linear combination of operators on Hilbert spaces and Banach algebra elements; on the problem of finding representations of the Drazin inverse of a 2x2 block matrix; and on selected additive results and algebraic properties for the Drazin inverse. In addition to the clarity of its content, the book discusses the relevant open problems for each topic discussed. Comments on the latest references on generalized inverses are also included. Accordingly, the book will be useful for graduate students, PhD students and researchers, but also for a broader readership interested in these topics.

This book begins with the fundamentals of the generalized inverses, then moves to more advanced topics. It presents a theoretical study of the generalization of Cramer's rule, determinant representations of the generalized inverses, reverse order law of the generalized inverses of a matrix product, structures of the generalized inverses of structured matrices, parallel computation of the generalized inverses, perturbation analysis of the generalized inverses, an algorithmic study of the computational methods for the full-rank factorization of a generalized inverse, generalized singular value decomposition, imbedding method, finite method, generalized inverses of polynomial matrices, and generalized inverses of linear operators. This book is intended for researchers, postdocs, and graduate students in the area of the generalized inverses with an undergraduate-level understanding of linear algebra.

This book addresses selected topics in the theory of generalized inverses. Following a discussion of the "reverse order law" problem and certain problems involving completions of operator matrices, it subsequently presents a specific approach to solving the problem of the reverse order law for {1} -generalized inverses. Particular emphasis is placed on the existence of Drazin invertible completions of an upper triangular operator matrix; on the invertibility and different types of generalized invertibility of a linear combination of operators on Hilbert spaces and Banach algebra elements; on the problem of finding representations of the Drazin inverse of a 2x2 block matrix; and on selected additive results and algebraic properties for the Drazin inverse. In addition to the clarity of its content, the book discusses the relevant open problems for each topic discussed. Comments on the latest references on generalized inverses are also included. Accordingly, the book will be useful for graduate students, PhD students and researchers, but also for a broader readership interested in these topics.

Theory and Computation of Tensors: Multi-Dimensional Arrays investigates theories and computations of tensors to broaden perspectives on matrices. Data in the Big Data Era is not only growing larger but also becoming much more complicated. Tensors (multi-dimensional arrays) arise naturally from many engineering or scientific disciplines because they can represent multi-relational data or nonlinear relationships.

We introduce new methods connecting numerics and symbolic computations, i.e., both the direct and iterative methods as well as the symbolic method for computing the generalized inverses. These will be useful for Engineers and Statisticians, in addition to applied mathematicians.Also, main applications of generalized inverses will be presented. Symbolic method covered in our book but not discussed in other book, which is important for numerical-symbolic computations.

For a numerical method, its stability is a crucial issue in the sense that an unstable algorithm can render it useless in practical computation. For an over-determined linear algebraic equation , its stability is typically evaluated by using the traditional condition number, Cond= , where and are the maximal and the minimal singular values of matrix , respectively. In this book, the concept of an effective condition number, Cond_eff= , is introduced. Cond_eff is smaller, and generally much smaller, than Cond, and is a better stability criterion. The Cond_eff can be used as an estimation on stability for the numerical solutions of partial differential equations (PDEs) using algorithms, such as the collocation Trefftz method, the spectral method, the finite difference method, and the finite element method. An analysis of stability integrated with errors is the focus of this book.