Parallel and large-scale matrix computations in control: Some ideas (Q1823622)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4115855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel and large-scale matrix computations in control: Some ideas |
scientific article; zbMATH DE number 4115855 |
Statements
Parallel and large-scale matrix computations in control: Some ideas (English)
0 references
1989
0 references
Several parallel algorithms for solving large-scale linear control problems are presented. The proposed pole assignment algorithms for single-input systems can be implemented in O(n \(log_ 2n)\) parallel steps using \(O(n^ 2)\) processors. Extensions for the multi-input case are also considered. A method for solving the Sylvester matrix equation, arising in the design of large-scale Luenberger observers is described, which exhibits a certain parallelism.
0 references
parallel algorithms
0 references
large-scale linear control problems
0 references
pole assignment algorithms
0 references
single-input systems
0 references
Sylvester matrix equation
0 references
large-scale Luenberger observers
0 references
0 references
0 references
0 references
0 references
0 references
0.8986100554466248
0 references
0.8393438458442688
0 references
0.8393437266349792
0 references
