
Algorithm 882
 Referenced in 10 articles
[sw10147]
 poles (in the same sense that Chebyshev points are near best for polynomial interpolation...

LC3Ditp
 Referenced in 3 articles
[sw32034]
 trivariate polynomial interpolation on general LissajousChebyshev points. This package syntesizes various interpolation schemes known...

Hyper2d
 Referenced in 8 articles
[sw01972]
 MorrowPattersonXu cubature points for the product Chebyshev measure provides a simple and powerful...

LC2Ditp
 Referenced in 1 article
[sw32033]
 LC2Ditp: Bivariate polynomial interpolation on LissajousChebyshev points. The package LC2Ditp contains a Matlab ... bivariate polynomial interpolation on general LissajousChebyshev points. This package syntesizes various interpolation schemes known...

NSPCG
 Referenced in 30 articles
[sw00636]
 basic preconditioners that are available are point methods such as Jacobi, incomplete $LU$ decomposition ... accelerators such as conjugate gradient (CG), Chebyshev (SI, for semiiterative), generalized minimal residual (GMRES...

PyCheb
 Referenced in 0 articles
[sw16455]
 collocation method. PyCheb incorporates discretization using Chebyshev points, barycentric interpolation and iterate methods. With this ... boundary conditions, and the number of Chebyshev points, which can also be generated automatically...

FCC
 Referenced in 1 article
[sw24629]
 solution at the Chebyshev GaussLobatto collocation points results in having spectral convergence and smaller ... matrix is derived at the Chebyshev GaussLobatto collocation points by using the discrete orthogonal...

Algorithm 017
 Referenced in 2 articles
[sw29825]
 alternating characterization of best Chebyshev approximations, the (singlepoint exchange) Remez algorithm is used...

IRKC
 Referenced in 18 articles
[sw00452]
 family of implicitexplicit RungeKuttaChebyshev methods which are unconditionally stable for reaction terms ... coupled over the spatial grid points. Hence, the systems to be solved have a small...

PSOPT
 Referenced in 7 articles
[sw20700]
 using global polynomials, such as Legendre or Chebyshev functions. Local discretization methods approximate the time ... constraints; General event constraints; Integral constraints; Interior point constraints; Bounds on controls and state variables...

ClusterES
 Referenced in 4 articles
[sw18311]
 combination of preconditioned block eigensolvers and Chebyshev polynomial filter accelerated subspace iterations. Several algorithmic ... method to study clusters with arbitrary point group symmetries is briefly discussed...

Algorithm 973
 Referenced in 1 article
[sw23684]
 Extended rational Fejér quadrature rules based on Chebyshev orthogonal rational functions. We present a numerical ... computed nodes and weights in the npoint rational quadrature formula strongly depends...

ChASE
 Referenced in 1 article
[sw30514]
 them can be substantial. We present the Chebyshev Accelerated Subspace iteration Eigensolver (ChASE), a modern ... degree that further reduces the necessary floatingpoint operations. ChASE is written in C++ using...

Algorithm 967
 Referenced in 4 articles
[sw23693]
 highorder piecewise Chebyshev polynomials and an octree data structure to represent the input ... better than 50% of peak floatingpoint performance. We use task parallelism to employ...

AMD
 Referenced in 51 articles
[sw00039]
 Algorithm 837: AMD is a set of routines...

ANSYS
 Referenced in 641 articles
[sw00044]
 ANSYS offers a comprehensive software suite that spans...

ATLAS
 Referenced in 195 articles
[sw00056]
 This paper describes the Automatically Tuned Linear Algebra...

BPOLY
 Referenced in 13 articles
[sw00089]
 Algorithm 812: BPOLY: An objectoriented library of...

CADNA
 Referenced in 36 articles
[sw00098]
 CADNA: a library for estimating roundoff error...