35 YEARS OF ADVANCEMENTS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD

Size: px
Start display at page:

Download "35 YEARS OF ADVANCEMENTS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD"

Transcription

1 N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) 3 35 YEARS OF ADVANCEMENTS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD Noah J. DeMoes, Gabriel T. Ba, Bryce D. Wilkis, Theodore V. Hromadka II, & Rady Boucher Departmet of Mathematical Scieces, Uited States Military Academy, Uited States ABSTRACT The Complex Variable Boudary Elemet Method, or CVBEM, was first published i Joural of Numerical Methods i Egieerig i year 984 by authors Hromadka ad Guymo []. Sice that time, several papers ad books have bee published that preset various aspects of the umerical techique as well as advaces i the computatioal method such as extesio to three or higher dimesios for arbitrary geometries, ohomogeeous domais, extesio to use of a Hilbert Space settig as well as collocatio methods, iclusio of the time derivative via couplig to geeralized Fourier series techiques, examiatio of various families of basis fuctios icludig complex moomials, the product of complex polyomials with complex logarithm fuctios (i.e., the usual CVBEM basis fuctios), Lauret series expasios, reciprocal of complex moomials, other complex variable aalytic fuctios icludig expoetial ad others, as well as liear combiatios of these families. Other topics studied ad developed iclude rotatio of complex logarithm brach-cuts for extesio of the problem computatioal domai to the exterior of the problem geometry, depictio of computatioal error i achievig problem boudary coditios by meas of the approximate boudary techique, mixed boudary value problems, flow et developmet ad visualizatio, display of flow field traectory vectors i two ad three dimesios for use i depictig streamlies ad flow paths, amog other topics. The CVBEM approach has also bee exteded to solvig partial differetial equatios such as Laplace s equatio, Poisso s equatio, usteady flow equatio, ad the wave equatio, amog other formulatios that iclude sources, siks ad combiatios of these equatios with mixed boudary coditios. I the curret paper, a detailed examiatio is made of the performace betwee four families of basis fuctios i order to assess computatioal efficiecy i problem solvig of two dimesioal potetial problems i a high aspect ratio geometric problem domai. Two selected problems are preseted as case studies to demostrate the differet levels of success by each of the four families of examied basis fuctios. All four families ivolve basis fuctios that solve the goverig partial differetial equatio, leavig oly the goodess of fit i matchig boudary coditios of the boudary value problem as the computatioal optimizatio goal. The modelig techique is implemeted i computer programs Mathematica ad MATLAB. Recommedatios are made for future research directios ad lessos leared from the curret study effort. Keywords: complex variables, complex variable boudary elemet method, CV BEM, basis fuctios, ideal fluid flow, Laplace s equatio. INTRODUCTION The Complex Variable Boudary Elemet Method (CVBEM) has bee the subect of umerous publicatios icludig papers ad books [ ]. The approximatio approach solves several partial differetial equatios (PDE) of high iterest to practitioers ad developers i various aspects of egieerig ad computatioal mathematics. The modelig approach fids good use i potetial flow problems, icludig heat, groudwater, diffusio ad may other problems ad applicatios of high iterest i sciece, techology, egieerig, ad mathematics related topics. Most recetly, the CVBEM has bee exteded ito three or higher spatial dimesios for arbitrary geometric spatial domais [4], ad has bee applied to usteady flow problems [8], ad also problems ivolvig the wave equatio []. The modelig approach to applyig the CVBEM to usteady flow problems ivolves determiatio of the steady state coditio ad the reformulatig the usteady flow PDE ito 08 WIT Press, ISSN: (paper format), ISSN: (olie), DOI: 0.495/CMEM-V0-N0--3

