Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0754.65040
Parlett, Beresford N.
Reduction to tridiagonal form and minimal realizations. (English)
[J] SIAM J. Matrix Anal. Appl. 13, No.2, 567-593 (1992). ISSN 0895-4798; ISSN 1095-7162/e

The paper presents the theoretical background relevant to any method for producing a tridiagonal matrix similar to an arbitrary square matrix.\par In the preparative part of the paper the author describes the representation of the class of similar tridiagonals by vector pairs and the use of a pair $(\hat T,\Omega)$, with $\hat T$ symmetric tridiagonal and $\Omega$ diagonal, rather than a single matrix $\Omega\sp{-1}T$.\par The fundamental result of the paper says that the tridiagonal reduction is equivalent to a Gram-Schmidt process applied to two Krylow sequences. In Euclidean space a proper normalization allows one to monitor a tight lower bound on the condition number of the transformation.
[A.Roose (Tallinn)]

MSC 2000:: *65F30 Other matrix algorithms
65F15 Eigenvalues (numerical linear algebra)
65K10 Optimization techniques (numerical methods)
15A21 Canonical forms, etc.
93B10 Canonical structure of systems

Keywords: reduction to tridiagonal form; Lanczos algorithm; minimal realizations; three-term recurrence relations; orthogonal polynomials; time-invariant linear dynamical systems; tridiagonal matrix; Gram-Schmidt process; Krylow sequences; condition number; time-invariant

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]