𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Explicit solution of the row completion problem for matrix pencils

✍ Scribed by Marija Dodig

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
183 KB
Volume
432
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Assigning the Kronecker invariants of a
Assigning the Kronecker invariants of a matrix pencil by row or column completions
✍ Jean Jacques Loiseau; Sabine MondiΓ©; Ion Zaballa; Petr Zagalak πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 593 KB

The challenge consists in describing the relationships between the Kronecker invariants of a matrix pencil and one of its subpencils. For a given subpencil, an algorithm for constructing a matrix pencil with prescribed Kronecker invariants should also be proposed.

Probabilistic analysis of an asymptotica
Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
✍ C.T. Ng; X. Cai; T.C.E. Cheng πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 135 KB πŸ‘ 2 views

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well-known NP-hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optima

A Solution of the Matrix Problem for Ric
A Solution of the Matrix Problem for Rickart C*-Algebras
✍ Pere Ara; Dmitry Goldstein πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 636 KB

## Abstract We prove that matrix algebras over a Rickart __C__\*‐algebra are also Rickart __C__\*‐algebras. As a consequence of this, every Rickart __C__\*‐algebra is an __UMF__‐algebra and satisfies polar decomposition.