A simple piecewise cubic spline method for approximation of highly nonlinear data

Similar documents
Modeling Local Uncertainty accounting for Uncertainty in the Data

Numerical Solution of Deformation Equations. in Homotopy Analysis Method

Optimizing of Fuzzy C-Means Clustering Algorithm Using GA

An Improved Isogeometric Analysis Using the Lagrange Multiplier Method

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

NURBS curve method Taylor's launch type of interpolation arithmetic Wan-Jun Zhang1,2,3,a, Shan-Ping Gao1,b Xi-Yan Cheng 1,c &Feng Zhang2,d

On-line Scheduling Algorithm with Precedence Constraint in Embeded Real-time System

User Behavior Recognition based on Clustering for the Smart Home

Boundary layer and mesh refinement effects on aerodynamic performances of horizontal axis wind turbine (HAWT)

Hybrid Method of Biomedical Image Segmentation

An Optimal Algorithm for Prufer Codes *

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Cluster Analysis of Electrical Behavior

A combined test for randomness of spatial distribution of composite microstructures

A NEW APPROACH FOR SOLVING LINEAR FUZZY FRACTIONAL TRANSPORTATION PROBLEM

S1 Note. Basis functions.

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

Scheduling with Integer Time Budgeting for Low-Power Optimization

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

SUPPLEMENTARY INFORMATION

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

Generating Fuzzy Term Sets for Software Project Attributes using and Real Coded Genetic Algorithms

Outline. Third Programming Project Two-Dimensional Arrays. Files You Can Download. Exercise 8 Linear Regression. General Regression

Introduction to Geometric

Human Face Recognition Using Radial Basis Function Neural Network

Load Balancing for Hex-Cell Interconnection Network

Study on Fuzzy Models of Wind Turbine Power Curve

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Classifier Selection Based on Data Complexity Measures *

Cubic Spline Interpolation for. Petroleum Engineering Data

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap

X- Chart Using ANOM Approach

Review of approximation techniques

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

Constrained Robust Model Predictive Control Based on Polyhedral Invariant Sets by Off-line Optimization

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Interactive NURBS Tutorial in Virtual Reality

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

THE PHYSICS 23 LAB BOOK 23 Lab 03: Conservation of Linear Momentum

A Comparative Study of Constraint-Handling Techniques in Evolutionary Constrained Multiobjective Optimization

Machine Learning: Algorithms and Applications

AN ADAPTIVE APPROACH TO THE SEGMENTATION OF DCE-MR IMAGES OF THE BREAST: COMPARISON WITH CLASSICAL THRESHOLDING ALGORITHMS

GSA Training Notes Raft and Piled-raft Analysis

AN ALGORITHM FOR ODD GRACEFULNESS OF THE TENSOR PRODUCT OF TWO LINE GRAPHS

GSLM Operations Research II Fall 13/14

Shape Preserving Positive and Convex Data Visualization using Rational Bi-cubic Functions

Aircraft Engine Gas Path Fault Diagnosis Based on Fuzzy Inference

Subdividing Barycentric Coordinates

Cracking of the Merkle Hellman Cryptosystem Using Genetic Algorithm

Restaurants Review Star Prediction for Yelp Dataset

Multiple Instance Learning via Multiple Kernel Learning *

Winter 2013 MIDTERM TEST #2 Wednesday, March 20 7:00pm to 8:15pm. Please do not write your U of C ID number on this cover page.

An inverse problem solution for post-processing of PIV data

Intra-Parametric Analysis of a Fuzzy MOLP

Report #1 Example. Semester

C I R E D 18 th International Conference on Electricity Distribution Turin, 6-9 June 2005 ABSTRACT

MECHANICAL ANALYSIS OF 2D-BRAZED JOINT USING A NEW HYBRID MAX- FEM MODEL

Evaluation of spatial heterogeneity of watershed through HRU concept using SWAT. Xuesong Zhang

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

Nonlocal Mumford-Shah Model for Image Segmentation

Generalized Spatial Kernel based Fuzzy C-Means Clustering Algorithm for Image Segmentation

A TRANSFORMATION METHOD FOR TEXTURE FEATURE DESCRIPTION UNDER DIFFERENT IMAGINE CONDITIONS

