Error bounds for multistep methods revisited
- 期刊名称BIT Numerical Mathematics
- 作者Rolf Jeltsch; Olavi Nevanlinna
- 卷第26卷
- 期第4期
- 印刷ISSN0006-3835
- 电子ISSN1572-9125
- 文件大小510.80KB
- 发表时间1986
- DOI10.1007/bf01935056
- 页码505-520
What do multistep methods approximate?Timo Eirola; Olavi Nevanlinna · 1988
Numerical Taylor expansions for invariant manifoldsTimo Eirola; Jan von Pfaler · 2004
Perspectives in Numerical Analysis 2008Timo Eirola; Rolf Jeltsch; Claes Johnson; Erkki Somersalo; Rolf Stenberg · 2008
On Smooth Decompositions of MatricesDieci, Luca; Eirola, Timo · SIAM Journal on Matrix Analysis and Applications · 1999
Krylov integrators for Hamiltonian systemsEirola, Timo; Koskela, Antti · BIT Numerical Mathematics · 2018
A Refined Polar Decomposition: <i>A</i> = <i>UPD</i>Eirola, Timo · SIAM Journal on Matrix Analysis and Applications · 2001
Accelerating with rank-one updatesTimo Eirola; Olavi Nevanlinna · Linear Algebra and its Applications · 1989
Meromorphic resolvents and power bounded operatorsOlavi Nevanlinna · BIT Numerical Mathematics · 1996
Testing linear operatorsDavid Lee; Henryk Woźniakowski · BIT Numerical Mathematics · 1995
Highly accurate tables for elementary functionsWolfram Luther · BIT Numerical Mathematics · 1995
Some error expansions for Gaussian quadratureD. B. Hunter · BIT Numerical Mathematics · 1995
AcknowledgementsBIT Numerical Mathematics · 1996
AcknowledgementsBIT Numerical Mathematics · 1995
Enhancing energy conserving methodsSebastian Reich · BIT Numerical Mathematics · 1996
New books and journalsBIT Numerical Mathematics · 1996