Scribd
Upload
123 views4 pages

Linear Algebra: Matrix Theory

The document discusses three topics related to linear algebra: Matrix Theory, Computational Methods over Fields, and Computational Methods over PIDs. Each section lists references on the given topic, with titles and authors for research papers and technical reports published between 1997-2007.

Uploaded by

Eranga
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
123 views4 pages

Linear Algebra: Matrix Theory

The document discusses three topics related to linear algebra: Matrix Theory, Computational Methods over Fields, and Computational Methods over PIDs. Each section lists references on the given topic, with titles and authors for research papers and technical reports published between 1997-2007.

Uploaded by

Eranga
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Linear Algebra

Matrix Theory
15Axx

[1] Marjeta Kramar. The structure of irreducible matrix groups with sub-
multiplicative spectrum. Linear Multilinear Algebra, 53(1):13–25, 2005.

[2] R. V. Kravchenko and B. V. Petrenko. Some formulas for the


minimal number of generators of the direct sum of matrix rings.
arXiv:math/0611674, 23 pages, 2007.

[3] Sefi Ladkani. Insights on periodicity and nonnegativity from finite di-
mensional algebras. arXiv:math.RT/0611201, 13 pages, 2006.

[4] Zhongshan Li, Frank Hall, and Fuzhen Zhang. Sign patterns of non-
negative normal matrices. In Proceedings of the Fifth Conference of the
International Linear Algebra Society (Atlanta, GA, 1995), volume 254,
pages 335–354, 1997.

1
Linear Algebra
Computational Methods over Fields

[1] Jean-Guillaume Dumas, Thierry Gautier, Pascal Giorgi, and Clément


Pernet. Dense linear algebra over finite fields: The FFLAS and FFPACK
packages. arXiv:cs.SC/0601133 v1, 69 pages, 2006.

[2] Jean-Guillaume Dumas, Pascal Giorgi, and Clément Pernet. FFPACK:


finite field linear algebra package. In ISSAC ’2004: Proceedings of the
2004 International Symposium on Symbolic and Algebraic Computation,
pages 119–126. ACM, New York, 2004.

[3] Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, and
Gilles Villard. Faster inversion and other black box matrix computations
using efficient block projections. arXiv:cs.SC/0701188, 8 pages, 2007.

[4] Michael E. O’Sullivan. Algebraic construction of sparse matrices with


large girth. IEEE Trans. Inform. Theory, 52(2):718–727, 2006.

[5] Michael Schmid, Rainer Steinwandt, Jörn Müller-Quade, Martin


Rötteler, and Thomas Beth. Decomposing a matrix into circulant and
diagonal factors. Linear Algebra Appl., 306(1-3):131–143, 2000.

[6] Allan Steel. A new algorithm for the computation of canonical forms of
matrices over fields. J. Symbolic Comput., 24(3-4):409–432, 1997.

2
Linear Algebra
Computational Methods over PIDs

[1] Jean-Guillaume Dumas, Clément Pernet, and Zhendong Wan. Efficient


computation of the characteristic polynomial. In ISSAC’05: Proceed-
ings of the 2005 International Symposium on Symbolic and Algebraic
Computation, pages 140–147 (electronic). ACM, New York, 2005.

[2] Jean-Guillaume Dumas and Anna Urbanska. An introspective algorithm


for the integer determinant. arXiv:cs.SC/0511066, 32 pages, 2006.

[3] Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, and
Gilles Villard. Faster inversion and other black box matrix computations
using efficient block projections. arXiv:cs.SC/0701188, 8 pages, 2007.

[4] Katharina Geißler and Nigel P. Smart. Computing the M = U U t integer


matrix decomposition. In Cryptography and Coding, volume 2898 of
Lecture Notes in Comput. Sci., pages 223–233. Springer, Berlin, 2003.

[5] George Havas, Bohdan S. Majewski, and Keith R. Matthews. Extended


GCD and Hermite normal form algorithms via lattice basis reduction.
Experiment. Math., 7(2):125–136, 1998.

[6] George Havas, Bohdan S. Majewski, and Keith R. Matthews. Addenda


and errata: “Extended GCD and Hermite normal form algorithms via
lattice basis reduction”. Experiment. Math., 8(2):205, 1999.

[7] Gerold Jaeger. Parallel algorithms for computing the Smith normal
form of large matrices. In Recent Advances in Parallel Virtual Machine
and Message Passing Interface, volume 2840, pages 170–179. Springer,
Berlin/Heidelberg, 2003.

[8] G. Jäger. Reduction of Smith normal form transformation matrices.


Computing, 74(4):377–388, 2005.

[9] Frank Lübeck. On the computation of elementary divisors of integer


matrices. J. Symbolic Comput., 33(1):57–65, 2002.

3
[10] Patrick Theobald. Ein Framework zur Berechnung der Hermite-
Normalform von grössen, dünnbesetzten, ganzzahligen Matrizen. PhD
Thesis, Technischen Universität Darmstadt, 2000.

You might also like