On Serial and Parallel Implementations of the Erlang Fixed-Point Iteration Scheme

2001 ◽  
Vol 8 (3) ◽  
pp. 317-335 ◽  
Author(s):  
Andrew G. Hart
Author(s):  
Krishnan Suresh

In multi-objective topology optimization, a design is defined to be “pareto-optimal” if no other design exists that is better with respect to one objective, and as good with respect to others. This unfortunately suggests that unless other ‘better’ designs are found, one cannot declare a particular topology to be pareto-optimal. In this paper, we first show that a topology can be guaranteed to be (locally) pareto-optimal if certain inherent properties associated with the topological sensitivity field are satisfied, i.e., no further comparison is necessary. This, in turn, leads to a deterministic, i.e., non-stochastic, method for directly tracing pareto-optimal frontiers using the classic fixed-point iteration scheme. The proposed method can generate the full set of pareto-optimal topologies in a single-run, and is therefore both efficient and predictable, as illustrated through numerical examples.


2015 ◽  
Vol 70 (5) ◽  
pp. 343-350 ◽  
Author(s):  
Suheil Khuri ◽  
Ali Sayfy

AbstractThis paper presents a method based on embedding Green’s function into a well-known fixed-point iteration scheme for the numerical solution of a class of boundary value problems arising in mathematical physics and geometry, in particular the Yamabe equation on a sphere. Convergence of the numerical method is exhibited and is proved via application of the contraction principle. A selected number of cases for the parameters that appear in the equation are discussed to demonstrate and confirm the applicability, efficiency, and high accuracy of the proposed strategy. The numerical outcomes show the superiority of our scheme when compared with existing numerical solutions.


2010 ◽  
Author(s):  
Marcel Luethi

Being able to quickly compute the inverse of a deformation field is often useful in the context of medical image analysis. While ITK supports this functionality, the current algorithms are slow and do not always yield accurate results. In this paper we describe an ITK implementation of a fixed point algorithm for the approximate inversion of deformation fields that was recently proposed by M. Chen and co-workers. The algorithm has been shown to be both faster and more accurate than those currently implemented in ITK.


2015 ◽  
Author(s):  
S. Khoury ◽  
Mariam Abushammala ◽  
A. Sayfy

2018 ◽  
Vol 7 (3) ◽  
pp. 51
Author(s):  
KUMAR DAS APURVA ◽  
DHAR DIWAN SHAILESH ◽  
JAIN SWATI ◽  
◽  
◽  
...  

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 18383-18392
Author(s):  
Younghan Jeon ◽  
Minsik Lee ◽  
Jin Young Choi

Sign in / Sign up

Export Citation Format

Share Document