
N3Logic
 Referenced in 8 articles
[sw02003]
 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. ...

na1
 Referenced in 50 articles
[sw11516]
 Avoiding breakdown and nearbreakdown in Lanczos type algorithms. The paper deals with methods which the authors have developed to avoid breakdown and nearbreakdown due to ...

na10
 Referenced in 37 articles
[sw11511]
 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 ...

na11
 Referenced in 3 articles
[sw11510]
 Stable evaluation of boxsplines. The author proposes and investigates a new modification of the wellknown de Boor’s recursive algorithm for the evaluation of boxsplines. A ...

na12
 Referenced in 22 articles
[sw11490]
 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 ...

na13
 Referenced in 21 articles
[sw11509]
 Faster than the fast Legendre transform, the lineartime Legendre transform. An algorithm is proposed for numerical computation of the LegendreFenchel transform u∗(s)=supx[⟨s,x⟩−u(x)] with a lineartime ...

na14
 Referenced in 44 articles
[sw11508]
 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. ...

na15
 Referenced in 4 articles
[sw11491]
 ShohatFavard and Chebyshev’s methods in dorthogonality. This paper is concerned with the ShohatFavard, Chebyshev and Modified Chebyshev methods for dorthogonal polynomial sequences d∈ℕ. ShohatFavard’s method ...

na17
 Referenced in 3 articles
[sw11507]
 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 ...

na18
 Referenced in 5 articles
[sw11506]
 Implementation of a variable block Davidson method with deflation for solving large sparse eigenproblems. E. R. Davidson’s method [J. Comput Phys. 17, 8794 (1975; Zbl ...

na2
 Referenced in 20 articles
[sw11515]
 Fortran subroutines for Bnets of box splines on three and four directional meshes. We describe an algorithm to compute the Bnets of bivariate box splines ...

na20
 Referenced in 59 articles
[sw11505]
 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 ...

na21
 Referenced in 1 article
[sw11504]
 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 ...

na24
 Referenced in 10 articles
[sw11485]
 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 ...

na25
 Referenced in 4 articles
[sw11492]
 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 ...

na26
 Referenced in 15 articles
[sw11493]
 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 ...

na28
 Referenced in 11 articles
[sw11502]
 Algorithms and software for total variation image reconstruction via firstorder methods. This paper describes new algorithms and related software for total variation (TV) image reconstruction, ...

na3
 Referenced in 4 articles
[sw11514]
 Implementation of the recurrence relations of biorthogonality.General algorithms for computing some generalized Padétype approximants are given. The quality of the used approximants depends on the ...

na31
 Referenced in 6 articles
[sw11500]
 A fast solver for linear systems with displacement structure. We describe a fast solver for linear systems with reconstructible Cauchylike structure, which requires O(rn 2 ...

na5
 Referenced in 24 articles
[sw11489]
 Treatment of nearbreakdown in the CGS algorithm. Lanczos’ method for solving the system of linear equationsAx=b consists in constructing a sequence of vectors (x k ...