Parallel algorithms for certain matrix computations
DOI10.1016/S0304-3975(97)83810-8zbMath0901.65029OpenAlexW2084098088MaRDI QIDQ1390874
Biswa N. Datta, Bruno Codenotti, Karabi Datta, Mauro Leoncini
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)83810-8
Lyapunov matrix equationfeedback matrixmatrix powerspole assignment problemcomplexity of parallel algorithmsrank matrix problemSylvester-observer matrix equation
Numerical optimization and variational techniques (65K10) Controllability (93B05) Pole and zero placement problems (93B55) Matrix equations and identities (15A24) Parallel numerical computation (65Y05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reduced order observers: A new algorithm and proof
- A complexity theory of efficient parallel algorithms
- The matrix equation \(XA=A^ TX\) and an associated algorithm for solving the inertia and stability problems
- Complexity of parallel matrix computations
- Pole assignment via Sylvester's equation
- Parallel algebraic reductions among numerical problems
- An algorithm for computing powers of a Hessenberg matrix and its applications
- Computing powers of arbitrary Hessenberg matrices
- Parallel Solution of Certain Toeplitz Linear Systems
- A new criterion of controllability
- A Hessenberg-Schur method for the problem AX + XB= C
- A Schur method for pole assignment
- Trends in large space structure control theory: Fondest hopes, wildest dreams
- On pure structure of dynamic systems
- On Stable Parallel Linear System Solvers
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
This page was built for publication: Parallel algorithms for certain matrix computations
