• Title/Summary/Keyword: Newton methods

Search Result 252, Processing Time 0.026 seconds

DYNAMIC ANALYSIS AND DESIGN CALCULATION METHODS FOR POWERTRAIN MOUNTING SYSTEMS

  • Shangguan, W.B.;Zhao, Y.
    • International Journal of Automotive Technology
    • /
    • v.8 no.6
    • /
    • pp.731-744
    • /
    • 2007
  • A method for dynamic analysis and design calculation of a Powertrain Mounting System(PMS) including Hydraulic Engine Mounts(HEM) is developed with the aim of controlling powertrain motion and reducing low-frequency vibration in pitch and bounce modes. Here the pitch mode of the powertrain is defined as the mode rotating around the crankshaft of an engine for a transversely mounted powertrain. The powertrain is modeled as a rigid body connected to rigid ground by rubber mounts and/or HEMs. A mount is simplified as a three-dimensional spring with damping elements in its Local Coordinate System(LCS). The relation between force and displacement of each mount in its LCS is usually nonlinear and is simplified as piecewise linear in five ranges in this paper. An equation for estimating displacements of the powertrain center of gravity(C.G.) under static or quasi-static load is developed using Newton's second law, and an iterative algorithm is presented to calculate the displacements. Also an equation for analyzing the dynamic response of the powertrain under ground and engine shake excitations is derived using Newton's second law. Formulae for calculating reaction forces and displacements at each mount are presented. A generic PMS with four rubber mounts or two rubber mounts and two HEMs are used to validate the dynamic analysis and design calculation methods. Calculated displacements of the powertrain C.G. under static or quasi-static loads show that a powertrain motion can meet the displacement limits by properly selecting the stiffness and coordinates of the tuning points of each mount in its LCS using the calculation methods developed in this paper. Simulation results of the dynamic responses of a powertrain C.G. and the reaction forces at mounts demonstrate that resonance peaks can be reduced effectively with HEMs designed on the basis of the proposed methods.

Review on the Three-Dimensional Inversion of Magnetotelluric Date (MT 자료의 3차원 역산 개관)

  • Kim Hee Joon;Nam Myung Jin;Han Nuree;Choi Jihyang;Lee Tae Jong;Song Yoonho;Suh Jung Hee
    • Geophysics and Geophysical Exploration
    • /
    • v.7 no.3
    • /
    • pp.207-212
    • /
    • 2004
  • This article reviews recent developments in three-dimensional (3-D) magntotelluric (MT) imaging. The inversion of MT data is fundamentally ill-posed, and therefore the resultant solution is non-unique. A regularizing scheme must be involved to reduce the non-uniqueness while retaining certain a priori information in the solution. The standard approach to nonlinear inversion in geophysis has been the Gauss-Newton method, which solves a sequence of linearized inverse problems. When running to convergence, the algorithm minimizes an objective function over the space of models and in the sense produces an optimal solution of the inverse problem. The general usefulness of iterative, linearized inversion algorithms, however is greatly limited in 3-D MT applications by the requirement of computing the Jacobian(partial derivative, sensitivity) matrix of the forward problem. The difficulty may be relaxed using conjugate gradients(CG) methods. A linear CG technique is used to solve each step of Gauss-Newton iterations incompletely, while the method of nonlinear CG is applied directly to the minimization of the objective function. These CG techniques replace computation of jacobian matrix and solution of a large linear system with computations equivalent to only three forward problems per inversion iteration. Consequently, the algorithms are efficient in computational speed and memory requirement, making 3-D inversion feasible.

SOME OPTIMAL METHODS WITH EIGHTH-ORDER CONVERGENCE FOR THE SOLUTION OF NONLINEAR EQUATIONS

  • Kim, Weonbae;Chun, Changbum
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.29 no.4
    • /
    • pp.663-676
    • /
    • 2016
  • In this paper we propose a new family of eighth order optimal methods for solving nonlinear equations by using weight function methods. The methods of the family require three function and one derivative evaluations per step and has order of convergence eight, and so they are optimal in the sense of Kung-Traub hypothesis. Precise analysis of convergence is given. Some members of the family are compared with several existing methods to show their performance and as a result to confirm that our methods are as competitive as compared to them.

