Results 21 to 30 of about 1,550,711 (171)
Cycles and circles in roundoff errors
Physical Review E, 1993 CYCLER Paper 93feb007 ascii with figures available from ...
openaire +3 more sources
On numerical stability of continued fractions
Математичні СтудіїThe paper considers the numerical stability of the backward recurrence algorithm (BR-algorithm) for computing approximants of the continued fraction with complex elements.
V. Hladun +3 more
doaj +1 more source
Roundoff error analysis of the double exponential formula-based method for the matrix sign function [PDF]
, 2023 In this paper, we perform a roundoff error analysis of an integration-based method for computing the matrix sign function recently proposed by Nakaya and Tanaka.
Miyashita, Tomoya +2 more
core +1 more source
A Splitting Architecture for Exact Reduced Coulomb Friction
Computer Graphics Forum, EarlyView.Abstract Existing approaches to frictional contact dynamics typically either modify the Coulomb law to improve numerical robustness or solve the exact law in a fully coupled monolithic form. However, in its reduced form, exact Coulomb friction can be written as a cone complementarity problem with an augmented velocity, which reveals a natural split ...
Hongcheng Song +3 more
wiley +1 more source
Proceedings in Applied Mathematics and Mechanics, Volume 26, Issue 4, December 2026.ABSTRACT Stochastic Galerkin methods offer unexplored potential for the numerical simulation of parabolic problems with random variables, in particular if they are combined with variational discretizations of the space and time variables. Due to the high dimensionality, the solution of the arising algebraic systems do not become feasible without ...
Moataz Dawor +2 more
wiley +1 more source
Onsager: Roundoff error update
, 2016 <p>Corrects for roundoff error caused by very large omega2 rates; additional update to automator to include Makefile.</p ...
Dallas Trinkle, Abhinav Jain
core +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
Compile‐Once Block Encodings for Masked Similarity‐Transformed Effective Hamiltonians
Advanced Quantum Technologies, Volume 9, Issue 9, September 2026.Composer transforms structured electronic‐structure operators into a reusable quantum‐circuit fabric. Once compiled, the same block‐encoding architecture is re‐dialed through coefficients, rotation angles, and masks to generate similarity‐transformed effective Hamiltonians across related problem instances, avoiding repeated structural recompilation ...
Bo Peng, Yuan Liu, Karol Kowalski
wiley +1 more source
Математичні СтудіїIn this paper, we consider some numerical aspects of branched continued fractions as special families of functions to represent and expand analytical functions of several complex variables, including generalizations of hypergeometric functions.
R. Dmytryshyn +3 more
doaj +1 more source
Artificial Intelligence for Engineering, Volume 2, Issue 3, Page 251-264, September 2026.Caputo‐based fPINNs accurately solve fractional ODEs and PDEs while exposing an accuracy–cost trade‐off driven by the history‐dependent fractional derivative. Temporal collocation and shorter time windows are the most effective strategies for improving early‐time accuracy without unnecessary spatial refinement.
Donya Dabiri +4 more
wiley +1 more source