Abstract: The problem of minimizing l2-sensitivity subject to l2-scaling constraints for two-dimensional (2-D) separable-denominator state-space digital filters is investigated. The coefficient sensitivity of the filter is analized by using a pure l2-norm. An iterative algorithm for minimizing an l2-sensitivity measure subject to l2-scaling constraints is then explored by introducing a Lagrange...

In this paper we propose an iterative method to solve an optimal control problem, with fuzzy target and constraints. A solving method is developed for such type of problem, under quite general hypotheses. The algorithm is developed in such a way as to satisfy as best as possible both the target function and all the constraints. It consists of an iterative procedure, which modifies the admissibl...

Ding & Ferraro 1 Abstract. A concurrent partitioner for partitioning unstructured finite element meshes on distributed memory architectures is developed. The partitioner uses an element-based partitioning strategy. Its main advantage over the more conventional node-based partitioning strategy is its modular programing approach to the development of parallel applications. The partitioner first p...

A method is developed to include solvation effects in linear-scaling semiempirical quantum calculations. Favorable scaling of computational effort for large molecules is achieved using a preconditioned conjugate gradient technique in conjunction with a linear-scaling recursive bisection method for evaluation of electrostatic interactions. The method requires approximately 30% computational over...

In this paper, we propose two new hybrid methods for solving nonlinear equations, utilizing the advantages of classical (bisection, trisection, and modified false position), i.e., bisection-modified position (Bi-MFP) trisection-modified (Tri-MFP). We implemented proposed algorithms several benchmark problems. discuss graphical analysis these problems with respect to number iterations average CP...

A color quantization method is proposed. The method hierarchically uses a bisection tool that preserves certain color-distribution features. The preserved features are average color, variance in each color dimension, and average color radius. An algorithm is given that includes the histogram simpli"cation procedure, color palette generation, and pixel mapping. Experiments show that the proposed...

In a graph G = (V,E), a bisection (X,Y ) is a partition of V into sets X and Y such that |X| ≤ |Y | ≤ |X|+1. The size of (X,Y ) is the number of edges between X and Y . In the Max Bisection problem we are given a graph G = (V,E) and are required to find a bisection of maximum size. It is not hard to see that ⌈|E|/2⌉ is a tight lower bound on the maximum size of a bisection of G. We study parame...