the helicopter-borne electromagnetic (hem) frequency-domain exploration method is an airborne electromagnetic (aem) technique that is widely used for vast and rough areas for resistivity imaging. the vast amount of digitized data flowing from the hem method requires an efficient and accurate inversion algorithm. generally, the inverse modelling of hem data in the first step requires a precise a...

We consider the Schur complement operation for symmetric matrices over GF(2), which we identify with graphs through the adjacency matrix representation. It is known that Schur complementation for such a matrix (i.e., for a graph) can be decomposed into a sequence of two types of elementary Schur complement operations: (1) local complementation on a looped vertex followed by deletion of that ver...

Inverse matrix calculation can be considered as an optimization. We have demonstrated that this problem can be rapidly solved by highly interconnected simple neuron-like analog processors. A network for matrix inversion based on the concept of Hopfield's neural network was designed, and implemented with electronic hardware. With slight modifications, the network is readily applicable to solving...

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 calculation of the covariances of the inverted matrix elements to be reliable.

This paper presents a parallel algorithm for matrix inversion on a torus interconnected MIMD-MC multi-processor. This method is faster than the parallel implementations of other widely used methods namely Gauss-Jordan, Gauss-Seidal or LU decomposition based inversion. This new algorithm also introduces a novel technique, called adaptive pivoting, for solving the zero pivot problem at no cost. O...

In 1950, Forsythe and Leibler (1950) introduced a statistical technique for finding the inverse of a matrix by characterizing the elements of the matrix inverse as expected values of a sequence of random walks. Barto and Duff (1994) subsequently showed relations between this technique and standard dynamic programming and temporal differencing methods. The advantage of the Monte Carlo matrix inv...

Inversion of a triangular matrix can be accomplished in several ways. The standard methods are characterised by the loop ordering, whether matrix-vector multiplication, solution of a triangular system, or a rank-1 update is done inside the outer loop, and whether the method is blocked or unblocked. The numerical stability properties of these methods are investigated. It is shown that unblocked ...

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 approach to derive new matrix inversions from known ones.

A new computational technique is presented by which large structured matrices can be inverted. The specified matrix is viewed as the input-output operator of a time-varying system. Recently developed state space algorithms which apply to such systems are then used to compute a QR factorization first and subsequently the inverse of the matrix, starting from a state realization of the matrix. The...

Linear algebraic techniques are widely used in scientific computing, often requiring large-scale parallel resources such as those provided by the ARCHER service. Libraries exist to facilitate the development of appropriate parallel software, but use of these involves intricacies in decomposition of the problem, managing parallel input and output, passing messages and the execution of the linear...