Search results for: monotone iterative method

Authors: Chuanyun Gu, Shouming Zhong

Abstract:

In this paper, the existence and uniqueness of positive solutions for nonlinear fractional differential equation boundary value problem is concerned by a fixed point theorem of a sum operator. Our results can not only guarantee the existence and uniqueness of positive solution, but also be applied to construct an iterative scheme for approximating it. Finally, the example is given to illustrate the main result.

Keywords: Fractional differential equation, Boundary value problem, Positive solution, Existence and uniqueness, Fixed point theorem of a sum operator

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1444

Authors: Yiqin Lin, Liang Bao, Qinghua Wu, Liping Zhou

Abstract:

In this paper, we propose a direct method based on the real Schur factorization for solving the projected Sylvester equation with relatively small size. The algebraic formula of the solution of the projected continuous-time Sylvester equation is presented. The computational cost of the direct method is estimated. Numerical experiments show that this direct method has high accuracy.

Keywords: Projected Sylvester equation, Schur factorization, Spectral projection, Direct method.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1772

Authors: S. J. Hosseini Ghoncheh, M. Paripour

Abstract:

In this paper the Huang-s method for solving a m×n fuzzy linear system when, m≤ n, is considered. The method in detail is discussed and illustrated by solving some numerical examples.

Keywords: Fuzzy number, fuzzy linear systems, Huang's method.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1242

Authors: M. Zarebnia, R. Parvaz

Abstract:

In this paper, numerical solutions of the nonlinear Benjamin-Bona-Mahony-Burgers (BBMB) equation are obtained by a method based on collocation of cubic B-splines. Applying the Von-Neumann stability analysis, the proposed method is shown to be unconditionally stable. The method is applied on some test examples, and the numerical results have been compared with the exact solutions. The L∞ and L2 in the solutions show the efficiency of the method computationally.

Keywords: Benjamin-Bona-Mahony-Burgers equation, Cubic Bspline, Collocation method, Finite difference.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3631

Authors: H. Taghvafard, G. H. Erjaee

Abstract:

A method for solving linear and non-linear Goursat problem is given by using the two-dimensional differential transform method. The approximate solution of this problem is calculated in the form of a series with easily computable terms and also the exact solutions can be achieved by the known forms of the series solutions. The method can easily be applied to many linear and non-linear problems and is capable of reducing the size of computational work. Several examples are given to demonstrate the reliability and the performance of the presented method.

Keywords: Quadrature, Spline interpolation, Trapezoidal rule, Numericalintegration, Error analysis.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2331

Authors: Sumachaya Harnsukworapanich, Tetsuo Ichimori

Abstract:

The apportionment method is used by many countries, to calculate the distribution of seats in political bodies. For example, this method is used in the United States (U.S.) to distribute house seats proportionally based on the population of the electoral district. Famous apportionment methods include the divisor methods called the Adams Method, Dean Method, Hill Method, Jefferson Method and Webster Method. Sometimes the results from the implementation of these divisor methods are unfair and include errors. Therefore, it is important to examine the optimization of this method by using a bias measurement to figure out precise and fair results. In this research we investigate the bias of divisor methods in the U.S. Houses of Representatives toward large and small states by applying the Stolarsky Mean Method. We compare the bias of the apportionment method by using two famous bias measurements: the Balinski and Young measurement and the Ernst measurement. Both measurements have a formula for large and small states. The Third measurement however, which was created by the researchers, did not factor in the element of large and small states into the formula. All three measurements are compared and the results show that our measurement produces similar results to the other two famous measurements.

Keywords: Apportionment, Bias, Divisor, Fair, Simulation

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1752

Authors: Zhenyu Zhao, Lei You

Abstract:

The numerical analytic continuation of a function f(z) = f(x + iy) on a strip is discussed in this paper. The data are only given approximately on the real axis. The periodicity of given data is assumed. A truncated Fourier spectral method has been introduced to deal with the ill-posedness of the problem. The theoretic results show that the discrepancy principle can work well for this problem. Some numerical results are also given to show the efficiency of the method.

Keywords: Analytic continuation, ill-posed problem, regularization method Fourier spectral method, the discrepancy principle.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1439

Authors: Khosrow Maleknejad, Asyieh Ebrahimzadeh

Abstract:

