Checking positive definiteness or stability of symmetric interval matrices is NP-hard
It is proved that checking positive definiteness, stability or nonsingularity of all [symmetric] matrices contained in a symmetric interval matrix is NP-hard.
Classical orthogonal polynomials and Leverrier-Faddeev algorithm for the matrix pencils .
Combinatorial algorithms for computing column space bases that have sparse inverses.
Combined preorder and postorder traversal algorithm for the analysis of singular systems by Haar wavelets.
Communication balancing in parallel sparse matrix-vector multiplication.
Comparison of algorithms for calculation of the greatest common divisor of several polynomials
The computation of the greatest common divisor (GCD) has many applications in several disciplines including computer graphics, image deblurring problem or computing multiple roots of inexact polynomials. In this paper, Sylvester and Bézout matrices are considered for this purpose. The computation is divided into three stages. A rank revealing method is shortly mentioned in the first one and then the algorithms for calculation of an approximation of GCD are formulated. In the final stage the coefficients...
Computation of determinants and inverses of rectangular or singular matrices using residue arithmetic.
Computing codimensions and generic canonical forms for generalized matrix products.
Computing the CS and the Generalized Singular Value Decompositions.
Concerning the Solution Set of Ax = b where P< A < Q and p < b < q.
Constructing matrix geometric means.