2 N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) two portios ivolvig the steady state portio ad the usteady flow portio. Uder this scheme, the usteady portio problem defiitio ivolves homogeeous boudary coditios, whereas the steady state portio problem defiitio ivolves the origial problem boudary coditios. The usteady portio is the solved by use of geeralized Fourier series, ad the steady state portio that icludes the o-homogeeous boudary coditios, is solved by the CVBEM (or other Laplace s equatio solver). The total solutio is simply the sum of the solutios to the two problem portios idetified i the above. The geeralized Fourier series approach eables solutio of a wide class of PDE give the homogeeous boudary coditios afforded by the CVBEM solutio to the steady state portio of the problem. For example, a Poisso s equatio problem with a costat load value of - is ofte used i the modelig of torsio problems. Similarly, the wave equatio is solved by the Fourier series approach. Sice the itroductio of the CVBEM i the Joural of Numerical Methods i Egieerig [], CVBEM techology has advaced over the last 35 years. The CVBEM techological advacemets are briefly reviewed i this paper. The two-dimesioal (D) case is examied, although extesio to high dimesios follows [4]. The, focusig o the steady state portio of the PDE problem settig, the solutio of the steady state portio of the PDE problem settig is examied i detail regardig the computatioal efficiecy of differet basis fuctio families used i the CVBEM approach. The basis fuctio families examied i the curret paper are:. Complex Moomials, of the form (z z ).. Products of complex liear moomials with complex atural logarithm fuctios (with rotated brach cuts), of the form, (z z )l(z z ). 3. Liear complex poles (iverse factors of the form, z z, for several sigularity poits z, located exterior of the problem domai Lauret series, of the form, = ( z z ). Other complex aalytic fuctios may be used as alterative basis fuctio families, as ca liear combiatio or other combiatios of the basis fuctios that preserve the aalytic defiitio of the overall CVBEM approximatio fuctio. Demostratio of basis fuctio family computatioal efficiecy is provided by examiatio of potetial problems with respect to a high aspect ratio spatial domais located i the first quadrat of the complex plae. The motivatio for usig complex aalytic fuctios i the approximatio approach icludes the well-kow properties of aalytic fuctios. The aalytic fuctio ivolves two D real values fuctios that each solve Laplace s equatio. Furthermore, these two real fuctios are cougates which meas that plots of isocotours of both fuctios result i the well-kow flow et depictio of isopotetials ad stream lies. These two real fuctios are called the real ad imagiary compoets of the aalytic fuctio. Ad, these two compoets are related to each other by the Cauchy-Riema equatios, eablig both compoet fuctios to be examied give the other compoet fuctio. Boudary coditios of the Dirichlet or flux type or eve mixed types are all readily accommodated. Further details of the CVBEM are provided i the book, Foudatios of the Complex Variable Boudary Elemet Method [4].

3 N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) 3 The CVBEM ca be viewed as aother geeralized Fourier series that ca be coupled to the usual Fourier series. I the curret paper, the CVBEM approximatio fuctio is used to solve Laplace s equatio (for example, the steady state portio of the trasport equatio) over the arbitrary geometric domai ad with arbitrary but fixed boudary coditios. The usual Fourier series is used to solve the usteady compoet of the goverig PDE with homogeeous boudary coditios. Because of the use of the usual Fourier series, the geometric domais curretly are limited to -dimesioal bricks i order for the Fourier series elemet fuctios to satisfy the homogeeous boudary coditios. Load terms ivolvig sources ad siks are hadled as part of the steady state portio of the PDE. A derivatio ad detailed applicatio of the two-dimesioal usteady trasport modelig approach based upo the CVBEM (where, as described previously, the CVBEM is used to solve the steady state portio of the usteady flow problem, ad Fourier series is used to solve the homogeeous usteady portio of the trasport problem) is demostrated i the aalysis of a groudwater moud usteady flow problem [3, 4]. Although the refereced applicatio is focused upo a importat computatioal geoscieces problem, applicatio of the CVBEM approach to other computatioal topics is straight forward [4]. Review of the CVBEM The CVBEM is a aalytic method of solvig boudary value problems that differs from covetioal methods such as the fiite differece method (FDM) ad fiite elemet method (FEM) that require iterpolatio to determie a approximatio for the potetial fuctio. The CVBEM produces a cotiuous fuctio that approximates the solutio throughout the complete domai without the use of iterpolatio. The reaso the CVBEM does ot require iterpolatio is due to the method s reliace o aalytic basis fuctios to form the solutio approximatio. Because the basis fuctios are aalytic, the real ad imagiary parts satisfy the Laplace equatio. Because the basis fuctios are liear ad homogeeous, the priciple of superpositio states the summatio of the aalytic fuctios also satisfies the Laplace equatio that provides a stroger solutio to the boudary value problem. The real part of the CVBEM approximatio fuctio represets the potetial fuctio while the imagiary part represets the streamlies. The real ad imagiary parts of the approximatio fuctio are orthogoal to each other because the approximatio fuctio satisfies the Laplace equatio. The geeral CVBEM approximatio fuctio is wˆ( z) = cg () z () = where ŵ(z) represets the CVBEM approximatio for the potetial at locatio z, c represets the th complex coefficiet, ad g (z) represets the th fuctio i the set of complex basis fuctios chose to approximate the global trial fuctio, ad represets the umber of fuctios used to solve the global boudary value problem. I the followig, the four basis fuctio families cosidered i this paper will be examied. To solve the boudary value problem, the complex coefficiets must be foud. Each basis fuctio that is used i the summatio to approximate the potetial fuctio has a complex coefficiet, comprised of both a real ad imagiary part. Thus, there are degrees of freedom for each basis fuctio, ad degrees of freedom for the approximate solutio, where is the umber of basis fuctios. To determie all coefficiets there must be kow potetials, w(z), ad their