In this paper, the numerical solution of optimal control problem (OCP) for systems governed by Volterra integro-differential (VID) equation is considered. The method is developed by means of the Legendre wavelet approximation and collocation method. The properties of Legendre wavelet together with Gaussian integration method are utilized to reduce the problem to the solution of nonlinear programming one. Some numerical examples are given to confirm the accuracy and ease of implementation of the method.

Keywords: Collocation method, Legendre wavelet, optimal control, Volterra integro-differential equation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2845

Authors: Jaewon Jang, Gregory R. Miller

Abstract:

This paper presents work characterizing finite element performance boundaries within which live, interactive finite element modeling is feasible on current and emerging systems. These results are based on wide-ranging tests performed using a prototype finite element program implemented specifically for this study, thereby enabling the unified investigation of numerous direct and iterative solver strategies and implementations in a variety of modeling contexts. The results are intended to be useful for researchers interested in interactive analysis by providing baseline performance estimates, to give guidance in matching solution strategies to problem domains, and to spur further work addressing the challenge of extending the present boundaries.

Keywords: Finite Elements, Interactive Modeling, NumericalAnalysis.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1307

Authors: Tonislav Ivanov, Oleksii Nedashkivskyi, Denis Babeshko, Vadim Pinskiy, Matthew Putman

Abstract:

Training a machine learning model for object detection that generalizes well is known to benefit from a training dataset with diverse examples. However, training datasets usually contain many repeats of common examples of a class and lack rarely seen examples. This is due to the process commonly used during human annotation where a person would proceed sequentially through a list of images labeling a sufficiently high total number of examples. Instead, the method presented involves an active process where, after the initial labeling of several images is completed, the next subset of images for labeling is selected by an algorithm. This process of algorithmic image selection and manual labeling continues in an iterative fashion. The algorithm used for the image selection is a deep learning algorithm, based on the U-shaped architecture, which quantifies the presence of unseen data in each image in order to find images that contain the most novel examples. Moreover, the location of the unseen data in each image is highlighted, aiding the labeler in spotting these examples. Experiments performed using semiconductor wafer data show that labeling a subset of the data, curated by this algorithm, resulted in a model with a better performance than a model produced from sequentially labeling the same amount of data. Also, similar performance is achieved compared to a model trained on exhaustive labeling of the whole dataset. Overall, the proposed approach results in a dataset that has a diverse set of examples per class as well as more balanced classes, which proves beneficial when training a deep learning model.

Keywords: Computer vision, deep learning, object detection, semiconductor.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 744

Authors: Farnaz G. Nezami, Mir B. Aryanezhad, Seyed J. Sadjadi

Abstract:

In this paper a nonlinear model is presented to demonstrate the relation between production and marketing departments. By introducing some functions such as pricing cost and market share loss functions it will be tried to show some aspects of market modelling which has not been regarded before. The proposed model will be a constrained signomial geometric programming model. For model solving, after variables- modifications an iterative technique based on the concept of geometric mean will be introduced to solve the resulting non-standard posynomial model which can be applied to a wide variety of models in non-standard posynomial geometric programming form. At the end a numerical analysis will be presented to accredit the validity of the mentioned model.

Keywords: Geometric programming, marketing, nonlinear optimization, production.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1381

Authors: V. Ghadamyari, F. Samadi, F. Kowsary

Abstract:

An inverse geometry problem is solved to predict an unknown irregular boundary profile. The aim is to minimize the objective function, which is the difference between real and computed temperatures, using three different versions of Conjugate Gradient Method. The gradient of the objective function, considered necessary in this method, obtained as a result of solving the adjoint equation. The abilities of three versions of Conjugate Gradient Method in predicting the boundary profile are compared using a numerical algorithm based on the method. The predicted shapes show that due to its convergence rate and accuracy of predicted values, the Powell-Beale version of the method is more effective than the Fletcher-Reeves and Polak –Ribiere versions.

Keywords: Boundary elements, Conjugate Gradient Method, Inverse Geometry Problem, Sensitivity equation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1789

Authors: Shigeaki Sakurai, Youichi Kitahata, Ryohei Orihara

Abstract:

This paper proposes a method that discovers sequential patterns corresponding to user-s interests from sequential data. This method expresses the interests as constraint patterns. The constraint patterns can define relationships among attributes of the items composing the data. The method recursively decomposes the constraint patterns into constraint subpatterns. The method evaluates the constraint subpatterns in order to efficiently discover sequential patterns satisfying the constraint patterns. Also, this paper applies the method to the sequential data composed of stock price indexes and verifies its effectiveness through comparing it with a method without using the constraint patterns.