A primal-dual log barrier algorithm of interior point methods for linear programming (선형계획을 위한 내부점법의 원문제-쌍대문제 로그장벽법)

  • 정호원
    • Korean Management Science Review
    • /
    • v.11 no.3
    • /
    • pp.1-11
    • /
    • 1994
  • Recent advances in linear programming solution methodology have focused on interior point methods. This powerful new class of methods achieves significant reductions in computer time for large linear programs and solves problems significantly larger than previously possible. These methods can be examined from points of Fiacco and McCormick's barrier method, Lagrangian duality, Newton's method, and others. This study presents a primal-dual log barrier algorithm of interior point methods for linear programming. The primal-dual log barrier method is currently the most efficient and successful variant of interior point methods. This paper also addresses a Cholesky factorization method of symmetric positive definite matrices arising in interior point methods. A special structure of the matrices, called supernode, is exploited to use computational techniques such as direct addressing and loop-unrolling. Two dense matrix handling techniques are also presented to handle dense columns of the original matrix A. The two techniques may minimize storage requirement for factor matrix L and a smaller number of arithmetic operations in the matrix L computation.

  • PDF

Statistical Modeling of Learning Curves with Binary Response Data (이항 반응 자료에 대한 학습곡선의 모형화)

  • Lee, Seul-Ji;Park, Man-Sik
    • Communications for Statistical Applications and Methods
    • /
    • v.19 no.3
    • /
    • pp.433-450
    • /
    • 2012
  • As a worker performs a certain operation repeatedly, he tends to become familiar with the job and complete it in a very short time. That means that the efficiency is improved due to his accumulated knowledge, experience and skill in regards to the operation. Investing time in an output is reduced by repeating any operation. This phenomenon is referred to as the learning curve effect. A learning curve is a graphical representation of the changing rate of learning. According to previous literature, learning curve effects are determined by subjective pre-assigned factors. In this study, we propose a new statistical model to clarify the learning curve effect by means of a basic cumulative distribution function. This work mainly focuses on the statistical modeling of binary data. We employ the Newton-Raphson method for the estimation and Delta method for the construction of confidence intervals. We also perform a real data analysis.

On the Efficient Three-Dimensional Inversion of Static Shifted MT Data (정적효과를 포함한 자기지전류 자료의 효율적인 3차원 역산에 관하여)

  • Jang, Hannuree;Jang, Hangilro;Kim, Hee Joon
    • Geophysics and Geophysical Exploration
    • /
    • v.17 no.2
    • /
    • pp.95-103
    • /
    • 2014
  • This paper presents a practical inversion method for recovering a three-dimensional (3D) resistivity model and static shifts simultaneously. Although this method is based on a Gauss-Newton approach that requires a sensitivity matrix, the computer time can be greatly reduced by implementing a simple and effective procedure for updating the sensitivity matrix using the Broyden's algorithm. In this research, we examine the approximate inversion procedure and the weighting factor ${\beta}$ for static shifts through inversion experiments using synthetic MT data. In methods using the full sensitivity matrix constructed only once in the iteration process, a procedure using the full sensitivity in the earlier stage is useful to produce the smallest rms data misfit. The choice of ${\beta}$ is not critical below some threshold value. Synthetic examples demonstrate that the method proposed in this paper is effective in reconstructing a 3D resistivity structure from static-shifted MT data.

A LOCAL-GLOBAL STEPSIZE CONTROL FOR MULTISTEP METHODS APPLIED TO SEMI-EXPLICIT INDEX 1 DIFFERENTIAL-ALGEBRAIC EUATIONS

  • Kulikov, G.Yu;Shindin, S.K.
    • Journal of applied mathematics & informatics
    • /
    • v.6 no.3
    • /
    • pp.697-726
    • /
    • 1999
  • In this paper we develop a now procedure to control stepsize for linear multistep methods applied to semi-explicit index 1 differential-algebraic equations. in contrast to the standard approach the error control mechanism presented here is based on monitoring and contolling both the local and global errors of multistep formulas. As a result such methods with the local-global stepsize control solve differential-algebraic equation with any prescribed accuracy (up to round-off errors). For implicit multistep methods we give the minimum number of both full and modified Newton iterations allowing the iterative approxima-tions to be correctly used in the procedure of the local-global stepsize control. We also discuss validity of simple iterations for high accuracy solving differential-algebraic equations. Numerical tests support the the-oretical results of the paper.