4 4 N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) correspodig locatios. To solve for the coefficiets, create the followig matrix equatio of the form Gc = w: g g g L g g g g L g g g g L g c c c M c 0 w w = w M w 0 () where G represets the value of each basis fuctio at z, c represets the vector of complex coefficiets, ad w represets the kow potetial values. Solve for the coefficiets by performig liear algebra operatios to row reduce the matrix to fid c. Oce the coefficiets are foud ad back substituted ito the CVBEM approximatio fuctio, the real part is used to approximate the potetials i the problem domai. I this paper, basis fuctio families are used without combiatio. However, aother optio for use i the approximatio approach is to use a liear combiatio of the various basis fuctio families. Additioally, other aalytic fuctios are available to use as basis fuctios such as the complex expoetial fuctio ad complex trigoometric fuctios (that are, i tur, related to the complex expoetial fuctios). Research ito the CVBEM appears to idicate that use of the basis fuctios developed by the umerical itegratio of the Cauchy itegral formula results i the most stable ad usable basis fuctios. 3 CVBEM Basis Fuctio Families Cosidered The geeral CVBEM fuctio is 3. Complex Moomials wz ˆ () cg () z (3) For this basis fuctio family, complex fuctios of the form (z z ) are used where coordiates z are expasio poits as utilized i the Taylor series for complex variable fuctios [5]. Expasio of these basis fuctios reduces to the simpler complex moomials of the form z, where as i the prior form, are positive iteger expoets. This formulatio is aother represetatio of the complex variable polyomial method or CPM, as examied i a umber of publicatios [6]. The CPM approximatio fuctio is wz ˆ () = c( z z ) (4) = 3. Numerical Itegratio of Cauchy Itegral Usig Polyomial Iterpolatio Fuctios (Stadard CVBEM Basis Fuctios) The more traditioal basis fuctio family is of the form (z z ) l (z z ) where poits z are CVBEM odes ad the l (z z ) is the complex atural logarithm fuctio defied

5 N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) 5 with its brach cut selected to lie exterior of the problem domai uio boudary. Although odal coordiates z typically are defied o the problem boudary [4], placig CVBEM odes to be located exterior of the problem domai uio boudary have also bee used with good computatioal results [7]. These basis fuctios result from the umerical itegratio of the Cauchy itegral formula where liear trial fuctios are used to iterpolate the complex fuctio betwee odes located o the problem boudary. Depedig o mathematical formulatio, differet umerical statemets ca result that all have i commo the basis fuctios as described above. The stadard CVBEM approximatio fuctio is wˆ ( z) = c ( z z )l ( z z ) (5) = 3.3 Complex Poles Aother basis family family examied are the traditioal complex variable poles of the form z z. The poits z are located o or the problem boudary or exterior of the problem domai uio boudary. Theoretical cosideratios ivolvig complex fuctio poles of higher orders are examied i stadard texts o complex variables [5]. The complex poles CVBEM approximatio fuctio is 3.4 Lauret Series wz ˆ () = c (6) z z = The fourth family of basis fuctios examied is the terms of the Lauret series ad are of the form, where are positive itegers ad z ( z z0 ) 0 is a fixed expasio locatio exterior to the problem domai ad usually also exterior to the problem boudary. The locatio of z 0 impacts the approximatio error. I the followig, z 0 = i because this value reduced the approximatio error sigificatly compared to other locatios such as 40 40i or 0 + 0i. Several Lauret series ca be examied together, meldig together some of the advatages of the complex fuctio poles basis fuctios. However, z 0 must be located outside the problem domai to eable the basis fuctio to be completely aalytic o the problem domai. The theoretical exploratio of the Lauret series ca be foud i other books [5]. The Lauret series CVBEM approximatio fuctio is wz ˆ () = c ( ) = z z0 (7) 3.5 Mixed Basis Fuctio Approximatios ad other Families of Basis Fuctios Aother optio for use i the approximatio approach is to use a liear combiatio of the various basis fuctios examied i the above. Additioally, other aalytic fuctios are