Keywords: Sequential pattern mining, Constraint pattern, Attribute constraint, Stock price indexes

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1381

Authors: Wenshuai Zhai, Yunhua Zhang

Abstract:

Synthetic aperture radar (SAR) imaging usually requires echo data collected continuously pulse by pulse with certain bandwidth. However in real situation, data collection or part of signal spectrum can be interrupted due to various reasons, i.e. there will be gaps in spatial spectrum. In this case we need to find ways to fill out the resulted gaps and get image with defined resolution. In this paper we introduce our work on how to apply iterative spatially variant apodization (Super-SVA) technique to extrapolate the spatial spectrum in both azimuthal and range directions so as to fill out the gaps and get correct radar image.

Keywords: SAR imaging, Sparse aperture, Stepped frequencychirp signal, high resolution, Super-SVA

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1912

Authors: T. Matsubayashi, T. Yamada

Abstract:

In this paper, we propose a fast and efficient method for drawing very large-scale graph data. The conventional force-directed method proposed by Fruchterman and Rheingold (FR method) is well-known. It defines repulsive forces between every pair of nodes and attractive forces between connected nodes on a edge and calculates corresponding potential energy. An optimal layout is obtained by iteratively updating node positions to minimize the potential energy. Here, the positions of the nodes are updated every global timestep at the same time. In the proposed method, each node has its own individual time and time step, and nodes are updated at different frequencies depending on the local situation. The proposed method is inspired by the hierarchical individual time step method used for the high accuracy calculations for dense particle fields such as star clusters in astrophysical dynamics. Experiments show that the proposed method outperforms the original FR method in both speed and accuracy. We implement the proposed method on the MDGRAPE-3 PCI-X special purpose parallel computer and realize a speed enhancement of several hundred times.

Keywords: visualization, graph drawing, Internet Map

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1792

Authors: Marzieh. Savoj, S. Amirhassan. Monadjemi

Abstract:

Iris localization is a very important approach in biometric identification systems. Identification process usually is implemented in three levels: iris localization, feature extraction, and pattern matching finally. Accuracy of iris localization as the first step affects all other levels and this shows the importance of iris localization in an iris based biometric system. In this paper, we consider Daugman iris localization method as a standard method, propose a new method in this field and then analyze and compare the results of them on a standard set of iris images. The proposed method is based on the detection of circular edge of iris, and improved by fuzzy circles and surface energy difference contexts. Implementation of this method is so easy and compared to the other methods, have a rather high accuracy and speed. Test results show that the accuracy of our proposed method is about Daugman method and computation speed of it is 10 times faster.

Keywords: Convolution, Edge detector filter, Fuzzy circle, Identification

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1994

Authors: Maryam Khazaei Pool, Lori Lewis

Abstract:

This is a summary of articles based on higher order B-splines methods and the variation of B-spline methods such as Quadratic B-spline Finite Elements Method, Exponential Cubic B-Spline Method Septic B-spline Technique, Quintic B-spline Galerkin Method, and B-spline Galerkin Method based on the Quadratic B-spline Galerkin method (QBGM) and Cubic B-spline Galerkin method (CBGM). In this paper we study the B-spline methods and variations of B-spline techniques to find a numerical solution to the Burgers’ equation. A set of fundamental definitions including Burgers equation, spline functions, and B-spline functions are provided. For each method, the main technique is discussed as well as the discretization and stability analysis. A summary of the numerical results is provided and the efficiency of each method presented is discussed. A general conclusion is provided where we look at a comparison between the computational results of all the presented schemes. We describe the effectiveness and advantages of these methods.

Keywords: Burgers’ Equation, Septic B-spline, Modified Cubic B-Spline Differential Quadrature Method, Exponential Cubic B-Spline Technique, B-Spline Galerkin Method, and Quintic B-Spline Galerkin Method.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 286

Authors: Mohsen Keyvanfard

Abstract:

A new, simple and highly sensitive kinetic spectrophotometric method was developed for the determination of trace amounts of Ru(III) in the range of 0.06-20 ng/ml .The method is based on the inhibitory effect of ruthenium(III) on the oxidation of Rhodamine B by bromate in acidic and micellar medium. The reaction was monitored spectrophotometrically by measuring the decreasing in absorbance of Rhodamine B at 554 nm with a fixedtime method..The limit of detection is 0.04 ng/ml Ru(III).The relative standard deviation of 5 and 10 ng/ml Ru(III) was 2.3 and 2.7 %, respectively. The method was applied to the determination of ruthenium in real water samples

