A posteriori error estimates for linear equations.
A practical application of kernel-based fuzzy discriminant analysis
A novel method for feature extraction and recognition called Kernel Fuzzy Discriminant Analysis (KFDA) is proposed in this paper to deal with recognition problems, e.g., for images. The KFDA method is obtained by combining the advantages of fuzzy methods and a kernel trick. Based on the orthogonal-triangular decomposition of a matrix and Singular Value Decomposition (SVD), two different variants, KFDA/QR and KFDA/SVD, of KFDA are obtained. In the proposed method, the membership degree is incorporated...
A Prime Congruence System.
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 Quaternion QR Algorithm.
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.
A recursion formula for the moments of the gaussian orthogonal ensemble
We present an analogue of the Harer–Zagier recursion formula for the moments of the gaussian Orthogonal Ensemble in the form of a five term recurrence equation. The proof is based on simple gaussian integration by parts and differential equations on Laplace transforms. A similar recursion formula holds for the gaussian Symplectic Ensemble. As in the complex case, the result is interpreted as a recursion formula for the number of 1-vertex maps in locally orientable surfaces with a given number of...
A refined unsymmetric Lanczos eigensolver for computing accurate eigentriplets of a real unsymmetric matrix.
A refinement of an inequality of Johnson, Loewy and London on nonnegative matrices and some applications.
A relation between the multiplicity of the second eigenvalue of a graph Laplacian, Courant's nodal line theorem and the substantial dimension of tight polyhedral surfaces.