EUDML

Two universally applicable smoothing operations adjustable to meet the specific properties of the given smoothing problem are widely used: 1. Smoothing splines and 2. Smoothing digital convolution filters. The first operation is related to the data vector $r = {(r_{0}, . . ., r_{n - 1})}^{T}$ with respect to the operations $𝒜$ , $ℒ$ and to the smoothing parameter $α$ . The resulting function is denoted by $σ_{α} (t)$ . The measured sample $r$ is defined on an equally spaced mesh $Δ = {t_{i} = i h}_{i = 0}^{n - 1}$ $T = n h$ . The smoothed data vector $y$ is then $y = {σ_{α} (t_{i})}_{i = 0}^{n - 1}$ . The other operation...

How to draw tolerance lattices of finite chains

Ivan Chajda; Josef Dalík; Josef Niederle; Vítězslav Veselý; Bohdan Zelinka — 1980

Archivum Mathematicum

Page 1

Download Results (CSV)

Advanced Search

Formula preview

Currently displaying 1 – 7 of 7

An algorithm for the computation of polynomial splines of odd degree

Algebraic theory of fast mixed-radix transforms. II. Computational complexity and applications

A concentration of categories with non-injective monomorphisms

Algebraic theory of fast mixed-radix transforms. I. Generalized Kronecker product of matrices

Monomorphisms in the categories of connected algebraic systems with strong homomorphisms

Discrete smoothing splines and digital filtration. Theory and applications

How to draw tolerance lattices of finite chains