The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Approximating poles of complex rational functions.”

Constructing 7-Clusters

Kurz, Sascha, Noll, Landon Curt, Rathbun, Randall, Simmons, Chuck (2014)

Serdica Journal of Computing

Similarity:

ACM Computing Classification System (1998): G.2, G.4. A set of n lattice points in the plane, no three on a line and no four on a circle, such that all pairwise distances and coordinates are integers is called an n-cluster (in R^2). We determine the smallest 7-cluster with respect to its diameter. Additionally we provide a toolbox of algorithms which allowed us to computationally locate over 1000 different 7-clusters, some of them having huge integer edge lengths. Along the...

Analysis of an isopetype dual algorithm for optimizing control and nonlinear optimization

Wojciech Tadej, Piotr Tatjewski (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

First results concerning important theoretical properties of the dual ISOPE (Integrated System Optimization and Parameter Estimation) algorithm are presented. The algorithm applies to on-line set-point optimization in control structures with uncertainty in process models and disturbance estimates, as well as to difficult nonlinear constrained optimization problems. Properties of the conditioned (dualized) set of problem constraints are investigated, showing its structure and feasibility...

Measuring and maintaining consistency: a hybrid FTF algorithm

James Bunch, Richard Le Borne, Ian Proudler (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

Due to the versatility as well as its ease of implementation, the Fast Transversal Filters algorithm is attractive for many adaptive filtering applications. However, it is not widely used because of its undesirable tendency to diverge when operating in finite precision arithmetic. To compensate, modifications to the algorithm have been introduced that are either occasional (performed when a predefined condition(s) is violated) or structured as part of the normal update iteration. However,...