Related papers: Matrices Associated with Moving Least-Squares Appr…
We study the convergence of the Regularized Alternating Least-Squares algorithm for tensor decompositions. As a main result, we have shown that given the existence of critical points of the Alternating Least-Squares method, the limit points…
V.I. Arnold [Russian Math. Surveys, 26 (no. 2), 1971, pp. 29-43] gave a miniversal deformation of matrices of linear operators; that is, a simple canonical form, to which not only a given square matrix A, but also the family of all matrices…
We study randomized sketching methods for approximately solving least-squares problem with a general convex constraint. The quality of a least-squares approximation can be assessed in different ways: either in terms of the value of the…
The least squares solutions with the minimum norm 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…
A few iterations of alternating least squares with a random starting point provably suffice to produce nearly optimal spectral- and Frobenius-norm accuracies of low-rank approximations to a matrix; iterating to convergence is unnecessary.…
By studying the minimum resources required to perform a unitary transformation, families of metrics and pseudo-metrics on unitary matrices that are closely related to a recently reported quantum speed limit by the author are found.…
The Levenberg-Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems. Across different modified variations of the basic procedure, the algorithm enjoys global convergence, a…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
Given a set of matrices, modeled as samples of a matrix-valued function, we suggest a method to approximate the underline function using a product approximation operator. This operator extends known approximation methods by exploiting the…
The purpose of this paper is two-fold: we present some matrix inequalities of log-majorization type for eigenvalues indexed by a sequence; we then apply our main theorem to generalize and improve the Hua-Marcus' inequalities. Our results…
We provide a development that unifies, simplifies and extends considerably a number of minimax results in the restricted parameter space literature. Various applications follow, such as that of estimating location or scale parameters under…
The effect of preconditioning linear weighted least-squares using an approximation of the model matrix is analyzed, showing the interplay of the eigenstructures of both the model and weighting matrices. A small example is given illustrating…
In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation $Ax=b$, where $A$ is an $m\times n$ full-rank matrix, $b$ is a column-vector of dimension $m$, and $m$ (the number of…
In this paper we describe active set type algorithms for minimization of a smooth function under general order constraints, an important case being functions on the set of bimonotone r-by-s matrices. These algorithms can be used, for…
In this article we consider a method for proving a class of analytical inequalities via minimax rational approximations. All numerical calculations in this paper are given by Maple computer program.
We study the approximation of the spectrum of least-squares operators arising from linear elasticity. We consider a two-field (stress/displacement) and a three-field (stress/displacement/vorticity) formulation; other formulations might be…
We prove delocalization of eigenvectors of vertex-transitive graphs via elementary estimates of the spectral projector. We recover in this way known results which were formerly proved using representation theory. Similar techniques show…
Starting with the most general mass matrices, within the context of Standard Model and some of its extensions, incorporating the ideas of weak basis transformations and naturalness, we find that there exists a particular set of texture…
The problem of low rank approximation is ubiquitous in science. Traditionally this problem is solved in unitary invariant norms such as Frobenius or spectral norm due to existence of efficient methods for building approximations. However,…
Recently a systematic investigation of monoids of sequences of plus-minus weighted zero-sum sequences had been started, which is among others motivated by applications to monoids of norms of algebraic integers. In the current paper these…