✦ LIBER ✦

Euclidean centers: Computation, properties and a MOLP application

✍ Scribed by Ami Arbel; Luis G. Vargas

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 447 KB
Volume: 48
Category: Article
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2007.07.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Properties of a space-wise periodic flow

Properties of a space-wise periodic flow application to flow computation and design for blade cascades

✍ Miton, H. H. 📂 Article 📅 1986 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 482 KB

Analysis of soil properties and foundati

Analysis of soil properties and foundation design—computer applications

✍ E. Sai Baba Reddy 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 265 KB

Extremality and the global Markov proper

Extremality and the global Markov property. I. The Euclidean fields on a lattice

✍ Boguslaw Zegarliński 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 432 KB

Symbolic computation and equation on the

Symbolic computation and equation on the center manifold: Application to the Couette-Taylor problem

✍ P. Laure; Y. Demay 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 542 KB

A method of determining phase centers an

A method of determining phase centers and its application to electromagnetic horns

✍ Y.Y. Hu 📂 Article 📅 1961 🏛 Elsevier Science 🌐 English ⚖ 398 KB

A method of locating the phase center of any radiating system from the expression of its radiating field is formulated. This method is then applied to electromagnetic horns of different dimensions and flare angles. It is believed that the results and discussions presented in this paper will be usefu

Parallel Computation and Indefinite Summ

Parallel Computation and Indefinite Summation: a ‖MAPLE‖ Application for the Rational Case

✍ Roberto Pirastu; Kurt Siegl 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 439 KB

The problem of computing a closed form for sums of special functions arises in many parts of mathematical and computer science, especially in combinatorics and complexity analysis. Here we discuss two algorithms for indefinite summation of rational functions, due to Abramov (1975) and Paule (1993).