Goal. Adaptive Finite Element Methods for Non-Stationary Convection-Diffusion Problems. Outline. Differential Equation
|
|
- Jeffry George
- 5 years ago
- Views:
Transcription
1 Goal Adaptive Fiite Elemet Methods for No-Statioary Covectio-Diffusio Problems R. Verfürth Ruhr-Uiversität Bochum Tübige / July 0th, 017 Preset space-time adaptive fiite elemet methods for o-statioary covectio-diffusio equatios based o stable discretizatios ad a posteriori error estimates. A posteriori error estimates should yield upper ad lower bouds for the eergy orm of the error that are uiform with respect to all possible relative sizes of covectio to diffusio. Use a commo framework for various stabilizatio methods. 1/ 3 / 3 Outlie Discretizatio Cocludig Remarks Differetial Equatio t u ε u + a u + βu = f i Ω 0, T ] u = 0 o Γ 0, T ] u = u 0 i Ω 0 < ε 1, β 0, a R d, a = 1, f piecewise polyomial. Results hold for geeral f, variable coefficiets, ad mixed boudary coditios. The ε is a lower boud for the smallest eigevalue of the diffusio ad β is a lower boud for b 1 div a with b deotig the reactio. Geeral right-had sides f ad variable coefficiets give rise to additioal oscillatio terms. All estimates should be uiform w.r.t. ε. 3/ 3 4/ 3
2 Norms Fid u L 0, T ; H0 1Ω with tu L 0, T ; H 1 Ω such that u = u 0 i L ad for all t 0, T ad all v H0 1Ω t u, v + {ε u v + a uv + βuv} = fv Ω } {{ } Ω }{{} =Bu,v = l, v Eergy orm v = { ε v + β v } 1 ϕ, v Dual orm ϕ = sup v H0 1Ω\{0} v Error orm { u Xa,b = ess. sup u, t + t a,b + b a b a u, t dt t u + a u, t dt } 1 5/ 3 6/ 3 Discretizatio Discretizatio Meshes ad Spaces I = {t 1, t ] : 1 N I } partitio of [0, T ]. τ = t t 1. T, 0 N I, affie equivalet, admissible, shape regular partitios of Ω. Trasitio coditio: There is a commo refiemet T of T ad such that h K ch K for all K T ad all K T with K K. X H 1 0 Ω fiite elemet space correspodig to T. Discrete Problem Fid u T X, 0 N I, such that u 0 T 0 = π 0 u 0 ad, for = 1,..., N I ad all v X with U θ = θ u T + 1 θ u 1 u, v + BU θ, v + S U θ, v = l, v τ The stabilizatio term S is supposed to be liear i its secod argumet ad affie i its first argumet, it may deped o T ad o f. Solutio u I is cotiuous piece-wise affie ad equals u T at t. 7/ 3 8/ 3
3 Discretizatio Stabilizatios Streamlie diffusio method S u, v = K ϑ K K { tu ε u + a u + βu f}a v with ϑ K a ch K Cotiuous iterior pealty method S u, v = E ϑ E E J Ea uj E a v with ϑ E ch E Local projectio scheme S u, v = M ϑ M M κ M a u κ M a v with ϑ M a ch M ad I κ M projectio oto S l, 1 M Subgrid scale approach S u, v = K ϑ K K a Π u a Π v with ϑ K a ch K ad Π projectio oto Y X Basic Steps Error ad residual are equivalet. The residual splits ito a spatial ad a temporal residual. The orm of the sum of these is equivalet to the sum of their orms. Derive a reliable, efficiet ad robust error idicator for the temporal residual. Derive a reliable, efficiet ad robust error idicator for the spatial residual. All stabilizatios yield the same spatial error idicator. 9/ 3 10/ 3 Equivalece of Error ad Residual Proof of the Equivalece u I is cotiuous piece-wise affie ad equals u T at t. Residual: Ru I, v = l, v t u I, v Bu I, v Lower error-boud: Ru I L t 1,t ;H 1 u u I Xt 1,t Upper error-boud: u u I X0,t {4 u 0 π 0 u 0 +6 Ru I L 0,t ;H 1 } 1 Relatio of residual ad error: Ru I, v = t e, v + Be, v Lower error-boud: Defiitio of primal ad dual orm plus Cauchy-Schwarz iequality. Upper error-boud: Parabolic eergy estimate with v = e as test-fuctio. 11/ 3 1/ 3
4 Decompositio of the Residual Recall U θ = θ u T + 1 θ u 1 Temporal residual: R τ u I, v = BU θ u I, v Spatial residual: R h u I, v = l, v t u I, v BU θ, v Splittig: Ru I = R τ u I + R h u I Estimate for L t 1, t ; H 1 -orms: 1 { R τ u I + R h u I } 1 R τ u I + R h u I 13 R τ u I + R h u I Motivatio of the Lower Boud Stregtheed Cauchy-Schwarz iequality for v = c ad w = b t b a : b a Hece: vw = 1 cb a = 3 v a,b w a,b v + w a,b 1 3 { } v a,b + w a,b 13/ 3 14/ 3 Proof of the Lower Boud R h u I is piece-wise costat. R τ u I is piece-wise affie: R τ u I = ρ, v = Bu T, v. Choose v, w H0 1 Ω such that θ t t 1 τ ρ with v = R h u I, R h u I, v = R h u I, w = ρ, ρ, w = ρ. Isert 3 t t 1 τ v + t t τ w as test-fuctio i represetatio of Ru I. Estimatio of the Temporal Residual R τ u I = θ t t 1 τ ρ with ρ, v = Bu T, v. Upper boud: ρ u T a + u Follows from defiitio of ρ ad. Lower boud: 1 { u 3 a + u } ρ 15/ 3 16/ 3
5 Proof of the Lower Boud Set w = u T ad choose v H0 1 Ω with v = a w ad a w, v = a w Isert 1 w + 1 v i the defiitio of ρ : ρ, 1 w + 1 v = 1 ε w, w + 1 βw, w + 1 }{{} a w, w }{{} = 1 w =0 Estimatio of the Covective Derivative I Assume that a c c ε. Friedrichs iequality implies a u T, v a u T c Ω v. Hece a u T u c c c Ω T 1 ad a u T is equivalet to u T. + 1 ε w, v + 1 βw, v + 1 }{{} a w, v }{{} 1 w a w = 1 a w 17/ 3 18/ 3 Estimatio of the Covective Derivative II Assume that a ε. Auxiliary problem with aalytical ad discrete solutios Φ ad Φ : ε ϕ, ψ + β ϕ, ψ = a u T, ψ 1 3 { Φ T + Φ Φ } a u T Φ + Φ Φ Φ Φ is equivalet to robust residual error idicator η τ for. Hece a u T is equivalet to Φ + η τ. Estimatio of the Spatial Residual Spatial error idicator ηh : ηh = α K R K K + K { T } α S = mi ε 1 h S, β 1 ε 1 E E αe R E E R K ad R E are the usual elemet ad iterface residuals. Stadard argumets for statioary problems yield: R h u I c η h + I MR h u I, η h c R h u I. I M R hu I measures the cosistecy error of the stabilizatio. c, c oly deped o the polyomial degrees ad o the shape parameters of the partitios T. 1 19/ 3 0/ 3
6 Proof of the Upper Boud L -represetatio: R h u I, v = rv + Ω Σ jv Quasi-iterpolatio error estimate: v I M v K cα K v ωk Trace iequality: v E E K v K + h K E v K K v K Proof of the Lower Boud Isert ψ K R K i L -represetatio with stadard elemet cut-off fuctios ψ K. Isert ψ E,ϑ R E i L -represetatio with squeezed face cut-off fuctios ψ E,ϑ ad ϑ = ε 1 h 1 E α E = mi { 1, ε 1 h 1 E β 1 F 1 E,K F E,K }. Φ ϑ 1/ 3 / 3 Estimatio of the cosistecy error I M R hu I I MR h u I = R h u I, I M v sup v H0 1Ω v S u I, I M v = sup v H0 1Ω v Streamlie diffusio ad iterior pealty methods: I MR h u I cη h Local projectio scheme ad subgrid-scale approach: I M v ker κ M ad I M v ker Π hece I M R hu I = 0. A Posteriori Error Estimate Defie the space-time error estimator by: =η 1 τ {}}{ η = τ 1 η h }{{ + u T } + Φ + η τ. }{{} spatial temporal The } N e X0,T c { u 1 I 0 π 0 u 0 + η, η c e Xt 1,t. =1 c, c oly deped o the polyomial degrees ad the shape parameters of the partitios T. 3/ 3 4/ 3
7 Overview The adaptive Algorithm yields a solutio such that, for all times, its error is below a prescribed tolerace eps. The algorithm cosists of several modules that coarse ad refie spatial meshes. A a priori boud for the eergy of the discrete solutio guaratees that the fial time is actually reached withi a fiite umber of time-steps. The coarseig of spatial meshes leads to a icrease i the eergy of the discrete solutio which must effectively be cotrolled. Results hold for reactio-diffusio problems with domiat diffusio, ie. a = 0 ad β c r ε. Adaptive Space-Time Algorithm 1. Give τ 0 ad eps, choose ε 0, ε h,τ, ε such that ε 0 + T ε h,τ + ε = eps. Set = 0.. Determie T 0 ad π 0 u 0 such that u 0 π 0 u 0 ε Set τ = ε / f Ω 0,T + π 0u 0 miimal time-step. 4. Icremet by 1 ad set τ = mi{τ 1, T t 1 }. 5. Determie T = COARSENu 1,. 6. Determie u T, τ, T = ADAPTu 1, τ, T,, ε h,τ ad compute the eergy-icremet η, = π u 1 u 1 1 u τ π u If η, 0, go to 8. Otherwise determie T = REFINEη,, T, ad go to If t 1 + τ = T, stop. Otherwise go to 4. 5/ 3 6/ 3 Module COARSEN Module REFINE COARSENu 1, produces a partial coarseig of. This module may ot be based o a error idicator at all; its output may be idepedet of u 1 ad may equal. This module should remove as may degrees of freedom as possible while keepig the differece of u 1 to a suitable iterpolatio i the resultig fiite elemet space at a moderate size. This module is used i two differet ways depedig o its iput argumets. Give a partitio T ad a error idicator η = K η K 1, REFINEη, T produces a ew admissible partitio such that at least oe elemet i the subset argmax K T η K of T is refied. Give a partitio T, a associated error idicator η ad a secod partitio T, REFINEη, T, T has the same effect as REFINEη, T with the additioal coditio that at least oe elemet of T \ T which has previously bee coarseed is refied. 7/ 3 8/ 3
8 Module ADAPT 1. Solve the discrete problem for T ad τ ; compute η τ, η h.. If ητ + ηh ε h,τ, stop; otherwise go to If ηh > η τ, set T = REFINEηh, T ad go to 1; else set η 1 = u π u 1 ad η = 4. If τ > τ go to 5; else go to If η 1 > η, set τ = max{ 1 τ, τ }; else set T = REFINEη h, T, ad go to If ηh + η ε h,τ, stop; else go to 7. u 1 π u If η h > η, set T = REFINEη h, T ; else set T = REFINEη h, T,. Go to 1. Covergece Proof Difficulty: The goal η eps ivolves all times while, at ay itermediate time, oly iformatio up to that time is available. Basic steps: Prove a a priori boud for the discrete eergy depedig oly o the give data. Usig covergece results for statioary problems, prove the termiatio of the module REFINE. Prove the termiatio of the module ADAPT. 9/ 3 30/ 3 Cocludig Remarks Cocludig Remarks Modificatios ad Ope Problems Istead o parabolic eergy estimates, oe ca also base the a posteriori error aalysis o properties of the evolutio operator ad elliptic recostructio. This is a alterative way to decouple the temporal ad spatial error. For the spatial error oe may also use other a posteriori error idicators, e.g. auxiliary local discrete problems, Hdiv-liftigs,.... These, however, may ot be robust. Mildly oliear problems may be hadled similarly. The results, however, are less complete ad are based o the assumptio that the variatioal solutio is a regular oe i the sese of the implicit fuctio theorem. Cotrary to statioary problems, for time-depedet problems, the optimality of the adaptive algorithm is completely ope. Refereces Hadout of this talk C. Kreuzer, C. A. Möller, A. Schmidt, K.-G. Siebert Desig ad covergece aalysis for a adaptive discretizatio of the heat equatio IMA J. Numer. Aal. 3 01, o. 4, L. Tobiska, R. Verfürth Robust a posteriori error estimates for stabilized fiite elemet methods IMA J. Numer. Aal , o. 4, R. Verfürth A Posteriori Error Estimatio Techiques for Fiite Elemet Methods Oxford Uiversity Press / 3 3/ 3
Goal. Robust A Posteriori Error Estimates for Stabilized Finite Element Discretizations of Non-Stationary Convection-Diffusion Problems.
Robust A Posteriori Error Estimates for Stabilized Finite Element s of Non-Stationary Convection-Diffusion Problems L. Tobiska and R. Verfürth Universität Magdeburg Ruhr-Universität Bochum www.ruhr-uni-bochum.de/num
More informationAlgebra of Least Squares
October 19, 2018 Algebra of Least Squares Geometry of Least Squares Recall that out data is like a table [Y X] where Y collects observatios o the depedet variable Y ad X collects observatios o the k-dimesioal
More informationb i u x i U a i j u x i u x j
M ath 5 2 7 Fall 2 0 0 9 L ecture 1 9 N ov. 1 6, 2 0 0 9 ) S ecod- Order Elliptic Equatios: Weak S olutios 1. Defiitios. I this ad the followig two lectures we will study the boudary value problem Here
More informationLinear Elliptic PDE s Elliptic partial differential equations frequently arise out of conservation statements of the form
Liear Elliptic PDE s Elliptic partial differetial equatios frequetly arise out of coservatio statemets of the form B F d B Sdx B cotaied i bouded ope set U R. Here F, S deote respectively, the flux desity
More informationChapter 7 Isoperimetric problem
Chapter 7 Isoperimetric problem Recall that the isoperimetric problem (see the itroductio its coectio with ido s proble) is oe of the most classical problem of a shape optimizatio. It ca be formulated
More informationReal Numbers R ) - LUB(B) may or may not belong to B. (Ex; B= { y: y = 1 x, - Note that A B LUB( A) LUB( B)
Real Numbers The least upper boud - Let B be ay subset of R B is bouded above if there is a k R such that x k for all x B - A real umber, k R is a uique least upper boud of B, ie k = LUB(B), if () k is
More informationGeometry of LS. LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT
OCTOBER 7, 2016 LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT Geometry of LS We ca thik of y ad the colums of X as members of the -dimesioal Euclidea space R Oe ca
More informationTaylor expansion: Show that the TE of f(x)= sin(x) around. sin(x) = x - + 3! 5! L 7 & 8: MHD/ZAH
Taylor epasio: Let ƒ() be a ifiitely differetiable real fuctio. A ay poit i the eighbourhood of 0, the fuctio ƒ() ca be represeted by a power series of the followig form: X 0 f(a) f() f() ( ) f( ) ( )
More informationWe are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n
Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at
More informationApply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.
Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α
More informationDescribing Function: An Approximate Analysis Method
Describig Fuctio: A Approximate Aalysis Method his chapter presets a method for approximately aalyzig oliear dyamical systems A closed-form aalytical solutio of a oliear dyamical system (eg, a oliear differetial
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationFall 2013 MTH431/531 Real analysis Section Notes
Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters
More informationΩ ). Then the following inequality takes place:
Lecture 8 Lemma 5. Let f : R R be a cotiuously differetiable covex fuctio. Choose a costat δ > ad cosider the subset Ωδ = { R f δ } R. Let Ωδ ad assume that f < δ, i.e., is ot o the boudary of f = δ, i.e.,
More informationSolutions to HW Assignment 1
Solutios to HW: 1 Course: Theory of Probability II Page: 1 of 6 Uiversity of Texas at Austi Solutios to HW Assigmet 1 Problem 1.1. Let Ω, F, {F } 0, P) be a filtered probability space ad T a stoppig time.
More informationL 5 & 6: RelHydro/Basel. f(x)= ( ) f( ) ( ) ( ) ( ) n! 1! 2! 3! If the TE of f(x)= sin(x) around x 0 is: sin(x) = x - 3! 5!
aylor epasio: Let ƒ() be a ifiitely differetiable real fuctio. At ay poit i the eighbourhood of =0, the fuctio ca be represeted as a power series of the followig form: X 0 f(a) f() ƒ() f()= ( ) f( ) (
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations
ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows
More informationIP Reference guide for integer programming formulations.
IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more
More informationReview Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =
Review Problems ICME ad MS&E Refresher Course September 9, 0 Warm-up problems. For the followig matrices A = 0 B = C = AB = 0 fid all powers A,A 3,(which is A times A),... ad B,B 3,... ad C,C 3,... Solutio:
More information(bilinearity), a(u, v) M u V v V (continuity), a(v, v) m v 2 V (coercivity).
Precoditioed fiite elemets method Let V be a Hilbert space, (, ) V a ier product o V ad V the correspodig iduced orm. Let a be a coercive, cotiuous, biliear form o V, that is, a : V V R ad there exist
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationA Negative Result. We consider the resolvent problem for the scalar Oseen equation
O Osee Resolvet Estimates: A Negative Result Paul Deurig Werer Varhor 2 Uiversité Lille 2 Uiversität Kassel Laboratoire de Mathématiques BP 699, 62228 Calais cédex Frace paul.deurig@lmpa.uiv-littoral.fr
More informationChapter 4 : Laplace Transform
4. Itroductio Laplace trasform is a alterative to solve the differetial equatio by the complex frequecy domai ( s = σ + jω), istead of the usual time domai. The DE ca be easily trasformed ito a algebraic
More informationTERMWISE DERIVATIVES OF COMPLEX FUNCTIONS
TERMWISE DERIVATIVES OF COMPLEX FUNCTIONS This writeup proves a result that has as oe cosequece that ay complex power series ca be differetiated term-by-term withi its disk of covergece The result has
More informationSlide Set 13 Linear Model with Endogenous Regressors and the GMM estimator
Slide Set 13 Liear Model with Edogeous Regressors ad the GMM estimator Pietro Coretto pcoretto@uisa.it Ecoometrics Master i Ecoomics ad Fiace (MEF) Uiversità degli Studi di Napoli Federico II Versio: Friday
More informationLinear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d
Liear regressio Daiel Hsu (COMS 477) Maximum likelihood estimatio Oe of the simplest liear regressio models is the followig: (X, Y ),..., (X, Y ), (X, Y ) are iid radom pairs takig values i R d R, ad Y
More informationPRELIM PROBLEM SOLUTIONS
PRELIM PROBLEM SOLUTIONS THE GRAD STUDENTS + KEN Cotets. Complex Aalysis Practice Problems 2. 2. Real Aalysis Practice Problems 2. 4 3. Algebra Practice Problems 2. 8. Complex Aalysis Practice Problems
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationGeneralized Semi- Markov Processes (GSMP)
Geeralized Semi- Markov Processes (GSMP) Summary Some Defiitios Markov ad Semi-Markov Processes The Poisso Process Properties of the Poisso Process Iterarrival times Memoryless property ad the residual
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationEstimation of the essential supremum of a regression function
Estimatio of the essetial supremum of a regressio fuctio Michael ohler, Adam rzyżak 2, ad Harro Walk 3 Fachbereich Mathematik, Techische Uiversität Darmstadt, Schlossgartestr. 7, 64289 Darmstadt, Germay,
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationEfficient GMM LECTURE 12 GMM II
DECEMBER 1 010 LECTURE 1 II Efficiet The estimator depeds o the choice of the weight matrix A. The efficiet estimator is the oe that has the smallest asymptotic variace amog all estimators defied by differet
More informationLecture 19: Convergence
Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may
More informationMATH 31B: MIDTERM 2 REVIEW
MATH 3B: MIDTERM REVIEW JOE HUGHES. Evaluate x (x ) (x 3).. Partial Fractios Solutio: The umerator has degree less tha the deomiator, so we ca use partial fractios. Write x (x ) (x 3) = A x + A (x ) +
More informationNotes 19 : Martingale CLT
Notes 9 : Martigale CLT Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: [Bil95, Chapter 35], [Roc, Chapter 3]. Sice we have ot ecoutered weak covergece i some time, we first recall
More informationPoincaré Problem for Nonlinear Elliptic Equations of Second Order in Unbounded Domains
Advaces i Pure Mathematics 23 3 72-77 http://dxdoiorg/4236/apm233a24 Published Olie Jauary 23 (http://wwwscirporg/oural/apm) Poicaré Problem for Noliear Elliptic Equatios of Secod Order i Ubouded Domais
More informationNumerical Methods for Ordinary Differential Equations
Numerical Methods for Ordiary Differetial Equatios Braislav K. Nikolić Departmet of Physics ad Astroomy, Uiversity of Delaware, U.S.A. PHYS 460/660: Computatioal Methods of Physics http://www.physics.udel.edu/~bikolic/teachig/phys660/phys660.html
More informationLecture 10: Universal coding and prediction
0-704: Iformatio Processig ad Learig Sprig 0 Lecture 0: Uiversal codig ad predictio Lecturer: Aarti Sigh Scribes: Georg M. Goerg Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved
More informationIntroduction to Optimization Techniques. How to Solve Equations
Itroductio to Optimizatio Techiques How to Solve Equatios Iterative Methods of Optimizatio Iterative methods of optimizatio Solutio of the oliear equatios resultig form a optimizatio problem is usually
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationSingular Continuous Measures by Michael Pejic 5/14/10
Sigular Cotiuous Measures by Michael Peic 5/4/0 Prelimiaries Give a set X, a σ-algebra o X is a collectio of subsets of X that cotais X ad ad is closed uder complemetatio ad coutable uios hece, coutable
More informationTime-Domain Representations of LTI Systems
2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable
More informationUniversity of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!
Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad
More informationSignals & Systems Chapter3
Sigals & Systems Chapter3 1.2 Discrete-Time (D-T) Sigals Electroic systems do most of the processig of a sigal usig a computer. A computer ca t directly process a C-T sigal but istead eeds a stream of
More informationNumerical Solution of the First-Order Hyperbolic Partial Differential Equation with Point-Wise Advance
Iteratioal oural of Sciece ad Research (ISR) ISSN (Olie): 39-74 Ide Copericus Value (3): 4 Impact Factor (3): 4438 Numerical Solutio of the First-Order Hyperbolic Partial Differetial Equatio with Poit-Wise
More informationCS161 Handout 05 Summer 2013 July 10, 2013 Mathematical Terms and Identities
CS161 Hadout 05 Summer 2013 July 10, 2013 Mathematical Terms ad Idetities Thaks to Ady Nguye ad Julie Tibshirai for their advice o this hadout. This hadout covers mathematical otatio ad idetities that
More informationPAPER : IIT-JAM 2010
MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure
More informationMost text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t
Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationMachine Learning Brett Bernstein
Machie Learig Brett Berstei Week 2 Lecture: Cocept Check Exercises Starred problems are optioal. Excess Risk Decompositio 1. Let X = Y = {1, 2,..., 10}, A = {1,..., 10, 11} ad suppose the data distributio
More informationPC5215 Numerical Recipes with Applications - Review Problems
PC55 Numerical Recipes with Applicatios - Review Problems Give the IEEE 754 sigle precisio bit patter (biary or he format) of the followig umbers: 0 0 05 00 0 00 Note that it has 8 bits for the epoet,
More informationTHE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.
THE SOLUTION OF NONLINEAR EQUATIONS f( ) = 0. Noliear Equatio Solvers Bracketig. Graphical. Aalytical Ope Methods Bisectio False Positio (Regula-Falsi) Fied poit iteratio Newto Raphso Secat The root of
More informationProperties of Fuzzy Length on Fuzzy Set
Ope Access Library Joural 206, Volume 3, e3068 ISSN Olie: 2333-972 ISSN Prit: 2333-9705 Properties of Fuzzy Legth o Fuzzy Set Jehad R Kider, Jaafar Imra Mousa Departmet of Mathematics ad Computer Applicatios,
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationRiesz-Fischer Sequences and Lower Frame Bounds
Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.
More informationLECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK)
LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK) Everythig marked by is ot required by the course syllabus I this lecture, all vector spaces is over the real umber R. All vectors i R is viewed as a colum
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics ad Egieerig Lecture otes Sergei V. Shabaov Departmet of Mathematics, Uiversity of Florida, Gaiesville, FL 326 USA CHAPTER The theory of covergece. Numerical sequeces..
More informationA brief introduction to linear algebra
CHAPTER 6 A brief itroductio to liear algebra 1. Vector spaces ad liear maps I what follows, fix K 2{Q, R, C}. More geerally, K ca be ay field. 1.1. Vector spaces. Motivated by our ituitio of addig ad
More informationSubject: Differential Equations & Mathematical Modeling -III. Lesson: Power series solutions of Differential Equations. about ordinary points
Power series solutio of Differetial equatios about ordiary poits Subject: Differetial Equatios & Mathematical Modelig -III Lesso: Power series solutios of Differetial Equatios about ordiary poits Lesso
More informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
More informationMATH 413 FINAL EXAM. f(x) f(y) M x y. x + 1 n
MATH 43 FINAL EXAM Math 43 fial exam, 3 May 28. The exam starts at 9: am ad you have 5 miutes. No textbooks or calculators may be used durig the exam. This exam is prited o both sides of the paper. Good
More informationChapter 9: Numerical Differentiation
178 Chapter 9: Numerical Differetiatio Numerical Differetiatio Formulatio of equatios for physical problems ofte ivolve derivatives (rate-of-chage quatities, such as velocity ad acceleratio). Numerical
More informationLecture 3 The Lebesgue Integral
Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified
More informationIntroduction to Optimization Techniques
Itroductio to Optimizatio Techiques Basic Cocepts of Aalysis - Real Aalysis, Fuctioal Aalysis 1 Basic Cocepts of Aalysis Liear Vector Spaces Defiitio: A vector space X is a set of elemets called vectors
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationA Quantitative Lusin Theorem for Functions in BV
A Quatitative Lusi Theorem for Fuctios i BV Adrás Telcs, Vicezo Vespri November 19, 013 Abstract We exted to the BV case a measure theoretic lemma previously proved by DiBeedetto, Giaazza ad Vespri ([1])
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More informationAn efficient time integration method for extra-large eddy simulations
A efficiet time itegratio method for extra-large eddy simulatios M.A. Scheibeler Departmet of Mathematics Master s Thesis A efficiet time itegratio method for extra-large eddy simulatios M.A. Scheibeler
More informationSome vector-valued statistical convergent sequence spaces
Malaya J. Mat. 32)205) 6 67 Some vector-valued statistical coverget sequece spaces Kuldip Raj a, ad Suruchi Padoh b a School of Mathematics, Shri Mata Vaisho Devi Uiversity, Katra-82320, J&K, Idia. b School
More informationFilter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and
Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationMath 2784 (or 2794W) University of Connecticut
ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really
More informationAnalysis of Algorithms. Introduction. Contents
Itroductio The focus of this module is mathematical aspects of algorithms. Our mai focus is aalysis of algorithms, which meas evaluatig efficiecy of algorithms by aalytical ad mathematical methods. We
More informationSupplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate
Supplemetary Material for Fast Stochastic AUC Maximizatio with O/-Covergece Rate Migrui Liu Xiaoxua Zhag Zaiyi Che Xiaoyu Wag 3 iabao Yag echical Lemmas ized versio of Hoeffdig s iequality, ote that We
More informationMATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and
MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationA NOTE ON BOUNDARY BLOW-UP PROBLEM OF u = u p
A NOTE ON BOUNDARY BLOW-UP PROBLEM OF u = u p SEICK KIM Abstract. Assume that Ω is a bouded domai i R with 2. We study positive solutios to the problem, u = u p i Ω, u(x) as x Ω, where p > 1. Such solutios
More informationHOMEWORK #10 SOLUTIONS
Math 33 - Aalysis I Sprig 29 HOMEWORK # SOLUTIONS () Prove that the fuctio f(x) = x 3 is (Riema) itegrable o [, ] ad show that x 3 dx = 4. (Without usig formulae for itegratio that you leart i previous
More informationK. Grill Institut für Statistik und Wahrscheinlichkeitstheorie, TU Wien, Austria
MARKOV PROCESSES K. Grill Istitut für Statistik ud Wahrscheilichkeitstheorie, TU Wie, Austria Keywords: Markov process, Markov chai, Markov property, stoppig times, strog Markov property, trasitio matrix,
More informationTheorem 3. A subset S of a topological space X is compact if and only if every open cover of S by open sets in X has a finite subcover.
Compactess Defiitio 1. A cover or a coverig of a topological space X is a family C of subsets of X whose uio is X. A subcover of a cover C is a subfamily of C which is a cover of X. A ope cover of X is
More informationA General Iterative Scheme for Variational Inequality Problems and Fixed Point Problems
A Geeral Iterative Scheme for Variatioal Iequality Problems ad Fixed Poit Problems Wicha Khogtham Abstract We itroduce a geeral iterative scheme for fidig a commo of the set solutios of variatioal iequality
More informationLyapunov Stability Analysis for Feedback Control Design
Copyright F.L. Lewis 008 All rights reserved Updated: uesday, November, 008 Lyapuov Stability Aalysis for Feedbac Cotrol Desig Lyapuov heorems Lyapuov Aalysis allows oe to aalyze the stability of cotiuous-time
More informationMixingales. Chapter 7
Chapter 7 Mixigales I this sectio we prove some of the results stated i the previous sectios usig mixigales. We first defie a mixigale, otig that the defiitio we give is ot the most geeral defiitio. Defiitio
More informationAn Analysis of a Certain Linear First Order. Partial Differential Equation + f ( x, by Means of Topology
Iteratioal Mathematical Forum 2 2007 o. 66 3241-3267 A Aalysis of a Certai Liear First Order Partial Differetial Equatio + f ( x y) = 0 z x by Meas of Topology z y T. Oepomo Sciece Egieerig ad Mathematics
More informationChapter 6 Principles of Data Reduction
Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationECON 3150/4150, Spring term Lecture 3
Itroductio Fidig the best fit by regressio Residuals ad R-sq Regressio ad causality Summary ad ext step ECON 3150/4150, Sprig term 2014. Lecture 3 Ragar Nymoe Uiversity of Oslo 21 Jauary 2014 1 / 30 Itroductio
More informationSummary and Discussion on Simultaneous Analysis of Lasso and Dantzig Selector
Summary ad Discussio o Simultaeous Aalysis of Lasso ad Datzig Selector STAT732, Sprig 28 Duzhe Wag May 4, 28 Abstract This is a discussio o the work i Bickel, Ritov ad Tsybakov (29). We begi with a short
More informationComputation of Error Bounds for P-matrix Linear Complementarity Problems
Mathematical Programmig mauscript No. (will be iserted by the editor) Xiaoju Che Shuhuag Xiag Computatio of Error Bouds for P-matrix Liear Complemetarity Problems Received: date / Accepted: date Abstract
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationSieve Estimators: Consistency and Rates of Convergence
EECS 598: Statistical Learig Theory, Witer 2014 Topic 6 Sieve Estimators: Cosistecy ad Rates of Covergece Lecturer: Clayto Scott Scribe: Julia Katz-Samuels, Brado Oselio, Pi-Yu Che Disclaimer: These otes
More informationSignal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.
Sigal Processig Lecture 02: Discrete Time Sigals ad Systems Ahmet Taha Koru, Ph. D. Yildiz Techical Uiversity 2017-2018 Fall ATK (YTU) Sigal Processig 2017-2018 Fall 1 / 51 Discrete Time Sigals Discrete
More information