Results 31 to 40 of about 1,550,711 (171)
Bidiagonal Decompositions and High‐Accuracy Computations for Newton Collocation Matrices
Numerical Linear Algebra with Applications, Volume 33, Issue 4, August 2026.ABSTRACT We consider a class of collocation matrices A$$ A $$ associated with the Newton basis of the space of polynomials of degree at most n$$ n $$, evaluated at a set of l+1≥n+1$$ l+1\ge n+1 $$ nodes. In the most general setting, we allow n$$ n $$ of these nodes to either coincide with or differ from those defining the Newton basis.
E. Mainar, A. Marco, B. Rubio, R. Viaña
wiley +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.
Taniguchi, Takeo, Soga, Akira
core +1 more source
Математичні СтудіїContinued fractions and their generalization, branched continued fractions, are the effective tools used to study special functions. In this aspect, an important problem of continued fractions and branched continued fractions is the study of their ...
M. V. Dmytryshyn +3 more
doaj +1 more source
Quantifying Numerical Energy Dissipation in Implicit Large Eddy Simulations
Journal of Advances in Modeling Earth Systems, Volume 18, Issue 8, August 2026.Abstract A novel methodology, using energy tracers, is introduced with the aim of diagnosing numerical energy dissipation, both globally and locally, in numerical models of the atmosphere. Energy dissipation might correspond to some physical process, such as the cascade of kinetic energy to unresolved scales if that energy is not restored as heat ...
J. Thuburn
wiley +1 more source
Roundoff errors in the fast computation of discrete convolutions [PDF]
, 1981 summary:The efficient evaluation of a discrete convolution is usually carried out as a repated evaluation of a discrete convolution of a special type with the help of the fast Fourier transform.
Segeth, Karel
core +1 more source
The Role of Dice in the Emergence of the Probability Calculus
International Statistical Review, Volume 94, Issue 2, Page 464-483, August 2026.Summary The early development of the probability calculus was clearly influenced by the roll of dice. However, while dice have been cast since time immemorial, documented calculations on the frequency of various dice throws date back only to the mid‐13th century.
David R. Bellhouse, Christian Genest
wiley +1 more source
FloeNet: A Mass‐Conserving Global Sea Ice Emulator That Generalizes Across Climates
Geophysical Research Letters, Volume 53, Issue 14, 28 July 2026.Abstract We introduce FloeNet, a graph neural network trained to emulate the Geophysical Fluid Dynamics Laboratory global sea ice model, SIS2. FloeNet is a mass‐conserving model, emulating 6‐hr mass and area budget tendencies related to sea ice and snow‐on‐sea‐ice growth, melt, and advection.
William Gregory +10 more
wiley +1 more source
Distributed arithmetic implementation of a reduced roundoff error filter [PDF]
, 1984 The applicability of a hardware efficient realization of the distributed arithmetic approach for implementing digital filters was the concern of this study. To this end, 2 sixth order Butterworth filters were implemented. The first had a cutoff frequency
Phillips, Carrie F.
core
Local Polynomial Regression and Filtering for a Versatile Mesh‐Free PDE Solver
International Journal for Numerical Methods in Fluids, Volume 98, Issue 7, Page 804-839, July 2026.A high‐order, mesh‐free finite difference method for solving differential equations is presented. Both derivative approximation and scheme stabilisation is carried out by parametric or non‐parametric local polynomial regression, making the resulting numerical method accurate, simple and versatile. Numerous numerical benchmark tests are investigated for
Alberto M. Gambaruto
wiley +1 more source
Gram Decay and Intrinsic Dimensions of Krylov Subspaces
Numerical Linear Algebra with Applications, Volume 33, Issue 3, June 2026.ABSTRACT Krylov subspace methods solve large sparse linear systems Ax=b$$ Ax=b $$ by building a sequence of polynomial approximations to A−1b$$ {A}^{-1}b $$ from successive matrix‐vector products. In finite precision, the number of numerically independent directions that can be extracted from this sequence is bounded by the intrinsic information ...
Stephen J. Thomas
wiley +1 more source