Bernhard Beckermann
- 1.BECKE.RMANN, B. CABAY, S., ANI) LABAIIN, G. Fraction-free computation of matrix padd systenls. In Proceedings of ISSAC 97 (Maul, LISA, 21-23 July 1997), W. Kiichlin, Ed., ACM Press, pp. 125-132. Google Scholar
Digital Library
- 2.BECKERMANN, B., AND LABAIIN, G. A uniforrrl approach for herrrlit(.', pa(t~, and simultaneous pad6 approximants and their matrix ge)leralizations. Numerical Algorithms 3 (1992), 45-54.Google ScholarCross Ref
- 3.BECKERMANN, B., AND LABAHN. G. A uniform approach for the fast, reliable COnlputation of inatrix-type padd. a.pproximants. SIAM J. Matrix Anal. Appl. 15 (1994), 804 823. Google ScholarDigital Library
- 4.BECKERMANN: B. ANI) LABAHN, G. Fraction-free computation of matrix god's and rational interpola.nts. Submit.ted to SIAM .1. Matrix Anal. Appl. (1997), 45pgs.Google Scholar
- 5.BECKERMANN, B., ANI) LABAIIN, G. Recursiveimss in inatrix rational interpola.tion problems. ,1. Comput. Appl. Math. 77 (1997), 5-34. Google ScholarDigital Library
- 6.BECKERMANN, B., LABAHN, G.: AND VILLARD, G. Shifted normal forins of general polynomial matrices. manuscript. 1999.Google Scholar
- 7.BE EI~EN. T. VAN DFR HtiRK, G., AND PRA2kGMAN, C,. A new method ibm" comt)uting a cohlmn reduced polynoinial matrix. Systems and Control Letters 10 (1988), 217-224. Google ScholarDigital Library
- 8.BULTIIEFL, A., AND VAN BAR.EL. N{. A matrix euclidean algorithm and the matrix minimal padd apt)roximation problem. Continued Fractions and Padd A pprox.imants (1990).Google Scholar
- 9.G.D. FORNEY, J. Mi,fimal bases of rational vector spaces, with applications to multivariable linear systems. SIAM J. Control 13 (1975), 493 520.Google ScholarCross Ref
- 10.GEDDES, K., C ZAPOR, S., AND LABAHN. G. Algorithms for" Computer Algebra. Kluwer, Boston, MA, 1992. Google ScholarDigital Library
- 11.HAVAS, G. MAJEWSKI, B., ANI) i'k.IATTIIEWS, K. Extended gcd and hernlite nornlal forln algorit;hms via lat;- t.ice basis reduction. Experimental Mathematics 7(2) (1998), 125-135.Google ScholarCross Ref
- 12.KAII:ATIt, T. Lin~;ar Systems. Prenti(:c-Hall, 1980.Google Scholar
- 13.KAI:rOVEN. E., KmSHNAMOOIVrHY, M., AND SAUN- DERS, B. ParMlel Mgorithms for matrix normal forms. Linear Algebra and its Applications 136 (1990), 189-- 2O8.Google Scholar
- 14.KANNAN, R. Solving systems of linear equations over polynomials. The.ore.tical Computer Sole.nee 39 (1985), 69 88.Google Scholar
- 15.h/IACDUF'FEE., C. 7'he Theory of Matrices. Chelsea,Google Scholar
- 16.NEWMAN, I~i. Integral Matrices. Aca(telnic Press, New- York. 1972.Google Scholar
- 17.P()POV, V. Some properties of control systems with irreducible matrix transfcr functions. L~:cture Notes in Mathematics 144 (1969), 169-180.Google Scholar
- 18.SCIIRIJVER: A. Theory of Linear and Integer Programruing. Wiley-Intei'scieime series iu Discrete Mathematics, 1986. Google ScholarDigital Library
- 19.STt.IC.HLIK-QUERE. 1VI. How t.o (:omI)ute nlinilnal basses using pad~. approxilnants. Rapport. de recherche lip6 1997/035, Labora.toire d'Informatique, de Pro'is 6, Frml(:e, 1997.Google Scholar
- 20.\.:AN BAR.EL, ~., AND BUITI.'HEEL, i. A generalized nlinimal partial realization problem. Linear Algebra and its Applications 254 (1997), 527--551.Google ScholarCross Ref
- 21.VERGHESE, G.: AND KAII~ATH, T. Rational inatrix structurc. IEEE Trans. Automat. Control 26 (1981). 434-438.Google Scholar
- 22.VILLARD, G. Computing popov and herInite fbrins of I)olynomial matrices. In Proceedings of ISSAC 96 (Zurich, Switzerland, 24-26 July 1996), Y. Lakshman, Ed. ACM Press, pp. 250-258. Google ScholarDigital Library
Index Terms
- Shifted normal forms of polynomial matrices
Recommendations
Shifted SSOR-like preconditioner for non-Hermitian positive definite matrices
Based on the SSOR-like iteration method of Bai (Numer. Linear Algebra Appl. 23, 37-60, 2016), we give a shifted SSOR-like preconditioner which is positive definite for solving the non-Hermitian positive definite linear system with a dominant Hermitian ...
The Arnoldi Method for Normal Matrices
For large Hermitian matrices the preconditioned conjugate gradient algorithm and the Lanczos algorithm are the most important methods for solving linear systems and for computing eigenvalues. There are various generalizations to the nonsymmetric case ...
Computing eigenvalues of normal matrices via complex symmetric matrices
AbstractComputing all eigenvalues of a modest size matrix typically proceeds in two phases. In the first phase, the matrix is transformed to a suitable condensed matrix format, sharing the eigenvalues, and in the second stage the eigenvalues ...
Comments