𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A variant of the subspace iteration algorithm for generalized eigenproblems

✍ Scribed by S. Rajendran; K. M. Liew

Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
134 KB
Volume
57
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A computationally efficient algorithm fo
A computationally efficient algorithm for the solution of eigenproblems for large structures with non-proportional damping using Lanczos method
✍ Kim, Man-Cheol; Lee, In-Won πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 168 KB πŸ‘ 2 views

In this paper, a solution method is presented to solve the eigenproblem arising in the dynamic analysis of non-proportional damping systems with symmetric matrices. The method is based on the Lanczos method to generate one pair of Krylov subspaces consisting of trial vectors, which is then used to r

Toward a Generalized Algorithm for the A
Toward a Generalized Algorithm for the Automated Analysis of Complex Anisotropic NMR Spectra
✍ F. Castiglione; M. Carravetta; G. Celebre; M. Longeri πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 217 KB

## An existing algorithm, founded on the works of Stephenson and There is a basic difference between the traditional CB-B Binsch, for the automatic analysis of isotropic or simple anisoapproach and automatic analysis programs since, in the fortropic NMR spectra has been improved to treat very comp

An Incremental Algorithm for a Generaliz
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
✍ G. Ramalingam; Thomas Reps πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 363 KB

The grammar problem, a generalization of the single-source shortest-path prob-Ž Ž . Ž . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1᎐5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv