Solving a parameter estimation problem in a three-dimensional conical tube on a parallel and distributed software infrastructure

Journal of Computational Science

Volumn 2, Issue 2, 2011, Pages 95-104

  Bücker, H Martin ^a   Fortmeier, Oliver ^a   Petera, Monika ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Computational fluid dynamics; Distributed computing; DROPS; EFCOSS; Inverse problem; Parallel computing

Indexed keywords

ADAPTIVE FINITE ELEMENT; COMPONENT-BASED SOFTWARE ARCHITECTURE; DISTRIBUTED SOFTWARE; EFCOSS; FLUID FLOWING; INCOMPRESSIBLE NAVIER STOKES EQUATIONS; INFINIBAND NETWORKS; INFLOW VELOCITY; MEASURING CELLS; NUMERICAL EXPERIMENTS; OPTIMIZATION ALGORITHMS; OPTIMIZATION SOFTWARE PACKAGE;

ALGORITHMS; CLUSTER COMPUTING; COMPUTATIONAL FLUID DYNAMICS; DROPS; ESTIMATION; FLUIDS; INVERSE PROBLEMS; NAVIER STOKES EQUATIONS; OPTIMIZATION; PARALLEL ARCHITECTURES; PARALLEL FLOW; RESONANCE; SOFTWARE ARCHITECTURE; THREE DIMENSIONAL;

PARAMETER ESTIMATION;

EID: 79958765023     PISSN: 18777503     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jocs.2011.01.002     Document Type: Article

References (28)

1. Groß S., Reichelt V., Reusken A. A finite element based level set method for two-phase incompressible flows. Comput. Vis. Sci. 2006, 9(4):239-257.
2. Rasch A., Bücker H.M. EFCOSS: An interactive environment facilitating optimal experimental design. ACM Trans. Math. Softw. 2010, 37(2):13:1-13:37.
3. Marquardt W. Model-based experimental analysis of kinetic phenomena in multi-phase reactive systems. Trans. Inst. Chem. Eng. 2005, 83(A6):561-573.
4. Gross-Hardt E., Slusanschi E., Bücker H.M., Pfennig A., Bischof C.H. Practical shape optimization of a levitation device for single droplets. Optimization Eng. 2008, 9(2):179-199.
5. Fortmeier O., Bücker H.M. A hybrid parallel algorithm for transforming finite element functions from adaptive to Cartesian grids. HPCS 2009, no. LNCS 5976, 2010, 48-61. Springer, Kingston, Canada. D. Mewhort, A. et (Eds.).
6. Turek S. Efficient solvers for incompressible flow problems: an algorithmic and computational approach, Lecture Notes in Computational Science and Engineering 1999, vol. 6. Springer, Berlin, Heidelberg.
7. Bey J. Simplicial grid refinement: on Freudenthal's algorithm and the optimal number of congruence classes. J. Numer. Math. 2000, 85(1):1-29.
8. Groß S., Reusken A. Parallel multilevel tetrahedral grid refinement. SIAM J. Sci. Comput. 2005, 26(4):1261-1288.
9. Bastian P. Load balancing for adaptive multigrid methods. SIAM J. Sci. Comput. 1998, 19(4):1303-1321.
10. Fortmeier O., Henrich T., Bücker H.M. Modeling data distribution for two-phase flow problems by weighted graphs. 23rd Workshop on Parallel Sytems and Algorithms 2010, 31-38. M. Beigl, F.J. Cazorla-Almeida (Eds.).
11. Garey M.R., Johnson D.S., Stockmeyer L.J. Some simplified NP-complete graph problems. Theor. Comput. Sci. 1976, 1(3):237-267.
12. Karypis G., Kumar V. A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. J. Parallel Distrib. Comput. 1998, 48(1):71-95.
13. Grisby D., Lo S.-L., Riddoch D. The omniORB version 4. 1 User's Guide April 2006, Apasphere Ltd. and AT&T Laboratories, Cambridge.
14. Bischof C.H., Bücker H.M., Lang B., Rasch A. An interactive environment for supporting the transition from simulation to optimization. Sci. Prog. 2003, 11(4):263-272.
15. Bischof C.H., Bücker H.M., Lang B., Rasch A. Solving large-scale optimization problems with EFCOSS. Adv.Eng. Softw. 2003, 34(10):633-639.
16. Rasch A., Bücker H.M., Bardow A. Software supporting optimal experimental design: a case study of binary diffusion experiments using EFCOSS. Comp. Chem. Eng. 2009, 33(4):838-849.
17. Moré J.J., Garbow B.S., Hillstrom K.E. User guide for MINPACK-1, Tech. Rep. ANL-80-74 1980, Argonne National Laboratory, Argonne, IL, USA.
18. Moré J.J., Sorensen D.C., Garbow B.S., Hillstrom K.E. The MINPACK project. Sources and Development of Mathematical Software 1984, 88-111. Prentice-Hall series in computational mathematics, Prentice-Hall, Englewood Cliffs, NJ, USA. W.R. Cowell (Ed.).
19. NAG N.A.G. Library manual 2006, The Numerical Algorithms Group Ltd, Oxford, UK.
20. Fox P.A., Hall A.P., Schryer N.L. The PORT mathematical subroutine library. ACM Trans. Math. Softw. 1978, 4(2):104-126.
21. Gay D.M. Usage summary for selected optimization routines, Computing Science Technical Report 153 1990, AT&T Bell Laboratories, Murray Hill, NJ, USA.
22. S. J. Benson, L.C. McInnes, J. Moré, J. Sarich, TAO user manual (revision 1.8), Tech. Rep. ANL/MCS-TM-242, Mathematics and Computer Science Division, Argonne National Laboratory, 2005, http://www.mcs.anl.gov/tao.
23. Benson S.J., McInnes L.C., Moré J.J. A case study in the performance and scalability of optimization algorithms. ACM Trans. Math. Softw. 2001, 27(3):361-376.
24. Kenny J.P., Benson S.J., Alexeev Y., Sarich J., Janssen C.L., McInnes L.C., Krishnan M., Nieplocha J., Jurrus E., Fahlstrom C., Windus T.L. Component-based integration of chemistry and optimization software. J. Comput. Chem. 2004, 25(14):1717-1725.
25. Czyzyk J., Mesnier M.P., Moré J.J. The NEOS server. IEEE Comput. Sci. Eng. 1998, 5(3):68-75.
26. Gropp W., Moré J.J. Optimization environments and the NEOS server. Approximation Theory and Optimization 1997, 167-182. Cambridge University Press, Cambridge, UK. M.D. Buhmann, A. Iserles (Eds.).
27. Ferris M.C., Mesnier M.P., Moré J.J. NEOS and Condor: Solving optimization problems over the Internet. ACM Trans. Math. Softw. 2000, 26(1):1-18.
28. Good M., Goux J.-P., Nocedal J., Pereyra V. iNEOS: An interactive environment for nonlinear optimization. Appl. Numer. Math. 2002, 40(1-2):49-57.