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

James C. Geuder

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

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

Applied, interdisciplinary, general and emerging computing · 1

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 linear algebra
linear equation solving
0.011967
Computable Error Bounds for Direct Solution of Linear Equations · J. ACM 1967
Computational science and engineering
numerical analysis
0.011967
Computable Error Bounds for Direct Solution of Linear Equations · J. ACM 1967

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

gaussian elimination · 0.0backward error analysis · 0.0
YearPublicationVenuePosition
1967 Computable Error Bounds for Direct Solution of Linear Equations
abstract
An error analysis of direct methods (i.e., Gaussian elimination or triangular factorization) of solving simultaneous linear algebraic equations is performed in the backward mode, in which the computational errors are expressed as perturbations on the data. Bounds are found for perturbations on the coefficients of the equations, leaving the right-hand sides unchanged. These bounds can be evaluated concurrently with the computation itself, with only a small increase in computing effort. Because they use information obtained during the solution process, these bounds avoid exaggerating the magnitude of the error, and so are also useful as error estimates.
Bruce A. Chartres, James C. Geuder
J. ACM2