A fast implementation of the FETI-DP method: FETI-DP-RBS-LNA and applications on large scale problems with localized non-linearities

2005 ◽  
Vol 63 (6) ◽  
pp. 833-858 ◽  
Author(s):  
Jun Sun ◽  
Pan Michaleris ◽  
Anshul Gupta ◽  
Padma Raghavan
Keyword(s):  
Large Scale ◽  
Large Scale Problems ◽  
Fast Implementation

scholarly journals Investigation of Improved Cooperative Coevolution for Large-Scale Global Optimization Problems

Algorithms ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 146
Author(s):  
Aleksei Vakhnin ◽  
Evgenii Sopov
Keyword(s):  
Global Optimization ◽  
Evolutionary Algorithms ◽  
Numerical Experiments ◽  
Large Scale ◽  
Optimization Problems ◽  
State Of The Art ◽  
Fixed Number ◽  
High Dimensional ◽  
Cooperative Coevolution ◽  
Large Scale Problems

Modern real-valued optimization problems are complex and high-dimensional, and they are known as “large-scale global optimization (LSGO)” problems. Classic evolutionary algorithms (EAs) perform poorly on this class of problems because of the curse of dimensionality. Cooperative Coevolution (CC) is a high-performed framework for performing the decomposition of large-scale problems into smaller and easier subproblems by grouping objective variables. The efficiency of CC strongly depends on the size of groups and the grouping approach. In this study, an improved CC (iCC) approach for solving LSGO problems has been proposed and investigated. iCC changes the number of variables in subcomponents dynamically during the optimization process. The SHADE algorithm is used as a subcomponent optimizer. We have investigated the performance of iCC-SHADE and CC-SHADE on fifteen problems from the LSGO CEC’13 benchmark set provided by the IEEE Congress of Evolutionary Computation. The results of numerical experiments have shown that iCC-SHADE outperforms, on average, CC-SHADE with a fixed number of subcomponents. Also, we have compared iCC-SHADE with some state-of-the-art LSGO metaheuristics. The experimental results have shown that the proposed algorithm is competitive with other efficient metaheuristics.

Fast Multipole Virtual Boundary Element - Least Square Method for Solving 2-D Elastic Problems

2011 ◽  
Vol 204-210 ◽  
pp. 2196-2201
Author(s):  
Yan Tao Jiang ◽  
Si Tian Chen ◽  
Cheng Hua Li
Keyword(s):  
Boundary Element ◽  
Large Scale ◽  
Fast Multipole Method ◽  
Main Idea ◽  
Least Square Method ◽  
Least Square ◽  
Fast Multipole ◽  
Large Scale Problems ◽  
Virtual Boundary ◽  
Virtual Boundary Element

In this paper, the fast multipole virtual boundary element - least square method (Fast Multipole VBE - LSM) is proposed and used to simulate 2-D elastic problems, which is based on the fast multipole method (FMM) and virtual boundary element - least square method (VBE - LSM).The main idea of the method is to change computational model by applying the FMM to conventional VBE - LSM. The memory and operations could be reduced to be of linear proportion to the degree of freedom (DOF) and large scale problems could be effectively solved on a common desktop with this method. Numerical results show that this method holds virtues of high feasibility, accuracy and efficiency. Moreover, the idea of this method can be generalized and extended in application.

Hierarchy theory as a guide to mycorrhizal research on large-scale problems

1991 ◽  
Vol 73 (3-4) ◽  
pp. 271-284 ◽  
Author(s):  
E.G. O'Neill ◽  
R.V. O'Neill ◽  
R.J. Norby
Keyword(s):  
Large Scale ◽  
Hierarchy Theory ◽  
Large Scale Problems

ON THE LOCATION AND CONTINUATION OF HOPF BIFURCATIONS IN LARGE-SCALE PROBLEMS

2008 ◽  
Vol 18 (05) ◽  
pp. 1589-1597 ◽  
Author(s):  
M. FRIEDMAN ◽  
W. QIU
Keyword(s):  
Dynamical Systems ◽  
Large Scale ◽  
Orthonormal Basis ◽  
Invariant Subspaces ◽  
Hopf Bifurcations ◽  
Augmented System ◽  
Large Scale Problems ◽  
System Technique ◽  
Matlab Package ◽  
Parameter Dependent

CL_MATCONT is a MATLAB package for the study of dynamical systems and their bifurcations. It uses a minimally augmented system for continuation of the Hopf curve. The Continuation of Invariant Subspaces (CIS) algorithm produces a smooth orthonormal basis for an invariant subspace [Formula: see text] of a parameter-dependent matrix A(s). We extend a minimally augmented system technique for location and continuation of Hopf bifurcations to large-scale problems using the CIS algorithm, which has been incorporated into CL_MATCONT. We compare this approach with using a standard augmented system and show that a minimally augmented system technique is more suitable for large-scale problems. We also suggest an improvement of a minimally augmented system technique for the case of the torus continuation.

A New Solution Seed for Job Shop Scheduling Problem

2011 ◽  
Vol 110-116 ◽  
pp. 3899-3905
Author(s):  
Parviz Fattahi ◽  
Mojdeh Shirazi Manesh ◽  
Abdolreza Roshani
Keyword(s):  
Tabu Search ◽  
Large Scale ◽  
Production Management ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Np Hard ◽  
Shop Scheduling ◽  
Large Scale Problems

Scheduling for job shop is very important in both fields of production management and combinatorial optimization. Since the problem is well known as NP-Hard class, many metaheuristic approaches are developed to solve the medium and large scale problems. One of the main elements of these metaheuristics is the solution seed structure. Solution seed represent the coding structure of real solution. In this paper, a new solution seed for job shop scheduling is presented. This solution seed is compared with a famous solution seed presented for the job shop scheduling. Since the problem is well known as NP-Hard class, a Tabu search algorithm is developed to solve large scale problems. The proposed solution seed are examined using an example and tabu search algorithm.

Sign in / Sign up

Export Citation Format

Share Document