Results 61 to 70 of about 7,065 (184)

Two Loop Computation of the Schroedinger Functional in Lattice QCD

, 2001
We compute the Schroedinger functional (SF) for the case of lattice QCD with Wilson fermions (with and without SW improvement) at two-loop order in lattice perturbation theory.
Achim Bode, Bode, Bode, Bode, Bode, Capitani, Capitani, Capitani, Christou, Christou, de Divitiis, Edwards, Gonzalez Arroyo, Groot, Kawai, Lüscher, Lüscher, Lüscher, Lüscher, Lüscher, Lüscher, Lüscher, Marinelli, Narayanan, Peter Weisz, Rolf, Sheikholeslami, Sint, Sint, Sommer, Sommer, Stehr, Tarasov, Ulli Wolff, Weisz, Weisz, Wohlert   +36 more
core   +1 more source

A Review of Green's Function Methods for Tracer Timescales and Pathways in Ocean Models

Journal of Advances in Modeling Earth Systems, Volume 17, Issue 7, July 2025.
Abstract Understanding advective‐diffusive dispersal of trace substances in environmental fluids like the global ocean is a ubiquitous challenge in geophysics. Since the turn of the millennium, substantial progress has been made in the theory, implementation in models, and application of such tracers in oceanography.
Thomas W. N. Haine, Stephen M. Griffies, Geoffrey Gebbie, Wenrui Jiang   +3 more
wiley   +1 more source

A Unifying Framework for Finite Wordlength Realizations.

, 2007
A general framework for the analysis of the finite wordlength (FWL) effects of linear time-invariant digital filter implementations is proposed. By means of a special implicit system description, all realization forms can be described.
Chevrel, Philippe, Hilaire, Thibault, Whidborne, James F.   +2 more
core   +3 more sources

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

Efficient and accurate methods for solving the time-dependent spin-1 Gross-Pitaevskii equation

, 2016
We develop a numerical method for solving the spin-1 Gross-Pitaevskii equation. The basis of our work is a two-way splitting of the spin-1 evolution equation that leads to two exactly solvable flows.
Blakie, P. B., McLachlan, R. I., Symes, L. M.   +2 more
core   +1 more source

Symplectic integration without roundoff error [PDF]

, 2006
Most numerical integration algorithms are not designed specifically for Hamiltonian systems and do not respect their characteristic properties, which include the preservation of phase space volume with time. This can lead to spurious damping or excitation.
openaire   +2 more sources

Evaluation of ECOSTRESS Collection 2 Evapotranspiration Products: Strengths and Uncertainties for Evapotranspiration Modeling

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, Adam J. Purdy, Gregory Halverson, Joshua B. Fisher, Kanishka Mallick, Madeleine Pascolini‐Campbell, Youngryel Ryu, Martha C. Anderson, Claire Villanueva‐Weeks, Margaret C. Johnson, Brenna Hatch, Evan Davis, Yun Yang, Kerry Cawse‐Nicholson   +13 more
wiley   +1 more source

Simple but accurate periodic solutions for the nonlinear pendulum equation

Revista Brasileira de Ensino de Física
Despite its elementary structure, the simple pendulum oscillations are described by a nonlinear differential equation whose exact solution for the angular displacement from vertical as a function of time cannot be expressed in terms of an elementary ...
Fábio M.S. Lima
doaj   +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

USING RATIONAL NUMBERS AND PARALLEL COMPUTING TO EFFICIENTLY AVOID ROUND-OFF ERRORS ON MAP SIMPLIFICATION

Revista Brasileira de Cartografia, 2018
This paper presents EPLSimp, an algorithm for map generalization that avoids the creation of topological inconsistencies. EPLSimp is based on Visvalingam-Whyatt's (VW) algorithm on which least "important" points are removed first.
Maurício G. Gruppi, Salles V. G. de Magalhães, Marcus V. A. Andrade, W. Randolph Franklin, Wenli Li   +4 more
doaj