Pyramid algorithms for barycentric rational interpolation
|
|
- Reginald Flowers
- 5 years ago
- Views:
Transcription
1 Pyrmd lgorthms for rycentrc rtonl nterpolton K Hormnn Scott Schefer Astrct We present new perspectve on the Floter Hormnn nterpolnt Ths nterpolnt s rtonl of degree (n, d ), reproduces polynomls of degree d, nd hs no rel poles By cstng the evluton of ths nterpolnt s pyrmd lgorthm, we frst demonstrte close relton to Nevlle s lgorthm We then derve n O(nd ) lgorthm for computng the rycentrc weghts of the Floter Hormnn nterpolnt, whch mproves upon the orgnl O (nd 2 ) constructon Ctton Info Journl Computer Aded Geometrc Desgn Volume 42, Ferury 206 Pges 6 Introducton Gven the n + nterpolton nodes x 0 < x < < x n nd the ssocted dt f 0, f,, f n, there re two wys to wrte the rtonl Floter Hormnn nterpolnt [3] of degree d n On the one hnd, t cn e expressed s the lend n d 0 r (x ) λ (x )p (x ) n d 0 λ () (x ) of the polynomls p of degree d, whch loclly nterpolte the dt f,, f +d, wth weghtng functons λ (x ) ( ) (x x ) (x x +d ) On the other hnd, t cn e wrtten n the rycentrc form n ( ) n ( ) r (x ) w f w (2) x x x x wth postve weghts w 0 mn(,n d ) +d mx(0, d ) k,k 0 x x k (3) The rycentrc form s prtculrly suted for evlutng the nterpolnt r n O (n) tme, once the weghts w, whch depend only on the nodes x nd not on the dt f, hve een precomputed Usng (3), these weghts cn e determned n O (nd 2 ) steps, whch s exctly how common lrres lke Numercl Recpes [5] nd ALGLIB [2] perform the computton We present two novel procedures for evlutng r (x ), whch re nspred y Ron Goldmn s pyrmd lgorthms [4] for the evluton of polynoml nd splne curves Whle the frst s tlored for Floter Hormnn nterpolnts nd explots the representton of r n (), the second s sed on (2) nd works for generl rycentrc rtonl nterpolnts of degree (n, n) wth rtrry weghts w Both lgorthms requre O (n 2 ) opertons nd re closely relted to Nevlle s lgorthm for constructng nterpoltng polynomls of degree n They further led to novel O (nd ) lgorthm for computng the weghts n (3) The clm n [5, pge 28] tht the worklod to construct the weghts s of order O(nd ) opertons s wrong, ecuse the gven code ust mplements the formul n (3) n strghtforwrd wy nd s clerly of order O (nd 2 ) Fgure : Pyrmd notton for lner comntons Thck rrows ndcte ffne comntons, where we omt the normlzton fctors of the weghts to keep the dgrm less cluttered Dshed rrows ndcte tht the weghts need to e multpled wth /2
2 Q 5 0 (x ) Q 4(x ) Q 4(x ) 0 x x Q 3(x ) Q 3(x ) Q 3(x ) 0 2 x x Q 2(x ) Q 2(x ) Q 2(x ) Q 2(x ) x x Q (x ) Q (x ) Q (x ) Q (x ) Q (x ) x x x x x x 4 Q 0(x ) Q 0(x ) Q 0(x ) Q 0(x ) Q 0(x ) Q 0(x ) Fgure 2: Exmple of the pyrmd lgorthm for Floter Hormnn nterpolton wth n 5 nd d 2 2 Evlutng the rtonl nterpolnt Usng the notton n Fgure, the Floter Hormnn nterpolnt n () cn e evluted y the pyrmd lgorthm n Fgure 2, whch s slght vrton of Nevlle s lgorthm [4, Chpter 22], where the weghts n the top n d rows of the pyrmd re not normlzed nd the weghts t the nteror edges n these rows re multpled wth n ddtonl fctor of /2 Tht s, for some gven evluton prmeter x, we strt wth the ntl dt Q 0 (x ) (f, ), 0,, n nd compute the ottom d rows of the pyrmd wth Nevlle s lgorthm s for l,, d, resultng n the vlues Q l (x ) x +l x Q l (x ) + x x Q l + (x ), 0,, n l, x +l x x +l x Q d (x ) (p (x ), ), 0,, n d We then contnue to compute the top n d rows of the pyrmd s Q l (x ) ηn l+ for l d +,, n, where resultng n the vlue (x +l x )Q l (x ) + η n l+ (x x )Q l (x ), 0,, n l, + + η l, f 0 or l, /2, otherwse, Q n 0 (x ) f (x ), g (x ) We now oserve tht the dgrm n Fgure 2 stsfes the prllel property, tht s, prllel rrows ll hve the sme lels Hence the product of lels long ny pth from Q d (x ) to the pex of the pyrmd s lwys µ (x ) (x x ) 0 n k +d + (x k x ) ( ) n d π(x )λ (x ), where n π(x ) (x x ) 0 2
3 P 0 0 η 0 η P 0 P η 2 0 η 2 η 2 η η 3 0 η 3 η 3 η 3 2 η 3 2 η Fgure 3: Recurrence of the vlues P l (left), whch re ll equl to (rght) Due to the ddtonl fctors η l, ech of these pths s further multpled y some power of /2 Denotng the sum of these powers y P n d, we hve Q n 0 (x ) P n d µ (x )Q d (x ) 0 As ny pth from the node Q l l l (x ) to the pex must trverse ether of the nodes Q (x ) or Q (x ), t s cler tht the vlues P l stsfy the recurrence 2 P 0 0, P l η l P l + ηl P l, 0,,l, l,, n d, s shown n Fgure 3, nd t follows y nducton tht P n d 0 for 0,, n Therefore, f (x ) ( ) n d π(x ) λ (x )p (x ), g (x ) ( ) n d π(x ) λ (x ), nd fnl dvson of these two components of Q n 0 (x ) gves r (x ) f (x ) g (x ) Another opton s to evlute the nterpolnt r y modfyng ll the rows of Nevlle s lgorthm, s shown n Fgure 4, nd to use the ntl dt R 0 (x ) w (f, ) (w f, w ), 0,, n We then compute the rows of the pyrmd from ottom to top s R l (x ) ηn l+ (x +l x )R l (x ) + η n l+ (x x )R l (x ), 0,, n l, for l,, n wth η l defned s ove, resultng n the vlue + R n 0 (x ) f (x ), g (x ) Wth rguments smlr to the ones ove, t cn e shown tht f (x ) ( ) n π(x ) n ( ) 0 + x x w f, g (x ) ( ) n π(x ) n 0 0 ( ) x x w, nd fnl dvson gves r (x ) f (x ) g (x ) 2 For the ske of smplcty, we tctly follow the conventon tht P l 0 for < 0 nd > l 3
4 R 5 0 (x ) R 4(x ) R 4(x ) 0 x x R 3(x ) R 3(x ) R 3(x ) 0 2 x x R 2(x ) R 2(x ) R 2(x ) R 2(x ) x x R (x ) R (x ) R (x ) R (x ) R (x ) x x x x x x 4 R 0(x ) R 0(x ) R 0(x ) R 0(x ) R 0(x ) R 0(x ) Fgure 4: Exmple of the pyrmd lgorthm for generl rycentrc rtonl nterpolton wth n 5 Note tht ths second lgorthm works for ny set of weghts w, hence for ny rtonl nterpolnt of degree (n, n) Clerly, oth lgorthms requre O (n 2 ) steps nd re thus slower nd possly not s roust s the O (n) evluton of r (x ) wth the rycentrc form (2), ut we eleve tht ths formulton sheds some nterestng new lght on the de of rycentrc rtonl nterpolton We would further lke to pont out tht the lgorthm n Fgure 2 ers strong resemlnce to the lgorthm of Brry nd Goldmn [] for evlutng Ctmull Rom splnes Both lgorthms frst crry out few rounds of Nevlle s lgorthm to compute the locl polynoml nterpolnts p (x ), ut they dffer n the wy these vlues re comned whle gong through the top rows of the pyrmd: for Ctmull Rom splnes we lend the locl polynomls wth B-splne ss functons, nd for Floter Hormnn nterpolnts we use λ / n d 0 λ s lendng functons 3 Computng the weghts Comprng the two lgorthms n Fgures 2 nd 4, we notce tht they re dentcl n the top n d rows nd tht the nput dt Q 0 (x ) nd R 0 (x ) dffer y the fctors w Ths oservton suggests tht there mght exst n effcent pyrmd lgorthm for computng the Floter Hormnn weghts Indeed, we cn determne the weghts w f we strt wth the vlues V d, 0,, n d nd then work our wy down the ottom d rows of the pyrmd, usng the normlzton fctors from Nevlle s lgorthm, to compute 3 V l V l+ x +l x + V l+ x +l+ x, 0,, n l, (4) for l d, d 2,, 0, s shown n Fgure 5 To see tht w for 0,, n, consder the vlues U l mn(,n l) mx(0, l) V l For these vlues we clerly hve U 0 +l k,k nd U d for ny l 0,, d The mn de s frst to expnd ech ddend A l of U l, x x k 0,, n, l 0,, d (5) 3 For the ske of smplcty, we tctly follow the conventon tht V l 0 for < 0 nd > n l w for 0,, n, nd we further show tht U l U l+ usng (4) nd then to ugment 4
5 0 2 3 V V V V V x x 0 x x 0 x 2 x 0 x 2 x 0 x 2 x x 2 x x 3 x x 3 x x 3 x 2 x 3 x 2 x 4 x 2 x 4 x 2 x 4 x 3 x 4 x 3 x 5 x 3 x 5 x 3 x 5 x 4 x 5 x Fgure 5: Exmple of the pyrmd lgorthm for computng the Floter Hormnn weghts w n (3) wth n 5 nd d 2 the products y one fctor, A l V l +l k,k x x k V l+ x +l x + V l+ V l+ x +l+ x +l +l k,k x x x +l x x k,k x k }{{} x x k x +l+ x x +l+ x x k,k x k }{{} + V l+ +l+ B l C l Next oserve tht the terms C l from A l nd B l + from Al + C l + B l + V l+ Fnlly, notce tht B l 0 V l+ l n l 0, nd C A l+ n (5) y V l+ x +l+ x x +l+ x +l+ k,k +l+ k,k x x k Al+ sum up to the ddend Al+ of U l+, x x k + V l+ x x x +l+ x +l+ k,k x x k l+ 0, ecuse V 0, ecuse for < n l If we now denote the lower nd upper ounds of the summton ndex 0, nd B l l Al+ l for > l, nd smlrly C l n l l mx(0, l), mn(, n l) nd dstngush the dfferent cses of the ndex, where ether l 0 or l l nd ether n l, we fnd tht n ll cses U l l A l B l + B l l + l + l C l + C l B l + l l A l+ + C l l+ l+ A l+ U l+ Therefore, U 0 U U d w, whch sserts tht the Floter Hormnn weghts re determned y the lgorthm ove n O (nd ) steps References or [] P J Brry nd R N Goldmn A recursve evluton lgorthm for clss of Ctmull Rom splnes ACM SIGGRAPH Computer Grphcs, 22(4):99 204, Aug 988 [2] S Bochknov ALGLIB 300 User Gude Interpolton nd fttng Rtonl nterpolton net/nterpolton/rtonlphp, Aug 205 [Onlne; ccessed 4-Decemer-205] [3] M S Floter nd K Hormnn Brycentrc rtonl nterpolton wth no poles nd hgh rtes of pproxmton Numersche Mthemtk, 07(2):35 33, Aug 2007 [4] R Goldmn Pyrmd Algorthms: A Dynmc Progrmmng Approch to Curves nd Surfces for Geometrc Modelng The Morgn Kufmnn Seres n Computer Grphcs nd Geometrc Modelng Morgn Kufmnn, Sn Frncsco, 2003 [5] S Teukolsky, B P Flnnery, W T Vetterlng, nd W H Press Numercl Recpes n C: The Art of Scentfc Computng, chpter 34, pges Cmrdge Unversty Press, New York, thrd edton,
Elton, Gruber, Brown, and Goetzmann. Modern Portfolio Theory and Investment Analysis, 7th Edition. Solutions to Text Problems: Chapter 14
Elton, Gruer, Brown, nd Goetznn odern Portfolo Theory nd Investent Anlyss, 7th Edton Solutons to Text Proles: hpter 14 hpter 14: Prole 1 Gven the zero-et securty rket lne n ths prole, the return on the
More informationTCOM501 Networking: Theory & Fundamentals Final Examination Professor Yannis A. Korilis April 26, 2002
TO5 Networng: Theory & undamentals nal xamnaton Professor Yanns. orls prl, Problem [ ponts]: onsder a rng networ wth nodes,,,. In ths networ, a customer that completes servce at node exts the networ wth
More informationINF 4130 Exercise set 4
INF 4130 Exercise set 4 Exercise 1 List the order in which we extrct the nodes from the Live Set queue when we do redth first serch of the following grph (tree) with the Live Set implemented s LIFO queue.
More informationElton, Gruber, Brown, and Goetzmann. Modern Portfolio Theory and Investment Analysis, 7th Edition. Solutions to Text Problems: Chapter 9
Elton, Gruber, Brown, and Goetzmann Modern Portfolo Theory and Investment Analyss, 7th Edton Solutons to Text Problems: Chapter 9 Chapter 9: Problem In the table below, gven that the rskless rate equals
More informationDifferential rain attenuation
Recommendton ITU-R.85-0/009) Dfferentl rn ttenuton Seres Rdowve propgton Rec. ITU-R.85- Foreword The role of the Rdocommuncton Sector s to ensure the rtonl, equtble, effcent nd economcl use of the rdo-frequency
More informationFast Laplacian Solvers by Sparsification
Spectral Graph Theory Lecture 19 Fast Laplacan Solvers by Sparsfcaton Danel A. Spelman November 9, 2015 Dsclamer These notes are not necessarly an accurate representaton of what happened n class. The notes
More informationDynamic model of funding in interbank payment systems
5 th Bn of Fnlnd s Pyment nd Settlement Smulton Semnr August 2007 Dscusson of Mrco Glbt nd Kmmo Sormä s Dynmc model of fundng n nterbn pyment systems By Fben Renult (Bnque de Frnce) The vews expressed
More information1. Determine the consequences of distributing a fixed total amount of income (Y) to maximize the following SWF:
ECO 755, Prolem Set Len Crer. Determne the consequences of dstrutng fed totl mount of ncome Y to mmze the followng SF: Consder cses: α < 0 α 0 c 0 < α < d α α α where Y nd > 0, Setup optmzton prolem: α
More informationCreating a zero coupon curve by bootstrapping with cubic splines.
MMA 708 Analytcal Fnance II Creatng a zero coupon curve by bootstrappng wth cubc splnes. erg Gryshkevych Professor: Jan R. M. Röman 0.2.200 Dvson of Appled Mathematcs chool of Educaton, Culture and Communcaton
More informationMULTIPLE CURVE CONSTRUCTION
MULTIPLE CURVE CONSTRUCTION RICHARD WHITE 1. Introducton In the post-credt-crunch world, swaps are generally collateralzed under a ISDA Master Agreement Andersen and Pterbarg p266, wth collateral rates
More informationMode is the value which occurs most frequency. The mode may not exist, and even if it does, it may not be unique.
1.7.4 Mode Mode s the value whch occurs most frequency. The mode may not exst, and even f t does, t may not be unque. For ungrouped data, we smply count the largest frequency of the gven value. If all
More informationHomework 9: due Monday, 27 October, 2008
PROBLEM ONE Homework 9: due Monday, 7 October, 008. (Exercses from the book, 6 th edton, 6.6, -3.) Determne the number of dstnct orderngs of the letters gven: (a) GUIDE (b) SCHOOL (c) SALESPERSONS. (Exercses
More informationParallel Prefix addition
Marcelo Kryger Sudent ID 015629850 Parallel Prefx addton The parallel prefx adder presented next, performs the addton of two bnary numbers n tme of complexty O(log n) and lnear cost O(n). Lets notce the
More information15-451/651: Design & Analysis of Algorithms January 22, 2019 Lecture #3: Amortized Analysis last changed: January 18, 2019
5-45/65: Desgn & Analyss of Algorthms January, 09 Lecture #3: Amortzed Analyss last changed: January 8, 09 Introducton In ths lecture we dscuss a useful form of analyss, called amortzed analyss, for problems
More informationElton, Gruber, Brown, and Goetzmann. Modern Portfolio Theory and Investment Analysis, 7th Edition. Solutions to Text Problems: Chapter 16
lton, Gruer, rown, and Goetzmann Modern Portfolo Theory and Investment nalyss, 7th dton Solutons to Text Prolems: hapter 6 hapter 6: Prolem From the text we know that three ponts determne a plane. The
More information2.1 Rademacher Calculus... 3
COS 598E: Unsupervsed Learnng Week 2 Lecturer: Elad Hazan Scrbe: Kran Vodrahall Contents 1 Introducton 1 2 Non-generatve pproach 1 2.1 Rademacher Calculus............................... 3 3 Spectral utoencoders
More informationSIMPLE FIXED-POINT ITERATION
SIMPLE FIXED-POINT ITERATION The fed-pont teraton method s an open root fndng method. The method starts wth the equaton f ( The equaton s then rearranged so that one s one the left hand sde of the equaton
More informationWhat is Monte Carlo Simulation? Monte Carlo Simulation
Wht is Monte Crlo Simultion? Monte Crlo methods re widely used clss of computtionl lgorithms for simulting the ehvior of vrious physicl nd mthemticl systems, nd for other computtions. Monte Crlo lgorithm
More informationCompiler construction in4303 lecture 4. Overview. Bottom-up (LR) parsing. LR(0) parsing. LR(0) parsing. LR(0) parsing. Compiler construction lecture 4
Compler constructon lecture Compler constructon n lecture Bottom-up prsng Chpter.. Overvew synt nlyss: tokens S lnguge grmmr prser genertor ottom-up prsng push-down utomton CION/GOO tles LR(), SLR(), LR(),
More informationTHE FINAL PROOF SUPPORTING THE TURNOVER FORMULA.
THE FINAL PROOF SUPPORTING THE TURNOVER FORMULA. I would like to thnk Aris for his mthemticl contriutions nd his swet which hs enled deeper understnding of the turnover formul to emerge. His contriution
More informationA Theoretical and Empirical Analysis of Expected Sarsa
A Theoretcl nd Emprcl Anlyss of Expected Srs Hrm vn Sejen, Hdo vn Hsselt, Shmon Whteson nd Mrco Werng Abstrct Ths pper presents theoretcl nd emprcl nlyss of Expected Srs, vrton on Srs, the clssc onpolcy
More informationCache CPI and DFAs and NFAs. CS230 Tutorial 10
Cche CPI nd DFAs nd NFAs CS230 Tutoril 10 Multi-Level Cche: Clculting CPI When memory ccess is ttempted, wht re the possible results? ccess miss miss CPU L1 Cche L2 Cche Memory L1 cche hit L2 cche hit
More informationLecture 7. We now use Brouwer s fixed point theorem to prove Nash s theorem.
Topcs on the Border of Economcs and Computaton December 11, 2005 Lecturer: Noam Nsan Lecture 7 Scrbe: Yoram Bachrach 1 Nash s Theorem We begn by provng Nash s Theorem about the exstance of a mxed strategy
More informationElements of Economic Analysis II Lecture VI: Industry Supply
Elements of Economc Analyss II Lecture VI: Industry Supply Ka Hao Yang 10/12/2017 In the prevous lecture, we analyzed the frm s supply decson usng a set of smple graphcal analyses. In fact, the dscusson
More informationTests for Two Correlations
PASS Sample Sze Software Chapter 805 Tests for Two Correlatons Introducton The correlaton coeffcent (or correlaton), ρ, s a popular parameter for descrbng the strength of the assocaton between two varables.
More informationA ppendix to. I soquants. Producing at Least Cost. Chapter
A ppendix to Chpter 0 Producing t est Cost This ppendix descries set of useful tools for studying firm s long-run production nd costs. The tools re isoqunts nd isocost lines. I soqunts FIGURE A0. SHOWS
More informationSurvey of Math: Chapter 22: Consumer Finance Borrowing Page 1
Survey of Math: Chapter 22: Consumer Fnance Borrowng Page 1 APR and EAR Borrowng s savng looked at from a dfferent perspectve. The dea of smple nterest and compound nterest stll apply. A new term s the
More informationAppendix - Normally Distributed Admissible Choices are Optimal
Appendx - Normally Dstrbuted Admssble Choces are Optmal James N. Bodurtha, Jr. McDonough School of Busness Georgetown Unversty and Q Shen Stafford Partners Aprl 994 latest revson September 00 Abstract
More informationFinal Exam. 7. (10 points) Please state whether each of the following statements is true or false. No explanation needed.
Fnal Exam Fall 4 Econ 8-67 Closed Book. Formula Sheet Provded. Calculators OK. Tme Allowed: hours Please wrte your answers on the page below each queston. (5 ponts) Assume that the rsk-free nterest rate
More informationUnderstanding Annuities. Some Algebraic Terminology.
Understandng Annutes Ma 162 Sprng 2010 Ma 162 Sprng 2010 March 22, 2010 Some Algebrac Termnology We recall some terms and calculatons from elementary algebra A fnte sequence of numbers s a functon of natural
More informationTopics Covered: Rules of indices Expanding bracketed expressions Factorisation of simple algebraic expressions
Algebr Workshop: Algebr Topics Covered: Rules of indices Expnding brcketed expressions Fctoristion of siple lgebric expressions Powers A power is used when nuber is ultiplied by itself severl ties. For
More informationCHAPTER 16: PORTFOLIO OPTIMIZATION USING SOLVER
EMSE 388 Quntttve Methods n Cost Engneerng CHAPTER 6: PORTFOLIO OPTIMIZATIO USIG SOLVER PROBLEM DEFIITIO: Gven set of nvestments (for emple stocks) how do we fnd portfolo tht hs the lowest rsk (.e. lowest
More informationParsing beyond context-free grammar: Tree Adjoining Grammar Parsing I
Parsng beyond context-free grammar: Tree donng Grammar Parsng I Laura Kallmeyer, Wolfgang Maer ommersemester 2009 duncton and substtuton (1) Tree donng Grammars (TG) Josh et al. (1975), Josh & chabes (1997):
More information2) In the medium-run/long-run, a decrease in the budget deficit will produce:
4.02 Quz 2 Solutons Fall 2004 Multple-Choce Questons ) Consder the wage-settng and prce-settng equatons we studed n class. Suppose the markup, µ, equals 0.25, and F(u,z) = -u. What s the natural rate of
More informationMEG 741 Energy and Variational Methods in Mechanics I
MEG 74 Energ n Vrtonl Methos n Mechncs I Brenn J. O Toole, Ph.D. Assocte Professor of Mechncl Engneerng Howr R. Hghes College of Engneerng Unverst of ev Ls Vegs TBE B- (7) 895-3885 j@me.nlv.e Chpter :
More informationGet Solution of These Packages & Learn by Video Tutorials on KEY CONCEPTS
FREE Downlod Study Pckge from wesite: www.tekoclsses.com & www.mthsbysuhg.com Get Solution of These Pckges & Lern y Video Tutorils on www.mthsbysuhg.com KEY CONCEPTS THINGS TO REMEMBER :. The re ounded
More informationECE 586GT: Problem Set 2: Problems and Solutions Uniqueness of Nash equilibria, zero sum games, evolutionary dynamics
Unversty of Illnos Fall 08 ECE 586GT: Problem Set : Problems and Solutons Unqueness of Nash equlbra, zero sum games, evolutonary dynamcs Due: Tuesday, Sept. 5, at begnnng of class Readng: Course notes,
More informationResearch Article Existence of Positive Solution to Second-Order Three-Point BVPs on Time Scales
Hindwi Publishing Corportion Boundry Vlue Problems Volume 2009, Article ID 685040, 6 pges doi:10.1155/2009/685040 Reserch Article Existence of Positive Solution to Second-Order hree-point BVPs on ime Scles
More informationCOS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture #21 Scribe: Lawrence Diao April 23, 2013
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #21 Scrbe: Lawrence Dao Aprl 23, 2013 1 On-Lne Log Loss To recap the end of the last lecture, we have the followng on-lne problem wth N
More informationMath F412: Homework 4 Solutions February 20, κ I = s α κ α
All prts of this homework to be completed in Mple should be done in single worksheet. You cn submit either the worksheet by emil or printout of it with your homework. 1. Opre 1.4.1 Let α be not-necessrily
More informationNote on Cubic Spline Valuation Methodology
Note on Cubc Splne Valuaton Methodology Regd. Offce: The Internatonal, 2 nd Floor THE CUBIC SPLINE METHODOLOGY A model for yeld curve takes traded yelds for avalable tenors as nput and generates the curve
More informationCS 286r: Matching and Market Design Lecture 2 Combinatorial Markets, Walrasian Equilibrium, Tâtonnement
CS 286r: Matchng and Market Desgn Lecture 2 Combnatoral Markets, Walrasan Equlbrum, Tâtonnement Matchng and Money Recall: Last tme we descrbed the Hungaran Method for computng a maxmumweght bpartte matchng.
More informationFinancial mathematics
Fnancal mathematcs Jean-Luc Bouchot jean-luc.bouchot@drexel.edu February 19, 2013 Warnng Ths s a work n progress. I can not ensure t to be mstake free at the moment. It s also lackng some nformaton. But
More informationA Closer Look at Bond Risk: Duration
W E B E X T E S I O 4C A Closer Look t Bond Risk: Durtion This Extension explins how to mnge the risk of bond portfolio using the concept of durtion. BOD RISK In our discussion of bond vlution in Chpter
More informationMath 210 Exam 4 - Practice Problem Solutions. 1. Answer the following questions based on the rooted tree shown below:
Mt 0 Exm 4 - Prctce Proem Soutons. Answer te foowng questons se on te roote tree sown eow: c m n o p q r s t () Lst te cren of vertex. n,o,p () Lst te ncestors of vertex s m,,,, (c) Lst te sngs of vertex
More informationOPERATIONS RESEARCH. Game Theory
OPERATIONS RESEARCH Chapter 2 Game Theory Prof. Bbhas C. Gr Department of Mathematcs Jadavpur Unversty Kolkata, Inda Emal: bcgr.umath@gmal.com 1.0 Introducton Game theory was developed for decson makng
More informationII. Random Variables. Variable Types. Variables Map Outcomes to Numbers
II. Random Varables Random varables operate n much the same way as the outcomes or events n some arbtrary sample space the dstncton s that random varables are smply outcomes that are represented numercally.
More information/ Computational Genomics. Normalization
0-80 /02-70 Computatonal Genomcs Normalzaton Gene Expresson Analyss Model Computatonal nformaton fuson Bologcal regulatory networks Pattern Recognton Data Analyss clusterng, classfcaton normalzaton, mss.
More informationMajor: All Engineering Majors. Authors: Autar Kaw, Jai Paul
Secant Method Major: All Engneerng Majors Authors: Autar Kaw, Ja Paul http://numercalmethods.eng.us.edu Transormng Numercal Methods Educaton or STEM Undergraduates /0/00 http://numercalmethods.eng.us.edu
More informationEXAMINATIONS OF THE HONG KONG STATISTICAL SOCIETY
EXAMINATIONS OF THE HONG KONG STATISTICAL SOCIETY HIGHER CERTIFICATE IN STATISTICS, 2013 MODULE 7 : Tme seres and ndex numbers Tme allowed: One and a half hours Canddates should answer THREE questons.
More informationAn introduction to quasi-random numbers
An ntroducton to quas-random numbers By George Levy, umercal Algorthms Grou Ltd. Introducton Monte-Carlo smulaton and random number generaton are technques that are wdely used n fnancal engneerng as a
More informationCapability Analysis. Chapter 255. Introduction. Capability Analysis
Chapter 55 Introducton Ths procedure summarzes the performance of a process based on user-specfed specfcaton lmts. The observed performance as well as the performance relatve to the Normal dstrbuton are
More informationCS 541 Algorithms and Programs. Exam 1 Solutions
CS 5 Algortms and Programs Exam Solutons Jonatan Turner 9/5/0 Be neat and concse, ut complete.. (5 ponts) An ncomplete nstance of te wgrap data structure s sown elow. Fll n te mssng felds for te adjacency
More informationProbability Distributions. Statistics and Quantitative Analysis U4320. Probability Distributions(cont.) Probability
Statstcs and Quanttatve Analss U430 Dstrbutons A. Dstrbutons: How do smple probablt tables relate to dstrbutons?. What s the of gettng a head? ( con toss) Prob. Segment 4: Dstrbutons, Unvarate & Bvarate
More informationOptimal Binary Search Trees (and a second example of dynamic programming): [ref:
Topc CS 466/666 Fll 2008 Optml Bry Serch Trees (d secod exmple of dymc progrmmg): [ref: Corme Leserso, Rvest d Ste secto 5.5] We strt wth smple prolem regrdg ry serch trees evromet whch the proltes of
More informationPrice and Quantity Competition Revisited. Abstract
rce and uantty Competton Revsted X. Henry Wang Unversty of Mssour - Columba Abstract By enlargng the parameter space orgnally consdered by Sngh and Vves (984 to allow for a wder range of cost asymmetry,
More informationChapter 10 Making Choices: The Method, MARR, and Multiple Attributes
Chapter 0 Makng Choces: The Method, MARR, and Multple Attrbutes INEN 303 Sergy Butenko Industral & Systems Engneerng Texas A&M Unversty Comparng Mutually Exclusve Alternatves by Dfferent Evaluaton Methods
More informationTopics on the Border of Economics and Computation November 6, Lecture 2
Topcs on the Border of Economcs and Computaton November 6, 2005 Lecturer: Noam Nsan Lecture 2 Scrbe: Arel Procacca 1 Introducton Last week we dscussed the bascs of zero-sum games n strategc form. We characterzed
More informationTrigonometry - Activity 21 General Triangle Solution: Given three sides.
Nme: lss: p 43 Mths Helper Plus Resoure Set. opyright 003 rue. Vughn, Tehers hoie Softwre Trigonometry - tivity 1 Generl Tringle Solution: Given three sides. When the three side lengths '', '' nd '' of
More information9.3. Regular Languages
9.3. REGULAR LANGUAGES 139 9.3. Regulr Lnguges 9.3.1. Properties of Regulr Lnguges. Recll tht regulr lnguge is the lnguge ssocited to regulr grmmr, i.e., grmmr G = (N, T, P, σ) in which every production
More informationTests for Two Ordered Categorical Variables
Chapter 253 Tests for Two Ordered Categorcal Varables Introducton Ths module computes power and sample sze for tests of ordered categorcal data such as Lkert scale data. Assumng proportonal odds, such
More informationTechnical Appendix. The Behavior of Growth Mixture Models Under Nonnormality: A Monte Carlo Analysis
Monte Crlo Technicl Appendix 1 Technicl Appendix The Behvior of Growth Mixture Models Under Nonnormlity: A Monte Crlo Anlysis Dniel J. Buer & Ptrick J. Currn 10/11/2002 These results re presented s compnion
More informationWages as Anti-Corruption Strategy: A Note
DISCUSSION PAPER November 200 No. 46 Wages as Ant-Corrupton Strategy: A Note by dek SAO Faculty of Economcs, Kyushu-Sangyo Unversty Wages as ant-corrupton strategy: A Note dek Sato Kyushu-Sangyo Unversty
More informationS yi a bx i cx yi a bx i cx 2 i =0. yi a bx i cx 2 i xi =0. yi a bx i cx 2 i x
LEAST-SQUARES FIT (Chapter 8) Ft the best straght lne (parabola, etc.) to a gven set of ponts. Ths wll be done by mnmzng the sum of squares of the vertcal dstances (called resduals) from the ponts to the
More informationCUTTING STOCK PROBLEM: SOLUTION BEHAVIORS
www.rppress.com/volumes/vol6issue4/ijrras_6_4_09.pdf CUTTING STOCK PROBLEM: SOLUTION BEHAVIORS Izzeddn A. O. Abuhssn 1 & Hebh H. O. Nsereddn 2 1 Ammn Arb Unversty, (buhssn@newsoft.ps) 2 Mddle Est Unversty,
More informationMechanisms for Efficient Allocation in Divisible Capacity Networks
Mechansms for Effcent Allocaton n Dvsble Capacty Networks Antons Dmaks, Rahul Jan and Jean Walrand EECS Department Unversty of Calforna, Berkeley {dmaks,ran,wlr}@eecs.berkeley.edu Abstract We propose a
More informationChapter 3 Descriptive Statistics: Numerical Measures Part B
Sldes Prepared by JOHN S. LOUCKS St. Edward s Unversty Slde 1 Chapter 3 Descrptve Statstcs: Numercal Measures Part B Measures of Dstrbuton Shape, Relatve Locaton, and Detectng Outlers Eploratory Data Analyss
More informationISE High Income Index Methodology
ISE Hgh Income Index Methodology Index Descrpton The ISE Hgh Income Index s desgned to track the returns and ncome of the top 30 U.S lsted Closed-End Funds. Index Calculaton The ISE Hgh Income Index s
More informationMacroeconomic Theory and Policy
ECO 209 Macroeconomc Theory and Polcy Lecture 7: The Open Economy wth Fxed Exchange Rates Gustavo Indart Slde 1 Open Economy under Fxed Exchange Rates Let s consder an open economy wth no captal moblty
More informationCOMPARISON OF THE ANALYTICAL AND NUMERICAL SOLUTION OF A ONE-DIMENSIONAL NON-STATIONARY COOLING PROBLEM. László Könözsy 1, Mátyás Benke 2
COMPARISON OF THE ANALYTICAL AND NUMERICAL SOLUTION OF A ONE-DIMENSIONAL NON-STATIONARY COOLING PROBLEM László Könözsy 1, Mátyás Benke Ph.D. Student 1, Unversty Student Unversty of Mskolc, Department of
More informationIntroduction. Chapter 7 - An Introduction to Portfolio Management
Introducton In the next three chapters, we wll examne dfferent aspects of captal market theory, ncludng: Brngng rsk and return nto the pcture of nvestment management Markowtz optmzaton Modelng rsk and
More informationHewlett Packard 10BII Calculator
Hewlett Packard 0BII Calculator Keystrokes for the HP 0BII are shown n the tet. However, takng a mnute to revew the Quk Start secton, below, wll be very helpful n gettng started wth your calculator. Note:
More informationMultifactor Term Structure Models
1 Multfactor Term Structure Models A. Lmtatons of One-Factor Models 1. Returns on bonds of all maturtes are perfectly correlated. 2. Term structure (and prces of every other dervatves) are unquely determned
More informationThe convolution computation for Perfectly Matched Boundary Layer algorithm in finite differences
The convoluton computaton for Perfectly Matched Boundary Layer algorthm n fnte dfferences Herman Jaramllo May 10, 2016 1 Introducton Ths s an exercse to help on the understandng on some mportant ssues
More informationPrinciples of Finance
Prncples of Fnance Grzegorz Trojanowsk Lecture 6: Captal Asset Prcng Model Prncples of Fnance - Lecture 6 1 Lecture 6 materal Requred readng: Elton et al., Chapters 13, 14, and 15 Supplementary readng:
More informationMeasures of Spread IQR and Deviation. For exam X, calculate the mean, median and mode. For exam Y, calculate the mean, median and mode.
Part 4 Measures of Spread IQR and Devaton In Part we learned how the three measures of center offer dfferent ways of provdng us wth a sngle representatve value for a data set. However, consder the followng
More informationEDC Introduction
.0 Introducton EDC3 In the last set of notes (EDC), we saw how to use penalty factors n solvng the EDC problem wth losses. In ths set of notes, we want to address two closely related ssues. What are, exactly,
More informationProblem Set for Chapter 3: Simple Regression Analysis ECO382 Econometrics Queens College K.Matsuda
Problem Set for Chpter 3 Simple Regression Anlysis ECO382 Econometrics Queens College K.Mtsud Excel Assignments You re required to hnd in these Excel Assignments by the due Mtsud specifies. Legibility
More informationInternational ejournals
Avalable onlne at www.nternatonalejournals.com ISSN 0976 1411 Internatonal ejournals Internatonal ejournal of Mathematcs and Engneerng 7 (010) 86-95 MODELING AND PREDICTING URBAN MALE POPULATION OF BANGLADESH:
More informationInequality, imperfect competition, and fiscal policy
MRA Munch ersonl ReEc Archve Inequlty, mperfect competton, nd fscl polcy vlos Blmtss 4 October 07 Onlne t https://mpr.ub.un-muenchen.de/8556/ MRA per No. 8556, posted 0 November 07 07:09 UTC Inequlty,
More informationFORD MOTOR CREDIT COMPANY SUGGESTED ANSWERS. Richard M. Levich. New York University Stern School of Business. Revised, February 1999
FORD MOTOR CREDIT COMPANY SUGGESTED ANSWERS by Rchard M. Levch New York Unversty Stern School of Busness Revsed, February 1999 1 SETTING UP THE PROBLEM The bond s beng sold to Swss nvestors for a prce
More informationLinear Combinations of Random Variables and Sampling (100 points)
Economcs 30330: Statstcs for Economcs Problem Set 6 Unversty of Notre Dame Instructor: Julo Garín Sprng 2012 Lnear Combnatons of Random Varables and Samplng 100 ponts 1. Four-part problem. Go get some
More informationChapter55. Algebraic expansion and simplification
Chpter55 Algebric expnsion nd simplifiction Contents: A The distributive lw B The product ( + b)(c + d) C Difference of two squres D Perfect squres expnsion E Further expnsion F The binomil expnsion 88
More informationISyE 512 Chapter 9. CUSUM and EWMA Control Charts. Instructor: Prof. Kaibo Liu. Department of Industrial and Systems Engineering UW-Madison
ISyE 512 hapter 9 USUM and EWMA ontrol harts Instructor: Prof. Kabo Lu Department of Industral and Systems Engneerng UW-Madson Emal: klu8@wsc.edu Offce: Room 317 (Mechancal Engneerng Buldng) ISyE 512 Instructor:
More informationProbabilistic Graphical Models
Probblstc Grphcl Models Brown Unversty CSCI 950-P Sprng 03 Pr. Erk Sudderth Lecture : Convexty Dulty nd Men Feld Methods Some fgures nd exmples courtesy M. Wnwrght & M. Jordn Grphcl Models Exponentl Fmles
More informationOutline. CSE 326: Data Structures. Priority Queues Leftist Heaps & Skew Heaps. Announcements. New Heap Operation: Merge
CSE 26: Dt Structures Priority Queues Leftist Heps & Skew Heps Outline Announcements Leftist Heps & Skew Heps Reding: Weiss, Ch. 6 Hl Perkins Spring 2 Lectures 6 & 4//2 4//2 2 Announcements Written HW
More informationLecture Note 2 Time Value of Money
Seg250 Management Prncples for Engneerng Managers Lecture ote 2 Tme Value of Money Department of Systems Engneerng and Engneerng Management The Chnese Unversty of Hong Kong Interest: The Cost of Money
More informationOnline Appendix for Merger Review for Markets with Buyer Power
Onlne Appendx for Merger Revew for Markets wth Buyer Power Smon Loertscher Lesle M. Marx July 23, 2018 Introducton In ths appendx we extend the framework of Loertscher and Marx (forthcomng) to allow two
More informationJeffrey Ely. October 7, This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License.
October 7, 2012 Ths work s lcensed under the Creatve Commons Attrbuton-NonCommercal-ShareAlke 3.0 Lcense. Recap We saw last tme that any standard of socal welfare s problematc n a precse sense. If we want
More informationProblem Set 6 Finance 1,
Carnege Mellon Unversty Graduate School of Industral Admnstraton Chrs Telmer Wnter 2006 Problem Set 6 Fnance, 47-720. (representatve agent constructon) Consder the followng two-perod, two-agent economy.
More informationArithmetic and Geometric Sequences
Arithmetic nd Geometric Sequences A sequence is list of numbers or objects, clled terms, in certin order. In n rithmetic sequence, the difference between one term nd the next is lwys the sme. This difference
More informationDr. A. Sudhakaraiah* V. Rama Latha E.Gnana Deepika
Internatonal Journal Of Scentfc & Engneerng Research, Volume, Issue 6, June-0 ISSN - Splt Domnatng Set of an Interval Graph Usng an Algorthm. Dr. A. Sudhakaraah* V. Rama Latha E.Gnana Deepka Abstract :
More informationA Bootstrap Confidence Limit for Process Capability Indices
A ootstrap Confdence Lmt for Process Capablty Indces YANG Janfeng School of usness, Zhengzhou Unversty, P.R.Chna, 450001 Abstract The process capablty ndces are wdely used by qualty professonals as an
More informationProblems to be discussed at the 5 th seminar Suggested solutions
ECON4260 Behavoral Economcs Problems to be dscussed at the 5 th semnar Suggested solutons Problem 1 a) Consder an ultmatum game n whch the proposer gets, ntally, 100 NOK. Assume that both the proposer
More informationCHAPTER 9 FUNCTIONAL FORMS OF REGRESSION MODELS
CHAPTER 9 FUNCTIONAL FORMS OF REGRESSION MODELS QUESTIONS 9.1. (a) In a log-log model the dependent and all explanatory varables are n the logarthmc form. (b) In the log-ln model the dependent varable
More informationMathematical Thinking Exam 1 09 October 2017
Mathematcal Thnkng Exam 1 09 October 2017 Name: Instructons: Be sure to read each problem s drectons. Wrte clearly durng the exam and fully erase or mark out anythng you do not want graded. You may use
More informationarxiv: v2 [math.co] 6 Apr 2016
On the number of equvalence classes of nvertble Boolean functons under acton of permutaton of varables on doman and range arxv:1603.04386v2 [math.co] 6 Apr 2016 Marko Carć and Modrag Žvkovć Abstract. Let
More informationBuckling of Stiffened Panels 1 overall buckling vs plate buckling PCCB Panel Collapse Combined Buckling
Buckling of Stiffened Pnels overll uckling vs plte uckling PCCB Pnel Collpse Comined Buckling Vrious estimtes hve een developed to determine the minimum size stiffener to insure the plte uckles while the
More informationPSAS: Government transfers what you need to know
PSAS: Government trnsfers wht you need to know Ferury 2018 Overview This summry will provide users with n understnding of the significnt recognition, presenttion nd disclosure requirements of the stndrd.
More informationJean-Paul Murara, Västeras, 26-April Mälardalen University, Sweden. Pricing EO under 2-dim. B S PDE by. using the Crank-Nicolson Method
Prcng EO under Mälardalen Unversty, Sweden Västeras, 26-Aprl-2017 1 / 15 Outlne 1 2 3 2 / 15 Optons - contracts that gve to the holder the rght but not the oblgaton to buy/sell an asset sometmes n the
More information