In this letter, we propose a recursive space time decoding method for orthogonal frequency division multiplexing (OFDM) systems exploiting multiple transmit antenna diversity when the channels are fast fading. We first develop a computationally efficient space-time decoding method involving a matrix inversion to mitigate the channel variation effect. We then further reduce the computational com...

this paper presents results of applying a new approach on 2d inversion of magnetotelluric (mt) data in order to enhance resolution and stability of the inversion results. due to non-linearity and limited coverage of data acquisition in an mt field campaign, minimizing the error by linearization of the problem in least squares inversion usually leads to an ill-posed problem. in general, an inver...

An iterative inversion algorithm for a class of square matrices is derived and tested. The inverted matrix can be defined over both real and complex fields. This algorithm is based only on the operations of addition and multiplication. The numerics of the algorithm can cope with a short number representation and therefore can be very useful in the case of processors with limited possibilities, ...

The efficient evaluation of polarizable molecular mechanics potentials on distributed memory parallel computers is discussed. The program executes at 7-10 Mflops/node on a 32-node CM-5 partition and is 19 times faster than comparable code running on a single-processor HP 9000/735. On the parallel computer, matrix inversion becomes a practical alternative to the commonly used iterative method fo...

Finding the rotational matrix that minimizes the sum of squared deviations between two vectors is an important problem in bioinformatics and crystallography. Traditional algorithms involve the inversion or decomposition of a 3 x 3 or 4 x 4 matrix, which can be computationally expensive and numerically unstable in certain cases. Here, we present a simple and robust algorithm to rapidly determine...

In the second part of this paper we study condition numbers with respect to componentwise perturbations in the input data for linear systems and for matrix inversion, and the distance to the nearest singular matrix. The structures under investigation are linear structures, namely symmetric, persymmetric, skewsymmetric, symmetric Toeplitz, general Toeplitz, circulant, Hankel, and persymmetric Ha...

An Orchestrator coordinates and controls computations at parallel and sequential computing nodes. Matrix inversion is the need of many scientific applications. The paper presents a design and implementation of an Orchestrated framework named InverseOrchestra. The InverseOrchestra is finding the faster large matrix inversion through Orchestration. The InverseOrchestra is using Cramer’s rule for ...

Downsampling is a routine step before applying interferometric synthetic aperture radar (InSAR) data to earthquake inversion because of the high computational burden. In this letter, we make use of the matrix perturbation theory to describe the downsampling process, which is considered as matrix perturbation on inversion equation. First, we derive a formula to quantitatively assess the perturba...

In this paper, we give a weakly stable algorithm to solve a block Toeplitz system of linear equations. If the \look-ahead" steps taken to compute the parameters of the inversion formula for the block Toeplitz matrix are small compared to the order n of the matrix, the algorithm requires O(n 2) oating point operations. The parameters of the inversion formula are interpreted and computed in a rec...

The titled problem of coupled thermoelasticity for porous structure has been solved with an instantaneous heat source acting on a plane area in an unbounded medium. The basic equations of thermoelasticity, after being converted into a one-dimensional form, have been written in the form of a vector-matrix differential equation and solved by the eigenvalue approach for the field variables in the ...