Classical condition numbers are normwise: they measure the size of both input perturbations and output errors using some norms. To take into account the relative of each data component, and, in particular, a possible data sparseness, componentwise condition numbers have been increasingly considered. These are mostly of two kinds: mixed and componentwise. In this paper, we give explicit expressi...

This paper proposes distributed algorithms for multi-agent networks to achieve a solution in finite time to a linear equation Ax = b where A has full row rank, and with the minimum l1-norm in the underdetermined case (where A has more columns than rows). The underlying network is assumed to be undirected and fixed, and an analytical proof is provided for the proposed algorithm to drive all agen...

in this paper, genetic algorithms (gas) are employed to control simultaneous linear systems in both state and output feedback. first, the similarity transformation is applied to obtain parameterized controllers. this requires solution of a system of equations and also some non-linear inequalities. gas are used to solve these equations and inequalities. therefore, the paper presents an analytica...

We study separability properties of solutions of elliptic equations with piecewise constant coefficients in R d , d ≥ 2. Besides that, we develop efficient tensor-structured preconditioner for the diffusion equation with variable coefficients. It is based only on rank structured decomposition of the tensor of reciprocal coefficient and on the decomposition of the inverse of the Laplacian operat...

Let Sn(S) denote the set of symmetric matrices over some semiring, S. A line of A ∈ Sn(S) is a row or a column of A. A star of A is the submatrix of A consisting of a row and the corresponding column of A. The term rank of A is the minimum number of lines that contain all the nonzero entries of A. The star cover number is the minimum number of stars that contain all the nonzero entries of A. Th...

This article introduces a new fast direct solver for linear systems arising out of wide range of applications, integral equations, multivariate statistics, radial basis interpolation, etc., to name a few. The highlight of this new fast direct solver is that the solver scales linearly in the number of unknowns in all dimensions. The solver, termed as Inverse Fast Multipole Method (abbreviated as...

We consider the solution of a linear system Ax = b on a distributed memory machine when the matrix A has full rank and is large, sparse and nonsymmetric. We use our Cartesian nested dissection algorithm to compute a ll-reducingcolumn ordering of the matrix. We develop algorithms that use the associated separator tree to estimate the structure of the factor and to distribute and perform numeric ...

In this paper, we study the Moore-Penrose inverse of a symmetric rank-one perturbed matrix from which a finite method is proposed for the minimum-norm least-squares solution to the system of linear equations Ax = b. This method is guaranteed to produce the required result.

In current cooperative communication schemes, to achieve cooperative diversity, synchronization between terminals is usually assumed, which may not be practical since each terminal has its own local oscillator. In this paper, we first present a necessary and sufficient condition for the space-time trellis codes based on the stack construction proposed by Hammons and El Gamal to possess the full...

Minimality ranks in the style of Deissler are one way of measuring the structural complexity of minimal extensions of first-order structures. In particular, positive Deissler rank measures the complexity of the injective envelope of a module as an extension of that module. In this paper we solve a problem of the second author by showing that certain injective envelopes have the maximum possible...