Sciweavers

394 search results - page 2 / 79
» Computing Minimal Polynomials of Matrices
Sort
View
SIAMMAX
2010
103views more  SIAMMAX 2010»
12 years 12 months ago
On Chebyshev Polynomials of Matrices
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
Vance Faber, Jörg Liesen, Petr Tichý
CORR
2011
Springer
213views Education» more  CORR 2011»
12 years 9 months ago
Symbolic computation of weighted Moore-Penrose inverse using partitioning method
We propose a method and algorithm for computing the weighted MoorePenrose inverse of one-variable rational matrices. Also, we develop an algorithm for computing the weighted Moore...
Milan B. Tasic, Predrag S. Stanimirovic, Marko D. ...
JSC
2006
85views more  JSC 2006»
13 years 5 months ago
Fraction-free row reduction of matrices of Ore polynomials
In this paper we give formulas for performing row reduction of a matrix of Ore polynomials in a fraction-free way. The reductions can be used for finding the rank and left nullspa...
Bernhard Beckermann, Howard Cheng, George Labahn
COMBINATORICS
2004
106views more  COMBINATORICS 2004»
13 years 5 months ago
Random Matrices, Magic Squares and Matching Polynomials
Characteristic polynomials of random unitary matrices have been intensively studied in recent years: by number theorists in connection with Riemann zetafunction, and by theoretica...
Persi Diaconis, Alexander Gamburd
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
13 years 10 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee