N2Grid: Neural Networks in the Grid. We present a framework for the usage of neural network resources on a world-wide basis. Our approach employs the ...
N3Logic: A logical framework for the world wide web The Semantic Web drives toward the use of the Web for interacting with logically interconnected data. ...
Application of the N3S finite element code to simulation of oscillatory convection in low Prandtl fluids. N3S is a finite element package which has been ...
N4ITK: Improved N3 Bias Correction. A variant of the popular nonparametric nonuniform intensity normalization (N3) algorithm is proposed for bias field correction. Given the superb ...
Avoiding breakdown and near-breakdown in Lanczos type algorithms. The paper deals with methods which the authors have developed to avoid breakdown and near-breakdown due to ...
Numerical computation of polynomial zeros by means of Aberth’s method. n algorithm for computing polynomial zeros, based on Aberth’s method, is presented. The starting approximations ...
Stable evaluation of box-splines. The author proposes and investigates a new modification of the well-known de Boor’s recursive algorithm for the evaluation of box-splines. A ...
Improved cyclic reduction for solving queueing problems. The cyclic reduction technique (Buzbee et al., 1970), rephrased in functional form (Bini and Meini, 1996), provides a ...
Faster than the fast Legendre transform, the linear-time Legendre transform. An algorithm is proposed for numerical computation of the Legendre-Fenchel transform u∗(s)=supx[⟨s,x⟩−u(x)] with a linear-time ...
Remarks around 50 lines of Matlab: short finite element implementation. A novel implementation of 50 lines of Matlab: A short finite element implementation is presented. ...
Shohat-Favard and Chebyshev’s methods in d-orthogonality. This paper is concerned with the Shohat-Favard, Chebyshev and Modified Chebyshev methods for d-orthogonal polynomial sequences d∈ℕ. Shohat-Favard’s method ...
A package for representing C 1 interpolating surfaces: Application to the lagoon of Venice’s bed. The problem of representing a C 1 piecewise polynomial intepolating ...
Implementation of a variable block Davidson method with deflation for solving large sparse eigenproblems. E. R. Davidson’s method [J. Comput Phys. 17, 87-94 (1975; Zbl ...
Fortran subroutines for B-nets of box splines on three- and four- directional meshes. We describe an algorithm to compute the B-nets of bivariate box splines ...
Design, analysis, and implementation of a multiprecision polynomial rootfinder. We present the design, analysis, and implementation of an algorithm for the computation of any number ...
Adaptive monotone rational approximation on finite sets. The problem of uniform approximation on a finite set of real numbers by rational functions whose first derivative ...
Fast Moreau envelope computation I: Numerical algorithms. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents ...
Computing curve intersection by means of simultaneous iterations. A new algorithm is proposed for computing the intersection of two plane curves given in rational parametric ...
Restarted block Lanczos bidiagonalization methods. The problem of computing a few of the largest or smallest singular values and associated singular vectors of a large ...
Algorithms and software for total variation image reconstruction via first-order methods. This paper describes new algorithms and related software for total variation (TV) image reconstruction, ...