6 6 N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) available to use as basis fuctios such as the complex expoetial fuctio ad complex trigoometric fuctios (that are, i tur, related to the complex expoetial fuctios). Research ito the CVBEM appears to idicate that use of the basis fuctios developed by the umerical itegratio of the Cauchy itegral formula results i the most stable ad usable basis fuctios. 3.6 Example Problems I order to demostrate the utility ad efficiecy of the CVBEM ad the various basis fuctios cosidered i the above, two test problems are examied:. Heat trasfer i a two dimesioal rod.. Ideal fluid flow i a 90-degree bed. Both demostratios are cosidered i detail i Sectio 4. To determie the accuracy of the CVBEM usig differet basis fuctios, the exact solutio is compared to the CVBEM approximatio fuctio alog the ceter lie of the domai. The reaso the ceter lie is chose is twofold. The first reaso is because the ceter lie ecompasses the largest deviatio to the exact solutio due to the decrease i proximity to the boudary. The secod reaso is because the ceter lie is the most accurate depictio of the iterior which is the part of the domai that the CVBEM is desiged to model. The first problem tests the computatioal accuracy of the CVBEM agaist the FEM i high aspect ratio domais with simple boudary coditios. The secod example problem tests the effectiveess of differet basis fuctios as the boudary coditio complexity icreases i the high aspect ratio domai to determie if certai basis fuctios are more accurate for high aspect ratio domais. The last two example problems examie other features of the CVBEM, such as the iclusio of the time derivative as used i trasiet potetial flow problems or the wave equatio, amog other formulatios, as well as sources ad siks, ad cosideratios of three or higher spatial dimesios, are preseted i the refereced publicatios above. 4 Example Problem Domai Defiitio The problem domai is a two-dimesioal spatial rectagle of high aspect ratio. The stadard domai has top ad bottom boudaries of legth 0 ad the left ad right boudaries of legth. All example problem places the problem domai etirely i the first quadrat. The stadard problem domai is depicted i Fig. where the boudary coditios are represeted as u, for the th test problem. Figure : Stadard problem domai for both test problem.

7 N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) 7 5 Test Problem : Heat Trasfer i a Oe Dimesioal Rod 5. Descriptio of Test Problem - Numerical Solutios ad Assessmets Heat trasfer is oe of the may applicatios that Laplace s equatio ca model. Laplace s equatio is of the form u x + u = 0 (8) y ad is used i combiatio with the boudary coditios to solve for u (x, t), the approximate solutio to Test Problem. I this oe dimesioal rod, heat travels liearly through the rod o the top ad bottom edges of the rod for this problem while the temperatures o the left ad right boudary coditios are held at costat temperatures, 0 ad, respectively. The boudary coditios o the top ad bottom must equal the boudary coditios o the left ad right at each corer of the rod. The global boudary value problem boudary coditios satisfy these coditios are: x u(, y) = 0, u( x, ) = 0 0 x u(, y) =, u( x, ) = 0 0 (9) Because the legth is kow ad the boudary coditios are a fuctio of locatio ad legth all temperatures are kow alog the boudary. To solve for the temperatures o the iside of the rod, collocatio poits are chose at evely spaced locatios alog the boudaries ad the kow boudary temperatures are used to solve for the complex coefficiets i the approximatio fuctios. The followig sectios provide the results of the approximatio fuctios compared to the exact solutio alog the ceter lie of the domai. The ceter lie is used for accuracy aalysis withi the domai because that lie is furthest from either boudary, makig the ceter lie the lie i which approximatio error will be the greatest withi the boudary domai. Examiatio of the domai where the maximum error occurs provides clarity o the accuracy of the approximatio withi the etire domai because all other approximatio error withi the domai is less. The followig sectios display the results. 5. Compariso of CVBEM Basis Fuctios with Liear Boudary Coditios The CPM, CVBEM ad complex poles basis fuctio approximatio fuctio use = 3 collocatio poits to solve for the approximatio fuctios. The Lauret series uses = 7 istead of = 3 because = 7 provides a more approximate solutio. Figure ad 3 break up the four approximatio fuctios ito two groups of two plotted agaist the exact solutio. I Fig., the exact solutio of the problem which is kow because test problem s boudary coditios are cotiuous throughout the problem domai is plotted agaist the CPM ad CVBEM approximatio method. There appears to be o sigificat error betwee the CPM ad CVBEM approximatios ad the exact solutio. The same coclusio is made about the Lauret series approximatio ad the complex poles basis fuctio approximatio i Fig. 3.

8 8 N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) Figure : CPM ad CVBEM vs exact. Figure 3: Lauret ad complex poles vs exact. Computatioal error aalysis is depicted i Figs For this paper computatio error is defied as f( x, y) u ( xy, ) CE = f( x, y) where CE is computatioal error, f(x, y) is the exact solutio, ad u (x, y) is the type of basis fuctio approximatio. Figure 4 shows the amout of computatioal error for the etire legth of the domai o the ceter lie for the CPM ad CVBEM approximatio. Figure 5 provides the same iformatio for the Lauret ad complex poles basis fuctio approximatios. The CPM, CVBEM, ad complex poles basis fuctio approximatio all produce better approximatios for the boudary value problem tha the Lauret series approximatio. Each (0) Figure 4: CPM ad CVBEM error

