𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for generalized algebraic Bernoulli equations based on the matrix sign function

✍ Scribed by Sergio Barrachina; Peter Benner; Enrique S. Quintana-Ortí

Publisher
Springer US
Year
2007
Tongue
English
Weight
418 KB
Volume
46
Category
Article
ISSN
1017-1398

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm based on the generalized D-
An algorithm based on the generalized D-gap function for equilibrium problems
✍ Liping Zhang; Soon-Yi Wu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 574 KB

The equilibrium problem (EP) can be reformulated as an unconstrained minimization problem through the generalized D-gap function. In this paper, we propose an algorithm for minimizing the problem and analyze some convergence properties of the proposed algorithm. Under some reasonable conditions, we

The Schur algorithm for generalized Schu
The Schur algorithm for generalized Schur functions III: J-unitary matrix polynomials on the circle
✍ Daniel Alpay; Tomas Azizov; Aad Dijksma; Heinz Langer 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 252 KB

The main result is that for J = 1 0 0 -1 every J -unitary 2 × 2-matrix polynomial on the unit circle is an essentially unique product of elementary J -unitary 2 × 2-matrix polynomials which are either of degree 1 or 2k. This is shown by means of the generalized Schur transformation introduced in [