Keywords: Ruthenium ;Inhibitory; Rhodamine B; bromate

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1648

Authors: Taiyo Matsumura, Kuninori Takahashi, Takashi Ono

Abstract:

The purpose of this research is to improve the convenience of waiting for trains at level crossings and stations and to prevent accidents resulting from forcible entry into level crossings, by providing level crossing users and passengers with information that tells them when the next train will pass through or arrive. For this paper, we proposed methods for estimating operation by means of an average value method, variable response smoothing method, and exponential smoothing method, on the basis of open data, which has low accuracy, but for which performance schedules are distributed in real time. We then examined the accuracy of the estimations. The results showed that the application of an exponential smoothing method is valid.

Keywords: Exponential smoothing method, open data, operation estimation, train schedule.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 667

Authors: Chuanyun Gu

Abstract:

By using fixed point theorems for a class of generalized concave and convex operators, the positive solution of nonlinear fractional differential equation with integral boundary conditions is studied, where n ≥ 3 is an integer, μ is a parameter and 0 ≤ μ < α. Its existence and uniqueness is proved, and an iterative scheme is constructed to approximate it. Finally, two examples are given to illustrate our results.

Keywords: Fractional differential equation, positive solution, existence and uniqueness, fixed point theorem, generalized concave and convex operator, integral boundary conditions.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1066

Authors: J. A. Michline Rupa, S. Ganesh

Abstract:

This paper proposes a backward/forward sweep method to analyze the power flow in radial distribution systems. The distribution system has radial structure and high R/X ratios. So the newton-raphson and fast decoupled methods are failed with distribution system. The proposed method presents a load flow study using backward/forward sweep method, which is one of the most effective methods for the load-flow analysis of the radial distribution system. By using this method, power losses for each bus branch and voltage magnitudes for each bus node are determined. This method has been tested on IEEE 33-bus radial distribution system and effective results are obtained using MATLAB.

Keywords: Backward/Forward sweep method, Distribution system, Load flow analysis.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17422

Authors: İnci M. Erhan

Abstract:

A numerical method for solving the time-independent Schrödinger equation of a particle moving freely in a three-dimensional axisymmetric region is developed. The boundary of the region is defined by an arbitrary analytic function. The method uses a coordinate transformation and an expansion in eigenfunctions. The effectiveness is checked and confirmed by applying the method to a particular example, which is a prolate spheroid.

Keywords: Bessel functions, Eigenfunction expansion, Quantum billiard, Schrödinger equation, Spherical harmonics

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 5161

Authors: Joe Imae, Kenjiro Shinagawa, Tomoaki Kobayashi, Guisheng Zhai

Abstract:

We propose a new approach on how to obtain the approximate solutions of Hamilton-Jacobi (HJ) equations. The process of the approximation consists of two steps. The first step is to transform the HJ equations into the virtual time based HJ equations (VT-HJ) by introducing a new idea of ‘virtual-time’. The second step is to construct the approximate solutions of the HJ equations through a computationally iterative procedure based on the VT-HJ equations. It should be noted that the approximate feedback solutions evolve by themselves as the virtual-time goes by. Finally, we demonstrate the effectiveness of our approximation approach by means of simulations with linear and nonlinear control problems.

Keywords: Nonlinear Control, Optimal Control, Hamilton-Jacobi Equation, Virtual-Time

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1469

Authors: A. Nikkar, M. Mighani

Abstract:

In this study, a new reliable technique use to handle the foam drainage equation. This new method is resulted from VIM by a simple modification that is Reconstruction of Variational Iteration Method (RVIM). The drainage of liquid foams involves the interplay of gravity, surface tension, and viscous forces. Foaming occurs in many distillation and absorption processes. Results are compared with those of Adomian’s decomposition method (ADM).The comparisons show that the Reconstruction of Variational Iteration Method is very effective and overcome the difficulty of traditional methods and quite accurate to systems of non-linear partial differential equations.

Keywords: Reconstruction of Variational Iteration Method (RVIM), Foam drainage, nonlinear partial differential equation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1769

Authors: N. M. Nusi, M. Othman, M. Suleiman, F. Ismail, N. Alias

Abstract:

