Related papers: The Bott-Duffin drazin inverse and its application
In the present paper, we consider large-scale differential Lyapunov matrix equations having a low rank constant term. We present two new approaches for the numerical resolution of such differential matrix equations. The first approach is…
Generalized sampling consists in the recovery of a function $f$, from the samples of the responses of a collection of linear shift-invariant systems to the input $f$. The reconstructed function is typically a member of a finitely generated…
We develop a reverse entropy power inequality for convex measures, which may be seen as an affine-geometric inverse of the entropy power inequality of Shannon and Stam. The specialization of this inequality to log-concave measures may be…
A new generalized inverse for a square matrix $H\in\mathbb{C}^{n\times n}$, called CCE-inverse, is established by the core-EP decomposition and Moore-Penrose inverse $H^{\dag}$. We propose some characterizations of the CCE-inverse.…
In this paper, we solve the linearized Poisson-Boltzmann equation, used to model the electric potential of macromolecules in a solvent. We derive a corrected trapezoidal rule with improved accuracy for a boundary integral formulation of the…
We consider the inverse problem of the broken ray transform (sometimes also referred to as the V-line transform). Explicit image reconstruction formulas are derived and tested numerically. The obtained formulas are generalizations of the…
Solving inverse problems by dynamical variant of the BC-method is basically reduced to inverting the connecting operator $C^T$ of the dynamical system, for which the problem is stated. Realizing the method numerically, one needs to invert…
In this work, new closed-form formulas for the matrix exponential are provided. Our method is direct and elementary, it gives tractable and manageable formulas not current in the extensive literature on this essential subject. Moreover,…
In this paper, we introduce a new matrix decomposition called the m-Core-nilpotent decomposition which is an extension of the Core-nilpotent decomposition. By this new decomposition, we propose a new generalized inverse named the m-weak…
We use Cramer's formula for the inverse of a matrix and a combinatorial expression for the determinant in terms of paths of an associated digraph (which can be traced back to Coates) to give a combinatorial interpretation of M\"obius…
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…
In this paper we generalize the known DDVV-type inequalities for real (skew-)symmetric and complex (skew-)Hermitian matrices to arbitrary real, complex and quaternionic matrices. Inspired by the Erd\H{o}s-Mordell inequality, we establish…
We introduce inversions tableaux, a new combinatorial model for Schubert polynomials and Stanley symmetric functions that directly specializes to semi-standard Young tableaux in the Grassmannian case. They are a modification of the balanced…
The Augmented Lagrangian Method as an approach for regularizing inverse problems received much attention recently, e.g. under the name Bregman iteration in imaging. This work shows convergence (rates) for this method when Morozov's…
The M-P (Moore-Penrose) pseudoinverse has as a key application the computation of least-squares solutions of inconsistent systems of linear equations. Irrespective of whether a given input matrix is sparse, its M-P pseudoinverse can be…
A concise analytical formula is developed for the inverse of an invertible 3 x 3 matrix using a telescoping method, and is generalized to larger square matrices. The formula is confirmed using randomly generated matrices in Matlab
We shall investigate randomized algorithms for solving large-scale linear inverse problems with general regularizations. We first present some techniques to transform inverse problems of general form into the ones of standard form, then…
Many inverse problems have to deal with complex, evolving and often not exactly known geometries, e.g. as domains of forward problems modeled by partial differential equations. This makes it desirable to use methods which are robust with…
The well-known M-P (Moore-Penrose) pseudoinverse is used in several linear-algebra applications; for example, to compute least-squares solutions of inconsistent systems of linear equations. Irrespective of whether a given matrix is sparse,…
A recognized trend of research investigates generalizations of the Hadamard's inversion theorem to functions that may fail to be differentiable. In this vein, the present paper explores some consequences of a recent result about the…