Parallel and large-scale matrix computations in control: Some ideas
type: Item
instance of: scholarly article
title: Parallel and large-scale matrix computations in control: Some ideas
zbMATH Open document ID: 0681.65046
DOI: 10.1016/0024-3795(89)90705-2
author: Biswa Nath Datta
published in: Linear Algebra and its Applications
publication date: 1989-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 93B55
Mathematics Subject Classification ID: 93A15
Mathematics Subject Classification ID: 15A24
zbMATH DE Number: 4115855
zbMATH Keywords: parallel algorithms
zbMATH Keywords: large-scale linear control problems
zbMATH Keywords: pole assignment algorithms
zbMATH Keywords: single-input systems
zbMATH Keywords: Sylvester matrix equation
zbMATH Keywords: large-scale Luenberger observers
reviewed by: Petko Hr. Petkov
MaRDI profile type: Publication
full work available at URL: 0024-3795(89)90705-2
OpenAlex ID: W2042471311
cites work: An iterative pole-placement algorithm
cites work: The principle of minimized iterations in the solution of the matrix eigenvalue problem
cites work: Trends in large space structure control theory: Fondest hopes, wildest dreams
cites work: Q4065362
cites work: Pole assignment via Sylvester's equation
cites work: Numerically Stable Solution of Dense Systems of Linear Equations Using Mesh-Connected Processors
cites work: The Lanczos-Arnoldi algorithm and controllability
cites work: Q3693370
cites work: Q4100000
cites work: Q4156633
cites work: Robust and well-conditioned eigenstructure assignment via sylvester's equation
cites work: An algorithm to assign eigenvalues in a Hessenberg matrix: Single input case
cites work: Q3734976
cites work: The matrix equation \(XA=A^ TX\) and an associated algorithm for solving the inertia and stability problems
cites work: The matrix equation \(XA-BX=R\) and its applications
cites work: Controllability, observability and the solution of AX-XB=C
cites work: Direct Solution of Sets of Linear Equations whose Matrix is Sparse, Symmetric and Indefinite
cites work: Fast projection methods for minimal design problems in linear system theory
cites work: Q3688184
cites work: Synthesis of linear systems with desired equivalent form
cites work: Q4401802
cites work: Numerical linear algebra aspects of control design computations
cites work: Q3912674
cites work: Pole assignment in real Schur form
cites work: Modal control of linear time invariant systems
cites work: Properties of numerical algorithms related to computing controllability
cites work: Computation of minimal-order state-space realizations and observability indices using orthogonal transformations
cites work: Q4724490
cites work: Q3931082
cites work: Q5659396
cites work: Projection and deflation method for partial pole assignment in linear state feedback
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: On Jacobi and Jacobi-Like Algorithms for a Parallel Computer
cites work: On Stable Parallel Linear System Solvers
cites work: On pure structure of dynamic systems
cites work: On structural decomposition and stabilization of large-scale control systems
cites work: Q3688170
cites work: Using the Hessenberg decomposition in control theory
cites work: A Schur method for pole assignment
cites work: Q5674306
cites work: Q3859620
description: scientific article; zbMATH DE number 4115855