In this paper, an alternating implicit block method for solving two dimensional scalar wave equation is presented. The new method consist of two stages for each time step implemented in alternating directions which are very simple in computation. To increase the speed of computation, a group of adjacent points is computed simultaneously. It is shown that the presented method increase the maximum time step size and more accurate than the conventional finite difference time domain (FDTD) method and other existing method of natural ordering.

Keywords: FDTD, Scalar wave equation, alternating direction implicit (ADI), alternating group explicit (AGE), asymmetric approximation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1857

Authors: Nicolay Zarutskiy, Roman Bulkin

Abstract:

The paper deals with the existing methods of force-torque sensor calibration with a number of components from one to six, analyzed their advantages and disadvantages, the necessity of introduction of a calibration method. Calibration method and its constructive realization are also described here. A calibration method allows performing automated force-torque sensor calibration both with selected components of the main vector of forces and moments and with complex loading. Thus, two main advantages of the proposed calibration method are achieved: the automation of the calibration process and universality.

Keywords: Automation, calibration, calibration device, calibration method, force-torque sensors.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1242

Authors: S. A. Eftekhari

Abstract:

In this paper, a numerical algorithm using a coupled Galerkin-Differential Quadrature (DQ) method is proposed for the solution of dam-reservoir interaction problem. The governing differential equation of motion of the dam structure is discretized by the Galerkin method and the DQM is used to discretize the fluid domain. The resulting systems of ordinary differential equations are then solved by the Newmark time integration scheme. The mixed scheme combines the simplicity of the Galerkin method and high accuracy and efficiency of the DQ method. Its accuracy and efficiency are demonstrated by comparing the calculated results with those of the existing literature. It is shown that highly accurate results can be obtained using a small number of Galerkin terms and DQM sampling points. The technique presented in this investigation is general and can be used to solve various fluid-structure interaction problems.

Keywords: Dam-reservoir system, Differential quadrature method, Fluid-structure interaction, Galerkin method, Integral quadrature method.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1833

Authors: A.K. Tangirala, S. Babji

Abstract:

In the last few years, three multivariate spectral analysis techniques namely, Principal Component Analysis (PCA), Independent Component Analysis (ICA) and Non-negative Matrix Factorization (NMF) have emerged as effective tools for oscillation detection and isolation. While the first method is used in determining the number of oscillatory sources, the latter two methods are used to identify source signatures by formulating the detection problem as a source identification problem in the spectral domain. In this paper, we present a critical drawback of the underlying linear (mixing) model which strongly limits the ability of the associated source separation methods to determine the number of sources and/or identify the physical source signatures. It is shown that the assumed mixing model is only valid if each unit of the process gives equal weighting (all-pass filter) to all oscillatory components in its inputs. This is in contrast to the fact that each unit, in general, acts as a filter with non-uniform frequency response. Thus, the model can only facilitate correct identification of a source with a single frequency component, which is again unrealistic. To overcome this deficiency, an iterative post-processing algorithm that correctly identifies the physical source(s) is developed. An additional issue with the existing methods is that they lack a procedure to pre-screen non-oscillatory/noisy measurements which obscure the identification of oscillatory sources. In this regard, a pre-screening procedure is prescribed based on the notion of sparseness index to eliminate the noisy and non-oscillatory measurements from the data set used for analysis.

Keywords: non-negative matrix factorization, PCA, source separation, plant-wide diagnosis

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1479

Authors: Xijian Wang

Abstract:

This paper is concerned with the numerical minimization of energy functionals in BV ( ) (the space of bounded variation functions) involving total variation for gray-scale 1-dimensional inpainting problem. Applications are shown by finite element method and discontinuous Galerkin method for total variation minimization. We include the numerical examples which show the different recovery image by these two methods.

Keywords: finite element method, discontinuous Galerkin method, total variation minimization, inpainting

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1300

Authors: Faranak Rabiei, Fudziah Ismail, S. Norazak, Saeid Emadi

Abstract:

In this paper we developed the Improved Runge-Kutta Nystrom (IRKN) method for solving second order ordinary differential equations. The methods are two step in nature and require lower number of function evaluations per step compared with the existing Runge-Kutta Nystrom (RKN) methods. Therefore, the methods are computationally more efficient at achieving the higher order of local accuracy. Algebraic order conditions of the method are obtained and the third and fourth order method are derived with two and three stages respectively. The numerical results are given to illustrate the efficiency of the proposed method compared to the existing RKN methods.

Keywords: Improved Runge-Kutta Nystrom method, Two step method, Second-order ordinary differential equations, Order conditions

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 6789