On some algebraic problems in connection with general elgenvalue algorithms

Elsner L (1979)
Linear algebra and its applications 26: 123-138.

Download
OA
Journal Article | Published | English
Abstract
Two real matrices A,B are S-congruent if there is a nonsingular upper triangular matrix R such that A = R^TBR. This congruence relation is studied in the set of all nonsingular symmetric and that of all skew-symmetric matrices. Invariants and systems of representation are give. The results are applied to the question of decomposability of a matrix in a product of an isometry and an upper triangular matrix, a problem crucial in eigenvalue algorithms.
Publishing Year
ISSN
PUB-ID

Cite this

Elsner L. On some algebraic problems in connection with general elgenvalue algorithms. Linear algebra and its applications. 1979;26:123-138.
Elsner, L. (1979). On some algebraic problems in connection with general elgenvalue algorithms. Linear algebra and its applications, 26, 123-138.
Elsner, L. (1979). On some algebraic problems in connection with general elgenvalue algorithms. Linear algebra and its applications 26, 123-138.
Elsner, L., 1979. On some algebraic problems in connection with general elgenvalue algorithms. Linear algebra and its applications, 26, p 123-138.
L. Elsner, “On some algebraic problems in connection with general elgenvalue algorithms”, Linear algebra and its applications, vol. 26, 1979, pp. 123-138.
Elsner, L.: On some algebraic problems in connection with general elgenvalue algorithms. Linear algebra and its applications. 26, 123-138 (1979).
Elsner, Ludwig. “On some algebraic problems in connection with general elgenvalue algorithms”. Linear algebra and its applications 26 (1979): 123-138.
Main File(s)
Access Level
OA Open Access

This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Search this title in

Google Scholar