A novel interpretation of least squares solution.
A Numerical Procedure for Computing the Moore-Penrose Inverse.
A numerical radius inequality and an estimate for the numerical radius of the Frobenius companion matrix
It is shown that if A is a bounded linear operator on a complex Hilbert space, then , where w(A) and ||A|| are the numerical radius and the usual operator norm of A, respectively. An application of this inequality is given to obtain a new estimate for the numerical radius of the Frobenius companion matrix. Bounds for the zeros of polynomials are also given.
A parallel algorithm for computing the group inverse via Perron complementation.
A parameterized lower bound for the smallest singular value.
A pencil approach to high gain feedback and generalized state space systems
A pointwise approximation of isolated trees in a random graph.
A posteriori error estimates for linear equations.
A problem on matrices
A product integral representation of the generalized inverse
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
A propos de l’algorithme
À propos de l'inversion des matrices généralisées de Jacobi.
A proposito di alcune disequazioni lineari
A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search
The Alternating Nonnegative Least Squares (ANLS) method is commonly used for solving nonnegative tensor factorization problems. In this paper, we focus on algorithmic improvement of this method. We present a Proximal ANLS (PANLS) algorithm to enforce convergence. To speed up the PANLS method, we propose to combine it with a periodic enhanced line search strategy. The resulting algorithm, PANLS/PELS, converges to a critical point of the nonnegative tensor factorization problem under mild conditions....
A quadratically convergent Bernoulli-like algorithm for solving matrix polynomial equations in Markov chains.
A quantitative extension of the Perron-Frobenius theorem for doubly stochastic matrices
A rational canonical form algorithm
We present an easy-to-implement algorithm for transforming a matrix to rational canonical form.
A rational canonical form for matrix fields
A recursion formula for expected negative and positive powers of the central Wishart distribution.
We use Haff's fundamental identity to express the expectation of Sp in lower-order terms, where S follows the central Wishart distribution.