Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Glenn H. Keitel

dblp:55/6802 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1956
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational science and engineering › numerical analysis
numerical integration
0.011956
An Extension of Milne's Three-Point Method · J. ACM 1956
Computational science and engineering › numerical analysis › numerical integration
ordinary differential equation solver
0.011956
An Extension of Milne's Three-Point Method · J. ACM 1956

Methods — techniques the papers use, named apart from their topics

variable step size adjustment · 0.0truncation error control · 0.0
YearPublicationVenuePosition
1956 An Extension of Milne's Three-Point Method
abstract
Milne's thr~e-point integration method uses a fixed integration step size, chosen to satisfy convergence and truncation error conditions at the worst possible point in the integration interval.Usually this step size is too small in most sections of the interval.In this paper, Milne's method is extended to i t ~l allow the use of a variable step size, the step being adiusted according to the conditions in the immediate neighborhood of the integration point.This method has the advantage of using the largest step consistent with convergence and accuracy requirements.In two applications of this method on a high-speed digital computer, it is estimated that the computing time required for Milne's lli method with a fixed step size would have been from 16 to 256 times greater than for the method described here.
Glenn H. Keitel
J. ACM1