Simple iteration method for structural static reanalysis

2009 ◽  
Vol 36 (9) ◽  
pp. 1535-1538 ◽  
Author(s):  
Haifeng Liu ◽  
Baisheng Wu ◽  
Zhengguang Li
Keyword(s):  
Iterative Method ◽  
Iteration Method ◽  
Stiffness Matrix ◽  
Potential Energy Function ◽  
Relaxation Parameter ◽  
Computational Time ◽  
Acceleration Technique ◽  
Structural Static Reanalysis ◽  
Finite Element Systems

This paper presents a simple iterative method for structural static reanalysis. A preconditioned Richardson’s iterative method is developed and the relaxation parameter is determined by a very simple formula derived from the corresponding potential energy function. Based on the iteration method, an acceleration technique is also established. The proposed method is intended to utilize the existing stiffness matrix factorization completed for the initial design, require matrix-by-vector products only, preserve the ease of implementation and improve significantly the quality of the results. The method is suitable for general finite element systems. Calculation of derivatives is not required. The computational time is considerably reduced. A numerical example is used to validate the effectiveness of the proposed reanalysis method.

A new modified group explicit iterative method for the numerical solution of time dependent viscous Burgers' equation

2014 ◽  
Vol 05 (02) ◽  
pp. 1350029 ◽  
Author(s):  
Jyoti Talwar ◽  
R. K. Mohanty
Keyword(s):  
Iterative Method ◽  
Numerical Solution ◽  
Convergence Analysis ◽  
Iterative Methods ◽  
Iteration Method ◽  
Burgers Equation ◽  
Time Dependent ◽  
Alternating Group ◽  
Explicit Method ◽  
Rectangular Coordinates

In this article, we discuss a new smart alternating group explicit method based on off-step discretization for the solution of time dependent viscous Burgers' equation in rectangular coordinates. The convergence analysis for the new iteration method is discussed in details. We compared the results of Burgers' equation obtained by using the proposed iterative method with the results obtained by other iterative methods to demonstrate computationally the efficiency of the proposed method.

scholarly journals ON SAMPLING BASED METHODS FOR THE DUBINS TRAVELING SALESMAN PROBLEM WITH NEIGHBORHOODS

2015 ◽  
Vol 2 (2) ◽  
pp. 57-61
Author(s):  
Petr Váňa ◽  
Jan Faigl
Keyword(s):  
Path Planning ◽  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Computational Time ◽  
Solution Quality ◽  
Goal Region ◽  
Dubins Vehicle ◽  
Proposed Modification ◽  
Dubins Traveling Salesman Problem

In this paper, we address the problem of path planning to visit a set of regions by Dubins vehicle, which is also known as the Dubins Traveling Salesman Problem Neighborhoods (DTSPN). We propose a modification of the existing sampling-based approach to determine increasing number of samples per goal region and thus improve the solution quality if a more computational time is available. The proposed modification of the sampling-based algorithm has been compared with performance of existing approaches for the DTSPN and results of the quality of the found solutions and the required computational time are presented in the paper.

scholarly journals A Preconditioned Iteration Method for Solving Sylvester Equations

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Jituan Zhou ◽  
Ruirui Wang ◽  
Qiang Niu
Keyword(s):  
Iterative Method ◽  
Iteration Method ◽  
Linear Equations ◽  
System Of Linear Equations ◽  
Newton's Iteration ◽  
Gradient Based ◽  
Selection Of

A preconditioned gradient-based iterative method is derived by judicious selection of two auxil- iary matrices. The strategy is based on the Newton’s iteration method and can be regarded as a generalization of the splitting iterative method for system of linear equations. We analyze the convergence of the method and illustrate that the approach is able to considerably accelerate the convergence of the gradient-based iterative method.

scholarly journals Region Filling with Super Resolution Algorithm

2021 ◽  
Vol 9 (VI) ◽  
pp. 3557-3564
Author(s):  
Darakhshan R. Khan
Keyword(s):  
Patch Size ◽  
Research Work ◽  
Super Resolution ◽  
Input Image ◽  
Computational Time ◽  
Low Resolution ◽  
Resolution Image ◽  
Resolution Algorithm ◽  
Region Filling

Region filling which has another name inpainting, is an approach to find the values of missing pixels from data available in the remaining portion of the image. The missing information must be recalculated in a distinctly convincing manner, such that, image look seamless. This research work has built a methodology for completely automating patch priority based region filling process. To reduce the computational time, low resolution image is constructed from input image. Based on texel of an image, patch size is determined. Several low resolution image with missing region filled is generated using region filling algorithm. Pixel information from these low resolution images is consolidated to produce single low resolution region filled image. Finally, super resolution algorithm is applied to enhance the quality of image and regain all specifics of image. This methodology of identifying patch size based on input fed has an advantage over filling algorithms which in true sense automate the process of region filling, to deal with sensitivity in region filling, algorithm different parameter settings are used and functioning with coarse version of image will notably reduce the computational time.

scholarly journals Fast Algorithm for Selective Image Segmentation Model

2018 ◽  
Vol 7 (4.33) ◽  
pp. 41
Author(s):  
Abdul K Jumaat ◽  
Ke Chen
Keyword(s):  
Image Segmentation ◽  
Fast Algorithm ◽  
Visual Quality ◽  
Projection Algorithm ◽  
Computational Time ◽  
Segmentation Result ◽  
Numerical Tests ◽  
Specific Object ◽  
The Common

Selective image segmentation model aims to separate a specific object from its surroundings. To solve the model, the common practice to deal with its non-differentiable term is to approximate the original functional. While this approach yields to successful segmentation result, however the segmentation process can be slow. In this paper, we showed how to solve the model without approximation using Chambolle’s projection algorithm. Numerical tests show that good visual quality of segmentation is obtained in a fast-computational time.  

Global Bacteria Optimization Meta-Heuristic Algorithm for Jobshop Scheduling

2010 ◽  
Vol 1 (4) ◽  
pp. 47-58 ◽  
Author(s):  
Jairo R. Montoya-Torres ◽  
Libardo S. Gómez-Vizcaíno ◽  
Elyn L. Solano-Charris ◽  
Carlos D. Paternina-Arboleda
Keyword(s):  
Heuristic Algorithm ◽  
State Of The Art ◽  
Total Tardiness ◽  
Computational Time ◽  
Heuristic Procedure ◽  
Makespan Minimization ◽  
Light Stimulation ◽  
Jobshop Scheduling ◽  
Previous State

This paper examines the problem of jobshop scheduling with either makespan minimization or total tardiness minimization, which are both known to be NP-hard. The authors propose the use of a meta-heuristic procedure inspired from bacterial phototaxis. This procedure, called Global Bacteria Optimization (GBO), emulates the reaction of some organisms (bacteria) to light stimulation. Computational experiments are performed using well-known instances from literature. Results show that the algorithm equals and even outperforms previous state-of-the-art procedures in terms of quality of solution and requires very short computational time.

Extension of Iteration Method for Determining Strain Distributions to the Uniformly Stressed Plate With a Hole

1963 ◽  
Vol 30 (2) ◽  
pp. 210-214 ◽  
Author(s):  
E. A. Davis
Keyword(s):  
Iterative Method ◽  
Strain Hardening ◽  
Iteration Method ◽  
Incompressible Materials

The iterative method for determining strain distributions is applied to a uniformly stressed plate with a hole at the center. The method is not limited to incompressible materials; the load can be raised in incremental amounts; and strain-hardening of the material can be taken into consideration.

Developing an Efficient Multigrid Strategy for Solving Incompressible Flow

2004 ◽  
Author(s):  
Masoud Darbandi ◽  
Gerry E. Schneider ◽  
Arash Taheri
Keyword(s):  
Finite Element ◽  
Stokes Equations ◽  
Navier Stokes ◽  
Computational Time ◽  
Fine Grid ◽  
Algebraic Set ◽  
Acceleration Technique ◽  
Relaxation Schemes ◽  
Relaxation Procedure ◽  
Benchmark Solutions

