This paper gives a brief overview of some of the recent Krylov subspace techniques for large-scale matrix computations and their applications to the solutions of large-scale control problems. The research in this area is still in its infancy, but is quite active. For a comprehensive account of resul
โฆ LIBER โฆ
Efficient large scaled profile matrix computation programs
โ Scribed by M.S. Park
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 813 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0045-7949
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Large-scale matrix computations in contr
โ
Biswa Nath Datta
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 91 KB
Efficient Algorithms for Large-Scale Qua
โ
P. Benner
๐
Article
๐
2002
๐
John Wiley and Sons
โ 149 KB
Parallelization of a large-scale computa
โ
K. F. Tiampo; J. B. Rundle; P. Hopper; J. Sรก Martins; S. Gross; S. McGinnis
๐
Article
๐
2002
๐
John Wiley and Sons
๐
English
โ 254 KB
Use of mini-computers for large scale st
โ
John A. Swanson
๐
Article
๐
1977
๐
Elsevier Science
๐
English
โ 508 KB
An efficient interconnection network for
โ
Chwei-King Mok; Nader F. Mir
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 245 KB
This paper presents a new class of interconnection network architectures called hierarchical Manhattan-street network (H-MSN). The proposed network can be used in large-scale computer communication systems. The H-MSN combines useful features of the Manhattan-street network and hierarchical networks
Program of the Workshop on Large-Scale C
๐
Article
๐
1990
๐
Springer
๐
English
โ 106 KB