✦ LIBER ✦

Horn minimization by iterative decomposition

✍ Scribed by Endre Boros; Ondřej Čepek; Alexander Kogan

Book ID: 110379716
Publisher: Springer Netherlands
Year: 1998
Tongue: English
Weight: 190 KB
Volume: 23
Category: Article
ISSN: 1012-2443
DOI: 10.1023/a:1018932728409

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal decompositions and iterative met

Minimal decompositions and iterative methods

✍ Marko Huhtanen; Olavi Nevanlinna 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 190 KB

Spectrum estimation by iterative minimiz

Spectrum estimation by iterative minimization of the I-divergence measure

✍ White, L.B. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 423 KB

Iterative methods for model reduction by

Iterative methods for model reduction by domain decomposition

✍ M. Buffoni; H. Telib; A. Iollo 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 607 KB

Expansions of o-Minimal Structures by It

Expansions of o-Minimal Structures by Iteration Sequences

✍ Miller, Chris; Tyne, James 📂 Article 📅 2006 🏛 University of Notre Dame 🌐 English ⚖ 166 KB

Iterative methods improving newton's met

Iterative methods improving newton's method by the decomposition method

✍ Changbum Chun 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 418 KB

Minimizing bumps in ordered sets by subs

Minimizing bumps in ordered sets by substitution decomposition

✍ George Steiner 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 495 KB

A linear extension x1x2. . . x, of a partially or&red set P has a bump whenever Xi <xi+1 in P. The bump number problem is to find a linear extension of P with the smallest possible number of bumps. We present a basic decomposition theorem for this problem. This leads to simple formulae for the bump