Bibliometrics
Skip Table Of Content Section
research-article
Accurate Calculation of Euclidean Norms Using Double-word Arithmetic
Article No.: 1, pp 1–34https://doi.org/10.1145/3568672

We consider the computation of the Euclidean (or L2) norm of an n-dimensional vector in floating-point arithmetic. We review the classical solutions used to avoid spurious overflow or underflow and/or to obtain very accurate results. We modify a recently ...

research-article
Robust Topological Construction of All-hexahedral Boundary Layer Meshes
Article No.: 2, pp 1–32https://doi.org/10.1145/3577196

We present a robust technique to build a topologically optimal all-hexahedral layer on the boundary of a model with arbitrarily complex ridges and corners. The generated boundary layer mesh strictly respects the geometry of the input surface mesh, and it ...

research-article
Event-Based Automatic Differentiation of OpenMP with OpDiLib
Article No.: 3, pp 1–31https://doi.org/10.1145/3570159

We present the new software OpDiLib, a universal add-on for classical operator overloading AD tools that enables the automatic differentiation (AD) of OpenMP parallelized code. With it, we establish support for OpenMP features in a reverse mode operator ...

research-article
Open Access
Combining Sparse Approximate Factorizations with Mixed-precision Iterative Refinement
Article No.: 4, pp 1–29https://doi.org/10.1145/3582493

The standard LU factorization-based solution process for linear systems can be enhanced in speed or accuracy by employing mixed-precision iterative refinement. Most recent work has focused on dense systems. We investigate the potential of mixed-precision ...

research-article
A Geometric Multigrid Method for Space-Time Finite Element Discretizations of the Navier–Stokes Equations and its Application to 3D Flow Simulation
Article No.: 5, pp 1–25https://doi.org/10.1145/3582492

We present a parallelized geometric multigrid (GMG) method, based on the cell-based Vanka smoother, for higher order space-time finite element methods (STFEM) to the incompressible Navier–Stokes equations. The STFEM is implemented as a time marching ...

Algorithm 1031: MQSI—Monotone Quintic Spline Interpolation
Article No.: 6, pp 1–17https://doi.org/10.1145/3570157

MQSI is a Fortran 2003 subroutine for constructing monotone quintic spline interpolants to univariate monotone data. Using sharp theoretical monotonicity constraints, first and second derivative estimates at data provided by a quadratic facet model are ...

Algorithm 1032: Bi-cubic Splines for Polyhedral Control Nets
Article No.: 7, pp 1–12https://doi.org/10.1145/3570158

For control nets outlining a large class of topological polyhedra, not just tensor-product grids, bi-cubic polyhedral splines form a piecewise polynomial, first-order differentiable space that associates one function with each vertex. Akin to tensor-...

Algorithm 1033: Parallel Implementations for Computing the Minimum Distance of a Random Linear Code on Distributed-memory Architectures
Article No.: 8, pp 1–24https://doi.org/10.1145/3573383

The minimum distance of a linear code is a key concept in information theory. Therefore, the time required by its computation is very important to many problems in this area. In this article, we introduce a family of implementations of the Brouwer–...

Algorithm 1034: An Accelerated Algorithm to Compute the Qn Robust Statistic, with Corrections to Constants
Article No.: 9, pp 1–12https://doi.org/10.1145/3576920

The robust scale estimator Qn developed by Croux and Rousseeuw [3], for the computation of which they provided a deterministic algorithm, has proven to be very useful in several domains including in quality management and time series analysis. It has ...

SECTION: Software Release Paper
research-article
Open Access
Newly Released Capabilities in the Distributed-Memory SuperLU Sparse Direct Solver
Article No.: 10, pp 1–20https://doi.org/10.1145/3577197

We present the new features available in the recent release of SuperLU_DIST, Version 8.1.1. SuperLU_DIST is a distributed-memory parallel sparse direct solver. The new features include (1) a 3D communication-avoiding algorithm framework that trades off ...

research-article
Certifying Zeros of Polynomial Systems Using Interval Arithmetic
Article No.: 11, pp 1–14https://doi.org/10.1145/3580277

We establish interval arithmetic as a practical tool for certification in numerical algebraic geometry. Our software HomotopyContinuation.jl now has a built-in function certify, which proves the correctness of an isolated nonsingular solution to a square ...

Subjects

Comments

About Cookies On This Site

We use cookies to ensure that we give you the best experience on our website.

Learn more

Got it!