✦ LIBER ✦

Convergence of iterated median rules

✍ Scribed by Stephen J Willson

Publisher: Elsevier Science
Year: 1989
Weight: 403 KB
Volume: 47
Category: Article
ISSN: 0734-189X
DOI: 10.1016/0734-189x(89)90058-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convergence of iterated median rules: St

Convergence of iterated median rules: Stephen J. Willson. Department of Mathematics, Iowa State University, Ames, Iowa 50011. Received October 25, 1988; revised December 19, 1988

📂 Article 📅 1989 🏛 Elsevier Science ⚖ 90 KB

Convergence of iterated clique graphs

✍ Erich Prisner 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 568 KB

THE CONVERGENCE OF THE ITERATED IRS METH

THE CONVERGENCE OF THE ITERATED IRS METHOD

✍ M.I. Friswell; S.D. Garvey; J.E.T. Penny 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Static or Guyan reduction is widely used to reduce the number of degrees of freedom in a finite element model, but it is exact only at zero frequency. The Improved Reduced System (IRS) method makes some allowance for the inertia terms and produces a reduced model which more accurately estimates the

Convergence of the median filterings of

Convergence of the median filterings of sequences

✍ Wanzhou Ye; Xingwei Zhou 📂 Article 📅 1999 🏛 SP Science China Press 🌐 English ⚖ 272 KB

Convergence of sequences of iterated tri

Convergence of sequences of iterated triangular line graphs

✍ David Dorrough 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 333 KB

The triangular line graph T(G) of a graph G is the graph with vertex set E(G), with two distinct vertices e and f of T(G) adjacent if and only if the edges e and f belong to a common copy ofK 3 in G. For n/> 1, the nth iterated triangular line graph T"(G) of a graph G is defined as T(T n-I(G)), wher

Orders of convergence for superlineary c

Orders of convergence for superlineary convergent chaotic iterations

✍ A. Frommer 📂 Article 📅 1991 🏛 Springer Vienna 🌐 English ⚖ 242 KB