9 N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) 9 Figure 5: Lauret ad complex poles Error. type of basis fuctio acts differetly. Thus, some basis fuctios are more suitable for specific types of modelig problems tha other basis fuctios. Additioally, the figures above depict the error alog the ceter lie. This error distributio is i lie with the Mi/Max Modulus Theorem. Because the max error occurs alog the boudary, examiatio of the error alog the boudary is oly ecessary, reducig computatioal cost. 6 Test Problem : Fluid Flow i a 90-Degree Bed Ideal fluid flow i a 90-Degree Bed ca be modeled by the fuctio f(z) = z. The real part of f(z), x y represets the isopotetial values. Because fluid flow potetials are depedet o locatio, the boudary coditios o all four sides of the domai are of the same form, x y. The domai i this problem is iitially set to a :0 ratio. Sectio 6., depicts the accuracy of the four basis fuctio approximatios to the exact solutio alog the ceter lie. The same boudary coditios are applied to two other high aspect ratio domais or ratios :5 ad :50 to determie the maximum absolute error for each approximatio compared to the error of the FEM discrete approximatio. 6. Descriptio of Test Problem - Numerical Solutios ad Assessmets Similar to Test Problem, Laplace s equatio u x + u = 0 () y is the goverig PDE that must be solved to create a approximatio for test problem. The global boudary value problem boudary coditios are give by: u (, y) = x y, u (, y) = x y, u ( x, ) = x y, u ( x, ) = x y. () 6. Compariso of CVBEM Basis Fuctio Performace Figure 6 shows the compariso of the two most accurate basis fuctio approximatios plotted agaist the exact solutio, x y. Ocular aalysis determies o sigificat differece betwee the exact solutio ad the approximatio solutios for the CPM ad CVBEM basis fuctios. Similarly Fig. 7 depicts the Lauret series ad Complex Poles approximatio

10 0 N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) Figure 6: CPM ad CVBEM vs exact. Figure 7: Lauret ad complex poles vs exact. fuctio with = 7 collocatio poits ad = 3 collocatio poits, respectively. The reaso that the Lauret series used 7 collocatio poits istead of = 3 like the other three basis fuctios is do to the icreased error whe icreases for the Lauret Series. This is due to the computers ability to hadle the ill-coditioed matrix caused by the ature of the basis fuctio. Figures 8 ad 9 depict the error, defied to be the differece betwee the exact solutio ad the approximate solutio o the ceter lie, for each approximatio fuctio. The ceter lie is defied to be the the lie bisectig the problem domai at y =.5. The error is sigificatly less for the CPM tha for ay other basis fuctio approximatio. The reaso for this is that the problem that is beig modeled u (x, y) = x y is a part of the basis fuctio family that makes up the CPM approximatio. Thus, the exact solutio is cotaied i the CPM approximatio, resultig i zero error. This would ot occur i a applicatio problem, but is importat to uderstad. Figure 8: CPM ad CVBEM error.

11 N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) Figure 9: Lauret ad complex poles error. 6.3 Error Compariso for Differet Domai Ratio Additioal aalysis o the impact domai ratio has o the accuracy of the CVBEM resulted i testig three differet domai ratios across the four basis fuctio families used i the CVBEM, complex moomials, traditioal CVBEM, complex poles, ad Lauret series usig = 8 collocatio poits. The maximum computatioal error of each approximatio is compared to the computatioal error of the FEM that uses a step size of 0.. The error aalysis is coducted o Test Problem. The results are listed i Table. The error data reveals that the higher the domai ratio, the greater the error for each. While the CPM ad complex poles basis fuctio family error decrease sigificatly, the CVBEM appears to maitai its validity with limited chage i error. Additioally, the Lauret series basis family produces the most iaccurate model. However, the FEM is the most accurate method of modelig BVPs i high aspect ratio domais out of the basis fuctio families tested. There are two reasos for why the FEM produced a better approximatio for this problem. The computer ad software used to create our approximatio fuctio fails to accurately solve for the ill-coditioed matrix that is created whe solvig for the coefficiets. As a result, the complex approximatio fuctios are limited to = 8 basis fuctios. If the program ad computatioal ability icreased ad the umber of basis fuctios icreased there would be higher accuracy i the complex approximatio fuctios that may be greater tha the FEM. The secod effect of havig limited to 8 is that there is a greater gap betwee each of the collocatio poits alog the problem domai. This results i greater ambiguity i the approximatio fuctio as the space betwee kow potetial values icreases with a greater aspect ratio. Although these coclusios are true, ode cout is ot totally idicative of modelig performace because the positioig of the model odes ad collocatio poits ca have Table : Display of error for differet basis families. Maximum Relative Error o the Boudary =8 Domai Ratio CPM CVBEM Complex poles Lauret FEM :0.03x0-6.8x x0-3.4x x0-3 :5.743x x x0-0.94x x0 - : x x x0-0.5x x0-0

