𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for solution of large eigenvalue problems

✍ Scribed by Duc T. Nguyen; Jasbir S. Arora

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
540 KB
Volume
24
Category
Article
ISSN
0045-7949

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

NUMERICAL ALGORITHMS FOR SOLUTIONS OF LA
NUMERICAL ALGORITHMS FOR SOLUTIONS OF LARGE EIGENVALUE PROBLEMS IN PIEZOELECTRIC RESONATORS
✍ Y.-K. YONG; Y. CHO πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 725 KB

Two algorithms for eigenvalue problems in piezoelectric finite element analyses are introduced. The first algorithm involves the use of Lanczos method with a new matrix storage scheme, while the second algorithm uses a Rayleigh quotient iteration scheme. In both solution methods, schemes are impleme

An algorithm for the solution of a third
An algorithm for the solution of a third-order eigenvalue problem
✍ G. S. Schajer; C. D. Mote Jr. πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 302 KB

## Abstract A simple, rapidly convergent procedure is described for solving a third‐order symmetric eigenvalue problem Au = Ξ» Bu typically arising in vibration analysis. The eigenvalue problem is represented in terms of its variational dual, the Rayleigh quotient, and the eigenosolution is obtained

An inexact inverse iteration for large s
An inexact inverse iteration for large sparse eigenvalue problems
✍ Yu-Ling Lai; Kun-Yi Lin; Wen-Wei Lin πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 111 KB πŸ‘ 2 views

In this paper, we propose an inexact inverse iteration method for the computation of the eigenvalue with the smallest modulus and its associated eigenvector for a large sparse matrix. The linear systems of the traditional inverse iteration are solved with accuracy that depends on the eigenvalue with