RELATIVE ORIENTATION ESTIMATION OF VIDEO STREAMS FROM A SINGLE PAN-TILT-ZOOM CAMERA. Commission I, WG I/5

Image Contrast Gain Control by Linear Neighbourhood Embedding

Heuristic Methods for Locating Emergency Facilities

Concurrent Apriori Data Mining Algorithms

Multicast Tree Rearrangement to Recover Node Failures. in Overlay Multicast Networks

A Simple and Efficient Goal Programming Model for Computing of Fuzzy Linear Regression Parameters with Considering Outliers

An Adaptive Hyperplane Approach for Multiple Objective Optimization Problems with Complex Constraints

Using BESO method to optimize the shape and reinforcement of the underground openings

y and the total sum of

Introduction. Leslie Lamports Time, Clocks & the Ordering of Events in a Distributed System. Overview. Introduction Concepts: Time

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Μέθοδος Πολυπλέγματoς (Multigrid)

CONCURRENT OPTIMIZATION OF MULTI RESPONCE QUALITY CHARACTERISTICS BASED ON TAGUCHI METHOD. Ümit Terzi*, Kasım Baynal

Parametric Study on Pile-Soil Interaction Analyses By Overlaying Mesh Method

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c

Dependability of the Explicit DMC Algorithm for a Rectification Process

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

OBJECT TRACKING BY ADAPTIVE MEAN SHIFT WITH KERNEL BASED CENTROID METHOD

A General Algorithm for Computing Distance Transforms in Linear Time

Comparative Study between different Eigenspace-based Approaches for Face Recognition

Small Baseline Stereo Matching Method based on Maximum Likelihood Estimation

EXTENDED FORMAL SPECIFICATIONS OF 3D SPATIAL DATA TYPES

A. General Type- Fzzy Clsterng There are two knds of type- fzzy sets whch are often sed n clsterng algorthms: 1) nterval and ) general. In nterval typ

Fuzzy C-Means Clustering For Content Based Image Retrieval System

An Efficient Fault-Tolerant Multi-Bus Data Scheduling Algorithm Based on Replication and Deallocation

Security Enhanced Dynamic ID based Remote User Authentication Scheme for Multi-Server Environments

TN348: Openlab Module - Colocalization

A New Approach For the Ranking of Fuzzy Sets With Different Heights

The Research of Support Vector Machine in Agricultural Data Classification

Reverse Engineering of the Digital Curve Outlines using Genetic Algorithm

On Reconstructing 3D Feature Boundaries

The Nottingham eprints service makes this work by researchers of the University of Nottingham available open access under the following conditions.

A Facet Generation Procedure. for solving 0/1 integer programs

ACTIVE SPECKLE PHOTOGRAPHY METHOD USING FOURIER TRANSFORM FOR MEASURING THE THICKNESS OF A TRANSPARENT PLATE

Face Recognition by Fusing Binary Edge Feature and Second-order Mutual Information

Hermite Splines in Lie Groups as Products of Geodesics

Using Gini-Index for Feature Selection in Text Categorization

Transcription:

