Results 21 to 30 of about 3,221,012 (201)
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
Propagation of internal errors in explicit Runge--Kutta methods and internal stability of SSP and extrapolation methods [PDF]
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
Where the really hard problems aren’t
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]
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
Scaling Turbulent Combustion Fields in Explosions
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
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
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
Solution of Dense Linear Systems via Roundoff-Error-Free Factorization Algorithms
Exact solving of systems of linear equations (SLEs) is a fundamental subroutine within number theory, formal verification of mathematical proofs, and exact-precision mathematical programming.
Adolfo R. Escobedo +2 more
semanticscholar +1 more source
Computation of the inverse Laplace Transform based on a Collocation method which uses only real values [PDF]
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
On fully discrete collocation methods for solving weakly singular integral equations
A popular class of methods for solving weakly singular integral equations is the class of piecewise polynomial collocation methods. In order to implement those methods one has to compute exactly certain integrals that determine the linear system to be ...
Raul Kangro, Inga Kangro
doaj +1 more source

