𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On computational efficiency of linear filtering algorithms

✍ Scribed by I.A. Gura; A.B. Bierman

Publisher
Elsevier Science
Year
1971
Tongue
English
Weight
903 KB
Volume
7
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computational efficiency of non-linear p
Computational efficiency of non-linear programming methods on a class of structural problems
✍ W. C. Carpenter; E. A. Smith πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 804 KB

## Abstract Results are presented of an investigation as to the computational efficiency of several non‐linear programming algorithms on the constrained structural weight optimization of plane trusses and plane stress plates. The optimization algorithms considered are the methods of sequential line

Linear combination of Lanczos vectors: A
Linear combination of Lanczos vectors: A storage-efficient algorithm for sparse matrix eigenvector computations
✍ T. Koslowski; W. Von Niessen πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 634 KB

We present a storage-efficient and robust algorithm for the computation of eigenvectors of large sparse symmetrical matrices using a Lanczos scheme. The algorithm is based upon a linear combination of Lanczos vectors (LCLV) with a variable iteration depth. A simple method is given to determine the i