Vol., No., 9 () http://d.do.org/./ns.. Natral Scence A sple pecewse cbc splne ethod for approaton of hghly nonlnear Mehd Zaan Cvl Engneerng Departent, Faclty of Techncal and Engneerng, Yaso Unversty, Yaso, Iran; ahd@al.y.ac.r Receved Septeber ; revsed October ; accepted October ABSTRACT Approaton ethods are sed n the analyss and predcton of, especally laboratory, n engneerng proects. These ethods are sally lnear and are obtaned by leastsqareerror approaches. There are any probles n whch lnear odels cannot be appled. Becase of that there are logarthc, eponental and polynoal crvefttng odels. These nonlnear odels have a lted applcaton n engneerng probles. The varaton of ost s sch that the nonlnearty cannot be approated by the above approaches. These ethods are also not applcable when there s a large aont of. For these reasons, a ethod of pecewse cbc splne approaton has been developed. The odel presented here s capable of followng the local nonnforty of n order to obtan a good ft of a crve to the. There s C contnty at the lts of the pecewse eleents. The odel s tested and eaned wth for probles here. The reslts show that the odel can approate hghly nonlnear effcently. Keywords: Slaton; Data analyss; Approaton; Cbc Splne; Optzaton; Crve Fttng. INTRODUCTION There are any cases n engneerng actvtes n whch one s confronted wth laboratory or feld. Sppose there are n pars of vales (, y ), where these vales are obtaned fro eperental, feld or statstcal analyss. The a s to fnd a fncton f() that predcts acceptable vales for the dependent varable y wth respect to the ndependent varable. There are always soe errors n the eperental analyss, and n the senstvty and calbraton of easrng nstrents, and therefore the vales of y are not eact. Also, soetes there est ltple vales for y for each vale of. In sch statons, f the crve of f() passes between and near to the ponts, t s ore accrate and soother than when t passes throgh all the ponts eactly. Ths, n those cases an approate analyss s ore stable for predctng and assgnng the y vales. If the crve governng f() were nstead to nterpolate sch, t wold have a snsodal or nsoothed zgzag for that wold not be acceptable and wold not be sable for analyss. Most of the pblcatons abot ths sbect are related anly to lnear or sple nonlnear odels []. Soe ore advanced ethods n ths feld are based on Bsplne and Bézer crves []. These ethods are sed ost for copter graphc. Becase of the wavness and the snsodal fors of ther crves, they are not applcable to engneerng probles.. FORMULATION Forlaton of Proble If the varaton of the follows a sple nonlnear crve, a sngle cbc splne fncton can be appled n the for of the followng eqaton: S abc d. () The paraeters a, b, c and d are obtaned by the ethod of leastsqareerror approaton fro the solton of the followng syste of eqatons: n y a n y b n c y d n y, () where n s the nber of pars of vales n the nterval [a, b]. In the case of the nonnfor varaton of that occrs n ost engneerng probles, a sngle cbc splne crve cannot be appled. Instead, t s nec Copyrght ScRes.

M. Zaan / Natral Scence () 9 essary to se pecewse cbc splne crves to approate sch. Sppose the dstrbton of s as n Fgre, for eaple. The doan of the proble s dvded nto n eleents. The nterval for the eleent s [, + ]. The cbc splne eqaton for ths eleent s S a b c d. () sbect to the constrants, At the edges of each eleent, C contnty ests: S S. () S S The paraeters a, b, c and d are obtaned fro Eqs. below, together wth the contnty condtons of Eq., by nzaton of the s of sqared errors (SSE):,, () SSE y Y y S n SSE y a b c d () d a b c d c a b c The nzaton of Eq. by the se of Lagrange ltplers and s epressed as follows: () n SSE y S d h a h b h c d c h a h b c To obtan the governng paraeters, the dervatves of Eq. are calclated so that, SSE SSE SSE SSE SSE SSE,,,,,. (9) a b c d The above eqatons are transfored to a lnear syste of eqatons for each eleent: y a b y c y d y h ahbc h ahbhcd S S S l S n λ λ λ λ l λ l+ λ n λ n λ n+ Fgre. Behavor of a dstrbton of nonnfor. Sn (). () The lnear syste of Eq. s a local syste, and all of these systes st be pt together to ake p a global lnear syste of eqatons wth denson n n. The paraeters for each splne fncton are calclated by solvng the global lnear syste. If there s a large nber of ponts, the denson of the governng lnear syste of eqatons ncreases drastcally and ts solton becoes teconsng. Therefore, n order to decrease the nber of calclaton operatons, we can apply the followng approach. If the contnty condtons of Eq. are nserted nto Eq., the followng eqaton reslts, S a b S S The vales of S and S () n the above Copyrght ScRes.

