𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Rate of Convergence for the Method of Alternating Projections, II

✍ Scribed by Frank Deutsch; Hein Hundal

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
215 KB
Volume
205
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

✦ Synopsis

The purpose of the paper is threefold:

Ε½ .

1 To develop a useful error bound for the method of alternating projections which is relatively easy to compute and remember;

Ε½ .

2 To exhibit a counterexample to a conjecture of Kayalar and Weinert; Ε½ .

Ž . 3 To show that in the case of at least three subspaces any error bound which only depends on the angles between the various subspaces involved can ne¨er be sharp.

πŸ“œ SIMILAR VOLUMES

Optimization of the nonlinear convergenc
Optimization of the nonlinear convergence rate of the SIMPLER Picard algorithm for steady incompressible internal flows through enforcement of continuity projections
✍ S. Kumar; P. J. Smith πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 249 KB

We discuss the performance optimization of the Semi-Implicit Method for Pressure-Linked Equations-Revised (SIMPLER) Picard algorithm for steady incompressible internal ows. We discuss the nonlinear convergence of the Picard iteration as a function of the pressure and scalar potential continuity proj

The rate of convergence of the S matrix
The rate of convergence of the S matrix for the renormalized Numerov and log-derivative methods
✍ J. P. Braga πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 245 KB

The convergence of the S matrix for the renormalized Numerov method, the original log-derivative method, and. one recent version of this method is studied. A single-and a two-channel problem are analyzed and the percent relative errors for the S matrix and transition probabilities are calculated.

Techniques for bounding the convergence
Techniques for bounding the convergence rate of genetic algorithms
✍ Yuri Rabinovich; Avi Wigderson πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 308 KB πŸ‘ 2 views

The main purpose of the present paper is the study of computational aspects, ## Ε½ . and primarily the convergence rate, of genetic algorithms GAs . Despite the fact that such algorithms are widely used in practice, little is known so far about their theoretical properties, and in particular about