12 N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) cosiderable ifluece o computatioal results. Curret research shows that similar computatioal error may be achieved with fewer odes ad collocatio poits by careful positioig of the odes ad collocatio poits. 7 Coclusios ad Recommedatios for Future Research The Complex Variable Boudary Elemet Method has the capability to use differet basis fuctios as the aalytic fuctios to approximate the potetial fuctio. I this paper, error for each basis fuctio was examied as the domai ratio decreases. The reaso for the icrease i error occurs because of the limitatios i computig power. The computers used i these tests were oly able to use up to = 8 collocatio poits. Thus, as the domai stretches with higher aspect ratios, the distace betwee each collocatio poit icreases, icreasig the probability that the approximate solutio estimates a icorrect potetial value. Although error icreased for each basis fuctio family that was tested, the traditioal CVBEM model with basis fuctios of the form (z z ) l (z z ) decreased i accuracy the slowest as the domai ratio icreased; therefore, the traditioal CVBEM holds its accuracy the best i problems with high aspect ratios. I Table, the CVBEM demostrated that the error decreased betwee the ratios of : ad :0 before icreasig for higher domai ratios. Future research icludes determiig the domai ratio that optimizes accuracy for each basis fuctio ad the specific boudary coditios. Oce the basis fuctio is paired with the domai ratio that optimizes CVBEM performace, the research ca be exteded to applyig the basis fuctio family to 3 dimesioal domais with the same high aspect ratio. Refereces [] Hromadka, T.V. & Guymo, G.L., Numerical aalysis of ormal stress i o- Newtoia boudary layer flow. Joural of Numerical Methods i Egieerig, 0(), pp. 5 37, 984. [] Hromadka, T.V. & Lai, C., The Complex Variable Boudary Elemet Method. Spriger- Verlag: New York, 984. [3] Hromadka, T.V. & Whitley, R.J., Approximatig three-dimesioal steady state potetial flow problems usig two-dimesioal complex polyomials. Egieerig Aalysis with Boudary Elemets, 9, pp , [4] Hromadka, T.V. & Whitley, R.J., Foudatios of the Complex Variable Boudary Elemet Method. Spriger: New York, 04. [5] Hromadka, T.V. & Whitley, R.J., A ew formulatio for developig CVBEM approximatio fuctios. Egieerig Aalysis with Boudary Elemets, 9(), 39 4, [6] Dumar, P. & Kumar, R., Complex variable boudary elemet method for torsio i aisotropic bars. Applied Mathematical Modelig, 7(), pp , [7] Hromadka, T.V. & Whitley, R., Advaces i the Complex Variable Boudary Elemet Method. Spriger-Verlag: New York, 998.

13 N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) 3 [8] Wilkis, B.D., Greeberg, J., Redmod, B., Baily, A., Flowerday, N., Kratch, A., Hromadka, T.V., Boucher, R., McIvale, H.D. & Horto, S., A usteady two dimesioal complex variable boudary elemet method. Applied Mathematics, 8(6), pp , [9] Hromadka, T.V., A Multi-Dimesioal Complex Variable Boudary Elemet Method. WIT Press: Southampto, Eglad, 00. [0] Hromadka, T.V. & Lai, C., The Complex Variable Boudary Elemet Method i Egieerig Aalysis. Spriger-Verlag: New York, First prit 987, Republished Digitally, 0. [] Hromadka, T.V., Isehour, M., Rao, P., Ye, C.C. & Crow, M., Computatioal biopsy to assess accuracy of large scale computatioal groudwater flow models. Iteratioal Joural of Egieerig Scieces ad Maagemet, 7(), pp. 6, 07. [] Wilkis, B.D., Hromadka, T.V. & Boucher, R., A coceptual umerical model of the wave equatio usig the complex variable boudary elemet method. Scietific Research Publishig, 8(5), pp , [3] Wilkis, B.D., Flowerday, N., Kratch, A., Greeberg, J., Redmod, B., Hromadka, T.V., Hood, K., Boucher, R. & McIvale, H.D., A computatioal model of groudwater moud evolutio usig the complex variable boudary elemet method ad geeralized fourier series. The Professioal Geologist, 54(), pp. 5, 07. [4] Hood, K., Wilkis, B.D., Hromadka, T.V., Boucher, R. & McIvale, H.D., Developmet of a earthe dam break date base. The Professioal Geologist, 54(), 0, 07. [5] Matthews, J.H. & Howell, R.W., Complex Aalysis for Mathematics ad Egieerig. Times Mirror Compay: Iowa, 996. [6] Bohao, A.W. & Hromadka, T.V., The complex polyomial method with a leastsquares fit to boudary coditios. Egieerig Aalysis with Boudary Elemets, 33(8 9), pp. 00 0, [7] Bloor, C., Hromadka, T.V., Wilkis, B.D. & McIvale, H.D., Cvbem ad fvm computatioal model compariso for solvig ideal fluid flow i a 90-degree bed. Ope Joural of Fluid Dyamics, 6, pp , 06.

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