In this work, a multigrid acceleration technique is suitably developed for solving the two-dimensional incompressible Navier-Stokes equations using an implicit finite element volume method. In this regard, the solution domain is broken into a huge number of quadrilateral finite elements. The accurate numerical solution of a flow field can be achieved if very fine grid resolutions are utilized. Unfortunately, the standard implicit solvers need more computational time to solve larger size of algebraic set of equations which normally arise if fine grid distributions are used. Past experience has shown that the convergence of classical relaxation schemes perform an initial rapid decrease of residuals followed by a slower rate of decrease. This point indicates that a relaxation procedure is efficient for eliminating only the high frequency components of the residuals. This problem can be overcome using multigrid method, i.e., carrying out the relaxation procedure on a series of different grid sizes. There are different prolongation operators to establish a multigrid procedure. A new prolongation expression is suitably developed in this work. It needs constructing data during refining and coarsening stages which is fulfilled using suitable finite element interpolators. The extended formulations are finally used to test several different problems with available benchmark solutions. The results indicate that the current multigrid strategy effectively improves the bandit solver performance.

scholarly journals Image-Based Artificial Intelligence Methods for Product Control of Tablet Coating Quality

Pharmaceutics ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 877
Author(s):  
Cosima Hirschberg ◽  
Magnus Edinger ◽  
Else Holmfred ◽  
Jukka Rantanen ◽  
Johan Boetker
Keyword(s):  
Classification Model ◽  
Computational Time ◽  
Support Vector ◽  
Coating Quality ◽  
Coating Solution ◽  
Human Decision ◽  
Control Situations ◽  
The Individual ◽  
Product Control

Mimicking the human decision-making process is challenging. Especially, many process control situations during the manufacturing of pharmaceuticals are based on visual observations and related experience-based actions. The aim of the present work was to investigate the use of image analysis to classify the quality of coated tablets. Tablets with an increasing amount of coating solution were imaged by fast scanning using a conventional office scanner. A segmentation routine was implemented to the images, allowing the extraction of numeric image-based information from individual tablets. The image preprocessing was performed prior to utilization of four different classification techniques for the individual tablet images. The support vector machine (SVM) technique performed superior compared to a convolutional neural network (CNN) in relation to computational time, and this approach was also slightly better at classifying the tablets correctly. The fastest multivariate method was partial least squares (PLS) regression, but this method was hampered by the inferior classification accuracy of the tablets. Finally, it was possible to create a numerical threshold classification model with an accuracy comparable to the SVM approach, so it is evident that there exist multiple valid options for classifying coated tablets.

An Improved Method for Scheduling Aircraft Ground Handling Operations From a Global Perspective

2019 ◽  
Vol 36 (04) ◽  
pp. 1950020 ◽  
Author(s):  
Silvia Padrón ◽  
Daniel Guimarans
Keyword(s):  
Time Windows ◽  
Pareto Frontier ◽  
Solution Space ◽  
Real Data ◽  
Global Perspective ◽  
Computational Time ◽  
Efficient Utilization ◽  
Ground Handling ◽  
And Performance

The turnaround is a critical airport process where a set of interrelated operations need to be performed to get an aircraft ready for its next flight. These activities are carried out by different vehicles, which need to be coordinated to guarantee an efficient utilization of resources. Due to the relations between operations, the order in which these resources are scheduled has a critical influence on the planning and performance of the turnaround. In this work, we present a novel methodology for solving the proposed bi-objective ground handling scheduling problem from a global perspective. This means solving a set of interconnected routing problems with restrictive time windows for each operation. We first explore the solution space using a fast heuristic, focusing then on the most promising solutions to intensify the search in the vicinity of the Pareto frontier. This two-step schema permits significantly reducing the required computational time, which, in turn, allows a more thorough exploration of solutions. Different experiments over real data from two Spanish airports have been conducted to assess the proposed methodology. Our results show that the new method not only outperforms previous approaches in terms of computational requirements, but can also improve the quality of scheduling solutions.

Sign in / Sign up

Export Citation Format

Share Document