Computation of rational product approximations
β Scribed by Jackson N. Henry
- Publisher
- John Wiley and Sons
- Year
- 1976
- Tongue
- English
- Weight
- 448 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0029-5981
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
Let F be a continuous realβvalued function defined on [β1, 1] Γ [β1,1]. For purposes of simplifaction in some numerical processes, one may desire to have an approximation of the function F. We present a known method of approximation called the best rational product approximation. When developing this approximation to F, certain types of discontinuities may arise. We develop a slight variation of a known technique to overcome such discontinuities. With this modified technique, it is then possible to develop a computer program to compute the approximation of F. A brief discussion of this program is presented along with some of the results which we have obtained.
π SIMILAR VOLUMES
A new numerically reliable computational approach is proposed to compute the factorization of a rational transfer function matrix G as a product of a J-lossless factor with a stable, minimum-phase factor. In contrast to existing computationally involved 'one-shot' methods which require the solution
Let be a real irrational number, and a 2 0, b 2 0 , a > 1 be integers. A theorem of S. UCHIYAMA states that there are infinitely many pairs of integers u and v # 0 such that provided that it is not a z b z 0 mod s. It is shown that this result is best-possible for all integers s > 1. 1991 Mathemati
The transformation in CIELAB from differences where h ab is the hue angle of the reference color. Equation (1) rotates the differences 2 in Da\* and Db\* by the angle in the L\*, a\*, b\* coordinates to those in lightness, 0h ab . The rotated differences are taken as equal to chroma, and hue, DL\*,