Sciweavers

414 search results - page 5 / 83
» On discrete norms of polynomials
Sort
View
MOC
1998
107views more  MOC 1998»
13 years 9 months ago
Fast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
Daniel Potts, Gabriele Steidl, Manfred Tasche
EJC
2010
13 years 10 months ago
Discrete piecewise linear functions
The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions t...
Sergei Ovchinnikov
AUTOMATICA
2005
116views more  AUTOMATICA 2005»
13 years 9 months ago
Monotonically convergent iterative learning control for linear discrete-time systems
In iterative learning control schemes for linear discrete time systems, conditions to guarantee the monotonic convergence of the tracking9 error norms are derived. By using the Ma...
Kevin L. Moore, Yangquan Chen, Vikas Bahl
DAM
2006
100views more  DAM 2006»
13 years 9 months ago
On the colored Tutte polynomial of a graph of bounded treewidth
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...
Lorenzo Traldi
MOC
1998
96views more  MOC 1998»
13 years 9 months ago
Fast solvers of integral and pseudodifferential equations on closed curves
On the basis of a fully discrete trigonometric Galerkin method and two grid iterations we propose solvers for integral and pseudodifferential equations on closed curves which solv...
Jukka Saranen, Gennadi Vainikko