Results 1  10
of
566,974
Matching is as Easy as Matrix Inversion
, 1987
"... A new algorithm for finding a maximum matching in a general graph is presented; its special feature being that the only computationally nontrivial step required in its execution is the inversion of a single integer matrix. Since this step can be parallelized, we get a simple parallel (RNC2) algorit ..."
Abstract

Cited by 210 (7 self)
 Add to MetaCart
A new algorithm for finding a maximum matching in a general graph is presented; its special feature being that the only computationally nontrivial step required in its execution is the inversion of a single integer matrix. Since this step can be parallelized, we get a simple parallel (RNC2
A new matrix inverse
 PROC. AMER. MATH. SOC
, 1996
"... We compute the inverse of a specific infinitedimensional matrix, thus unifying a number of previous matrix inversions. Our inversion theorem is applied to derive a number of summation formulas of hypergeometric type. ..."
Abstract

Cited by 41 (2 self)
 Add to MetaCart
We compute the inverse of a specific infinitedimensional matrix, thus unifying a number of previous matrix inversions. Our inversion theorem is applied to derive a number of summation formulas of hypergeometric type.
Propagation of Errors for Matrix Inversion
"... A formula is given for the propagation of errors during matrix inversion. An explicit calculation for a 2 × 2 matrix using both the formula and a Monte Carlo calculation are compared. A prescription is given to determine when a matrix with uncertain elements is sufficiently nonsingular for the calcu ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A formula is given for the propagation of errors during matrix inversion. An explicit calculation for a 2 × 2 matrix using both the formula and a Monte Carlo calculation are compared. A prescription is given to determine when a matrix with uncertain elements is sufficiently nonsingular
Structures preserved by matrix inversion
, 2004
"... In this paper we investigate some matrix structures on Cn×n that have a good behaviour under matrix inversion. The first type of structure is closely related to low displacement rank matrices. Next, we show that for a matrix having a low rank submatrix, also the inverse matrix must have a low rank s ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
In this paper we investigate some matrix structures on Cn×n that have a good behaviour under matrix inversion. The first type of structure is closely related to low displacement rank matrices. Next, we show that for a matrix having a low rank submatrix, also the inverse matrix must have a low rank
DIFFERENTIATION AND INTEGRATION BY USING MATRIX INVERSION
"... Abstract. In the paper certain examples of applications of the matrix inverses for generating and calculating the integrals are presented. ..."
Abstract
 Add to MetaCart
Abstract. In the paper certain examples of applications of the matrix inverses for generating and calculating the integrals are presented.
Degree Complexity of Matrix Inversion
, 907
"... Abstract. For a q × q matrix x = (xi,j) we let J(x) = (x −1 i,j) be the Hadamard inverse, which takes the reciprocal of the elements of x. We let I(x) = (xi,j) −1 denote the matrix inverse, and we define K = I ◦J to be the birational map obtained from the composition of these two involutions. We c ..."
Abstract
 Add to MetaCart
Abstract. For a q × q matrix x = (xi,j) we let J(x) = (x −1 i,j) be the Hadamard inverse, which takes the reciprocal of the elements of x. We let I(x) = (xi,j) −1 denote the matrix inverse, and we define K = I ◦J to be the birational map obtained from the composition of these two involutions. We
Stability of Methods for Matrix Inversion
, 1992
"... Inversion of a triangular matrix can be accomplished in several ways. The standard methods are characterised by the loop ordering, whether matrixvector multiplication, solution of a triangular system, or a rank1 update is done inside the outer loop, and whether the method is blocked or unblocked. ..."
Abstract

Cited by 28 (11 self)
 Add to MetaCart
Inversion of a triangular matrix can be accomplished in several ways. The standard methods are characterised by the loop ordering, whether matrixvector multiplication, solution of a triangular system, or a rank1 update is done inside the outer loop, and whether the method is blocked or unblocked
A New Multidimensional Matrix Inversion in ...
"... We invert a specic innite rdimensional matrix, thus giving an extension of our previous matrix inversion result. As applications, we derive new summation formulas for series in Ar . 1. ..."
Abstract

Cited by 13 (8 self)
 Add to MetaCart
We invert a specic innite rdimensional matrix, thus giving an extension of our previous matrix inversion result. As applications, we derive new summation formulas for series in Ar . 1.
An extension of Warnaar’s matrix inversion
 PROC. AMER. MATH. SOC
, 2005
"... We present a necessary and sufficient condition for two matrices given by two bivariate functions to be inverse to each other with certainty in the cases of Krattenthaler formula and Warnaar’s elliptic matrix inversion. Immediate consequences of our result are some known functions and a constructive ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
We present a necessary and sufficient condition for two matrices given by two bivariate functions to be inverse to each other with certainty in the cases of Krattenthaler formula and Warnaar’s elliptic matrix inversion. Immediate consequences of our result are some known functions and a
Results 1  10
of
566,974