相关论文: Improved Approximation Bounds for Moore-Penrose In…
In the first part of this paper we give an elementary proof of the fact that if an infinite matrix $A$, which is invertible as a bounded operator on $\ell^2$, can be uniformly approximated by banded matrices then so can the inverse of $A$.…
Low-rank pseudoinverses are widely used to approximate matrix inverses in scalable machine learning, optimization, and scientific computing. However, real-world matrices are often observed with noise, arising from sampling, sketching, and…
The aim of this work is to characterize linear maps of inner pro\-duct infinite-dimensional vector spaces where the Moore-Penrose inverse exists. This MP inverse generalizes the well-known Moore-Penrose inverse of a matrix $A\in…
The inverse covariance matrix provides considerable insight for understanding statistical models in the multivariate setting. In particular, when the distribution over variables is assumed to be multivariate normal, the sparsity pattern in…
We derive new explicit expressions for the components of Moore-Penrose inverses of symmetric difference matrices. These generalized inverses are applied in a new regularization approach for scattered data interpolation based on partial…
Inverse source approaches have shown their relevance for several applications in the past years. They rely on the solution of an ill-posed problem where near-field/current data is reconstructed starting from far-field (or less informative…
We develop the first stochastic incremental method for calculating the Moore-Penrose pseudoinverse of a real matrix. By leveraging three alternative characterizations of pseudoinverse matrices, we design three methods for calculating the…
We propose a new method for low-rank approximation of Moore-Penrose pseudoinverses (MPPs) of large-scale matrices using tensor networks. The computed pseudoinverses can be useful for solving or preconditioning of large-scale overdetermined…
Standard optimal control methods perform optimization in the time domain. However, many experimental settings demand the expression of the control signal as a superposition of given waveforms, a case that cannot easily be accommodated using…
This paper directly builds upon previous work where we introduced new reduced basis a posteriori error bounds for parametrized saddle point problems based on Brezzi's theory. We here sharpen these estimates for the special case of a…
In the last decades the Moore-Penrose pseudoinverse has found a wide range of applications in many areas of Science and became a useful tool for physicists dealing, for instance, with optimization problems, with data analysis, with the…
The computational complexity of simultaneous inference methods in high-dimensional linear regression models quickly increases with the number variables. This paper proposes a computationally efficient method based on the Moore-Penrose…
In this paper, we derive high-dimensional asymptotic properties of the Moore-Penrose inverse and, as a byproduct, of various ridge-type inverses of the sample covariance matrix. In particular, the analytical expressions of the asymptotic…
We present reduced basis approximations and rigorous a posteriori error bounds for the instationary Stokes equations. We shall discuss both a method based on the standard formulation as well as a method based on a penalty approach, which…
We establish sharp well-posedness and approximation estimates for variational saddle point systems at the continuous level. The main results of this note have been known to be true only in the finite dimensional case. Known spectral results…
This is the first paper of a two-long series in which we study linear generalized inverses that minimize matrix norms. Such generalized inverses are famously represented by the Moore-Penrose pseudoinverse (MPP) which happens to minimize the…
In the present work, we demonstrate how the pseudoinverse concept from linear algebra can be used to represent and analyze the boundary conditions of linear systems of partial differential equations. This approach has theoretical and…
In the first part of this study, a convex-constrained penalized formulation was studied for a class of constant modulus (CM) problems. In particular, the error bound techniques were shown to play a vital role in providing exact penalization…
Ill-posed linear inverse problems appear frequently in various signal processing applications. It can be very useful to have theoretical characterizations that quantify the level of ill-posedness for a given inverse problem and the degree…
Pseudoinverses are ubiquitous tools for handling over- and under-determined systems of equations. For computational efficiency, sparse pseudoinverses are desirable. Recently, sparse left and right pseudoinverses were introduced, using…