On a general \(\rho\)-algorithm (Q751746)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a general -algorithm |
scientific article; zbMATH DE number 4178621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a general \(\rho\)-algorithm |
scientific article; zbMATH DE number 4178621 |
Statements
On a general \(\rho\)-algorithm (English)
0 references
1990
0 references
The author obtains an identity for some determinant quotients. It is called the general \(\rho\)-algorithm and is stated and proved using the Schur-complement method. The usual \(\rho\)-algorithm is obtained as a particular case of the general \(\rho\)-algorithm.
0 references
rho-algorithm
0 references
convergence acceleration
0 references
lozenge rule
0 references
epsilon-algorithm
0 references
lozenge algorithms
0 references
E-algorithm
0 references
determinant quotients
0 references
Schur-complement method
0 references
0 references
0 references
0 references
0.8926631
0 references
0.8708473
0 references
0.8657678
0 references
0.86393267
0 references
0.8606464
0 references
