SIMULTANEOUS AERODYNAMIC ANALYSIS AND DESIGN OPTIMIZATION (SAADO) FOR A 3-D RIGID WING
|
|
- Ralf Patterson
- 5 years ago
- Views:
Transcription
1 AIAA SIMULTANEOUS AERODYNAMIC ANALYSIS AND DESIGN OPTIMIZATION (SAADO) FOR A -D RIGID WING Clyde R. Gumbert Research Scentst Multdscplnary Optmzaton Branch NASA Langley Research Center Hampton, VA Gene J.-W. Hou Professor Department of Mechancal Engneerng Old Domnon Unversty, Norfolk, VA Member AIAA Perry A. Newman Senor Research Scentst Multdscplnary Optmzaton Branch NASA Langley Research Center Hampton, VA Abstract The formulaton and mplementaton of an optmzaton method called Smultaneous Aerodynamc Analyss and Desgn Optmzaton (SAADO) s presented and appled to a smple D wng problem. The method ams to reduce the computatonal expense ncurred n performng shape optmzaton usng state-of-the-art CFD flow analyss and senstvty analyss tools. Results for ths small problem show that the method reaches the same local optmum as conventonal optmzaton methods and does so n about half the computatonal tme. b C D C l C L C M C p Nomenclature wng semspan drag coeffcent rollng moment coeffcent lft coeffcent ptchng moment coeffcent pressure coeffcent Copyrght 999 by the Amercan Insttute of Aeronautcs and Astronautcs, Inc. No copyrght s asserted n the Unted States under Ttle 7 U. S. Code. The U. S. Government has a royaltyfree lcense to exercse all rghts under the copyrght clamed heren for Governmental Purposes. All other rghts are reserved by the copyrght holder c r wng root chord wng tp chord F objectve functon g constrants M free-stream Mach number Q flow feld varables (state varables) at each CFD mesh pont Q change n flow solver feld varables due to better convergence Q change n flow solver feld varables due to desgn changes R resdual feld of the state equatons at each CFD mesh pont R/R norm of the resdual normalzed by ts ntal value S semspan wng planform area T twst angle at wng tp, postve for leadng edge up X CFD volume mesh X LE vector locaton of wng root leadng edge x/c chordwse locaton normalzed by local wng secton chord longtudnal locaton of wng tp tralng edge z r root secton camber α free-stream angle-of-attack β desgn varables
2 operator whch ndcates a change n a varable δ sze of fcttous sde bound on desgn varables γ lne search parameter superscrpts: * desgnates updated value gradent wth respect to desgn varables Introducton Smultaneous Aerodynamc Analyss and Desgn Optmzaton (SAADO) s a procedure whch ncorporates desgn mprovement wthn the teratvely solved (nonlnear) aerodynamc analyss so as to acheve fully converged flow solutons only near an optmal desgn. Overall computatonal effcency s acheved because the many expensve teratve (nonlnear) solutons for nonoptmal desgn parameters are not converged (.e., obtaned) at each optmzaton step. One obtans the desgn n the equvalent of a few (rather than many) multples of the computatonal tme for a sngle, fully converged flow analyss. SAADO and smlar procedures for smultaneous analyss and desgn (SAND) developed by others are noted and dscussed by Newman et al. These SAND procedures appear to be best suted for applcatons where the dscplne analyses nvolved n the desgn are nonlnear and solved teratvely. Generally, convergence of these dscplne analyses (.e., state equatons) s vewed as an equalty constrant n an optmzaton problem. From ths latter pont of vew, the SAADO method proceeds through nfeasble regons of the (β, Q) desgn space. A further advantage of SAADO s the effcent utlzaton of exstng dscplne analyss codes (wthout nternal changes), augmented wth senstvty or gradent nformaton, and yet effectvely coupled more tghtly than s done n conventonal gradent-based optmzaton procedures, referred to as nested analyss and desgn (NAND) procedures. A recent overvew of aerodynamc shape optmzaton dscusses both NAND and SAND procedures n the context of current steady aerodynamc optmzaton research. For sngle-dscplne desgn problems, the dstncton between NAND and SAND procedures s farly clear and readly seen. Wth respect to dscplne feasblty (.e., convergence of the teratvely (generally nonlnear) solved state equatons), these procedures can be vewed as accomplshng desgn by usng only very well converged dscplne solutons (NAND) or as convergng a sequence of dscplne solutons from poorly to well as the desgn progresses (SAND). However, the problem formulaton and soluton algorthms may dffer consderably. About twenty SAND references are quoted by Newman et al. and Newman et al. ; these references dscuss a varety of formulatons, algorthms, and results for sngledscplne problems (mostly CFD applcatons) n the sense of SAND defned above. For multdscplnary desgn optmzaton problems, the dstncton between NAND and SAND s somewhat blurred because there are feasblty consderatons wth respect to all the ndvdual dscplne state equatons as well as wth respect to the multdscplnary system compatblty and constrants. A number of the papers n Ref. dscuss MDO formulatons and algorthms that are called SAND-lke. However, not all of these latter MDO procedures appear to agree wth the sense of SAND defned above and used heren; one that does s Ref.4. The computatonal feasblty of SAADO for quas -D nozzle shape desgn based on the Euler equaton CFD approxmaton was demonstrated by Hou et al. 5 and Man. 6 Applcaton of SAADO for turbulent transonc arfol shape desgn based on a -D thn-layer Naver- Stokes CFD approxmaton was demonstrated and reported n a later paper by Hou et al. 7 Both of these applcaton results are summarzed and brefly dscussed n Ref.. These SAADO procedures utlzed quasanalytcal senstvty dervatves whch were obtaned from hand-dfferentated code for the ntal quas -D applcaton 5, 6 and from automatcally dfferentated code for both the -D arfol applcaton 7 and the present -D wng applcaton. Dfferent optmzaton technques have also been used n these SAADO procedures. Our ntal -D wng results from SAADO, obtaned wth several optmzaton technques, are gven n ths paper. The problem was a smple wng planform desgn where changes n desgn varables were sought to produce mprovement n the lft-to-drag rato subject to lft, ptchng moment, and rollng moment (.e., soluton dependent) constrants, as well as geometrc constrants. Our ultmate goal s smultaneous aerodynamc and structural wng desgn. Problem Descrpton To evaluate the effcacy of ths SAADO procedure n -D, t s appled heren to a smple rgd wng alone. The wng conssted of a trapezodal planform wth a rounded tp. It was parameterzed by ffteen varables; fve descrbed the planform, and fve each descrbed the root and tp secton shapes. A schematc of the wng and ts assocated planform parameters s shown n Fg.. The baselne wng secton vared lnearly from an NACA at the root to an NACA 8 at the tp. The specfc parameters selected as desgn
3 varables n the sample optmzaton problems are dentfed n the secton enttled Results. The objectve functon to be mnmzed was the negatve of the lft-to-drag rato, L/D. In leu of addtonal dscplne nteractons, both aerodynamc and geometrc constrants were mposed. The aerodynamc constrants were: lower lmt on lft, C L * S, n leu of a mnmum payload requrement upper lmt on rollng moment, C l, n leu of a maxmum bendng moment upper lmt on ptchng moment, C M, n leu of a trm constrant The purely geometrc constrants were: mnmum leadng edge radus, n leu of a manufacturng requrement mnmum wng secton thckness, n leu of a structural nteracton sde constrants (bounds) on the actve desgn varables SAADO Procedure The SAADO approach formulates the desgnoptmzaton problem as follows: mn F(Q, X ( β), β) () β, Q subject to g ( Q, X( ), ) ; =,,..., m () and RQX (, ( β), β ) =. () Recall that Q, R, and X are very large vectors. Ths formulaton treats the state varables, Q, as part of the set of ndependent desgn varables, and consders the state equatons to be constrants. Because satsfacton of the equalty constrants of Eq. () s requred only at the fnal optmum soluton, the steady-state aerodynamc feld equatons are not converged at every desgn-optmzaton teraton. The easng of that restrcton can sgnfcantly reduce the excessvely large computatonal cost ncurred n the conventonal approach. However, ths advantage would lkely be offset by the very large ncrease n the number of desgn varables and equalty constrant functons, unless some remedal procedure s adopted. The SAADO method begns wth a lnearzed desgnoptmzaton problem whch s solved for the most favorable change n the desgn varables, β, as well as for the changes n the state varables, Q; that s, subject to and mn F(Q, X, β) β, Q Q X β X β g g (Q, X, β) Q g g X β X β ; R(Q, X, β) Q X X β = β =,,..., m (4) (5) (6) where Eqs. (4), (5) and (6) are lnearzed approxmatons of Eqs. (), () and (), respectvely. In ths formulaton, the resdual of the non-lnear aerodynamc feld equatons, R(Q,X,β), s not requred to be zero (reach target) untl the fnal optmum desgn s acheved. The lnearzed problem of Eqs. (4), (5), and (6) s dffcult to solve drectly because of the number of desgn varables and equalty constrant equatons. Ths dffculty s overcome for the drect dfferentaton method by usng drect substtuton to remove Q and Eq. (6) altogether from ths lnearzed problem. The dscrete adjont method descrbed n the Appendx s another way to overcome the dffculty. However, the remander of ths paper descrbes only the use of the drect dfferentaton method for formulatng the SAADO procedure and ts applcaton to optmzaton problems. Equaton (6) provdes a lnear relaton to represent Q n terms of β as Q = Q Q β (7) where vector Q and matrx Q are solutons of the followng equatons Q = R (8) Q = X. (9) X β Note that the number of columns of matrx Q s equal to the number of desgn varables, β. A new
4 lnearzed problem wth β as the only desgn varables can be obtaned by substtutng Eq (7) nto Eqs. (4) and (5) for Q: subject to mn F(Q, X, β) Q β Q X β X β g g (Q, X, β) Q g g g Q X ; Q X β β =,,..., m () () Once establshed, ths lnearzed problem can be solved usng any mathematcal programmng technque for desgn changes, β. The assocated changes n Q can be calculated usng Eq (6) or equvalently, Eqs. (7), (8), and (9). A onedmensonal search on the step sze parameter γ s then performed n order to fnd the updated values, β * =βγ β, the new mesh, X * =X(β ), and Q * =Q Q * where the search procedure must solve a nonlnear optmzaton problem of the form subject to and * * * mn F(Q, X, β ) () γ * * * g ( Q, X, β ) ; =,,..., m () * * * RQ (, X, β ) = (4) The step sze γ s the only desgn varable. Agan t s noted for emphass that the equalty constrants, Eq. (4), are not requred to be zero (reach target) untl the fnal optmum desgn; volatons of these equalty constrants should smply be progressvely reduced durng the SAADO procedure. Therefore, the updated Q * n ths study s defned as Q * =Q Q *, whch satsfes the frst order approxmatons Eq. (4) as R(Q, X, β) Q X X β * ( γ β) = (5) Equaton (5) may be solved usng Eqs (8) and (9), whch gve the updated Q * as Q * =Q Q γ Q β. Therefore, the update of Q ncludes two parts: Q and Q. The former s due to better convergence of the flow solver, whereas the latter s due to changes n the desgn varables. In fact, Q approaches the flow feld senstvtes, Q, as the soluton becomes better converged. The appearance of Q n the formulaton makes the SAADO approach dfferent from the conventonal NAND aerodynamc optmzaton method. The Q not only consttutes a change n Q but also plays an mportant role n defnng the constrant volaton of Eq. (). Snce Q, as shown n Eq. (8), represents a sngle Newton s teraton on the flow equatons, t s possble to approxmate t as the change n Q as a result of several Newton s teratons to mprove the qualty of the flow soluton. A schematc of the present SAADO procedure s shown n Fg.. Computatonal Tools and Models The aerodynamc flow analyss code used for ths study s a verson of the CFLD code 8. Only Euler analyses are performed for ths work, although the code s capable of solvng the Naver-Stokes equatons wth any of several turbulence models. The dervatve verson of ths code, whch was used for aerodynamc senstvty analyss, was generated by an unconventonal applcaton 9 of the automatc dfferentaton code ADIFOR, to produce a relatvely effcent, drect mode, gradent analyss code, CFLD.ADII. It should be ponted out that the ADIFOR process produces a dscretzed dervatve code that s consstent wth the dscretzed functon analyss code. The addton of a stoppng crteron based on the norm of the resdual of the feld equatons was the only modfcaton of the CFLD.ADII code made to accommodate the SAADO procedure. The surface geometry was generated based on the parameters descrbed n the prevous secton by a code utlzng the Rapd Arcraft Parameterzaton Input Desgn (RAPID) technque developed by Smth, et al. Ths code was preprocessed wth ADIFOR to generate a code capable of producng senstvty dervatves as well. The CFD volume mesh needed by the flow analyss code was generated usng a verson of the CSCMDO 4 grd generaton code. The assocated grd senstvty dervatves needed by the flow senstvty analyss were generated wth an automatcally dfferentated 4
5 verson of CSCMDO. 5 In addton to the parameterzed surface mesh and accompanyng gradents, CSCMDO requres a baselne volume mesh of smlar shape and dentcal topology. The 4, grd pont baselne volume mesh of C-O topology used n the present examples was obtaned wth the WTCO code. 6 Ths mesh s admttedly partcularly coarse by current CFD analyss standards. Several optmzaton technques were used n ths study. Both conventonal and SAADO procedures were mplemented, run, and compared. The Sequental Quadratc Programmng method and the Method of Feasble Drectons as mplemented n the DOT 7 optmzaton software were used and the results were desgnated SQP and MFD, respectvely, when run n the conventonal (NAND) mode. The same optmzaton methods were also used n a SAADO or SAND mode (that s, partally converged CFD analyss and senstvty results at each teraton) and these results were desgnated SSQP and SMFD. In addton, a rather neffcent, unsophstcated optmzaton technque was devsed for use n the SAADO mode n order to provde dynamc drect access to and control of parameters typcally nternally controlled by packaged optmzers. Ths technque s a sequental lnear method consstng of formulaton of a mert functon as weghted sum of objectve functon and actve constrants determnaton of the step drecton by steepest descent of the mert functon determnaton of the step sze usng a onedmensonal lne search Results are desgnated SDMF when obtaned n the conventonal mode and when obtaned n the SAADO mode. All procedures were executed wth an SGI OCTANE workstaton wth a 5Mhz R processor. The 785MB RAM was suffcent for the largest code, CFLD.ADII, to ft n core for the 4,-pont mesh and number of desgn varables consdered heren. Results Most of the results shown n ths work are for a desgn problem nvolvng only two desgn varables out of the ffteen avalable wng parameters. Prelmnary results for a fve-desgn-varable problem are brefly dscussed n the subsequent subsecton. In the last subsecton, these present SAADO results are dscussed n the context of other SAND approaches. Two-Desgn-Varable Problems Many of the benefts and many of the problems assocated wth SAADO are demonstrated wth just two desgn varables. A beneft of studyng just two desgn varables s the faclty to vsualze the optmzaton process. In the course of another approxmaton and optmzaton study 8, databases of computatonal results were created for each of several grds for the present objectve functon as a functon of and wth the same CFD code, wng, and flow condtons as used heren. One of those grds was dentcal to that used n ths study. The results n ths database were converged to R/R = -6. Thus, contour plots of the present objectve functon are avalable; on such plots, we can show the paths taken through desgn space by the several optmzaton technques. Subsonc Problem-The flow condtons for the subsonc flow case were M =.5 and α =. Fgure a shows the objectve functon contour plot for ths case; the two SAADO mode results are those labeled and SSQP whereas the conventonal mode result s that labeled SQP. The rollng moment constrant boundary wth ts correspondng nfeasble regon appears on ths plot; however, the other constrants are feasble throughout the doman shown. Ths ( - ) doman conssts of that regon bounded by the desgn varable sde constrants. All three optmzaton results le very close to the mnmum. Fgure b shows the dfferent paths taken by these three optmzaton technques. Because none of these optmzaton paths approach the constrant boundary, none of the constrants are actve for these subsonc case results. All of these paths start at (,) n the (, ) desgn space. The doman has been truncated for these plots. The paths taken by the SQP and SSQP methods appear to be much more effcent n terms of the total number of calls to the analyss code. Even wth analyss and gradents not as well converged, the step drecton and sze determned by the SSQP are qute smlar to those of the SQP method. The method takes smaller steps on a dstnctly more crcutous path. Ths crcutous path s partally due to less effectve use of past teraton results and also due to a somewhat smplstc method of determnng the step sze and drecton. Defntve computatonal tme comparsons for these subsonc cases are not avalable due to omssons n the code nstrumentaton. The results are presented to show that for two optmzaton technques, the SAADO (SAND) method fnds the same optmum as the 5
6 conventonal (NAND) method. Further, these results suggest that a more sophstcated optmzaton procedure could substantally mprove the result, whle greater user control of the step sze, partcularly early n the procedure, could further decrease the computatonal cost for the SSQP result. Fgure 4 shows the wng planform and the surface pressure coeffcent results for the subsonc cases. The three optmzed planform shapes are very smlar and can be seen to result n essentally the same chordwse pressure dstrbutons. Furthermore, all of these dstrbutons dffer lttle from the orgnal, even where the local chords dffer, away from the wng root. Supercrtcal Problem- Most of the expermentaton wth SAADO was conducted for a problem whch s more nterestng both from the pont of vew of the aerodynamc analyss and of the optmzaton problem. The flow condtons for the supercrtcal flow case were M =.8 and α =. A shock was present over a substantal spanwse porton of the wng and there were actve constrants. Fgure 5a shows the objectve functon contour plot for the two desgn varable problem. The shaded regon denotes the nfeasble regon of the lft constrant. The other constrants were not actve. The fnal terates for eght optmzaton technque results are shown to le near the optmal pont of the feasble regon. These eght technques consst of three conventonal NAND optmzatons (SQP, MFD and SDMF) and ther correspondng SAND modes (SSQP, SMFD and ) as dscussed n a prevous secton, as well as two modfcatons to the SSQP, denoted as SSQP, δ=. and SSQP, δ=.5. The parameter δ smply provdes a means to lmt the change n desgn varables at each optmzaton step by dynamcally adjustng the sde constrants. Further dscusson concernng results from these latter two technques appears n the subsequent subsecton. Fgure 5b shows the dfferent paths taken by these eght optmzaton technques. All of these optmzaton paths approach and cross the lft constrant boundary. Thus, ths constrant was actve and, at tmes, volated n all of the technques for ths supercrtcal problem. As n the subsonc problem, all of these paths start at (,) n the (, ) desgn space, and the doman has been truncated for these plots. Here too, the less-converged analyss and gradent data used by the SSQP method do not seem to mpar ts ablty to determne the step drecton and sze. Agan, the results are smlar to those of the conventonal SQP method. The smplstc SDMF and methods stll take smaller steps on less drect paths, and once more, these crcutous paths are due to neffectve use of nformaton from past optmzaton teraton results and a smplstc means of determnng the step sze and drecton. The step sze for the SDMF decreased substantally when the constrant was encountered. The SDMF requred a few more optmzaton steps than the to reach the mnmum. As expected, the MFD spends less tme n the nfeasble regon than the other optmzaton technques. However, the SMFD does not appear to track the MFD optmzaton path very well. Fgure 6 shows the wng planform and the surface pressure coeffcent results for the supercrtcal cases. Snce all of the optmzed planform shapes are essentally the same and result n the same chordwse pressure dstrbuton, results from only three optmzaton technques are shown. The shock wave on the orgnal wng has been weakened substantally n the optmzed cases, as would be expected. Computaton Cost Comparsons- In vew of the consstency of the NAND and SAND optmzaton results, the measure of success or falure of the SAADO procedure s then ts relatve computatonal expense. Fgure 7 shows the relatve cost, based on accumulated CPU tme, for the procedures usng the varous methods. The cost of the geometry generator, mesh generator and optmzaton drver are not ncluded because ther contrbutons are mnmal relatve to the cost of the flow solver and flow senstvty solver. The cost shown s for flow analyses and gradent analyses and s normalzed by the cost of one full analyss to the target resdual. The SAADO method prmarly reduces the cost of the flow analyss. In ths regard, the SAADO method does show mprovement over ts conventonal counterpart for all methods. The SAADO method appears to make the most overall mprovement for the Method of Feasble Drectons (MFD vs. SMFD) and the Steepest Descent Method wth the Mert Functon (SDMF vs. ). The least relatve reducton s shown for the Sequental Quadratc Programmng method (SQP vs. SSQP). Note that for the conventonal methods, the MFD s domnated by flow analyss whereas the SDMF s domnated by senstvty analyss; the SQP s relatvely balanced. On the computer platform used n ths study, the ADIFOR-generated gradent analyss s relatvely neffcent compared to the flow analyss. 6
7 For the SAND methods, the smaller steps taken n the path relatve to those n the SSQP path, result n smaller perturbatons n the flow and gradent felds. In addton, for each step n the, the convergence level for the subsequent step s not as strngent as that requred n the SSQP. Compared to the number of flow solver teratons requred at each desgn step n SSQP and conventonal SQP, relatvely few are requred n the. However, ths savngs s traded off wth the relatvely large number of desgn steps requred for. Some combnaton of the two methods, such that small steps are taken along a more drect path, may lead to mproved effcency. That mproved effcency was the dea behnd the two SSQP methods labeled δ=. and δ=.5. The sde constrants were adjusted at each call to DOT so as to lmt the step sze. However, an overall detrmental effect on the method resulted, snce each tme ths fcttous sde constrant was encountered, DOT called for recalculaton of the gradents. The most computatonal cost for any of these methods, other than MFD and SMFD, s spent computng gradents, even though none of the gradent resdual ratos were converged below three orders of magntude. Early n the respectve processes, the gradents for n partcular and also the DOT methods were not well converged. As the number of desgn varables s ncreased, ths proporton wll grow nearly lnearly. The need for faster gradent calculatons s apparent. Hou et al. estmated a consderable speed-up attrbuted to usng hand-dfferentated adjont code for the -D Euler equatons. Fortunately, automatc code generaton tools for more easly and effcently computng gradents usng adjont methods 9 are on the horzon. Fve-Desgn-Varable Problem Lmted prelmnary results are gven and brefly dscussed n ths secton for the same wng shape optmzaton problem but wth fve desgn varables. These fve desgn varables are root camber (z r ), tp chord ( ), tp setback ( ), wng semspan (b), and tp twst (T). Table presents a comparson of the conventonal SQP (NAND) and SSQP (SAND) results. It can be seen from the objectve functon and fnal desgn varable values that these two procedures dd not arrve at exactly the same place n desgn space. However, both had the same two actve constrants (rollng moment and ptchng moment) and actve sde constrants (wng semspan and tp setback). The reducton n relatve optmzaton cost, based on CPU tme, for SAADO s comparable to that obtaned n the two desgn varable cases and the total optmzaton cost scales wth the number of desgn varables as t should for gradents obtaned va drect dfferentaton. Further Dscusson The relatve cost, based on CPU tmng ratos, for the SAADO (SAND) versus conventonal (NAND) procedures appled to these present small -D aerodynamc shape desgn optmzaton problems range from about one-half to seven-tenths. Ths range s very smlar to that reported for -D nonlnear aerodynamc shape desgn optmzaton n Refs. and 4, even though many of the computatonal detals dffer. The results gven n Ref. were for a turbulent transonc flow wth shock waves computed usng a Naver-Stokes code; a drect dfferentaton approach (usng ADIFOR) was used for the senstvty analyss. The results reported n Ref. 4 were for a compressble flow wthout shock waves computed usng a nonlnear potental flow code; an adjont approach was used for the senstvty analyss. Snce these two optmzaton problems were also not the same, then, no tmng comparson between these adjont and drect dfferentaton soluton approaches would be meanngful. As ndcated earler, an expected speed-up for usng an adjont, nstead of the drect dfferentaton, approach was estmated n Ref.. Ghattas and Bark recently reported -D and -D results for optmal control of steady ncompressble Naver-Stokes flow whch demonstrate an order-ofmagntude reducton of CPU tme for a SAND approach versus a NAND approach. These results were obtaned usng reduced Hessan SQP methods that avod convergng the flow equatons at each optmzaton teraton. The relatonshp of these methods wth respect to other optmzaton technques s also dscussed n Ref.. Several other SAND-lke methods for smultaneous analyss and desgn are summarzed and dscussed by Ta asan. These methods are called "One-Shot" and "Pseudo-Tme" and have been appled to aerodynamc shape desgn problems at several fdeltes of CFD approxmaton, as noted n Ref.. These technques have obtaned an aerodynamc desgn n the equvalent of several analyss CPU tmes for some sample problems. 7
8 Concludng Remarks Ths study has ntroduced an mplementaton of the SAADO technque for a smple -D wng. Intal results ndcate that SAADO. fnds the same local mnmum as a conventonal technque for the two-desgn-varable cases and a smlar local mnmum for a prelmnary fvedesgn-varable case. s computatonally more effcent than a conventonal gradent-based optmzaton technque. requres few modfcatons to the analyss and senstvty analyss codes nvolved. Intal results have llustrated the need for an adjont method for effcently computng the senstvty dervatves. Fortunately, such automated adjont code generaton tools are on the brnk of beng readly avalable. The SAADO method of closely couplng the analyss and optmzer teraton loops requres optmzaton software that does not usurp all control. That s, the SAADO technque needs to have some control over certan parameters durng the optmzaton process; these parameters are typcally consdered optmzer parameters and are only set by the user ntally. Acknowledgement The second author, G. J.-W. H., was supported n ths work by NASA through several Tasks under contract NAS-9858 wth the ODU Research Foundaton. References. Newman, P. A., Hou, G. J.-W., and Taylor III, A. C., Observatons Regardng Use of Advanced CFD Analyss, Senstvty Analyss, and Desgn Codes n MDO, n Ref., pp. 6-79; also ICASE Report 96-6, NASA CR 989, (avalable electroncally at Newman, III, J. C., Taylor, III, A. C., Barnwell, R. W., Newman, P. A., and Hou, G. J.-W., Overvew of Senstvty Analyss and Shape Optmzaton for Complex Aerodynamc Confguratons, Journal of Arcraft, Vol. 6, No., 999, pp Alexandrov, N. M., and Hussan, M. Y., Eds., Multdscplnary Desgn Optmzaton: State of the Art, SIAM Proceedngs Seres, SIAM, Phladelpha, Ghattas, O. and Orozco, C. E., A Parallel Reduced Hessan SQP Method for Shape Optmzaton, n Ref., pp Hou, G. J.-W., Taylor, III, A. C., Man, S. V., and Newman, P. A., Smultaneous Aerodynamc Analyss and Desgn Optmzaton, Abstracts from nd U.S. Natonal Congress on Computatonal Mechancs, Washngton, DC, Aug., 99, pp.. 6. Man, S. V., Smultaneous Aerodynamc Analyss and Desgn Optmzaton, M. S. Thess, Old Domnon Unversty, Norfolk, VA, Dec Hou, G. J.-W., Korv, V. M., Taylor, III, A. C., Maroju, V., and Newman, P. A., Smultaneous Aerodynamc Analyss and Desgn Optmzaton (SAADO) of a Turbulent Transonc Arfol Usng a Naver-Stokes Code Wth Automatc Dfferentaton (ADIFOR), Computatonal Aeroscences Workshop 95, edted by W. J. Feeresen, and A. K. Lacer, NASA CD CP-, Jan. 996, pp Rumsey, C., Bedron, R., and Thomas, J., CFLD: Its Hstory and Some Recent Applcatons, NASA TM-86, May Sherman, L., Taylor, III, A., Green, L., Newman, P., Hou, G., and Korv, M., Frst- and Second- Order Aerodynamc Senstvty Dervatves va Automatc Dfferentaton wth Incremental Iteratve Methods, Journal of Computatonal Physcs, Vol.9, No., 996, pp Bschof, C. H., Carle, A., Corlss, G. F., Grewank, A., and Hovland, P., ADIFOR: Generatng Dervatve Codes from Fortran Programs, Scentfc Programmng, Vol., No., 99, pp Bschof, C., and Grewank, A., ADIFOR: A Fortran System for Portable Automatc Dfferentaton, Proceedngs, Fourth AIAA/USAF/NASA/OAI Symposum on Multdscplnary Analyss and Optmzaton, Cleveland, Sept. 99, pp. 4-44; also AIAA Paper CP.. Taylor, III, A. C., Oloso, A., and Newman, III, J.C., CFLD.ADII (Verson.): An Effcent, Accurate, General-Purpose Code for Flow Shape-Senstvty Analyss, AIAA Paper 97-4, June Smth, R. E., Bloor, M. I. G., Wlson, M. J., and Thomas, A. T., Rapd Arplane Parametrc Input Desgn (RAPID), Proceedngs, th AIAA Computatonal Flud Dynamcs Conference, San Dego, June 995, pp ; also AIAA Paper
9 4. Jones, W. T., and Samareh-Abolhassan, J., A Grd Generaton System for Multdscplnary Desgn Optmzaton, Proceedngs, th AIAA Computatonal Flud Dynamcs Conference, San Dego, June 995, pp ; also AIAA Paper Bschof, C., Jones, W. T., Samareh-Abolhassan, J., and Mauer, A., Experences wth the Applcaton of the ADIC Automatc Dfferentaton Tool to the CSCMDO -D Volume Grd Generaton Code, AIAA Paper 96-76, Jan Vatsa, V. N., and Wedan, B. W., Effect of Sdewall Boundary Layer on a Wng n a Wnd Tunnel, Journal of Arcraft, Vol. 6, No., 989, pp. 57-6; also AIAA Paper 88-, Jan Anon., DOT Users Manual: Verson 4., Vanderplaats Research & Development, Inc., Colorado Sprngs, May Prvate communcaton Alexandrov, N., and presentaton, Multlevel Optmzaton wth Surrogates In Wng Desgn, Sxth SIAM Conference on Optmzaton, Atlanta, May, Carle, A., Fagan, M., and Green, L. L., Prelmnary Results from the Applcaton of Automated Adjont Code Generaton to CFLD, Proceedngs, th AIAA/USAF/NASA/ISSMO Symposum on Multdscplnary Analyss and Optmzaton, St. Lous, Sept. 998, pp ; also AIAA Paper Ghattas, O., and Bark, J.-H., Optmal Control of Two- and Three-Dmensonal Naver-Stokes Flows, Journal of Computatonal Physcs, Vol. 6, No., 997, pp Ta asan, S., Trends n Aerodynamc Desgn and Optmzaton: A Mathematcal Vewpont, Proceedngs, th AIAA Computatonal Flud Dynamcs Conference, San Dego, June 995, pp ; also, AIAA Paper Appendx - SAADO Procedure Usng a Dscrete Adjont Approach The SAADO approach formulates the desgnoptmzaton problem as follows: mn F(Q, X ( β), β) β, Q subject to g ( Q, X( β ), β ) ; =,,..., m (A) (A) and RQX (, ( β), β ) =. (A) Recall that Q, R, and X are very large vectors. Ths formulaton treats the state varables, Q, as part of the set of ndependent desgn varables, and consders the state equatons to be constrants. Because satsfacton of the equalty constrants of Eq. (A) s requred only at the fnal optmum soluton, the steady-state aerodynamc feld equatons are not converged at every desgn-optmzaton teraton. The easng of that restrcton can sgnfcantly reduce the excessvely large computatonal cost ncurred n the conventonal approach. However, ths advantage would lkely be offset by the very large ncrease n the number of desgn varables and equalty constrant functons, unless some remedal procedure s adopted. The SAADO method begns wth a lnearzed desgnoptmzaton problem whch s solved for the most favorable change n the desgn varables, β, as well as for the changes n the state varables, Q; that s, subject to and mn F(Q, X, β) Q β, Q (A4) X β X β g g (Q, X, β) Q g g X β X β ; R(Q, X, β) Q X X β = β =,,..., m (A5) (A6) where Eqs. (A4), (A5) and (A6) are lnearzed approxmatons of Eqs. (A), (A) and (A), respectvely. In ths formulaton, the resdual of the non-lnear aerodynamc feld equatons, R(Q,X,β), s not requred to be zero (reach target) untl the fnal optmum desgn s acheved. The lnearzed problem of Eqs. (A4), (A5), and (A6) s dffcult to solve drectly because of the number of desgn varables and equalty constrant equatons. Ths dffculty s overcome for the adjont method by the ntroducton 9
10 of the adjont vectors, λ and λ whch are solutons of the followng adjont equatons T λ T λ = (A7) g = ; =,,...m. (A8) The lnearzed problem of Eqs. (A4) to (A6) can then be formulated as mn F(Q, X, β) λ β λ X subject to T g (Q, X, β) λ T T R X λ X β g T g λ X λ X X β =,,..., m R T T (A9) β β β ; (A) β Once establshed, ths lnearzed problem can be solved usng any mathematcal programmng technque for desgn changes, β. A one-dmensonal search s then performed for the step sze parameter γ n order to fnd the updated values, β * =βγ β, X * =X(β ), and Q * where the search procedure must solve a nonlnear optmzaton problem of the form subject to and * * * mn F(Q, X, β ) (A) γ * * * g ( Q, X, β ) ; =,,..., m * * * (A) RQ (, X, β ) =. (A) The step sze, γ, s the only desgn varable. Agan t s noted for emphass that the equalty constrants, Eq. (A), are not requred to be zero (reach target) untl the fnal optmum desgn; volatons of these equalty constrants should smply be progressvely reduced durng the SAADO procedure. Therefore, the updated Q * n ths study s defned as Q * =Q Q *, whch satsfes the frst order approxmatons Eq. (A) as R(Q, X, β) Q X X β * ( γ β) = (A4) The update for Q * need not be determned from Eq. (A4), but rather can be taken from the results of solvng Eq. (A) n the process of determnng γ. The SAADO procedure presented here s smlar to that procedure whch Ghattas and Bark call Quas- Newton Sequental Quadratc Programmng. However, that procedure as presented dd not provde for state varable dependent constrants and t was drectly embedded n a partcular mathematcal programmng technque, SQP. Table. Comparson of Prelmnary SQP and SSQP Results for the Fve Desgn Varable Problem Objectve functon Number of actve constrants Number of actve bounds z r, %chord b T, deg. Relatve functon analyss cost Relatve gradent analyss cost Relatve optmzaton cost Intal value SQP value SSQP value ** 4.** ** 4.98**..*.*** * CPU tme for an analyss soluton converged to R/R 6 s 9 sec. ** Desgn varable sde bound s actve *** Gradent solutons converged to R/R
11 X LE =(,,) Planform vew Profle vew c r = T xt z r XLE =(,,) xt b Fg. Dagram of the parametrc wng model. Input Specfy: Desgn problem Target convergence Intalze: Geometry Flow condtons Convergence level Tghten convergence level Geometry generaton wth gradents Desgn update Optmzer Volume mesh generaton Flow analyss Mesh senstvty generaton Flow senstvty analyss Partally converged desgn Partally converged aerodynamc analyss Partally converged aerodynamc senstvty analyss Fg. Schematc dagram of the SAADO procedure.
12 SQP SSQP contours of objectve nfeasble regon startng pont Fg. a Map of well converged objectve functon and constrant boundary wth optmzaton endponts, M =.5, α =..8 SQP SQP SSQP.. Contours of objectve SSQP Fg. b. Map of well converged objectve functon and constrant boundary wth complete optmzaton paths, M =.5, α =.
13 B Upper surface pressure contours Orgnal result wng A B. B C p.5 A B.5 Secton A A.5 Orgnal SQP SSQP C p.5 Secton B B Pressure coeffcents Planform shapes Fg. 4. Comparson of orgnal wng and optmzaton results at M =.5, α = : upper surface pressure contours, pressure coeffcents at two span statons, and planform shapes.
14 start here MFD SMFD SQP SSQP SSQP, δ=. SSQP, δ=.5 SDMF Fg. 5a Map of well converged objectve functon and constrant boundary wth optmzaton endponts, M =.8, α=. MFD SMFD Fg. 5b Map of well converged objectve functon and constrant boundary wth optmzaton paths, M =.8, α=. 4
15 8 SQP SSQP SSQP δ =. SSQP δ= SDMF Fg. 5b Map of well converged objectve functon and constrant boundary wth optmzaton paths, M =.8, α=
16 B Upper surface pressure contours result A Orgnal wng B..5 B C p B.5. Secton A A Orgnal SQP SSQP A.5 C p.5 Secton B B Pressure coeffcents Fg. 6. Comparson of orgnal wng and optmzaton results at M =.8, α = : upper surface pressure contours, pressure coeffcents at two span statons, and planform shapes. Planform shapes
17 Flow Analyss Gradent Analyss Relatve cost MFD SMFD SQP SSQP δ=.5 SSQP δ=. SSQP SDMF Fgure 7. Computatonal cost comparsons 7
A mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationStructural Optimization Using OPTIMIZER Program
SprngerLnk - Book Chapter http://www.sprngerlnk.com/content/m28478j4372qh274/?prnt=true ق.ظ 1 of 2 2009/03/12 11:30 Book Chapter large verson Structural Optmzaton Usng OPTIMIZER Program Book III European
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationLS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract
12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More information陳申岳 S-Y. Chen, 2007, Gradient-Based Structural and CFD Global Shape Optimization with SmartDO and the Response Smoothing Technology, Proceeding of
陳申岳 S-Y. Chen, 2007, Gradent-Based Structural and CFD Global Shape Optmzaton wth SmartDO and the Response Smoothng Technology, Proceedng of the 7 th World Congress of Structural and Multdscplnary Optmzaton
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationLECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming
CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)
More informationReview of approximation techniques
CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated
More informationTopology Design using LS-TaSC Version 2 and LS-DYNA
Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool
More informationAdaptive Weighted Sum Method for Bi-objective Optimization
45th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamcs & Materals Conference 19-22 Aprl 2004, Palm Sprngs, Calforna AIAA 2004-1680 Adaptve Weghted Sum Method for B-objectve Optmzaton Olver de Weck
More informationClassification / Regression Support Vector Machines
Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM
More informationCable optimization of a long span cable stayed bridge in La Coruña (Spain)
Computer Aded Optmum Desgn n Engneerng XI 107 Cable optmzaton of a long span cable stayed brdge n La Coruña (Span) A. Baldomr & S. Hernández School of Cvl Engneerng, Unversty of Coruña, La Coruña, Span
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationVery simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)
Structured meshes Very smple computatonal domans can be dscretzed usng boundary-ftted structured meshes (also called grds) The grd lnes of a Cartesan mesh are parallel to one another Structured meshes
More informationOptimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming
Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationParallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)
Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)
More informationSupport Vector Machines. CS534 - Machine Learning
Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationRepeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits
Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationA Facet Generation Procedure. for solving 0/1 integer programs
A Facet Generaton Procedure for solvng 0/ nteger programs by Gyana R. Parja IBM Corporaton, Poughkeepse, NY 260 Radu Gaddov Emery Worldwde Arlnes, Vandala, Oho 45377 and Wlbert E. Wlhelm Teas A&M Unversty,
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationAn inverse problem solution for post-processing of PIV data
An nverse problem soluton for post-processng of PIV data Wt Strycznewcz 1,* 1 Appled Aerodynamcs Laboratory, Insttute of Avaton, Warsaw, Poland *correspondng author: wt.strycznewcz@lot.edu.pl Abstract
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationDesign of Structure Optimization with APDL
Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationModule 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell
Module 6: FEM for Plates and Shells Lecture 6: Fnte Element Analyss of Shell 3 6.6. Introducton A shell s a curved surface, whch by vrtue of ther shape can wthstand both membrane and bendng forces. A shell
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More information5 The Primal-Dual Method
5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton
More informationSolitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis
Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
More information3. CR parameters and Multi-Objective Fitness Function
3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationDynamic wetting property investigation of AFM tips in micro/nanoscale
Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationUB at GeoCLEF Department of Geography Abstract
UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationChapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward
More informationTPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints
TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationSENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR
SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu
More informationWavefront Reconstructor
A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes
More informationQuery Clustering Using a Hybrid Query Similarity Measure
Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationA Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationCHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION
48 CHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION 3.1 INTRODUCTION The raw mcroarray data s bascally an mage wth dfferent colors ndcatng hybrdzaton (Xue
More informationAPPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA
RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationCategories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms
3. Fndng Determnstc Soluton from Underdetermned Equaton: Large-Scale Performance Modelng by Least Angle Regresson Xn L ECE Department, Carnege Mellon Unversty Forbs Avenue, Pttsburgh, PA 3 xnl@ece.cmu.edu
More informationUSING GRAPHING SKILLS
Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationMulti-Objective Design Exploration for Aerodynamic Configurations
Mult-Objectve Desgn Exploraton for Aerodynamc Confguratons Shgeru Obayash *, Tohoku Unversty, Senda, 980-8577, Japan Shnkyu Jeong Tohoku Unversty, Senda, 980-8577, Japan and Kazuhsa Chba Japan Aerospace
More informationPreconditioning Parallel Sparse Iterative Solvers for Circuit Simulation
Precondtonng Parallel Sparse Iteratve Solvers for Crcut Smulaton A. Basermann, U. Jaekel, and K. Hachya 1 Introducton One mportant mathematcal problem n smulaton of large electrcal crcuts s the soluton
More informationFitting: Deformable contours April 26 th, 2018
4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.
More informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More information