Data Structures and Algorithms. Analysis of Algorithms

Data Structures and Algorithms. Analysis of Algorithms Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information

Math 10C Long Range Plans

Math 10C Long Range Plans Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

Consider the following population data for the state of California. Year Population

Consider the following population data for the state of California. Year Population Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB

More information

South Slave Divisional Education Council. Math 10C

South Slave Divisional Education Council. Math 10C South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve

More information

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The

More information

1.2 Binomial Coefficients and Subsets

1.2 Binomial Coefficients and Subsets 1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting) MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give

More information

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation The Nature of Light Chapter Reflectio ad Refractio of Light Sectios: 5, 8 Problems: 6, 7, 4, 30, 34, 38 Particles of light are called photos Each photo has a particular eergy E = h ƒ h is Plack s costat

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

More information

ASSESSMENT OF COMPLEX VARIABLE BASIS FUNCTIONS IN THE APPROXIMATION OF IDEAL FLUID FLOW PROBLEMS

ASSESSMENT OF COMPLEX VARIABLE BASIS FUNCTIONS IN THE APPROXIMATION OF IDEAL FLUID FLOW PROBLEMS B. D. Wilkins, et al. Int. J. Comp. Meth. and Exp. Meas., Vol. 7, No. 1 (2019) 45 56 ASSESSMENT OF COMPLEX VARIABLE BASIS FUNCTIONS IN THE APPROXIMATION OF IDEAL FLUID FLOW PROBLEMS BRYCE D. WILKINS, T.V.

More information

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More information

Appendix A. Use of Operators in ARPS

Appendix A. Use of Operators in ARPS A Appedix A. Use of Operators i ARPS The methodology for solvig the equatios of hydrodyamics i either differetial or itegral form usig grid-poit techiques (fiite differece, fiite volume, fiite elemet)

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite

More information

How do we evaluate algorithms?

How do we evaluate algorithms? F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:

More information

MODELING MIXED BOUNDARY PROBLEMS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD (CVBEM) USING MATLAB AND MATHEMATICA

MODELING MIXED BOUNDARY PROBLEMS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD (CVBEM) USING MATLAB AND MATHEMATICA A. N. Johnson et al., Int. J. Comp. Meth. and Exp. Meas., Vol. 3, No. 3 (2015) 269 278 MODELING MIXED BOUNDARY PROBLEMS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD (CVBEM) USING MATLAB AND MATHEMATICA

More information

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute

More information

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

Solving Fuzzy Assignment Problem Using Fourier Elimination Method Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio

More information

Lecture 18. Optimization in n dimensions

Lecture 18. Optimization in n dimensions Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Force Network Analysis using Complementary Energy

Force Network Analysis using Complementary Energy orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,

More information

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

Second-Order Domain Decomposition Method for Three-Dimensional Hyperbolic Problems

Second-Order Domain Decomposition Method for Three-Dimensional Hyperbolic Problems Iteratioal Mathematical Forum, Vol. 8, 013, o. 7, 311-317 Secod-Order Domai Decompositio Method for Three-Dimesioal Hyperbolic Problems Youbae Ju Departmet of Applied Mathematics Kumoh Natioal Istitute

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms

More information

Descriptive Statistics Summary Lists

Descriptive Statistics Summary Lists Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College

More information

Data diverse software fault tolerance techniques

Data diverse software fault tolerance techniques Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the

More information

Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design

Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of

More information

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8) CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig

More information

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued

More information

Optimal Mapped Mesh on the Circle

Optimal Mapped Mesh on the Circle Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful

More information

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4 1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

Intro to Scientific Computing: Solutions

Intro to Scientific Computing: Solutions Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile

More information

New HSL Distance Based Colour Clustering Algorithm

New HSL Distance Based Colour Clustering Algorithm The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics

More information

Visualization of Gauss-Bonnet Theorem

Visualization of Gauss-Bonnet Theorem Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are

More information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical

More information

Service Oriented Enterprise Architecture and Service Oriented Enterprise

Service Oriented Enterprise Architecture and Service Oriented Enterprise Approved for Public Release Distributio Ulimited Case Number: 09-2786 The 23 rd Ope Group Eterprise Practitioers Coferece Service Orieted Eterprise ad Service Orieted Eterprise Ya Zhao, PhD Pricipal, MITRE

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu

More information

2D Isogeometric Shape Optimization considering both control point positions and weights as design variables

2D Isogeometric Shape Optimization considering both control point positions and weights as design variables 1 th World Cogress o tructural ad Multidiscipliary Optimizatio May 19-24, 213, Orlado, Florida, UA 2D Isogeometric hape Optimizatio cosiderig both cotrol poit positios ad weights as desig variables Yeo-Ul

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

