In this article we discuss a method for the solution of non-separable eigenvalue problems. These problems are taken to be elliptic and linear and arise in a whole host of physically interesting problems. The approach exploits finite differences and a pseudo-spectral scheme. We elect to normalise at
The palindromic generalized eigenvalue problem : Numerical solution and applications
β Scribed by Tiexiang Li; Chun-Yueh Chiang; Eric King-wah Chu; Wen-Wei Lin
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 266 KB
- Volume
- 434
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we propose the palindromic doubling algorithm (PDA) for the palindromic generalized eigenvalue problem (PGEP)
A * x = Ξ»Ax. We establish a complete convergence theory of the PDA for PGEPs without unimodular eigenvalues, or with unimodular eigenvalues of partial multiplicities two (one or two for eigenvalue 1). Some important applications from the vibration analysis and the optimal control for singular descriptor linear systems will be presented to illustrate the feasibility and efficiency of the PDA.
π SIMILAR VOLUMES
## Abstract A numerical βsaturationβ technique is presented for solution of a generalization of Hitchcock's distribution problem.