Article
Licensed
Unlicensed
Requires Authentication
Computing reducing subspaces of a large linear matrix pencil
-
G. Hechmé
Published/Copyright:
2006
This paper deals with the computation of the reducing subspace associated with the rightmost part of the spectrum of a large matrix pencil A–λ B with B = diag(I,0). Two variants of the Jacobi-Davidson method are discussed and developed. One is based on the Euclidean inner product and the second on the semi-inner product induced by B. Both versions use real arithmetics and incorporate an efficient deflation procedure. Numerical results are reported.
Published Online: --
Published in Print: 2006-05-01
Copyright 2006, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Computing reducing subspaces of a large linear matrix pencil
- Majorant frequency principle for an approximate solution of a nonlinear spatially inhomogeneous coagulation equation by the Monte Carlo method
- Special algorithms for stochastic simulation of hydrometeorological processes and inhomogeneous fields
- The effect of parental life spans on age diseases in humans
- Complete optimization of a discrete stochastic numerical procedure for globally estimating the solution of an integral equation of the second kind
Articles in the same Issue
- Computing reducing subspaces of a large linear matrix pencil
- Majorant frequency principle for an approximate solution of a nonlinear spatially inhomogeneous coagulation equation by the Monte Carlo method
- Special algorithms for stochastic simulation of hydrometeorological processes and inhomogeneous fields
- The effect of parental life spans on age diseases in humans
- Complete optimization of a discrete stochastic numerical procedure for globally estimating the solution of an integral equation of the second kind
