Let S be a finite set of points in the plane and let T (S) be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configurations of points S such that iteration of the above operation produces a dense set. We also discuss partial results on the characterization of those finite point-sets with rational coordinates that generate all of Q ...

We analyze inexact fixed point iterations where the generating function contains an inexact solve of an equation system to answer the question of how tolerances for the inner solves influence the iteration error of the outer fixed point iteration. Important applications are the Picard iteration and partitioned fluid structure interaction. We prove that the iteration converges irrespective of ho...

1 Deenitions and Preliminaries A data-ow graph (DFG) is represented by a directed weighted graph G = (V , E, d, t) where V is the set of computation nodes, E is the edge set which deenes the directed edges (or precedence relation) from nodes in V to nodes in V , and d(e) is the delay count for edge e 2 E. Each node v in V is associated with a positive integer t(v) which may represent the comput...

in this paper a modification of he's variational iteration method (vim) has been employed to solve dung and riccati equations. sometimes, it is not easy or even impossible, to obtain the first few iterations of vim, therefore, we suggest to approximate the integrand by using suitable expansions such as taylor or chebyshev expansions.

Consider the three-component time series model that decomposes observed data (Y ) into the sum of seasonal (S), trend (T ), and irregular (I) portions. Assuming that S and T are nonstationary and that I is stationary, it is demonstrated that widely-used Wiener-Kolmogorov signal extraction estimates of S and T can be obtained through an iteration scheme applied to optimal estimates derived from ...

Superscalar processors are well suited for meeting the demands of scientific computing, given sufficient memory bandwidth. Employing parallel memory modules increases the bandwidth available; however , storage schemes devised to reduce module conflict for vector computers are not suitable for scalar computation. Access ordering is a compilation technique that increases effective bandwidth by re...

The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146 local inequivalent graphs are classified as three categories: the 2-colorable graphs, the non 2colorable graphs with identical upper LOCC entanglement bound ...

The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146 local inequivalent graphs are classified as two categories: graphs with identical upper LOCC entanglement bound and lower bipartite entanglement bound, graph...

Given M ∈ <n×n and q ∈ <, the linear complementarity problem (LCP) is to find (x, s) ∈ < × < such that (x, s) ≥ 0, s = Mx + q, x s = 0. By using the ChenHarker-Kanzow-Smale (CHKS) smoothing function, the LCP is reformulated as a system of parameterized smooth-nonsmooth equations. As a result, a smoothing Newton algorithm, which is a modified version of the Qi-Sun-Zhou algorithm [Mathematical Pr...

Both Sylvester matrix and convolution are defined by two polynomials. If one of them has small degree, then the associated Sylvester linear system can be solved fast by using its PFD interpretation of the convolution equation. This can immediately simplify the refinement of approximate convolution by means of Newton’s iteration, where we also incorporate the PFD refinement techniques or alterna...