Panel for Adobe Premiere Pro CC Partner Solution

Panel for Adobe Premiere Pro CC Partner Solution Pael for Adobe Premiere Pro CC Itegratio for more efficiecy The makes video editig simple, fast ad coveiet. The itegrated pael gives users immediate access to all medialoopster features iside Adobe Premiere

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

An Investigation of Radial Basis Function-Finite Difference (RBF-FD) Method for Numerical Solution of Elliptic Partial Differential Equations

An Investigation of Radial Basis Function-Finite Difference (RBF-FD) Method for Numerical Solution of Elliptic Partial Differential Equations mathematics Article A Ivestigatio of Radial Basis Fuctio-Fiite Differece (RBF-FD) Method for Numerical Solutio of Elliptic Partial Differetial Equatios Surao Yesiri 1 ID ad Ruth J. Skulkhu 1,2, * ID 1

More information

A General Framework for Accurate Statistical Timing Analysis Considering Correlations

A General Framework for Accurate Statistical Timing Analysis Considering Correlations A Geeral Framework for Accurate Statistical Timig Aalysis Cosiderig Correlatios 7.4 Vishal Khadelwal Departmet of ECE Uiversity of Marylad-College Park vishalk@glue.umd.edu Akur Srivastava Departmet of

More information

Normals. In OpenGL the normal vector is part of the state Set by glnormal*()

Normals. In OpenGL the normal vector is part of the state Set by glnormal*() Ray Tracig 1 Normals OpeG the ormal vector is part of the state Set by glnormal*() -glnormal3f(x, y, z); -glnormal3fv(p); Usually we wat to set the ormal to have uit legth so cosie calculatios are correct

More information

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved. Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:

More information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi

More information

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD) FINIT DIFFRNC TIM DOMAIN MTOD (FDTD) The FDTD method, proposed b Yee, 1966, is aother umerical method, used widel for the solutio of M problems. It is used to solve ope-regio scatterig, radiatio, diffusio,

More information

EVALUATION OF TRIGONOMETRIC FUNCTIONS

EVALUATION OF TRIGONOMETRIC FUNCTIONS EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special

More information

Image Segmentation EEE 508

Image Segmentation EEE 508 Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms for Disk Covering Problems with the Most Points Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi

More information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters. SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that

More information

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis

More information

BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM

BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM Staislav Shidlovskiy 1, 1 Natioal Research

More information

Parabolic Path to a Best Best-Fit Line:

Parabolic Path to a Best Best-Fit Line: Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be

More information

A Note on Least-norm Solution of Global WireWarping

A Note on Least-norm Solution of Global WireWarping A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract

More information

It just came to me that I 8.2 GRAPHS AND CONVERGENCE

It just came to me that I 8.2 GRAPHS AND CONVERGENCE 44 Chapter 8 Discrete Mathematics: Fuctios o the Set of Natural Numbers (a) Take several odd, positive itegers for a ad write out eough terms of the 3N sequece to reach a repeatig loop (b) Show that ot

More information

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted

More information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

Computer Systems - HS

Computer Systems - HS What have we leared so far? Computer Systems High Level ENGG1203 2d Semester, 2017-18 Applicatios Sigals Systems & Cotrol Systems Computer & Embedded Systems Digital Logic Combiatioal Logic Sequetial Logic

More information

Higher-order iterative methods free from second derivative for solving nonlinear equations

Higher-order iterative methods free from second derivative for solving nonlinear equations Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order

More information

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order

More information

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS

Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS 28 Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS Tolerace sythesis deals with the allocatio of tolerace values to various dimesios of idividual compoets

More information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic Programming and Curve Fitting Based Road Boundary Detection Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk

More information

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION 397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio

More information

Freeform Optimization: A New Capability to Perform Grid by Grid Shape Optimization of Structures

Freeform Optimization: A New Capability to Perform Grid by Grid Shape Optimization of Structures 6 th Chia-Japa-Korea Joit Symposium o Optimizatio of Structural ad Mechaical Systems Jue 22-25, 200, Kyoto, Japa Freeform Optimizatio: A New Capability to Perform Grid by Grid Shape Optimizatio of Structures

More information

Section 7.2: Direction Fields and Euler s Methods

Section 7.2: Direction Fields and Euler s Methods Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will

More information

BAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini

BAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini Proceedig of Iteratioal Coferece O Research, Implemetatio Ad Educatio Of Mathematics Ad Scieces 014, Yogyakarta State Uiversity, 18-0 May 014 BAYESIAN WIH FULL CONDIIONAL POSERIOR DISRIBUION APPROACH FOR

More information

ANN WHICH COVERS MLP AND RBF

ANN WHICH COVERS MLP AND RBF ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi

More information