Javascript must be enabled to continue!
An iterative algorithm to compute the Bott-Duffin inverse and generalized Bott-Duffin inverse
View through CrossRef
Let L be a subspace of Cn and PL be the orthogonal projector of Cn onto L.
For A?Cn?n, the generalized Bott-Duffin (B-D) inverse A(+)(L) is given by
A(+)(L)= PL(APL + PL?)?. In this paper, by defined a non-standard inner
product, a finite formulae is presented to compute Bott-Duffin
inverse A(?)(L) = PL(APL+P?)? and generalized Bott-Duffin inverse A(?)(L)= PL
(APL+PL?)? under the condition A is L?zero (i.e., AL?L?={0}). By this
iterative method, when taken the initial matrix X0 = PLA?PL,
the Bott-Duffin inverse A(?1)(L) and generalized Bott-duffin inverse A(?)(L)
can be obtained within a finite number of iterations in absence
of roundoff errors. Finally a given numerical example illustrates that the
iterative algorithm dose converge.
Title: An iterative algorithm to compute the Bott-Duffin inverse and generalized Bott-Duffin inverse
Description:
Let L be a subspace of Cn and PL be the orthogonal projector of Cn onto L.
For A?Cn?n, the generalized Bott-Duffin (B-D) inverse A(+)(L) is given by
A(+)(L)= PL(APL + PL?)?.
In this paper, by defined a non-standard inner
product, a finite formulae is presented to compute Bott-Duffin
inverse A(?)(L) = PL(APL+P?)? and generalized Bott-Duffin inverse A(?)(L)= PL
(APL+PL?)? under the condition A is L?zero (i.
e.
, AL?L?={0}).
By this
iterative method, when taken the initial matrix X0 = PLA?PL,
the Bott-Duffin inverse A(?1)(L) and generalized Bott-duffin inverse A(?)(L)
can be obtained within a finite number of iterations in absence
of roundoff errors.
Finally a given numerical example illustrates that the
iterative algorithm dose converge.
Related Results
On iterative methods to solve nonlinear equations
On iterative methods to solve nonlinear equations
Many of the problems in experimental sciences and other disciplines can be expressed in the form of nonlinear equations. The solution of these equations is rarely obtained in close...
When Does a Dual Matrix Have a Dual Generalized Inverse?
When Does a Dual Matrix Have a Dual Generalized Inverse?
This paper deals with the existence of various types of dual generalized inverses of dual matrices. New and foundational results on the necessary and sufficient conditions for vari...
Iterative convergent computation may not be a useful inductive bias for residual neural networks
Iterative convergent computation may not be a useful inductive bias for residual neural networks
Abstract
Recent work has suggested that feedforward residual neural networks (ResNets) approximate iterative recurrent computations. Iterative computations are usef...
Novel/Old Generalized Multiplicative Zagreb Indices of Some Special Graphs
Novel/Old Generalized Multiplicative Zagreb Indices of Some Special Graphs
Topological descriptor is a fixed real number directly attached with the molecular graph to predict the physical and chemical properties of the chemical compound. Gutman and Trinaj...
Newton-SOR Iterative Method with Lagrangian Function for Large-Scale Nonlinear Constrained Optimization Problems
Newton-SOR Iterative Method with Lagrangian Function for Large-Scale Nonlinear Constrained Optimization Problems
With the rapid development of computer technology and the wide application of nonlinear constrained optimization problems, many researchers are committed to solve large-scale const...
A Review of the Parallelization Strategies for Iterative Algorithms
A Review of the Parallelization Strategies for Iterative Algorithms
Abstract
Iteration-based algorithms have been widely used and achieved excellent results in many fields. However, in the big data era, data that needs to be processed is en...
New Mathematical Tool For Icy Moon Exploration: Spherical Iterative Filtering For Gravimetric Data And The Study Case Of Ganymede
New Mathematical Tool For Icy Moon Exploration: Spherical Iterative Filtering For Gravimetric Data And The Study Case Of Ganymede
The gravitational field of a planetary body is a direct manifestation of its internal mass distribution, and the ability to decompose this signal into contributions from individual...
Preconditioned successive over relaxation iterative method via semi-approximate approach for Burgers’ equation
Preconditioned successive over relaxation iterative method via semi-approximate approach for Burgers’ equation
<span lang="EN-US">This paper proposes the combination of a preconditioner applied with successive over relaxation (SOR) iterative method for solving a sparse and huge scale ...

