Related papers: Dual Core-EP Generalized Inverse and Decomposition

Incorporating prior information into inverse problems, e.g. via maximum-a-posteriori estimation, is an important technique for facilitating robust inverse problem solutions. In this paper, we devise two novel approaches for linear inverse…

The results on the inversion of convolution operators as well as Toeplitz (and block Toeplitz) matrices in the $1$-D (one-dimensional) case are classical and have numerous applications. Last year, we considered the $2$-D case of…

We study the combinatorial description of the LDU decomposition of totally positive matrices. We give a description of the lower triangular L, the diagonal D, and the upper triangular U matrices of the LDU decomposition of totally positive…

Deep Gaussian Processes (DGP) are hierarchical generalizations of Gaussian Processes (GP) that have proven to work effectively on a multiple supervised regression tasks. They combine the well calibrated uncertainty estimates of GPs with the…

In this paper, we propose a distributed algorithm for solving large-scale separable convex problems using Lagrangian dual decomposition and the interior-point framework. By adding self-concordant barrier terms to the ordinary Lagrangian, we…

An algorithm for computing {2, 3}, {2, 4}, {1, 2, 3}, {1, 2, 4} -inverses and the Moore-Penrose inverse of a given rational matrix A is established. Classes A(2, 3)s and A(2, 4)s are characterized in terms of matrix products (R*A)+R* and…

This paper presents a comprehensive analysis of the well-known extragradient (EG) method for solving both equations and inclusions. First, we unify and generalize EG for [non]linear equations to a wider class of algorithms, encompassing…

This paper studies high-dimensional regression with two-way structured data. To estimate the high-dimensional coefficient vector, we propose the generalized matrix decomposition regression (GMDR) to efficiently leverage any auxiliary…

Let $\mathscr{C}$ be an additive category with an involution $\ast$. Suppose that $\varphi : X \rightarrow X$ is a morphism with kernel $\kappa : K \rightarrow X$ in $\mathscr{C}$, then $\varphi$ is core invertible if and only if $\varphi$…

We prove that any compact surface with constant positive curvature and conical singularities can be decomposed into irreducible components of standard shape, glued along geodesic arcs connecting conical singularities. This is a spherical…

This paper presents the forward and backward derivatives of partial eigendecomposition, i.e. where it only obtains some of the eigenpairs, of a real symmetric matrix for degenerate cases. The numerical calculation of forward and backward…

We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…

In this article we study the deformation of finite maps and show how to use this deformation theory to construct varieties with given invariants in a projective space. Among other things, we prove a criterion that determines when a finite…

For the second fundamental representation of the general linear group over a commutative ring $R$ we construct straightforward and uniform polynomial expressions of elementary generators as products of elementary conjugates of an arbitrary…

How can we compute the pseudoinverse of a sparse feature matrix efficiently and accurately for solving optimization problems? A pseudoinverse is a generalization of a matrix inverse, which has been extensively utilized as a fundamental…

In this paper we establish links between, and new results for, three problems that are not usually considered together. The first is a matrix decomposition problem that arises in areas such as statistical modeling and signal processing:…

We introduce an $hp$-version symmetric interior penalty discontinuous Galerkin finite element method (DGFEM) for the numerical approximation of the biharmonic equation on general computational meshes consisting of polygonal/polyhedral…

Let $\mathscr{C}$ be an additive category with an involution $\ast$. Suppose that $\varphi : X \rightarrow X$ is a morphism of $\mathscr{C}$ with core inverse $\varphi^{\co} : X \rightarrow X$ and $\eta : X \rightarrow X$ is a morphism of…

Compression of inverted lists with methods that support fast intersection operations is an active research topic. Most compression schemes rely on encoding differences between consecutive positions with techniques that favor small numbers.…

Drazin inverses are a fundamental algebraic structure which have been extensively deployed in semigroup theory, ring theory, and matrix theory. Drazin inverses can also be defined for endomorphisms in any category. However, beyond a paper…