Matrix completion with e-algorithm: In memory of Peter Wynn (1931–2017)

Walter Gander; Qiquan Shi

doi:10.1007/s11075-018-0579-y

Matrix completion with e-algorithm: In memory of Peter Wynn (1931–2017)

Walter Gander^*
, Qiquan Shi

^*Corresponding author for this work

Department of Computer Science

Research output: Contribution to journal › Journal article › peer-review

2 Citations (Scopus)

Abstract

We show in this paper how the convergence of an algorithm for matrix completion can be significantly improved by applying Wynn’s e-algorithm. Straightforward generalization of the scalar e-algorithm to matrices fails. However, accelerating the convergence of only the missing matrix elements turns out to be very successful.

Original language	English
Pages (from-to)	279-301
Number of pages	23
Journal	Numerical Algorithms
Volume	80
Issue number	1
DOIs	https://doi.org/10.1007/s11075-018-0579-y
Publication status	Published - 23 Jan 2019

User-Defined Keywords

Convergence acceleration
Epsilon-algorithm
Matrix completion

Access to Document

10.1007/s11075-018-0579-y

Cite this

@article{3cf923d362f84578a27a6a29f41c214f,

title = "Matrix completion with e-algorithm: In memory of Peter Wynn (1931–2017)",

abstract = "We show in this paper how the convergence of an algorithm for matrix completion can be significantly improved by applying Wynn{\textquoteright}s e-algorithm. Straightforward generalization of the scalar e-algorithm to matrices fails. However, accelerating the convergence of only the missing matrix elements turns out to be very successful.",

keywords = "Convergence acceleration, Epsilon-algorithm, Matrix completion",

author = "Walter Gander and Qiquan Shi",

note = "Publisher Copyright: {\textcopyright} 2018, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2019",

month = jan,

day = "23",

doi = "10.1007/s11075-018-0579-y",

language = "English",

volume = "80",

pages = "279--301",

journal = "Numerical Algorithms",

issn = "1017-1398",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Matrix completion with e-algorithm

T2 - In memory of Peter Wynn (1931–2017)

AU - Gander, Walter

AU - Shi, Qiquan

PY - 2019/1/23

Y1 - 2019/1/23

N2 - We show in this paper how the convergence of an algorithm for matrix completion can be significantly improved by applying Wynn’s e-algorithm. Straightforward generalization of the scalar e-algorithm to matrices fails. However, accelerating the convergence of only the missing matrix elements turns out to be very successful.

AB - We show in this paper how the convergence of an algorithm for matrix completion can be significantly improved by applying Wynn’s e-algorithm. Straightforward generalization of the scalar e-algorithm to matrices fails. However, accelerating the convergence of only the missing matrix elements turns out to be very successful.

KW - Convergence acceleration

KW - Epsilon-algorithm

KW - Matrix completion

UR - https://www.scopus.com/pages/publications/85051739037

U2 - 10.1007/s11075-018-0579-y

DO - 10.1007/s11075-018-0579-y

M3 - Journal article

AN - SCOPUS:85051739037

SN - 1017-1398

VL - 80

SP - 279

EP - 301

JO - Numerical Algorithms

JF - Numerical Algorithms

IS - 1

ER -

Matrix completion with e-algorithm: In memory of Peter Wynn (1931–2017)

Abstract

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this