Entry Lyche:1969:OOM from lnm1960.bib
Last update: Sat Mar 2 02:18:53 MST 2019
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
Y |
Z
BibTeX entry
@Article{Lyche:1969:OOM,
author = "Tom Lyche",
title = "Optimal order multistep methods with an arbitrary
number of nonsteppoints",
journal = j-LECT-NOTES-MATH,
volume = "109",
pages = "194--199",
year = "1969",
CODEN = "LNMAA2",
DOI = "https://doi.org/10.1007/BFb0060028",
ISBN = "3-540-04628-3 (print), 3-540-36158-8 (e-book)",
ISBN-13 = "978-3-540-04628-8 (print), 978-3-540-36158-9
(e-book)",
ISSN = "0075-8434 (print), 1617-9692 (electronic)",
ISSN-L = "0075-8434",
bibdate = "Thu May 8 17:39:14 MDT 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/lnm1960.bib",
URL = "http://link.springer.com/chapter/10.1007/BFb0060028/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/BFb0060012",
book-URL = "http://www.springerlink.com/content/978-3-540-36158-9",
fjournal = "Lecture Notes in Mathematics",
journal-URL = "http://link.springer.com/bookseries/304",
}
Related entries
- 3-540-04628-3,
109(0)vi--275,
109(0)1,
109(0)7,
109(0)23,
109(0)40,
109(0)87,
109(0)113,
109(0)133,
109(0)140,
109(0)148,
109(0)154,
109(0)160,
109(0)168,
109(0)172,
109(0)179,
109(0)188,
109(0)200,
109(0)207,
109(0)214,
109(0)221,
109(0)261
- 3-540-36158-8,
109(0)vi--275,
109(0)1,
109(0)7,
109(0)23,
109(0)40,
109(0)87,
109(0)113,
109(0)133,
109(0)140,
109(0)148,
109(0)154,
109(0)160,
109(0)168,
109(0)172,
109(0)179,
109(0)188,
109(0)200,
109(0)207,
109(0)214,
109(0)221,
109(0)261
- 978-3-540-04628-8,
109(0)vi--275,
109(0)1,
109(0)7,
109(0)23,
109(0)40,
109(0)87,
109(0)113,
109(0)133,
109(0)140,
109(0)148,
109(0)154,
109(0)160,
109(0)168,
109(0)172,
109(0)179,
109(0)188,
109(0)200,
109(0)207,
109(0)214,
109(0)221,
109(0)261
- 978-3-540-36158-9,
109(0)vi--275,
109(0)1,
109(0)7,
109(0)23,
109(0)40,
109(0)87,
109(0)113,
109(0)133,
109(0)140,
109(0)148,
109(0)154,
109(0)160,
109(0)168,
109(0)172,
109(0)179,
109(0)188,
109(0)200,
109(0)207,
109(0)214,
109(0)221,
109(0)261
- arbitrary,
83(0)15
- method,
8(0)112,
8(0)120,
13(0)12,
23(0)ii--122,
27(0)24,
27(0)43,
27(0)71,
31(0)iv--329,
31(0)208,
32(0)iii--122,
35(0)246,
37(0)83,
50(0)117,
54(0)39,
60(0)31,
64(0)v--90,
81(0)v--131,
89(0)55,
91(0)viii--194,
91(0)45,
91(0)59,
91(0)161,
109(0)7,
109(0)23,
109(0)40,
109(0)113,
109(0)133,
109(0)140,
109(0)172,
109(0)200,
109(0)207,
109(0)214,
109(0)221,
109(0)261
- multistep,
109(0)23
- number,
21(0)ii--102,
29(0)vi--199,
29(0)1,
29(0)23,
29(0)72,
29(0)131,
29(0)160,
29(0)188,
31(0)63,
54(0)v--69,
72(0)166,
75(0)57,
95(0)22,
95(0)34,
95(0)57,
109(0)179,
110(0)41,
110(0)77,
110(0)83,
111(0)iii--99,
111(0)70
- Optimal,
31(0)176
- order,
8(0)80,
10(0)96,
31(0)112,
51(0)123,
54(0)13,
68(0)36,
84(0)81,
95(0)26,
109(0)133