Results 11 to 20 of about 2,905,950 (213)
Global error estimation of linear multistep methods through the Runge-Kutta methods [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2016 In this paper, we study the global truncation error of the linear multistep methods (LMM) in terms of local truncation error of the corresponding Runge-Kutta schemes. The key idea is the representation of LMM with a corresponding Runge-Kutta method.
Javad Farzi
doaj +1 more source
Axioms, 2023 This paper is presented in the context of sensitivity analysis (SA) of large-scale data assimilation (DA) models. We studied consistency, convergence, stability and roundoff error propagation of the reduced-space optimization technique arising in ...
Luisa D’Amore, Rosalba Cacciapuoti
doaj +1 more source
Certified Roundoff Error Bounds Using Bernstein Expansions and Sparse Krivine-Stengle Representations [PDF]
IEEE transactions on computers, 2018 Floating point error is a drawback of embedded systems implementation that is difficult to avoid. Computing rigorous upper bounds of roundoff errors is absolutely necessary for the validation of critical software. This problem of computing rigorous upper
Victor Magron, Alexandre Rocca, T. Dang
semanticscholar +1 more source
Where the really hard problems aren’t
Operations Research Perspectives, 2020 Not all problem instances in combinatorial optimization are equally hard. One famous study “Where the Really Hard Problems Are” shows that for three decision problems and one optimization problem, computational costs can vary dramatically for equally ...
Joeri Sleegers +3 more
doaj +1 more source
Error Analysis of Band Matrix Method [PDF]
, 1984 Numerical error in the solution of the band matrix method based on the elimination method in single precision is investigated theoretically and experimentally, and the behaviour of the truncation error and the roundoff error is clarified.
Soga, Akira, Taniguchi, Takeo
core +1 more source
Propagation of internal errors in explicit Runge--Kutta methods and internal stability of SSP and extrapolation methods [PDF]
, 2014 In practical computation with Runge--Kutta methods, the stage equations are not satisfied exactly, due to roundoff errors, algebraic solver errors, and so forth.
Ketcheson, David I. +2 more
core +2 more sources
Scaling Turbulent Combustion Fields in Explosions
Applied Sciences, 2020 We considered the topic of explosions from spherical high-explosive (HE) charges. We studied how the turbulent combustion fields scale. On the basis of theories of dimensional analysis by Bridgman and similarity theories of Sedov and Barenblatt, we found
Allen Kuhl, David Grote, John Bell
doaj +1 more source
Parts of the Whole: Error Estimation for Science Students
Numeracy, 2017 It is important for science students to understand not only how to estimate error sizes in measurement data, but also to see how these errors contribute to errors in conclusions they may make about the data. Relatively small errors in measurement, errors
Dorothy Wallace
doaj +1 more source
An Introduction to Affine Arithmetic
Trends in Computational and Applied Mathematics, 2003 Affine arithmetic (AA) is a model for self-validated computation which, like standard interval arithmetic (IA), produces guaranteed enclosures for computed quantities, taking into account any uncertainties in the input data as well as all internal ...
J. Stolfi, L.H. de Figueiredo
doaj +1 more source
Computation of the inverse Laplace Transform based on a Collocation method which uses only real values [PDF]
, 2007 We develop a numerical algorithm for inverting a Laplace transform (LT), based on Laguerre polynomial series expansion of the inverse function under the assumption that the LT is known on the real axis only.
A. MurliI +3 more
core +1 more source