Results 81 to 90 of about 67,589 (200)
Computing the Lambert W function in arbitrary-precision complex interval arithmetic
We describe an algorithm to evaluate all the complex branches of the Lambert W function with rigorous error bounds in interval arithmetic, which has been implemented in the Arb library.
Johansson, Fredrik
core
A Subdivision Solver for Systems of Large Dense Polynomials [PDF]
We describe here the package {\tt subdivision\\_solver} for the mathematical software {\tt SageMath}. It provides a solver on real numbers for square systems of large dense polynomials.
Imbach, Rémi
core +3 more sources
2D Piecewise Linear Scalar Fields with Invertible Integral Lines
Abstract Integral lines of the gradient flow are standard features in continuously differentiable scalar fields that enjoy some useful properties: They cover the domain densely, do not split, merge, or intersect, and are therefore invertible. For widely used discretizations of scalar fields, the corresponding polygonal approximations of integral lines ...
T.L. Erxleben +3 more
wiley +1 more source
Accurate and Efficient Expression Evaluation and Linear Algebra
We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices.
Aho +17 more
core +3 more sources
Parallel Arbitrary-precision Integer Arithmetic
Arbitrary-precision integer arithmetic computations are driven by applications in solving systems of polynomial equations and public-key cryptography. Such computations arise when high precision is required (with large input values that fit into multiple machine words), or to avoid coefficient overflow due to intermediate expression swell.
openaire +1 more source
Fast Injective Mesh Parameterization via Beltrami Coefficient Prolongation
Abstract We present a highly efficient and robust method for free boundary injective parameterization of disk‐like triangle meshes with low isometric distortion. Harmonic function–based approaches, grounded in a strong mathematical framework, are widely employed.
G. Fargion, O. Weber
wiley +1 more source
SWATI: Synthesizing Wordlengths Automatically Using Testing and Induction [PDF]
In this paper, we present an automated technique SWATI: Synthesizing Wordlengths Automatically Using Testing and Induction, which uses a combination of Nelder-Mead optimization based testing, and induction from examples to automatically synthesize ...
Jha, Susmit, Seshia, Sanjit A.
core
Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis
Abstract We investigate the evaluation of points and derivatives of Bézier curves and surfaces on modern architectures, focusing on performance and guided by numerical error bounds. While the de Casteljau algorithm remains the reference for numerical robustness, its linear working‐set size imposes substantial register pressure on GPUs.
Gábor Valasek, Anna Lili Horváth
wiley +1 more source
A revision of the subtract-with-borrow random number generators
The most popular and widely used subtract-with-borrow generator, also known as RANLUX, is reimplemented as a linear congruential generator using large integer arithmetic with the modulus size of 576 bits.
Sibidanov, Alexei
core +1 more source
The hole in the doughnut: Formalizing and testing a key model of degrowth
Abstract Degrowth scholars often claim that capitalism generates social and ecological imbalances, as captured by Kate Raworth's leading doughnut model. We formalize this model using social and environmental indices and measure imbalances using their coefficient of variation.
Ashruta Acharya +2 more
wiley +1 more source

