Discrete Multi-material Topology Optimization under Total Mass Constraint
|
|
- Stuart Gordon
- 5 years ago
- Views:
Transcription
1 Discrete Multi-material Topology Optimization under Total Mass Constraint Xingtong Yang Ming Li State Key Laboratory of CAD&CG, Zhejiang University Solid and Physical Modeling Bilbao, June 12, 2018
2 Problem statement Overview Problem statement Multi-material optimization under total mass constraint Discrete design domain: Ω = {Ω e, e = 1... N}; Candidate materials: (E j, ρ j ), j = 1... m. E 1... E m and ρ 1... ρ m of Young s modulus E i and density ρ i ; Material distribution: x = {x e}, x e = {x ej }, e = 1,..., N, j = 1,..., m, m j=1 x ej = 1. Classic compliance minimization problem min x s.t. c(x) = 1 2 ut K(x)u K(x)u = f, u U M(x) M. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 1 / 25
3 Problem statement Overview Problem statement Multi-material optimization under total mass constraint Discrete design domain: Ω = {Ω e, e = 1... N}; Candidate materials: (E j, ρ j ), j = 1... m. E 1... E m and ρ 1... ρ m of Young s modulus E i and density ρ i ; Material distribution: x = {x e}, x e = {x ej }, e = 1,..., N, j = 1,..., m, m j=1 x ej = 1. Classic compliance minimization problem min x s.t. c(x) = 1 2 ut K(x)u K(x)u = f, u U M(x) M. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 1 / 25
4 Challenges Overview Problem statement Challenges: Multi-materials, total mass constraint, discrete variable Multiple materials VS solid-void material Larger design space, difficult convergence control and material representation Total mass constraint VS single material mass constraint The incompressibility constraint: an additional usage on the summation of the total materials Discrete variable VS continuous variable Essentially of combinatorial complexity Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 2 / 25
5 Challenges Overview Problem statement Challenges: Multi-materials, total mass constraint, discrete variable Multiple materials VS solid-void material Larger design space, difficult convergence control and material representation Total mass constraint VS single material mass constraint The incompressibility constraint: an additional usage on the summation of the total materials Discrete variable VS continuous variable Essentially of combinatorial complexity Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 2 / 25
6 Challenges Overview Problem statement Challenges: Multi-materials, total mass constraint, discrete variable Multiple materials VS solid-void material Larger design space, difficult convergence control and material representation Total mass constraint VS single material mass constraint The incompressibility constraint: an additional usage on the summation of the total materials Discrete variable VS continuous variable Essentially of combinatorial complexity Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 2 / 25
7 Overview Problem statement Overall approach Key observation Material density update only depends on structural compliance, once the quantity of each material is specified. Approach overview 1: Evolutionary mass reduction at total mass M i 2: Exploring density x k at total mass constraint M i // smooth transition 3: Update x k to x k+1 based on elemental compliance ranking Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 3 / 25
8 Overview Problem statement Overall approach Key observation Material density update only depends on structural compliance, once the quantity of each material is specified. Approach overview 1: Evolutionary mass reduction at total mass M i 2: Exploring density x k at total mass constraint M i // smooth transition 3: Update x k to x k+1 based on elemental compliance ranking Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 3 / 25
9 Theory Update Theory: update only depends on compliance ranking Lemma 1 Let x M 1 be an optimal solution to the original problem under mass bound M 1, and M 2 be another mass bound satisfying M 1 M 2, M 1 M 2 δ, δ > 0. We have x M 2 = arg max M(x) M 2c(x M 1 ) T x. The solution is determined by choosing the elements of top compliances c(x M 1 ) e whose sum of masses is less than M 2. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 4 / 25
10 Theory Update Proof to Lemma The density update from total M 1 to M 2 for M 2 < M 1 and close enough. c(x M 2 ) = c(x M 1 (x M 1 x M 2 )) = c(x M 1 ) c (x M 1 )(x M 1 x M 2 ) + O(x M 1 x M 2 ) c(x M 1 ) c (x M 1 )(x M 1 x M 2 ). In this situation, the minimizing problem in the last Lemma becomes arg min c(x M 2 ) = arg min c(x M 2 ) c(x M 1 ) arg min c (x M 1 ) T (x M 1 x M 2 ). Further taking into account of c(x) x ej = c(x ej ) and noticing that x M 1 is constant, there is arg min c(x M 2 ) arg min c(x M 1 ) T (x M 1 x M 2 ) = arg min c(x M 1 ) T x M 2 = arg max c(x M 1 ) T x M 2. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 5 / 25
11 Theory Searching strategy Theory: three-stage density exploration To prevent an abrupt density variation during the iteration. Decomposed into three sub-iterations for full exploration: preprocessing iteration, upwards searching iteration and downwards searching iteration. Figure 1: Left: overall exploration process; Right: inner three-state updating. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 6 / 25
12 Numerical approach Two-material Numerical approach: Two-material Ideas: constraints determine quantity of each material Constraints: N elements & the total mass M : { { n 1 + n 2 = N n 1 ρ 1 + n 2 ρ 2 M where n i is the number of elements filled with material i. n 1 M Nρ 2 ρ 1 ρ 2 n 2 = N n 1 n 1 = M Nρ 2 ρ 1 ρ 2, n 2 = N n 1. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 7 / 25
13 Numerical approach Two-material Numerical approach: Two-material algorithm Two-material procedure Step 1: Input material properties, total mass constraint M, evolutionary ratio ER, domain size nelx, nely, and initial density consisting of only material 1. Step 2: Set the next target mass as follows M i+1 = max(m i (1 ER), M ). Step 3: Calculate elemental compliances {c M i e } via FE analysis. Step 4: Determine the quantity of material 1 and 2 in the design domain n 1 = M i+1 Nρ 2 ρ 1 ρ 2, n 2 = N n 1. Step 5: Update density x i+1 via filling the top n 1 elements of large compliances {c M i e } by material 1, and others by material 2. Step 6: Repeat steps 2-5 until the objective mass is achieved and the convergent criterion is satisfied error = xi+1 x i x i+1 τ Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 8 / 25
14 Numerical approach Three-material Numerical approach: Three-material Two challenges: Two constraints (total material number/mass) determine two equality: the left freedom is to explore all choices. Exploration strategy: Smooth material distribution transition. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 9 / 25
15 Numerical approach Three-material Numerical approach: material quantity equality The possible maximum number n 1 max of material 1 and the minimum n 3 min of material 3 can be calculated by { { n 1 + n 3 = N n 1 ρ 1 + n 3 ρ 3 M i+1 n 1 max = M i+1 Nρ 3 ρ 1 ρ 3 n 3 min = N n 1 max. { n2 + n 3 = N n 1 n 2 ρ 2 + n 3 ρ 3 M i+1 n 1 ρ 1 { n 2 = M i+1 n 1 ρ 1 (N n 1 )ρ 3 ρ 2 ρ 3. n 3 = N n 1 n 2 where E 1 E 2 E 3, ρ 1 ρ 2 ρ 3, the mass constraint is M i+1 in current iteration. In each mass deduction iteration, the proposed method will construct and search a set of feasible material combinations Ω = Ω 1 Ω 2 Ω 3, mainly confined by the feasible range Ω 1 = [n 1 min, n 1 max] of material 1. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 10 / 25
16 Numerical approach Three-material Numerical approach: material quantity equality The possible maximum number n 1 max of material 1 and the minimum n 3 min of material 3 can be calculated by { { n 1 + n 3 = N n 1 ρ 1 + n 3 ρ 3 M i+1 n 1 max = M i+1 Nρ 3 ρ 1 ρ 3 n 3 min = N n 1 max. { n2 + n 3 = N n 1 n 2 ρ 2 + n 3 ρ 3 M i+1 n 1 ρ 1 { n 2 = M i+1 n 1 ρ 1 (N n 1 )ρ 3 ρ 2 ρ 3. n 3 = N n 1 n 2 where E 1 E 2 E 3, ρ 1 ρ 2 ρ 3, the mass constraint is M i+1 in current iteration. In each mass deduction iteration, the proposed method will construct and search a set of feasible material combinations Ω = Ω 1 Ω 2 Ω 3, mainly confined by the feasible range Ω 1 = [n 1 min, n 1 max] of material 1. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 10 / 25
17 Numerical approach Three-material Three-stage strategy Preprocessing stage The preprocessing step gradually find x i Ω 1 via iterating different numbers of domain material compositions, specifically, 1 Moving from (n i 1, ni 2, ni 3 ) at mass constraint M i, 2 via to an intermediate composition (n i 1, 0, N ni 1 ) at mass M i+1, 3 till reaching (n 1 max, 0, N n 1 max) at mass M i+1. Upwards and Downwards stage 1 Once the n 1 of an initial structure lies in Ω 1. 2 Upwards searching procedure from n 1 to n 1 max. 3 Downwards searching procedure from n 1 to n 1 min. 4 The best of them gives the next update density. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 11 / 25
18 Numerical approach Three-material Three-stage strategy Preprocessing stage The preprocessing step gradually find x i Ω 1 via iterating different numbers of domain material compositions, specifically, 1 Moving from (n i 1, ni 2, ni 3 ) at mass constraint M i, 2 via to an intermediate composition (n i 1, 0, N ni 1 ) at mass M i+1, 3 till reaching (n 1 max, 0, N n 1 max) at mass M i+1. Upwards and Downwards stage 1 Once the n 1 of an initial structure lies in Ω 1. 2 Upwards searching procedure from n 1 to n 1 max. 3 Downwards searching procedure from n 1 to n 1 min. 4 The best of them gives the next update density. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 11 / 25
19 Numerical approach Three-material Three-stage strategy Preprocessing stage The preprocessing step gradually find x i Ω 1 via iterating different numbers of domain material compositions, specifically, 1 Moving from (n i 1, ni 2, ni 3 ) at mass constraint M i, 2 via to an intermediate composition (n i 1, 0, N ni 1 ) at mass M i+1, 3 till reaching (n 1 max, 0, N n 1 max) at mass M i+1. Upwards and Downwards stage 1 Once the n 1 of an initial structure lies in Ω 1. 2 Upwards searching procedure from n 1 to n 1 max. 3 Downwards searching procedure from n 1 to n 1 min. 4 The best of them gives the next update density. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 11 / 25
20 Numerical results Numerical results Initial value Fully-filled with the material of the largest Youngs modulus and density. Structural compliance c str Actual value of the optimized structure during each iteration step. Estimated compliance c est The one computed as its approximation, c est = c(x i ) T x i+1. Iteration gap The step size in the iteration process as involved in the three sub-processing stages. step = 0.3%N. Default settings Evolutionary ratio ER = Filter: r min = 2.5. Mesh: Environment Matlab2017b, Windows10, Intel Core i GHz CPU, 16GB RAM. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 12 / 25
21 Numerical results Two-material Two-material Problem definition Both gradually decrease the mass from the initial maximal one till the target. Same mass fraction curve. Similar value of the objective function. Solid-void problem iteration process Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 13 / 25
22 Numerical results Two-material Two-material Problem definition Structure converges to a stable topology after 30 iterations. c est is larger and shows less smooth convergence, but leads the iterative procedure to an expected structure. Two non-zero problem process Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 14 / 25
23 Numerical results Three-material Three-material: iteration process Involve an iterative searching at the same mass constraint: preprocessing, upwards, downwards searching stages. Main-loop produces an optimal structure at certain mass constraint. Sub-loop at each main-loop step, search for the best structure for all the possible candidate numbers of materials at a given mass constraint. Inner iteration: controlled by the quantity of material A; lack regularity. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 15 / 25
24 Numerical results Three-material Material iteration Fluctuate locally, converge ultimately The variations of the associated volume and mass fraction of each material during the main iteration process. The inner: materials update smoothly. The outer: material iteration curves fluctuate locally, but ultimately converge globally. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 16 / 25
25 Higher resolution Numerical results Three-material Mesh size: v.s Able to deal with high resolution problems. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 17 / 25
26 Numerical results Four-material Four-material: effect of material properties Usually: the more, the better Results of various types of material combinations, using four, three and two candidate materials under the same total mass constraint. The usage of more materials indeed produces structures of better compliance. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 18 / 25
27 Numerical results Four-material Four-material: effect of material properties Need further exploration Effect of the candidate material properties: the ranking of the Young s modulus or the modulus-density ratio. No clear evidence on the dependence of the final produced structure on property ranking of the materials. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 19 / 25
28 Numerical results Four-material Compared to SIMP Unpredictable optimized structures Problem definition Mesh size: Better compliance. Ability of avoiding being stuck in local minima. (To a certain extent) The single-material optimal structure: material C has the largest E/ρ? Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 20 / 25
29 Numerical results Four-material Four-material: c est, the motivation Problem definition c est v.s. c str Estimated compliances v.s actual structural compliances. More than two materials: high similarity. Single material: strongly different. Estimated compliances works in all cases. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 21 / 25
30 3D Cantilever beam Numerical results 3D examples Two-material, Material E ρ A 1 1 B M c 0.4 c Three-material, Material E ρ A 1 1 B C M c 0.4 c Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 22 / 25
31 3D Cantilever beam Numerical results 3D examples Four-material Material E ρ A 2 1 B C D M c 0.7 c Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 23 / 25
32 Computation time Numerical results Computation time Problem Size M c m Our SIMP/ BESO Half MBB MBB Cantilever Multi-grid preconditioned conjugate gradients (MGCG) solver. Better in target value but worse in computation time, especially when m 3. Computation time: strongly effected by m and N. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 24 / 25
33 Conclusion Conclusion Contributions Discrete method on multi-material optimization under total mass constraint, seldom studied before. Theoretical finding to reduce multi-material to a series of two-material problems. Practical regulated approach to iterate optimization in two-material subproblems. Limitations & Future work 1 Efficiency improvement The traversal searching strategy is able to produce a better solution but inefficient. Advanced searching technique is to be developed. 2 Theoretical exploration Theoretical understanding on the number of material types in the final optimal solution. 3 Microstructure Extended cases multi-material microstructure optimization or to cases of large deformations. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 25 / 25
34 Conclusion Conclusion Contributions Discrete method on multi-material optimization under total mass constraint, seldom studied before. Theoretical finding to reduce multi-material to a series of two-material problems. Practical regulated approach to iterate optimization in two-material subproblems. Limitations & Future work 1 Efficiency improvement The traversal searching strategy is able to produce a better solution but inefficient. Advanced searching technique is to be developed. 2 Theoretical exploration Theoretical understanding on the number of material types in the final optimal solution. 3 Microstructure Extended cases multi-material microstructure optimization or to cases of large deformations. Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 25 / 25
35 Thanks Thanks for listening! Xingtong Yang, Ming Li (ZJU) Discrete Multi-material TO SPM 2018, Bilbao 25 / 25
An improved soft-kill BESO algorithm for optimal distribution of single or multiple material phases
Noname manuscript No. (will be inserted by the editor) An improved soft-kill BESO algorithm for optimal distribution of single or multiple material phases Kazem Ghabraie the date of receipt and acceptance
More informationTunnel Reinforcement Optimization for Nonlinear Material
November 25-27, 2012, Gold Coast, Australia www.iccm-2012.org Tunnel Reinforcement Optimization for Nonlinear Material T. Nguyen* 1,2, K. Ghabraie 1,2, T. Tran-Cong 1,2 1 Computational Engineering and
More informationImproved Two-Phase Projection Topology Optimization
10 th World Congress on Structural and Multidisciplinary Optimization May 19-24, 2013, Orlando, Florida, USA Improved Two-Phase Projection Topology Optimization Josephine V. Carstensen and James K. Guest
More informationTopology and shape optimization for non-linear problems. Edward de Boer MT Sydney, December 2010
Topology and shape optimization for non-linear problems Edward de Boer MT 11.1 Sydney, December 21 Contents 1 Introduction 2 2 Bi-directional evolutionary structural optimization 3 3 Topology optimization
More informationPressure corrected SPH for fluid animation
Pressure corrected SPH for fluid animation Kai Bao, Hui Zhang, Lili Zheng and Enhua Wu Analyzed by Po-Ram Kim 2 March 2010 Abstract We present pressure scheme for the SPH for fluid animation In conventional
More informationIncomplete Cholesky preconditioners that exploit the low-rank property
anapov@ulb.ac.be ; http://homepages.ulb.ac.be/ anapov/ 1 / 35 Incomplete Cholesky preconditioners that exploit the low-rank property (theory and practice) Artem Napov Service de Métrologie Nucléaire, Université
More informationCSMA Towards optimal design of multiscale nonlinear structures and reduced-order modeling approaches. 1 Introduction.
CSMA 2017 13ème Colloque National en Calcul des Structures 15-19 Mai 2017, Presqu île de Giens (Var) Towards optimal design of multiscale nonlinear structures and reduced-order modeling approaches Liang
More information- Part 4 - Multicore and Manycore Technology: Chances and Challenges. Vincent Heuveline
- Part 4 - Multicore and Manycore Technology: Chances and Challenges Vincent Heuveline 1 Numerical Simulation of Tropical Cyclones Goal oriented adaptivity for tropical cyclones ~10⁴km ~1500km ~100km 2
More informationExample 37 - Analytical Beam
Example 37 - Analytical Beam Summary This example deals with the use of RADIOSS linear and nonlinear solvers. A beam submitted to a concentrated load on one extremity and fixed on the other hand is studied.
More informationLarge Scale Topology Optimization Using Preconditioned Krylov Subspace Recycling and Continuous Approximation of Material Distribution
Large Scale Topology Optimization Using Preconditioned Krylov Subspace Recycling and Continuous Approximation of Material Distribution Eric de Sturler", Chau Le'', Shun Wang", Glaucio Paulino'' " Department
More informationDevelopment of the new MINLP Solver Decogo using SCIP - Status Report
Development of the new MINLP Solver Decogo using SCIP - Status Report Pavlo Muts with Norman Breitfeld, Vitali Gintner, Ivo Nowak SCIP Workshop 2018, Aachen Table of contents 1. Introduction 2. Automatic
More informationA Newton-Galerkin-ADI Method for Large-Scale Algebraic Riccati Equations
A Newton-Galerkin-ADI Method for Large-Scale Algebraic Riccati Equations Peter Benner Max-Planck-Institute for Dynamics of Complex Technical Systems Computational Methods in Systems and Control Theory
More informationA New Penalty-SQP Method
Background and Motivation Illustration of Numerical Results Final Remarks Frank E. Curtis Informs Annual Meeting, October 2008 Background and Motivation Illustration of Numerical Results Final Remarks
More informationA domain decomposition algorithm for contact problems with Coulomb s friction
A domain decomposition algorithm for contact problems with Coulomb s friction J. Haslinger 1,R.Kučera 2, and T. Sassi 1 1 Introduction Contact problems of elasticity are used in many fields of science
More informationTHE solution of the absolute value equation (AVE) of
The nonlinear HSS-like iterative method for absolute value equations Mu-Zheng Zhu Member, IAENG, and Ya-E Qi arxiv:1403.7013v4 [math.na] 2 Jan 2018 Abstract Salkuyeh proposed the Picard-HSS iteration method
More informationOptimal Shape and Topology of Structure Searched by Ants Foraging Behavior
ISSN 0386-1678 Report of the Research Institute of Industrial Technology, Nihon University Number 83, 2006 Optimal Shape and Topology of Structure Searched by Ants Foraging Behavior Kazuo MITSUI* ( Received
More informationSolving the Stochastic Steady-State Diffusion Problem Using Multigrid
Solving the Stochastic Steady-State Diffusion Problem Using Multigrid Tengfei Su Applied Mathematics and Scientific Computing Advisor: Howard Elman Department of Computer Science Sept. 29, 2015 Tengfei
More informationGlobal optimization of minimum weight truss topology problems with stress, displacement, and local buckling constraints using branch-and-bound
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING Int. J. Numer. Meth. Engng 2004; 61:1270 1309 (DOI: 10.1002/nme.1112) Global optimization of minimum weight truss topology problems with stress,
More informationHeaviside projection based aggregation in stress constrained topology optimization
Heaviside projection based aggregation in stress constrained topology optimization Cunfu Wang Xiaoping Qian Department of Mechanical Engineering, University of Wisconsin-Madison, 1513 University Avenue,
More informationParallelizing large scale time domain electromagnetic inverse problem
Parallelizing large scale time domain electromagnetic inverse problems Eldad Haber with: D. Oldenburg & R. Shekhtman + Emory University, Atlanta, GA + The University of British Columbia, Vancouver, BC,
More informationMotivation, Basic Concepts, Basic Methods, Travelling Salesperson Problem (TSP), Algorithms
Motivation, Basic Concepts, Basic Methods, Travelling Salesperson Problem (TSP), Algorithms 1 What is Combinatorial Optimization? Combinatorial Optimization deals with problems where we have to search
More informationAn example of inverse interpolation accelerated by preconditioning
Stanford Exploration Project, Report 84, May 9, 2001, pages 1 290 Short Note An example of inverse interpolation accelerated by preconditioning Sean Crawley 1 INTRODUCTION Prediction error filters can
More informationJ.I. Aliaga 1 M. Bollhöfer 2 A.F. Martín 1 E.S. Quintana-Ortí 1. March, 2009
Parallel Preconditioning of Linear Systems based on ILUPACK for Multithreaded Architectures J.I. Aliaga M. Bollhöfer 2 A.F. Martín E.S. Quintana-Ortí Deparment of Computer Science and Engineering, Univ.
More informationMultilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses
Multilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses P. Boyanova 1, I. Georgiev 34, S. Margenov, L. Zikatanov 5 1 Uppsala University, Box 337, 751 05 Uppsala,
More informationA Flexible Scheme for the Numerical Homogenisation in Linear Elasticity
Presented at the COMSOL Conference 2010 Paris A Flexible Scheme for the Numerical Homogenisation in Linear Elasticity A. Gerisch 1, S. Tiburtius 1, Q. Grimal 2, K. Raum 3 1 Technische Universität Darmstadt,
More informationAn Inexact Newton Method for Nonlinear Constrained Optimization
An Inexact Newton Method for Nonlinear Constrained Optimization Frank E. Curtis Numerical Analysis Seminar, January 23, 2009 Outline Motivation and background Algorithm development and theoretical results
More information6. Iterative Methods for Linear Systems. The stepwise approach to the solution...
6 Iterative Methods for Linear Systems The stepwise approach to the solution Miriam Mehl: 6 Iterative Methods for Linear Systems The stepwise approach to the solution, January 18, 2013 1 61 Large Sparse
More informationRobust Convex Approximation Methods for TDOA-Based Localization under NLOS Conditions
Robust Convex Approximation Methods for TDOA-Based Localization under NLOS Conditions Anthony Man-Cho So Department of Systems Engineering & Engineering Management The Chinese University of Hong Kong (CUHK)
More informationSPARSE SOLVERS POISSON EQUATION. Margreet Nool. November 9, 2015 FOR THE. CWI, Multiscale Dynamics
SPARSE SOLVERS FOR THE POISSON EQUATION Margreet Nool CWI, Multiscale Dynamics November 9, 2015 OUTLINE OF THIS TALK 1 FISHPACK, LAPACK, PARDISO 2 SYSTEM OVERVIEW OF CARTESIUS 3 POISSON EQUATION 4 SOLVERS
More informationIterative methods for positive definite linear systems with a complex shift
Iterative methods for positive definite linear systems with a complex shift William McLean, University of New South Wales Vidar Thomée, Chalmers University November 4, 2011 Outline 1. Numerical solution
More informationReducing The Computational Cost of Bayesian Indoor Positioning Systems
Reducing The Computational Cost of Bayesian Indoor Positioning Systems Konstantinos Kleisouris, Richard P. Martin Computer Science Department Rutgers University WINLAB Research Review May 15 th, 2006 Motivation
More informationOptimal Stochastic Strongly Convex Optimization with a Logarithmic Number of Projections
Optimal Stochastic Strongly Convex Optimization with a Logarithmic Number of Projections Jianhui Chen 1, Tianbao Yang 2, Qihang Lin 2, Lijun Zhang 3, and Yi Chang 4 July 18, 2016 Yahoo Research 1, The
More informationMulti-Objective Topology Optimization Tracing of Pareto-optimal structures with respect to volume, compliance and fundamental eigenvalue
6 5.8.4 5 4.6 w C w λ.6 8 4 9 3.4.8 2 7 3 8 2 2 9.4 6.6 2.8 7 w V..3.4.5.6 Multi-Objective Topology Optimization Tracing of Pareto-optimal structures with respect to volume, compliance and fundamental
More informationImplementational Aspects of Eigenmode Computation based on Perturbation Theory
Implementational Aspects of Eigenmode Computation based on Perturbation Theory Korinna Brackebusch Prof. Ursula van Rienen University of Rostock 11th International Computational Accelerator Physics Conference
More informationPerformance Evaluation of Various Smoothed Finite Element Methods with Tetrahedral Elements in Large Deformation Dynamic Analysis
Performance Evaluation of Various Smoothed Finite Element Methods with Tetrahedral Elements in Large Deformation Dynamic Analysis Ryoya IIDA, Yuki ONISHI, Kenji AMAYA Tokyo Institute of Technology, Japan
More informationModelling and Experimental Validation Possibilities of Heat Transfer Room Model
Excerpt from the Proceedings of the COMSOL Conference 2010 Paris Modelling and Experimental Validation Possibilities of Heat Transfer Room Model Author M. Zalesak 1, Author V. Gerlich *,1 1 Author Tomas
More informationEvolutionary Multiobjective. Optimization Methods for the Shape Design of Industrial Electromagnetic Devices. P. Di Barba, University of Pavia, Italy
Evolutionary Multiobjective Optimization Methods for the Shape Design of Industrial Electromagnetic Devices P. Di Barba, University of Pavia, Italy INTRODUCTION Evolutionary Multiobjective Optimization
More informationComputation Time Assessment of a Galerkin Finite Volume Method (GFVM) for Solving Time Solid Mechanics Problems under Dynamic Loads
Proceedings of the International Conference on Civil, Structural and Transportation Engineering Ottawa, Ontario, Canada, May 4 5, 215 Paper o. 31 Computation Time Assessment of a Galerkin Finite Volume
More informationA New Trust Region Algorithm Using Radial Basis Function Models
A New Trust Region Algorithm Using Radial Basis Function Models Seppo Pulkkinen University of Turku Department of Mathematics July 14, 2010 Outline 1 Introduction 2 Background Taylor series approximations
More informationA Hybrid Method for the Wave Equation. beilina
A Hybrid Method for the Wave Equation http://www.math.unibas.ch/ beilina 1 The mathematical model The model problem is the wave equation 2 u t 2 = (a 2 u) + f, x Ω R 3, t > 0, (1) u(x, 0) = 0, x Ω, (2)
More informationA unifying model for fluid flow and elastic solid deformation: a novel approach for fluid-structure interaction and wave propagation
A unifying model for fluid flow and elastic solid deformation: a novel approach for fluid-structure interaction and wave propagation S. Bordère a and J.-P. Caltagirone b a. CNRS, Univ. Bordeaux, ICMCB,
More informationMultilevel low-rank approximation preconditioners Yousef Saad Department of Computer Science and Engineering University of Minnesota
Multilevel low-rank approximation preconditioners Yousef Saad Department of Computer Science and Engineering University of Minnesota SIAM CSE Boston - March 1, 2013 First: Joint work with Ruipeng Li Work
More informationSome definitions. Math 1080: Numerical Linear Algebra Chapter 5, Solving Ax = b by Optimization. A-inner product. Important facts
Some definitions Math 1080: Numerical Linear Algebra Chapter 5, Solving Ax = b by Optimization M. M. Sussman sussmanm@math.pitt.edu Office Hours: MW 1:45PM-2:45PM, Thack 622 A matrix A is SPD (Symmetric
More informationCoupled electrostatic-elastic analysis for topology optimization using material interpolation
Institute of Physics Publishing Journal of Physics: Conference Series 34 (2006) 264 270 doi:0.088/742-6596/34//044 International MEMS Conference 2006 Coupled electrostatic-elastic analysis for topology
More informationA new approach for stress-based topology optimization: Internal stress penalization
10 th World Congress on Structural and Multidisciplinary Optimization May 19-24, 2013, Orlando, Florida, USA A new approach for stress-based topology optimization: Internal stress penalization Alexander
More informationBenchmark of Femlab, Fluent and Ansys
Benchmark of Femlab, Fluent and Ansys Verdier, Olivier 2004 Link to publication Citation for published version (APA): Verdier, O. (2004). Benchmark of Femlab, Fluent and Ansys. (Preprints in Mathematical
More informationDiscrete Projection Methods for Incompressible Fluid Flow Problems and Application to a Fluid-Structure Interaction
Discrete Projection Methods for Incompressible Fluid Flow Problems and Application to a Fluid-Structure Interaction Problem Jörg-M. Sautter Mathematisches Institut, Universität Düsseldorf, Germany, sautter@am.uni-duesseldorf.de
More informationA NOVEL FILLED FUNCTION METHOD FOR GLOBAL OPTIMIZATION. 1. Introduction Consider the following unconstrained programming problem:
J. Korean Math. Soc. 47, No. 6, pp. 53 67 DOI.434/JKMS..47.6.53 A NOVEL FILLED FUNCTION METHOD FOR GLOBAL OPTIMIZATION Youjiang Lin, Yongjian Yang, and Liansheng Zhang Abstract. This paper considers the
More informationAn Active Set Strategy for Solving Optimization Problems with up to 200,000,000 Nonlinear Constraints
An Active Set Strategy for Solving Optimization Problems with up to 200,000,000 Nonlinear Constraints Klaus Schittkowski Department of Computer Science, University of Bayreuth 95440 Bayreuth, Germany e-mail:
More informationLEAST-SQUARES FINITE ELEMENT MODELS
LEAST-SQUARES FINITE ELEMENT MODELS General idea of the least-squares formulation applied to an abstract boundary-value problem Works of our group Application to Poisson s equation Application to flows
More informationA Bregman alternating direction method of multipliers for sparse probabilistic Boolean network problem
A Bregman alternating direction method of multipliers for sparse probabilistic Boolean network problem Kangkang Deng, Zheng Peng Abstract: The main task of genetic regulatory networks is to construct a
More informationEIGIFP: A MATLAB Program for Solving Large Symmetric Generalized Eigenvalue Problems
EIGIFP: A MATLAB Program for Solving Large Symmetric Generalized Eigenvalue Problems JAMES H. MONEY and QIANG YE UNIVERSITY OF KENTUCKY eigifp is a MATLAB program for computing a few extreme eigenvalues
More informationEfficient BDF time discretization of the Navier Stokes equations with VMS LES modeling in a High Performance Computing framework
Introduction VS LES/BDF Implementation Results Conclusions Swiss Numerical Analysis Day 2015, Geneva, Switzerland, 17 April 2015. Efficient BDF time discretization of the Navier Stokes equations with VS
More informationCAEFEM v9.5 Information
CAEFEM v9.5 Information Concurrent Analysis Corporation, 50 Via Ricardo, Thousand Oaks, CA 91320 USA Tel. (805) 375 1060, Fax (805) 375 1061 email: info@caefem.com or support@caefem.com Web: http://www.caefem.com
More informationEnvironment (Parallelizing Query Optimization)
Advanced d Query Optimization i i Techniques in a Parallel Computing Environment (Parallelizing Query Optimization) Wook-Shin Han*, Wooseong Kwak, Jinsoo Lee Guy M. Lohman, Volker Markl Kyungpook National
More information5. Simulated Annealing 5.1 Basic Concepts. Fall 2010 Instructor: Dr. Masoud Yaghini
5. Simulated Annealing 5.1 Basic Concepts Fall 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Real Annealing and Simulated Annealing Metropolis Algorithm Template of SA A Simple Example References
More informationSparse Approximation via Penalty Decomposition Methods
Sparse Approximation via Penalty Decomposition Methods Zhaosong Lu Yong Zhang February 19, 2012 Abstract In this paper we consider sparse approximation problems, that is, general l 0 minimization problems
More informationNumerical Properties of Spherical and Cubical Representative Volume Elements with Different Boundary Conditions
TECHNISCHE MECHANIK, 33, 2, (2013), 97 103 submitted: December 11, 2012 Numerical Properties of Spherical and Cubical Representative Volume Elements with Different Boundary Conditions R. Glüge, M. Weber
More informationA MULTISCALE APPROACH IN TOPOLOGY OPTIMIZATION
1 A MULTISCALE APPROACH IN TOPOLOGY OPTIMIZATION Grégoire ALLAIRE CMAP, Ecole Polytechnique The most recent results were obtained in collaboration with F. de Gournay, F. Jouve, O. Pantz, A.-M. Toader.
More informationIMPLEMENTATION OF PRESSURE BASED SOLVER FOR SU2. 3rd SU2 Developers Meet Akshay.K.R, Huseyin Ozdemir, Edwin van der Weide
IMPLEMENTATION OF PRESSURE BASED SOLVER FOR SU2 3rd SU2 Developers Meet Akshay.K.R, Huseyin Ozdemir, Edwin van der Weide Content ECN part of TNO SU2 applications at ECN Incompressible flow solver Pressure-based
More informationAn efficient 3D topology optimization code written in Matlab
Noname manuscript No. (will be inserted by the editor) An efficient 3D topology optimization code written in Matlab Kai Liu Andrés Tovar Journal publication K. Liu and A. Tovar "An efficient 3D topology
More informationStructural Optimization. for Acoustic Disciplines
Optimization for Acoustic Disciplines 4. Norddeutschen Simulationsforum 26 May Hamburg, Germany Claus B.W. Pedersen (claus.pedersen@fe-design.com) Peter M. Clausen, Peter Allinger, Jens Harder FE-Design
More informationAlgorithm for Sparse Approximate Inverse Preconditioners in the Conjugate Gradient Method
Algorithm for Sparse Approximate Inverse Preconditioners in the Conjugate Gradient Method Ilya B. Labutin A.A. Trofimuk Institute of Petroleum Geology and Geophysics SB RAS, 3, acad. Koptyug Ave., Novosibirsk
More informationFEM-FEM and FEM-BEM Coupling within the Dune Computational Software Environment
FEM-FEM and FEM-BEM Coupling within the Dune Computational Software Environment Alastair J. Radcliffe Andreas Dedner Timo Betcke Warwick University, Coventry University College of London (UCL) U.K. Radcliffe
More informationAn Integrated Column Generation and Lagrangian Relaxation for Flowshop Scheduling Problems
Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 An Integrated Column Generation and Lagrangian Relaxation for Flowshop Scheduling
More informationTopology Optimization for Conceptual Design of Reinforced Concrete Structures
Downloaded from orbit.dtu.dk on: Sep 8, 208 Topology Optimization for Conceptual Design of Reinforced Concrete Structures Amir, Oded; Bogomolny, Michael Published in: 9th World Congress on Structural and
More informationOrdonnancement robuste de réseaux de capteurs sans fil pour le suivi d une cible mobile sous incertitudes
Ordonnancement robuste de réseaux de capteurs sans fil pour le suivi d une cible mobile sous incertitudes Charly Lersteau Marc Sevaux André Rossi ROADEF 2016, Compiègne February 11, 2016 1/17 Context 2/17
More informationiretilp : An efficient incremental algorithm for min-period retiming under general delay model
iretilp : An efficient incremental algorithm for min-period retiming under general delay model Debasish Das, Jia Wang and Hai Zhou EECS, Northwestern University, Evanston, IL 60201 Place and Route Group,
More informationTopology Optimization Mathematics for Design
Topology Optimization Mathematics for Design Homogenization Design Method (HMD) Why topology? Change in shape & size may not lead our design criterion for reduction of structural weight. 1 Structural Design
More informationThis chapter focuses on the study of the numerical approximation of threedimensional
6 CHAPTER 6: NUMERICAL OPTIMISATION OF CONJUGATE HEAT TRANSFER IN COOLING CHANNELS WITH DIFFERENT CROSS-SECTIONAL SHAPES 3, 4 6.1. INTRODUCTION This chapter focuses on the study of the numerical approximation
More informationTermination criteria for inexact fixed point methods
Termination criteria for inexact fixed point methods Philipp Birken 1 October 1, 2013 1 Institute of Mathematics, University of Kassel, Heinrich-Plett-Str. 40, D-34132 Kassel, Germany Department of Mathematics/Computer
More informationM. Marques Alves Marina Geremia. November 30, 2017
Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng s F-B four-operator splitting method for solving monotone inclusions M. Marques Alves Marina Geremia November
More informationDiscontinuous Galerkin methods for nonlinear elasticity
Discontinuous Galerkin methods for nonlinear elasticity Preprint submitted to lsevier Science 8 January 2008 The goal of this paper is to introduce Discontinuous Galerkin (DG) methods for nonlinear elasticity
More informationUTPlaceF 3.0: A Parallelization Framework for Modern FPGA Global Placement
UTPlaceF 3.0: A Parallelization Framework for Modern FPGA Global Placement Wuxi Li, Meng Li, Jiajun Wang, and David Z. Pan University of Texas at Austin wuxili@utexas.edu November 14, 2017 UT DA Wuxi Li
More informationSensitivity and Reliability Analysis of Nonlinear Frame Structures
Sensitivity and Reliability Analysis of Nonlinear Frame Structures Michael H. Scott Associate Professor School of Civil and Construction Engineering Applied Mathematics and Computation Seminar April 8,
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT -09 Computational and Sensitivity Aspects of Eigenvalue-Based Methods for the Large-Scale Trust-Region Subproblem Marielba Rojas, Bjørn H. Fotland, and Trond Steihaug
More informationApproximation algorithms for nonnegative polynomial optimization problems over unit spheres
Front. Math. China 2017, 12(6): 1409 1426 https://doi.org/10.1007/s11464-017-0644-1 Approximation algorithms for nonnegative polynomial optimization problems over unit spheres Xinzhen ZHANG 1, Guanglu
More informationAN AUGMENTED LAGRANGIAN AFFINE SCALING METHOD FOR NONLINEAR PROGRAMMING
AN AUGMENTED LAGRANGIAN AFFINE SCALING METHOD FOR NONLINEAR PROGRAMMING XIAO WANG AND HONGCHAO ZHANG Abstract. In this paper, we propose an Augmented Lagrangian Affine Scaling (ALAS) algorithm for general
More informationModeling and solving the Euclidean Steiner Problem
Modeling and solving the Euclidean Steiner Problem Marcia Fampa Work done in collaboration with: Kurt Anstreicher, Claudia D'Ambrosio, Jon Lee, Nelson Maculan, Wendel Melo, Stefan Vigerske DIMACS Workshop
More informationFINITE ELEMENT APPROXIMATION OF A TIME-DEPENDENT TOPOLOGY OPTIMIZATION PROBLEM
ECCOMAS Congress 2016 VII European Congress on Computational Methods in Applied Sciences and Engineering M. Papadrakakis, V. Papadopoulos, G. Stefanou, V. Plevris (eds.) Crete Island, Greece, 5 10 June
More informationColumn Generation for Extended Formulations
1 / 28 Column Generation for Extended Formulations Ruslan Sadykov 1 François Vanderbeck 2,1 1 INRIA Bordeaux Sud-Ouest, France 2 University Bordeaux I, France ISMP 2012 Berlin, August 23 2 / 28 Contents
More informationIterative Reweighted Minimization Methods for l p Regularized Unconstrained Nonlinear Programming
Iterative Reweighted Minimization Methods for l p Regularized Unconstrained Nonlinear Programming Zhaosong Lu October 5, 2012 (Revised: June 3, 2013; September 17, 2013) Abstract In this paper we study
More informationFast Multipole Methods for Incompressible Flow Simulation
Fast Multipole Methods for Incompressible Flow Simulation Nail A. Gumerov & Ramani Duraiswami Institute for Advanced Computer Studies University of Maryland, College Park Support of NSF awards 0086075
More informationEE 381V: Large Scale Optimization Fall Lecture 24 April 11
EE 381V: Large Scale Optimization Fall 2012 Lecture 24 April 11 Lecturer: Caramanis & Sanghavi Scribe: Tao Huang 24.1 Review In past classes, we studied the problem of sparsity. Sparsity problem is that
More informationResearch Article A Novel Differential Evolution Invasive Weed Optimization Algorithm for Solving Nonlinear Equations Systems
Journal of Applied Mathematics Volume 2013, Article ID 757391, 18 pages http://dx.doi.org/10.1155/2013/757391 Research Article A Novel Differential Evolution Invasive Weed Optimization for Solving Nonlinear
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 24: Preconditioning and Multigrid Solver Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 5 Preconditioning Motivation:
More informationUtility Maximizing Routing to Data Centers
0-0 Utility Maximizing Routing to Data Centers M. Sarwat, J. Shin and S. Kapoor (Presented by J. Shin) Sep 26, 2011 Sep 26, 2011 1 Outline 1. Problem Definition - Data Center Allocation 2. How to construct
More informationDouglas-Rachford splitting for nonconvex feasibility problems
Douglas-Rachford splitting for nonconvex feasibility problems Guoyin Li Ting Kei Pong Jan 3, 015 Abstract We adapt the Douglas-Rachford DR) splitting method to solve nonconvex feasibility problems by studying
More informationOn DC. optimization algorithms for solving minmax flow problems
On DC. optimization algorithms for solving minmax flow problems Le Dung Muu Institute of Mathematics, Hanoi Tel.: +84 4 37563474 Fax: +84 4 37564303 Email: ldmuu@math.ac.vn Le Quang Thuy Faculty of Applied
More informationExercises with 'A 99 line topology optimization code written in Matlab'
Exercises with 'A 99 line topology optimization code written in Matlab' 1 Introduction Ole Sigmund Department of Solid Mechanics, Building 404, Technical University of Denmark DK-2800 Lyngby, Denmark May
More informationRisk Averse Shape Optimization
Risk Averse Shape Optimization Sergio Conti 2 Martin Pach 1 Martin Rumpf 2 Rüdiger Schultz 1 1 Department of Mathematics University Duisburg-Essen 2 Rheinische Friedrich-Wilhelms-Universität Bonn Workshop
More informationA direct solver for elliptic PDEs in three dimensions based on hierarchical merging of Poincaré-Steklov operators
(1) A direct solver for elliptic PDEs in three dimensions based on hierarchical merging of Poincaré-Steklov operators S. Hao 1, P.G. Martinsson 2 Abstract: A numerical method for variable coefficient elliptic
More informationAlgebraic Multigrid as Solvers and as Preconditioner
Ò Algebraic Multigrid as Solvers and as Preconditioner Domenico Lahaye domenico.lahaye@cs.kuleuven.ac.be http://www.cs.kuleuven.ac.be/ domenico/ Department of Computer Science Katholieke Universiteit Leuven
More informationApplication of a Non-Linear Frequency Domain Solver to the Euler and Navier-Stokes Equations
Application of a Non-Linear Frequency Domain Solver to the Euler and Navier-Stokes Equations Contours of Pressure.8.6.4...4.6.8 Matthew McMullen Antony Jameson Juan J. Alonso Aero Astro Dept. Stanford
More informationA Polynomial Column-wise Rescaling von Neumann Algorithm
A Polynomial Column-wise Rescaling von Neumann Algorithm Dan Li Department of Industrial and Systems Engineering, Lehigh University, USA Cornelis Roos Department of Information Systems and Algorithms,
More informationConstrained Nonlinear Optimization Algorithms
Department of Industrial Engineering and Management Sciences Northwestern University waechter@iems.northwestern.edu Institute for Mathematics and its Applications University of Minnesota August 4, 2016
More informationFEAST eigenvalue algorithm and solver: review and perspectives
FEAST eigenvalue algorithm and solver: review and perspectives Eric Polizzi Department of Electrical and Computer Engineering University of Masachusetts, Amherst, USA Sparse Days, CERFACS, June 25, 2012
More informationInterior-Point Method for the Computation of Shakedown Loads for Engineering Systems
Institute of General Mechanics RWTH Aachen University Interior-Point Method for the Computation of Shakedown Loads for Engineering Systems J.W. Simon, D. Weichert ESDA 2010, 13. July 2010, Istanbul, Turkey
More informationFront Inform Technol Electron Eng
Interference coordination in full-duplex HetNet with large-scale antenna arrays Zhao-yang ZHANG, Wei LYU Zhejiang University Key words: Massive MIMO; Full-duplex; Small cell; Wireless backhaul; Distributed
More informationFETI domain decomposition method to solution of contact problems with large displacements
FETI domain decomposition method to solution of contact problems with large displacements Vít Vondrák 1, Zdeněk Dostál 1, Jiří Dobiáš 2, and Svatopluk Pták 2 1 Dept. of Appl. Math., Technical University
More information