Computation of the Moore-Penrose Inverse for Bidiagonal Matrices

Author:   Yuri Hakopian
Publisher:   Createspace Independent Publishing Platform
ISBN:  

9781544901336


Pages:   56
Publication Date:   27 April 2017
Format:   Paperback
Availability:   In stock   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

Our Price $63.36 Quantity:  
Add to Cart

Share |

Computation of the Moore-Penrose Inverse for Bidiagonal Matrices


Add your own review!

Overview

The Moore-Penrose inverse is the most popular type of matrix generalized inverses, or pseudoinverses, which has many applications both in matrix theory and numerical linear algebra. A common use of the Moore-Penrose inverse is to compute the least squares solution to the systems of linear algebraic equations. It is well known that the Moore-Penrose inverse can be found via singular value decomposition. In this regard, there is the most effective algorithm which consists of two stages. In the first stage, with the help of Householder reflections, the initial matrix is reduced to an upper bidiagonal form (the Golub-Kahan bidiagonalization algorithm). The second stage is known in scientific literature as the Golub-Reinsch algorithm. This is an iterative procedure which with the help of Givens rotations generates a sequence of bidiagonal matrices converging to a diagonal form. Acting in this way, an iterative approximation to the singular value decomposition of the bidiagonal matrix is obtained. The principal intention of the present research monograph booklet is to develop a method which can be considered as an alternative to the Golub-Reinsch iterative algorithm. Realizing the approach proposed in the study, the following two main results were achieved. First, we obtain explicit expressions for the entries of the Moore-Penrose inverse of upper bidigonal matrices. Secondly, based on the closed form formulae, we get a finite numerical algorithm of optimal order of computational complexity. Thus, we can compute the Moore-Penrose inverse of an upper bidiagonal matrix without using the singular value decomposition. This book is intended for scientists interested in linear algebra and the theory of generalized inverses. We hope that the work should also be useful for research workers in numerical analysis and computational practitioners.

Full Product Details

Author:   Yuri Hakopian
Publisher:   Createspace Independent Publishing Platform
Imprint:   Createspace Independent Publishing Platform
Dimensions:   Width: 21.60cm , Height: 0.30cm , Length: 27.90cm
Weight:   0.154kg
ISBN:  

9781544901336


ISBN 10:   154490133
Pages:   56
Publication Date:   27 April 2017
Audience:   General/trade ,  General
Format:   Paperback
Publisher's Status:   Active
Availability:   In stock   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

Table of Contents

Reviews

Author Information

Yuri Hakopian is a Doctor of Science in Mathematics, Professor, Head of the Chair of Numerical Analysis and Mathematical Modeling, Faculty of Informatics and Applied Mathematics at Yerevan State University, Armenia, and author of more than 60 scientific publications and textbooks.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

Aorrng

Shopping Cart
Your cart is empty
Shopping cart
Mailing List