Fraud Detection in E-Commerce

  • Alqethami, Sara;Almutanni, Badriah;AlGhamdi, Manal
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.6
    • /
    • pp.200-206
    • /
    • 2021
  • Fraud in e-commerce transaction increased in the last decade especially with the increasing number of online stores and the lockdown that forced more people to pay for services and groceries online using their credit card. Several machine learning methods were proposed to detect fraudulent transaction. Neural networks showed promising results, but it has some few drawbacks that can be overcome using optimization methods. There are two categories of learning optimization methods, first-order methods which utilizes gradient information to construct the next training iteration whereas, and second-order methods which derivatives use Hessian to calculate the iteration based on the optimization trajectory. There also some training refinements procedures that aims to potentially enhance the original accuracy while possibly reduce the model size. This paper investigate the performance of several NN models in detecting fraud in e-commerce transaction. The backpropagation model which is classified as first learning algorithm achieved the best accuracy 96% among all the models.

A novel approach to the classification of ultrasonic NDE signals using the Expectation Maximization(EM) and Least Mean Square(LMS) algorithms (Expectation Maximization (EM)과 Least Mean Square(LMS) algorithm을 이용하여 초음파 비파괴검사 신호의 분류를 하기 위한 새로운 접근법)

  • Daewon Kim
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.4 no.1
    • /
    • pp.15-26
    • /
    • 2003
  • Ultrasonic inspection methods are widely used for detecting flaws in materials. The signal analysis step plays a crucial part in the data interpretation process. A number of signal processing methods have been proposed to classify ultrasonic flaw signals. One of the more popular methods involves the extraction of an appropriate set of features followed by the use of a neural network for the classification of the signals in the feature space. This paper describes an alternative approach which uses the least mean square (LMS) method and expectation maximization (EM) algorithm with the model based deconvolution which is employed for classifying nondestructive evaluation (NDE) signals from steam generator tubes in a nuclear power plant. The signals due to cracks and deposits are not significantly different. These signals must be discriminated to prevent from happening a huge disaster such as contamination of water or explosion. A model based deconvolution has been described to facilitate comparison of classification results. The method uses the space alternating generalized expectation maximization (SAGE) algorithm In conjunction with the Newton-Raphson method which uses the Hessian parameter resulting in fast convergence to estimate the time of flight and the distance between the tube wall and the ultrasonic sensor Results using these schemes for the classification of ultrasonic signals from cracks and deposits within steam generator tubes are presented and showed a reasonable performances.

  • PDF

Classification of Ultrasonic NDE Signals Using the Expectation Maximization (EM) and Least Mean Square (LMS) Algorithms (최대 추정 기법과 최소 평균 자승 알고리즘을 이용한 초음파 비파괴검사 신호 분류법)

  • Kim, Dae-Won
    • Journal of the Korean Society for Nondestructive Testing
    • /
    • v.25 no.1
    • /
    • pp.27-35
    • /
    • 2005
  • Ultrasonic inspection methods are widely used for detecting flaws in materials. The signal analysis step plays a crucial part in the data interpretation process. A number of signal processing methods have been proposed to classify ultrasonic flaw signals. One of the more popular methods involves the extraction of an appropriate set of features followed by the use of a neural network for the classification of the signals in the feature spare. This paper describes an alternative approach which uses the least mean square (LMS) method and exportation maximization (EM) algorithm with the model based deconvolution which is employed for classifying nondestructive evaluation (NDE) signals from steam generator tubes in a nuclear power plant. The signals due to cracks and deposits are not significantly different. These signals must be discriminated to prevent from happening a huge disaster such as contamination of water or explosion. A model based deconvolution has been described to facilitate comparison of classification results. The method uses the space alternating generalized expectation maximiBation (SAGE) algorithm ill conjunction with the Newton-Raphson method which uses the Hessian parameter resulting in fast convergence to estimate the time of flight and the distance between the tube wall and the ultrasonic sensor. Results using these schemes for the classification of ultrasonic signals from cracks and deposits within steam generator tubes are presented and showed a reasonable performances.