Related papers: A formula for inverse matrix

We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…

The present author recently proposed and proved a relationship theorem between nonlinear polynomial equations and the corresponding Jacobian matrix. By using this theorem, this paper derives a Newton iterative formula without requiring the…

We study the compositional inverses of some general classes of permutation polynomials over finite fields. We show that we can write these inverses in terms of the inverses of two other polynomials bijecting subspaces of the finite field,…

We use elementary triangular matrices to obtain some factorization, multiplication, and inversion properties of triangular matrices. We also obtain explicit expressions for the inverses of strict $k$-Hessenberg matrices and banded matrices.…

A one-dimensional generalized nonlinear Schroedinger equation is considered, and the corresponding inverse scattering problem is analyzed when the potential is compactly supported and depends on the wave function. The unique recovery of the…

An Inverse Scattering Method is developed for the Camassa-Holm equation. As an illustration of our approach the solutions corresponding to the reflectionless potentials are explicitly constructed in terms of the scattering data. The main…

In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula of inverses of generalized cyclotomic permutation polynomials over finite fields. Moreover, we characterize all these cyclotomic permutation…

This paper concerns the inverse problem of determining a planar conductivity inclusion. Our aim is to analytically recover from the generalized polarization tensors (GPTs), which can be obtained from exterior measurements, a homogeneous…

The exponential of the triangular matrix whose entries in the diagonal at distance $n$ from the principal diagonal are all equal to the sum of the inverse of the divisors of $n$ is the triangular matrix whose entries in the diagonal at…

In this paper we derive and analyze an algorithm for inverting quaternion matrices. The algorithm is an analogue of the Frobenius algorithm for the complex matrix inversion. On the theory side, we prove that our algorithm is more efficient…

An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…

We consider a class of inexact Newton regularization methods for solving nonlinear inverse problems in Hilbert scales. Under certain conditions we obtain the order optimal convergence rate result.

We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over $p$-adic numbers gives a recurrence relation computing modular inverse modulo $p^m$, that is logarithmic in $m$. We solve the recurrence to…

In this study, we introduce the concept of commutative quaternions and commutative quaternion matrices. Firstly, we give some properties of commutative quaternions and their Hamilton matrices. After that we investigate commutative…

Given a convergent sequence of nodes we present a one-dimensional-holomorphic-function version of the Newton interpolation method of polynomials. It also generalises the Taylor and the Laurent formula. In other words, we present an…

The Fourier transform is naturally defined for integrable functrions. Otherwise, it should be stipulated in which sense the Fourier transform is understood. We consider some class of radial and, generally saying, nonintegrable functions.…

We consider canonical systems (with $2p\times 2p$ Hamiltonians $H(x)\geq 0$), which correspond to matrix string equations. Direct and inverse problems are solved in terms of Titchmarsh--Weyl and spectral matrix functions and related…

A number $s$ is the sum of the entries of the inverse of an $n \times n, (n \geq 3)$ upper triangular matrix with entries from the set $\{0, 1\}$ if and only if $s$ is an integer lying between $2-F_{n-1}$ and $2+F_{n-1}$, where $F_n$ is the…

In this paper we analyzed solutions of some complex matrix equations related to pseudoinverses using the concept of reproductivity. Especially for matrix equation AXB=C it is shown that Penrose's general solution is actually the case of the…

The Drazin inverse solutions of the matrix equations ${\rm {\bf A}}{\rm {\bf X}} = {\rm {\bf B}}$, ${\rm {\bf X}}{\rm {\bf A}} = {\rm {\bf B}}$ and ${\rm {\bf A}}{\rm {\bf X}}{\rm {\bf B}} ={\rm {\bf D}} $ are considered in this paper. We…