𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convergence of a subgradient method for computing the bound norm of matrices

✍ Scribed by Pham Dinh Tao

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
996 KB
Volume
62
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on bound for norms of Cauchy–Hank
A note on bound for norms of Cauchy–Hankel matrices
✍ SΓΌleyman Solak; Durmuş Bozkurt πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 77 KB

## Abstract We determine bounds for the spectral and 𝓁~__p__~ norm of Cauchy–Hankel matrices of the form __H__~__n__~=[1/(__g__+__h__(__i__+__j__))]^__n__^~__i,j__=1~≑ ([1/(__g__+__kh__)]^__n__^~__i,j__=1~), __k__=0, 1,…, __n__ –1, where __k__ is defined by __i__+__j__=__k__ (mod __n__). Copyright

Convergence analysis of an iterative agg
Convergence analysis of an iterative aggregation/disaggregation method for computing stationary probability vectors of stochastic matrices
✍ Ivo Marek; Petr Mayer πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 104 KB πŸ‘ 2 views

An aggregation/disaggregation iterative algorithm for computing stationary probability vectors of stochastic matrices is analysed. Two convergence results are presented. First, it is shown that fast, global convergence can be achieved provided that a sufficiently high number of relaxations is perfor

A Power Method for Computing Square Root
A Power Method for Computing Square Roots of Complex Matrices
✍ Mohammed A. Hasan πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 188 KB

In this paper higher order convergent methods for computing square roots of nonsingular complex matrices are derived. These methods are globally convergent and are based on eigenvalue shifting and powering. Specifically, it is shown for each positive integer r G 2, a convergent method of order r can