Search

We address the discrete inverse conductance problem for well-connected spider networks; that is, to recover the conductance function on a well-connected spider network from the Dirichlet-to-Neumann map. It is well-known that this inverse problem is exponentially ill-posed, requiring the implementation of a regularization strategy for numerical solutions. Our focus lies in exploring whether prior knowledge of the conductance being piecewise constant within a partition of the edge set comprising few subsets enables stable conductance recovery. To achieve this, we propose formulating the problem as a polynomial optimization one, incorporating a regularization term that accounts for the piecewise constant hypothesis. We show several experimental examples in which the stable conductance recovery under the aforementioned hypothesis is feasible., Comment: Submitted to Applied Mathematics and Computation

In this paper we provide the group inverse of the combinatorial Laplacian matrix of distance-biregular graphs using the so-called equilibrium measures for sets obtained by deleting a vertex. We also show that the two equilibrium arrays characterizing a distance-biregular graph can be expressed in terms of the mentioned equilibrium measures. As a consequence of the minimum principle, we show a characterization of when the group inverse of the combinatorial Laplacian matrix of a distance-biregular graph is an $M$-matrix.

This work presents closed formulas for determinant, permanent, inverse, and Drazin inverse of circulant matrices with two non-zero coefficients.

In this paper we provide a version of the Floquet's theorem to be applied to any second order difference equations with quasi-periodic coefficients. To do this we extend to second order linear difference equations with quasi-periodic coefficients, the known equivalence between the Chebyshev equations and the second order linear difference equations with constant coefficients. So, any second order linear difference equations with quasi-periodic coefficients is essentially equivalent to a Chebyshev equation, whose parameter only depends on the values of the quasi-periodic coefficients and can be determined by a non-linear recurrence. Moreover, we solve this recurrence and obtaining a closed expression for this parameter. As a by-product we also obtain a Floquet's type result; that is, the necessary and sufficient condition for the equation has quasi-periodic solutions.