Results 51 to 60 of about 7,840 (182)
Stabilized Krylov Subspace Recurrences via Randomized Sketching
Numerical Linear Algebra with Applications, Volume 32, Issue 3, June 2025.ABSTRACT Recurrences building orthonormal bases for polynomial Krylov spaces have been classically used for approximation purposes in various numerical linear algebra contexts. Variants aiming to limit memory and computational costs by using truncated recurrences often have convergence constraints.
Valeria Simoncini, YiHong Wang
wiley +1 more source
A close look at Newton–Cotes integration rules
Results in Nonlinear Analysis, 2019 Newton–Cotes integration rules are the simplest methods in numerical integration. The main advantage of using these rules in quadrature software is ease of programming.
Emre Sermutlu
doaj
Time-Symmetric Rolling Tachyon Profile
, 2015 We investigate the tachyon profile of a time-symmetric rolling tachyon solution to open string field theory. We algebraically construct the solution of [arXiv:0707.4472] at 6th order in the marginal parameter, and numerically evaluate the corresponding ...
Longton, Matheson
core +1 more source
Water Resources Research, Volume 61, Issue 6, June 2025.Abstract The ECOsystem Spaceborne Thermal Radiometer Experiment on Space Station (ECOSTRESS) collects thermal observations from the International Space Station to support evapotranspiration (ET) research at fine spatial resolutions (70 m × 70 m). Initial ET from ECOSTRESS Collection 1 was used in scientific research and applications, though subsequent ...
Zoe Amie Pierrat +13 more
wiley +1 more source
A stochastic roundoff error analysis for the convolution [PDF]
Mathematics of Computation, 1992 We study the accuracy of an algorithm which computes the convolution via Radix-2 fast Fourier transforms. Upper bounds are derived for the expected value and the variance of the accompanying linear forms in terms of the expected value and variance of the relative roundoff errors for the elementary operations of addition and multiplication.
openaire +1 more source
Checking roundoff errors using counterexample-guided narrowing [PDF]
Proceedings of the IEEE/ACM international conference on Automated software engineering, 2010 This paper proposes a counterexample-guided narrowing approach, which mutually refines analyses and testing if (possibly spurious) counterexamples are found. A prototype tool CANAT for checking roundoff errors between floating point and fixed point numbers is reported with preliminary experiments.
Do Thi Bich Ngoc, Mizuhito Ogawa
openaire +1 more source
A new upper bound for the growth factor in Gaussian elimination with complete pivoting
Bulletin of the London Mathematical Society, Volume 57, Issue 5, Page 1369-1387, May 2025.Abstract The growth factor in Gaussian elimination measures how large the entries of an LU factorization can be relative to the entries of the original matrix. It is a key parameter in error estimates, and one of the most fundamental topics in numerical analysis. We produce an upper bound of n0.2079lnn+0.91$n^{0.2079 \ln n +0.91}$ for the growth factor
Ankit Bisain, Alan Edelman, John Urschel
wiley +1 more source
Nonconcurrent Error Correction in the Presence of Roundoff Noise [PDF]
Proceedings of the 45th IEEE Conference on Decision and Control, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Takos, G. +3 more
openaire +4 more sources
Sketched and Truncated Polynomial Krylov Methods: Evaluation of Matrix Functions
Numerical Linear Algebra with Applications, Volume 32, Issue 1, February 2025.ABSTRACT Among randomized numerical linear algebra strategies, so‐called sketching procedures are emerging as effective reduction means to accelerate the computation of Krylov subspace methods for, for example, the solution of linear systems, eigenvalue computations, and the approximation of matrix functions.
Davide Palitta +2 more
wiley +1 more source
On Sound Relative Error Bounds for Floating-Point Arithmetic
, 2017 State-of-the-art static analysis tools for verifying finite-precision code compute worst-case absolute error bounds on numerical errors. These are, however, often not a good estimate of accuracy as they do not take into account the magnitude of the ...
baranowski +9 more
core +1 more source