M. Zaan / Natral Scence () 9 eqaton can be calclated nercally, takng accont of the for of the varaton of the. Ths, the for paraeters of Eq. are redced to two. Ths decreases the nber of related calclaton operatons by a large aont. Then, by optzng the s of sqared errors, the paraeters a and b can be obtaned fro the followng eqaton: b a a f a a a a a a, () f n whch a a () a and Eq. (see the botto of the page). The bondary condtons for Eq. are s and s. For probles were selected for verfcaton and eanaton of the odel presented here.. PROBLEMS.. Proble Abot pars of vales, y were generated fro the followng eqaton, ln f sn ln r, () where r s a nfor rando nber between and. For splcty and to redce the nber of calclatons, two cbc splne eleents were sed. Fgre llstrates the dstrbton for the nterval [,]. As can be seen, there s a good relatonshp between the pecewse cbc splne crves and the set of. Therefore the odel that we have developed can satsfactorly approate ths set of... Proble Ths eaple conssted of pars of vales on the nterval [, ]. These were generated fro the followng eqaton:.. Nonnfor eleents were appled here becase of the coplety and heterogenety of the dstrbton. The locatons of the eleent bondares are lsted n Table. Fgre llstrates the dstrbton and the calclated pecewse splne crve. As can be observed fro the graph, there s a satsfactorly close relatonshp between the and the crve... Proble For ths proble, abot pars of vales were generated fro the followng eqaton [] on the nterval [,] wth nonnfor f e r. () Fgre. Coparson between real and odel. f() odel Fgre. Coparson between splne crves and real. Table. Characterstcs of the splne crve eleents.......... odel f() f S S y f S S y () Copyrght ScRes.

M. Zaan / Natral Scence () 9 f sn r. () The above eqaton s hghly nonlnear and ts varaton s heterogeneos. A cbc splne crve consstng of eght peces was developed for ths eaple, based on the characterstcs of the eleents lsted n Table. Fgre shows a coparson between the splne crve and the for ths test proble. The fgre shows that there s a very close sperposton between the odel and the governng... Proble Ths proble s n the feld of grondwater engneerng. Thes solton for the noneqlbr partal dfferental eqaton for nsteady radal flow fro confned aqfer to ppng well s: Q e h h d πt () Thes approated the above eqaton by the followng seres: Q h h.ln (9) πt.!.! The vale of brackets eqals W() well fncton. The for approaton have logarth vale of W() respect to logarth vale of [9]. A cbc splne crve consstng of fve peces was developed for ths proble, based on the characterstcs of the eleents lsted n Table. Fgre llstrates the dstrbton for the Table. Characterstcs of the splne crve eleents............9............... f() odel. Fgre. Coparson between real and odel. Table. Characterstcs of the splne crve eleents. 9 Well fncton W() 9 Fgre. Coparson between real and odel. W() nterval [, ]. Accordng to the graph, there s an acceptable close relatonshp between the and the cbc splne crve.. RESULTS AND CONCLUSIONS The odel presented above for the approaton of wth hghly nonlnear varaton can be appled effcently to varos engneerng probles. Becase the odel s forlaton s straghtforward and eplct, there s no need to establsh and solve any lnear syste of eqatons. Therefore; the nber of calclaton operatons related to the generaton of pecewse cbc crves s notceably less than that for other classcal ethods of approaton. I sggest that ths forlaton and odel cold be etended to twodensonal approaton analyss. For ths prpose, ore attenton st be pad to defnng the forlaton accrately, especally the satsfacton of the contnty condtons at the bondares between eleents or patches. REFERENCES [] De Boor, C. (9) A practcal gde to splnes. Sprnger Verlag, Berln,. do:./9 [] Conte, S.D. and De Boor, C. (9) Eleentary nercal analyss: An algorth approach. rd Edton, McGraw Hll, Ackland,. [] Lobo, N.A. (99) Crve fttng sng splne sectons of dfferent orders. Proceedngs of the st Internatonal Matheatca Sypos, Sothapton, Jly,. [] Zaan, M. (9) Three sple splne ethods for ap Copyrght ScRes.

M. Zaan / Natral Scence () 9 proaton and nterpolaton of. Conteporary Engneerng Scences Jornal,,. [] Lehann, T.M., Gonner, C. and Sptzer, K. () B splne nterpolaton n edcal age processng. IEEE Transactons on Medcal Iagng,,. do:.9/.99 [] Saloon, D. () Crves and srfaces for copter graphcs. Sprnger, Northrdge,. [] Zaan, M. (9) An nvestgaton of Bsplne and Bezer ethods for nterpolaton of. Conteporary Engneerng Scences Jornal,,. [] Brden, R.L. and Fars, J.D. (99) Nercal analyss. th Edton, PWSKent, Boston,. [9] Todd, D.K. (9) Grondwater hydrology. nd Edton, Wley, New York,. Copyrght ScRes.