ON THE OPTIMALITY OF A CLASS OF H MATRICES

Size: px
Start display at page:

Download "ON THE OPTIMALITY OF A CLASS OF H MATRICES"

Transcription

1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY Series A OF THE ROMANIAN ACADEMY Volume 6 Number /5 pp. - ON THE OPTIMALITY OF A CLASS OF H MATRICES by Ricar GABRIEL Hartstraße Karlsrue Germay We erive a ecessary coitio for optimality of H- matrices i C wic are efie i sectio. We sow tat for tis coitio is also sufficiet a we state a coecture for >.. H MATRICES Accorig to [] a H matrix is a matrix wic ca be writte as Reccomee bymarius IOSIFESCU member of te Romaia Acaemy GD+DH-HD (.) were: D iag(! ) is a iagoal matrix a H is ermitea: H H. A equivalet otatio for G is GD+DH-HD ; ( )] were ( ) are te off-iagoal etries. For a matrix A C let us cosier te optimisatio problems () max Diag TAT ; TT E (i.e. T is uitary) a () mi A Z ; ZZ Z Z (i.e. Z is ormal) G [ (.) Here Diag( A ) iag ( a a! a ) a A a is te Frobeius orm of te matrix A. Tese problems ivolve H matrices: if a iagoal matrix D is a statioary poit for problem () of te best ormal approximatio te A must be a H matrix wit Diag ( A) D(Teorem i []). O te oter a for a H matrix A te ietity matrix E is a statioary poit for problem (); te coverse is ot always true but it ols we E is a seco-orer statioary poit. We oly global extrema are cosiere te problems () a () are always equivalet (Teorem 5 i [] a Teorem i []). If E is a global solutio to () a/or D is a global solutio to () te A must be a H matrix: A G D + DH HD ; i our previous papers we calle it a optimal H matrix. I te case optimality meas (Teorem 5 i []) tat G as te form / ( ) ; ; ( ) G a is equivalet to te seco-orer statioary poit coitio. (.)

2 H matrices also occur as limit poits of a Jacobi sequece { } Ricar GABRIEL A were te iitial matrix A C is a arbitrary (ormal or o-ormal) matrix (Teorem i [9]). We will ow state te seco orer optimality coitio for problem () we te solutio to te problem is a iagoal matrix D. We cosier te geeral case we ot all iagoal etries of D are istict i.e. for is allowe. Let Clearly te pairs {( ) } [5]): D {( ) } I ; (.4) belog to te set I D. Te seco orer optimality coitio is (Teorem i G z z z + z z ( Z) ( ) l l l l l l l ( ) ID l ( ) ID l ( z l l + z l l ) ( l ) ( z l l + z l l ) ( l ) Z i.e. te essia G ( Z) is positive semi- efiite o z C for all [ ] C. (.5) A H- matrix i G ( ) ( ) ( ) wit. Because C is a matrix of te form. H- MATRICES IN C ( ) ( ) ( ) ; (.)! (.) D coul be viewe as a o trivial maximal egeerate iagoal matrix. Teorem. For a H- matrix (.) coitio (.5) is equivalet to / ; (! ). (.) Proof. First for a H- matrix all etermiats i (.5) are zero a o te oter a so te essia becomes D { ( ) ; } I! (.4)

3 O te optimality of a class of H matrices wit a G ( Z) z + z z + z g z z z z g z z z z g z z z z (! ;! ) (! ;! ) (! ;! ) (! ;! ) g z z z z z z z z ( ) z + z g + ( z! z ; z! z ) z z + z z Associate wit te form g ( z z ; z! z ) ermitea matrix Ω ( ) () T E! except for te positive factor ( ) E E ( ) E Te caracteristic equatio of te matrix is T (.5) (.6) (.7) is te (.8) Ω (.9) T 4 ( x ) ( ) x (.) a te ozero roots are a ; terefore te eigevalues of te matrix Ω ( ) are 4 a [ ( ) times]. (.) Hece te matrix Ω ( ) is positive semi-efiite if a oly if 4 tat is /. I orer to sow tat te coitio / is also sufficiet for global optimality i problem () we soul ivoe Teorem 5 i [8]. For a ormal matrix B let us eote { } KomH ( B) X; X X XB BX (.) a for a ermitiea matrix H let δ (H) be its spectral iameter: δ ( H) ymax ymi were y max a y are respectively te largest a te smallest eigevalues of H. Furter wit mi

4 Ricar GABRIEL 4 { δ H } δ( HB ) if ( H X) ; X Kom ( B) (.) Teorem 5 i [8] states tat a sufficiet coitio for a ormal matrix B to be te best ormal approximatio (i Frobeius orm) for te matrix A B + BH HB is For a H- matrix G let us tae δ ( H B). (.4) ( ) B iag!. (.5) Te every matrix X i Kom ( B) ca be expresse as ece te matrix H x X X X X H X will essetially ave te form x H X X X X (.6) (.7) Now if we cosier te caoical ecompositio of X : te result state will follow from Lemma : We ave X Tiag ( x! x ) T ; TT E x u x x δ δ (.8) X u # x were u T. Te poit ere is tat T u. We will sow tat for tir orer H- matrices G ( (. THIRD ORDER H- MATRICES ) ) te coitio ( + ) ( ) ( ) ; / uiquely ietifies global extrema i problems () a (). To tis aim cosier te caracteristic equatio of te matrix (.) y p y + p y p (.)

5 5 O te optimality of a class of H matrices a te problem mi x H x x (.) x {( y ); ( x x x R } y (.4) max mi ) were we get y max a y mi are te largest a respectively te smallest eigevalues. Puttig q q x x x s x + x + x q xx + xx + xx p p p q s q q x x (.5) (.6) It is ow easy to see tat we ca always coose x x a x suc tat y ymax ymi y (.7) wit y betwee y a y : y y y. Equatio (.) as te roots y y a y s. Besies y a y verify te equatios wic lea to y py + p y + p I y + q II q y x x + q (.8) (.9) From I we get y q. If x x x we ave te solutio y max y. We sall prove tat tis is a global solutio to problem (.4) i.e. tat q for ay oter values x x x. To tis e we sow tat te cotrary assumptio q > leas to a cotraictio. Lemma : If eiter x + x x + x or x + x (.) te q. Proof (for x + x ). If x x te q x ( x + x ) x x (.) Lemma : If q > te sg( x + x ) sg( x + x) sg( x + x) sg( x + x )( x + x)( x + x). (.)

6 Ricar GABRIEL 6 Proof. We ave ( x + x )( x + x ) x + q > ( x + x )( x + x ) x + q > ( x + x )( x + x ) x + q > (.) Lemma 4: Te ietity ols. Proof. Obvious. Suppose ow x a let q q q x + x )( x + x )( x + ) (.4) ( x x x x t x x t x. (.5) From Lemma we ave sg( + t ) sg( + t ) sg( + t) sg( t + t)( + t )( + t). (.6) By multiplyig I (i.8) by s q a euctig II y is elimiate; usig (.5) we obtai R qq q q + x + x ( + t )( + t )( t + t ) x ( + )( + t + t ) x+ t x+ t x a a straigtforwar computatio yiels (.7) From I we obtai x ( + t ) + ( + t). (.8) ( + t )( + t )( t + t ) y q + t + t + ( t t ) x (.9) or by (.8) t ( + t) + t ( + t ) y. (.) ( + t )( + t)( t + t) Now we are reay to prove te followig result Teorem : For a H- matrix (.) te coitio ( + ) / (.) is ecessary a sufficiet for D to be a global extremum i problems () a (). Proof. We oly ave to sow tat a cotraictio occurs we assumig q >. To tis e we relay o te iequality y (ece y ). Let us estimate q s

7 7 O te optimality of a class of H matrices E s y ( + t + t ) x y + ( + t) ( + t + t) t ( + t) ( + t + t) t ( + t)( + t)( t + t) ( + t)( + t)( t + t) ( + t) + t ( + t) + t ( + t)( t + t) + t ( + t)( t + t) + t (.) wic soul be egative. But as ca be see from Lemma a te associate relatios (.6) eac term i te above sum is o egative. Now we oly ave to cosier te special case x we system (.9) taes te form y + x x (.) ( x + x ) y x x. (.4) We ca assume x. Te wit x x x x by elimiatig y i (.) a (.4) we get x +. (.5) ( + ) For y xx te computatio yiels wile for s y we obtai te expressio s y + y (.6) ( + ) ( + ). (.7) + wic soul be egative. But te coitio q x implies ece all terms i (.7) are o egative. Te cotraictio also proves te teorem i tis special case. Coecture. I accorace wit Teorems a oe ca expect tat te coitio ( ) /! is ecessary a sufficiet for D to be a global optimum i problems () a () for a arbitrary H- matrix i C. ACKNOWLEDGEMENT. I woul lie to express my tas to M.Iosifescu for is remars cocerig a previous versio of tis paper a to C. Foias a D. Voiculescu wo itrouce me i 97 to problem () of best ormal approximatio.

8 Ricar GABRIEL 8 REFERENCES. R.L. CAUSEY O closest ormal matrices. Tec. Rep. CS- Dept. Comp. Sci. Stafor R. GABRIEL Matrize mit maximaler Diagoale bei uitärer Similarität. J. Reie Agew. Mat. 7/8 pp R. GABRIEL Optimale H-Matrize mit eiem Bezug zur Grapeteorie. Rev. Roumaie Mat. Pures et Appl. 6 pp R. GABRIEL Matrize mit statioärer Diagoale bei uitäre Similarität. Rev. Roumaie Mat. Pures Appl. 9 pp R. GABRIEL Zu e implizite Optimailtätsbeiguge zweiter Orug eier H-Matrix. Rev. Roumaie Mat. Pures et Appl. pp R. GABRIEl Azieee H-Matrize ie ict optimal si. Rev. Roumaie Mat. Pures et Appl. pp R. GABRIEl Te ormal H-matrices wit coectio to some Jacobi-lie metos. Liear Algebra Appl. 9 pp R-GABRIEl Zur beste ormale Approximatio omplexer Matrize i er Euliisce Norm. Mat. Z. pp R. GABRIEl Jacobi s Meto for ormal Matrices of tir a fourt orer. Rev. Roumai Mat. Pures Appl. 4 pp R. GABRIEL Miimizatio of te Frobeius orm of a complex matrix usig plaar similarities. Applie Numerical Matematics 4 pp C. G. J. JACOBI Über ei leictes Verfare ie i er Teorie er Seularstöruge vorommee Gleicuge umerisc aufzulöse. J. Reie Agew. Mat. pp L. LASZLO Optimal plae rotatios for complex matrices. A. Uiv. Sci. Buapest Sect. Comp. pp L. LASZLO Seco orer optimality coitio for H-matrices. BIT (to appear). 4. A. RUHE O te quaratic covergece of te Jacobi meto for ormal matrices. BIT 7 pp V. V. VOEVODIN H. D. IKKRAMOV Über eie Erweiterug er Jacobisce Metoe. I: Vycisl. Met. Programmirovaie VII pp.6-8. Izat. Moscov. Uiv. Mosow 967. Receive November 4

Sparsification using Regular and Weighted. Graphs

Sparsification using Regular and Weighted. Graphs Sparsificatio usig Regular a Weighte 1 Graphs Aly El Gamal ECE Departmet a Cooriate Sciece Laboratory Uiversity of Illiois at Urbaa-Champaig Abstract We review the state of the art results o spectral approximatio

More information

Stability analysis of numerical methods for stochastic systems with additive noise

Stability analysis of numerical methods for stochastic systems with additive noise Stability aalysis of umerical metods for stoctic systems wit additive oise Yosiiro SAITO Abstract Stoctic differetial equatios (SDEs) represet pysical peomea domiated by stoctic processes As for determiistic

More information

An Insight into Differentiation and Integration

An Insight into Differentiation and Integration Differetiatio A Isigt ito Differetiatio a Itegratio Differetiatio is basically a task to fi out ow oe variable is cagig i relatio to aoter variable, te latter is usually take as a cause of te cage. For

More information

A note on equiangular tight frames

A note on equiangular tight frames A ote o equiagular tight frames Thomas Strohmer Departmet of Mathematics, Uiversity of Califoria, Davis, CA 9566, USA Abstract We settle a cojecture of Joseph Rees about the existece a costructio of certai

More information

Lecture 7 Testing Nonlinear Inequality Restrictions 1

Lecture 7 Testing Nonlinear Inequality Restrictions 1 Eco 75 Lecture 7 Testig Noliear Iequality Restrictios I Lecture 6, we discussed te testig problems were te ull ypotesis is de ed by oliear equality restrictios: H : ( ) = versus H : ( ) 6= : () We sowed

More information

Iterative Techniques for Solving Ax b -(3.8). Assume that the system has a unique solution. Let x be the solution. Then x A 1 b.

Iterative Techniques for Solving Ax b -(3.8). Assume that the system has a unique solution. Let x be the solution. Then x A 1 b. Iterative Techiques for Solvig Ax b -(8) Cosider solvig liear systems of them form: Ax b where A a ij, x x i, b b i Assume that the system has a uique solutio Let x be the solutio The x A b Jacobi ad Gauss-Seidel

More information

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors 5 Eigevalues ad Eigevectors 5.3 DIAGONALIZATION DIAGONALIZATION Example 1: Let. Fid a formula for A k, give that P 1 1 = 1 2 ad, where Solutio: The stadard formula for the iverse of a 2 2 matrix yields

More information

2.3 Warmup. Graph the derivative of the following functions. Where necessary, approximate the derivative.

2.3 Warmup. Graph the derivative of the following functions. Where necessary, approximate the derivative. . Warmup Grap te erivative of te followig fuctios. Were ecessar, approimate te erivative. Differetiabilit Must a fuctio ave a erivative at eac poit were te fuctio is efie? Or If f a is efie, must f ( a)

More information

Computation of Hahn Moments for Large Size Images

Computation of Hahn Moments for Large Size Images Joural of Computer Sciece 6 (9): 37-4, ISSN 549-3636 Sciece Publicatios Computatio of Ha Momets for Large Size Images A. Vekataramaa ad P. Aat Raj Departmet of Electroics ad Commuicatio Egieerig, Quli

More information

Essential Microeconomics EXISTENCE OF EQUILIBRIUM Core ideas: continuity of excess demand functions, Fixed point theorems

Essential Microeconomics EXISTENCE OF EQUILIBRIUM Core ideas: continuity of excess demand functions, Fixed point theorems Essetial Microecoomics -- 5.3 EXISTENCE OF EQUILIBRIUM Core ideas: cotiuity of excess demad fuctios, Fixed oit teorems Two commodity excage ecoomy 2 Excage ecoomy wit may commodities 5 Discotiuous demad

More information

EXPLICIT FORMULAE FOR THE BRENTI S POLYNOMIALS γ a1,...,a r

EXPLICIT FORMULAE FOR THE BRENTI S POLYNOMIALS γ a1,...,a r EXPLICIT FORMULAE FOR THE BRENTI S POLYNOMIALS γ,,a r Jia-yi Si Departmet of Matematics, East Cia Normal Uiversity, Sagai, 0006, P R Cia Astract We itroduce two kids of geeralized Catala umers a a, Z ad

More information

Estimation of Backward Perturbation Bounds For Linear Least Squares Problem

Estimation of Backward Perturbation Bounds For Linear Least Squares Problem dvaced Sciece ad Techology Letters Vol.53 (ITS 4), pp.47-476 http://dx.doi.org/.457/astl.4.53.96 Estimatio of Bacward Perturbatio Bouds For Liear Least Squares Problem Xixiu Li School of Natural Scieces,

More information

arxiv: v4 [math.co] 5 May 2011

arxiv: v4 [math.co] 5 May 2011 A PROBLEM OF ENUMERATION OF TWO-COLOR BRACELETS WITH SEVERAL VARIATIONS arxiv:07101370v4 [mathco] 5 May 011 VLADIMIR SHEVELEV Abstract We cosier the problem of eumeratio of icogruet two-color bracelets

More information

6. Kalman filter implementation for linear algebraic equations. Karhunen-Loeve decomposition

6. Kalman filter implementation for linear algebraic equations. Karhunen-Loeve decomposition 6. Kalma filter implemetatio for liear algebraic equatios. Karhue-Loeve decompositio 6.1. Solvable liear algebraic systems. Probabilistic iterpretatio. Let A be a quadratic matrix (ot obligatory osigular.

More information

Definition 2 (Eigenvalue Expansion). We say a d-regular graph is a λ eigenvalue expander if

Definition 2 (Eigenvalue Expansion). We say a d-regular graph is a λ eigenvalue expander if Expaer Graphs Graph Theory (Fall 011) Rutgers Uiversity Swastik Kopparty Throughout these otes G is a -regular graph 1 The Spectrum Let A G be the ajacecy matrix of G Let λ 1 λ λ be the eigevalues of A

More information

CMSE 820: Math. Foundations of Data Sci.

CMSE 820: Math. Foundations of Data Sci. Lecture 17 8.4 Weighted path graphs Take from [10, Lecture 3] As alluded to at the ed of the previous sectio, we ow aalyze weighted path graphs. To that ed, we prove the followig: Theorem 6 (Fiedler).

More information

Intelligent Systems I 08 SVM

Intelligent Systems I 08 SVM Itelliget Systems I 08 SVM Stefa Harmelig & Philipp Heig 12. December 2013 Max Plack Istitute for Itelliget Systems Dptmt. of Empirical Iferece 1 / 30 Your feeback Ejoye most Laplace approximatio gettig

More information

About the use of a result of Professor Alexandru Lupaş to obtain some properties in the theory of the number e 1

About the use of a result of Professor Alexandru Lupaş to obtain some properties in the theory of the number e 1 Geeral Mathematics Vol. 5, No. 2007), 75 80 About the use of a result of Professor Alexadru Lupaş to obtai some properties i the theory of the umber e Adrei Verescu Dedicated to Professor Alexadru Lupaş

More information

6.451 Principles of Digital Communication II Wednesday, March 9, 2005 MIT, Spring 2005 Handout #12. Problem Set 5 Solutions

6.451 Principles of Digital Communication II Wednesday, March 9, 2005 MIT, Spring 2005 Handout #12. Problem Set 5 Solutions 6.51 Priciples of Digital Commuicatio II Weesay, March 9, 2005 MIT, Sprig 2005 Haout #12 Problem Set 5 Solutios Problem 5.1 (Eucliea ivisio algorithm). (a) For the set F[x] of polyomials over ay fiel F,

More information

LIMITS AND DERIVATIVES

LIMITS AND DERIVATIVES Capter LIMITS AND DERIVATIVES. Overview.. Limits of a fuctio Let f be a fuctio defied i a domai wic we take to be a iterval, say, I. We sall study te cocept of it of f at a poit a i I. We say f ( ) is

More information

Algebra of Least Squares

Algebra 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 information

Lecture 6 Testing Nonlinear Restrictions 1. The previous lectures prepare us for the tests of nonlinear restrictions of the form:

Lecture 6 Testing Nonlinear Restrictions 1. The previous lectures prepare us for the tests of nonlinear restrictions of the form: Eco 75 Lecture 6 Testig Noliear Restrictios The previous lectures prepare us for the tests of oliear restrictios of the form: H 0 : h( 0 ) = 0 versus H : h( 0 ) 6= 0: () I this lecture, we cosier Wal,

More information

LIMITS AND DERIVATIVES NCERT

LIMITS AND DERIVATIVES NCERT . Overview.. Limits of a fuctio Let f be a fuctio defied i a domai wic we take to be a iterval, say, I. We sall study te cocept of it of f at a poit a i I. We say f ( ) is te epected value of f at a give

More information

ALLOCATING SAMPLE TO STRATA PROPORTIONAL TO AGGREGATE MEASURE OF SIZE WITH BOTH UPPER AND LOWER BOUNDS ON THE NUMBER OF UNITS IN EACH STRATUM

ALLOCATING SAMPLE TO STRATA PROPORTIONAL TO AGGREGATE MEASURE OF SIZE WITH BOTH UPPER AND LOWER BOUNDS ON THE NUMBER OF UNITS IN EACH STRATUM ALLOCATING SAPLE TO STRATA PROPORTIONAL TO AGGREGATE EASURE OF SIZE WIT BOT UPPER AND LOWER BOUNDS ON TE NUBER OF UNITS IN EAC STRATU Lawrece R. Erst ad Cristoper J. Guciardo Erst_L@bls.gov, Guciardo_C@bls.gov

More information

Bounds for the Extreme Eigenvalues Using the Trace and Determinant

Bounds for the Extreme Eigenvalues Using the Trace and Determinant ISSN 746-7659, Eglad, UK Joural of Iformatio ad Computig Sciece Vol 4, No, 9, pp 49-55 Bouds for the Etreme Eigevalues Usig the Trace ad Determiat Qi Zhog, +, Tig-Zhu Huag School of pplied Mathematics,

More information

1 = 2 d x. n x n (mod d) d n

1 = 2 d x. n x n (mod d) d n HW2, Problem 3*: Use Dirichlet hyperbola metho to show that τ 2 + = 3 log + O. This ote presets the ifferet ieas suggeste by the stuets Daiel Klocker, Jürge Steiiger, Stefaia Ebli a Valerie Roiter for

More information

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5 Ma 42: Itroductio to Lebesgue Itegratio Solutios to Homework Assigmet 5 Prof. Wickerhauser Due Thursday, April th, 23 Please retur your solutios to the istructor by the ed of class o the due date. You

More information

arxiv: v1 [math.fa] 3 Apr 2016

arxiv: v1 [math.fa] 3 Apr 2016 Aticommutator Norm Formula for Proectio Operators arxiv:164.699v1 math.fa] 3 Apr 16 Sam Walters Uiversity of Norther British Columbia ABSTRACT. We prove that for ay two proectio operators f, g o Hilbert

More information

Atomic Physics 4. Name: Date: 1. The de Broglie wavelength associated with a car moving with a speed of 20 m s 1 is of the order of. A m.

Atomic Physics 4. Name: Date: 1. The de Broglie wavelength associated with a car moving with a speed of 20 m s 1 is of the order of. A m. Name: Date: Atomic Pysics 4 1. Te de Broglie wavelegt associated wit a car movig wit a speed of 0 m s 1 is of te order of A. 10 38 m. B. 10 4 m. C. 10 4 m. D. 10 38 m.. Te diagram below sows tree eergy

More information

62. 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 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 information

LECTURE 2 LEAST SQUARES CROSS-VALIDATION FOR KERNEL DENSITY ESTIMATION

LECTURE 2 LEAST SQUARES CROSS-VALIDATION FOR KERNEL DENSITY ESTIMATION Jauary 3 07 LECTURE LEAST SQUARES CROSS-VALIDATION FOR ERNEL DENSITY ESTIMATION Noparametric kerel estimatio is extremely sesitive to te coice of badwidt as larger values of result i averagig over more

More information

University of Washington Department of Chemistry Chemistry 453 Winter Quarter 2015

University of Washington Department of Chemistry Chemistry 453 Winter Quarter 2015 Uiversity of Wasigto Departmet of Cemistry Cemistry 453 Witer Quarter 15 Lecture 14. /11/15 Recommeded Text Readig: Atkis DePaula: 9.1, 9., 9.3 A. Te Equipartitio Priciple & Eergy Quatizatio Te Equipartio

More information

Diagonal approximations by martingales

Diagonal approximations by martingales Alea 7, 257 276 200 Diagoal approximatios by martigales Jaa Klicarová ad Dalibor Volý Faculty of Ecoomics, Uiversity of South Bohemia, Studetsa 3, 370 05, Cese Budejovice, Czech Republic E-mail address:

More information

The Advection-Diffusion equation!

The Advection-Diffusion equation! ttp://www.d.edu/~gtryggva/cf-course/! Te Advectio-iffusio equatio! Grétar Tryggvaso! Sprig 3! Navier-Stokes equatios! Summary! u t + u u x + v u y = P ρ x + µ u + u ρ y Hyperbolic part! u x + v y = Elliptic

More information

NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE

NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE UPB Sci Bull, Series A, Vol 79, Iss, 207 ISSN 22-7027 NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE Gabriel Bercu We itroduce two ew sequeces of Euler-Mascheroi type which have fast covergece

More information

Extremality and Comparison Results for Discontinuous Third Order Functional Initial-Boundary Value Problems

Extremality and Comparison Results for Discontinuous Third Order Functional Initial-Boundary Value Problems Joural of Mathematical Aalysis a Applicatios 255, 9522 2 oi:.6jmaa.2.7232, available olie at http:www.iealibrary.com o Extremality a Compariso Results for Discotiuous Thir Orer Fuctioal Iitial-Bouary Value

More information

x x x 2x x N ( ) p NUMERICAL METHODS UNIT-I-SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS By Newton-Raphson formula

x x x 2x x N ( ) p NUMERICAL METHODS UNIT-I-SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS By Newton-Raphson formula NUMERICAL METHODS UNIT-I-SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS. If g( is cotiuous i [a,b], te uder wat coditio te iterative (or iteratio metod = g( as a uique solutio i [a,b]? '( i [a,b].. Wat

More information

ALGEBRA HW 7 CLAY SHONKWILER

ALGEBRA HW 7 CLAY SHONKWILER ALGEBRA HW 7 CLAY SHONKWILER Prove, or isprove a salvage: If K is a fiel, a f(x) K[x] has o roots, the K[x]/(f(x)) is a fiel. Couter-example: Cosier the fiel K = Q a the polyomial f(x) = x 4 + 3x 2 + 2.

More information

Lecture #3. Math tools covered today

Lecture #3. Math tools covered today Toay s Program:. Review of previous lecture. QM free particle a particle i a bo. 3. Priciple of spectral ecompositio. 4. Fourth Postulate Math tools covere toay Lecture #3. Lear how to solve separable

More information

On Nonsingularity of Saddle Point Matrices. with Vectors of Ones

On Nonsingularity of Saddle Point Matrices. with Vectors of Ones Iteratioal Joural of Algebra, Vol. 2, 2008, o. 4, 197-204 O Nosigularity of Saddle Poit Matrices with Vectors of Oes Tadeusz Ostrowski Istitute of Maagemet The State Vocatioal Uiversity -400 Gorzów, Polad

More information

(VII.A) Review of Orthogonality

(VII.A) Review of Orthogonality VII.A Review of Orthogoality At the begiig of our study of liear trasformatios i we briefly discussed projectios, rotatios ad projectios. I III.A, projectios were treated i the abstract ad without regard

More information

Partial Differential Equations

Partial Differential Equations EE 84 Matematical Metods i Egieerig Partial Differetial Eqatios Followig are some classical partial differetial eqatios were is assmed to be a fctio of two or more variables t (time) ad y (spatial coordiates).

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

Math 242: Principles of Analysis Fall 2016 Homework 7 Part B Solutions

Math 242: Principles of Analysis Fall 2016 Homework 7 Part B Solutions Mat 22: Principles of Analysis Fall 206 Homework 7 Part B Solutions. Sow tat f(x) = x 2 is not uniformly continuous on R. Solution. Te equation is equivalent to f(x) = 0 were f(x) = x 2 sin(x) 3. Since

More information

3. Calculus with distributions

3. Calculus with distributions 6 RODICA D. COSTIN 3.1. Limits of istributios. 3. Calculus with istributios Defiitio 4. A sequece of istributios {u } coverges to the istributio u (all efie o the same space of test fuctios) if (φ, u )

More information

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series. .3 Covergece Theorems of Fourier Series I this sectio, we preset the covergece of Fourier series. A ifiite sum is, by defiitio, a limit of partial sums, that is, a cos( kx) b si( kx) lim a cos( kx) b si(

More information

On triangular billiards

On triangular billiards O triagular billiars Abstract We prove a cojecture of Keyo a Smillie cocerig the oexistece of acute ratioal-agle triagles with the lattice property. MSC-iex: 58F99, 11N25 Keywors: Polygoal billiars, Veech

More information

The Positivity of a Sequence of Numbers and the Riemann Hypothesis

The Positivity of a Sequence of Numbers and the Riemann Hypothesis joural of umber theory 65, 325333 (997) article o. NT97237 The Positivity of a Sequece of Numbers ad the Riema Hypothesis Xia-Ji Li The Uiversity of Texas at Austi, Austi, Texas 7872 Commuicated by A.

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence 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 information

Sequences and Limits

Sequences and Limits Chapter Sequeces ad Limits Let { a } be a sequece of real or complex umbers A ecessary ad sufficiet coditio for the sequece to coverge is that for ay ɛ > 0 there exists a iteger N > 0 such that a p a q

More information

Linear 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

Linear 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 information

Lecture 8: October 20, Applications of SVD: least squares approximation

Lecture 8: October 20, Applications of SVD: least squares approximation Mathematical Toolkit Autum 2016 Lecturer: Madhur Tulsiai Lecture 8: October 20, 2016 1 Applicatios of SVD: least squares approximatio We discuss aother applicatio of sigular value decompositio (SVD) of

More information

MASSACHUSETTS 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

MASSACHUSETTS 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 information

1. By using truth tables prove that, for all statements P and Q, the statement

1. By using truth tables prove that, for all statements P and Q, the statement Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3

More information

Introduction to Optimization Techniques. How to Solve Equations

Introduction 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 information

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial. Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable

More information

Ω ). Then the following inequality takes place:

Ω ). 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 information

Recurrence Relations

Recurrence Relations Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The

More information

Differentiable Convex Functions

Differentiable Convex Functions Differetiable Covex Fuctios The followig picture motivates Theorem 11. f ( x) f ( x) f '( x)( x x) ˆx x 1 Theorem 11 : Let f : R R be differetiable. The, f is covex o the covex set C R if, ad oly if for

More information

Maths /2014. CCP Maths 2. Reduction, projector,endomorphism of rank 1... Hadamard s inequality and some applications. Solution.

Maths /2014. CCP Maths 2. Reduction, projector,endomorphism of rank 1... Hadamard s inequality and some applications. Solution. CCP Maths 2 Reductio, projector,edomorphism of rak 1... Hadamard s iequality ad some applicatios Solutio Exercise 1. 1 A is a symmetric matrix so diagoalizable. 2 Diagoalizatio of A : A characteristic

More information

d y f f dy Numerical Solution of Ordinary Differential Equations Consider the 1 st order ordinary differential equation (ODE) . dx

d y f f dy Numerical Solution of Ordinary Differential Equations Consider the 1 st order ordinary differential equation (ODE) . dx umerical Solutio o Ordiar Dieretial Equatios Cosider te st order ordiar dieretial equatio ODE d. d Te iitial coditio ca be tae as. Te we could use a Talor series about ad obtai te complete solutio or......!!!

More information

Lecture 7: Properties of Random Samples

Lecture 7: Properties of Random Samples Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ

More information

Ellipsoid Method for Linear Programming made simple

Ellipsoid Method for Linear Programming made simple Ellipsoid Method for Liear Programmig made simple Sajeev Saxea Dept. of Computer Sciece ad Egieerig, Idia Istitute of Techology, Kapur, INDIA-08 06 December 3, 07 Abstract I this paper, ellipsoid method

More information

Determinants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1)

Determinants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1) 5. Determiats 5.. Itroductio 5.2. Motivatio for the Choice of Axioms for a Determiat Fuctios 5.3. A Set of Axioms for a Determiat Fuctio 5.4. The Determiat of a Diagoal Matrix 5.5. The Determiat of a Upper

More information

TMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods

TMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods TMA4205 Numerical Liear Algebra The Poisso problem i R 2 : diagoalizatio methods September 3, 2007 c Eiar M Røquist Departmet of Mathematical Scieces NTNU, N-749 Trodheim, Norway All rights reserved A

More information

On Exact Finite-Difference Scheme for Numerical Solution of Initial Value Problems in Ordinary Differential Equations.

On Exact Finite-Difference Scheme for Numerical Solution of Initial Value Problems in Ordinary Differential Equations. O Exact Fiite-Differece Sceme for Numerical Solutio of Iitial Value Problems i Ordiar Differetial Equatios. Josua Suda, M.Sc. Departmet of Matematical Scieces, Adamawa State Uiversit, Mubi, Nigeria. E-mail:

More information

Matrix Operators and Functions Thereof

Matrix Operators and Functions Thereof Mathematics Notes Note 97 31 May 27 Matrix Operators a Fuctios Thereof Carl E. Baum Uiversity of New Mexico Departmet of Electrical a Computer Egieerig Albuquerque New Mexico 87131 Abstract This paper

More information

Representing Functions as Power Series. 3 n ...

Representing Functions as Power Series. 3 n ... Math Fall 7 Lab Represetig Fuctios as Power Series I. Itrouctio I sectio.8 we leare the series c c c c c... () is calle a power series. It is a uctio o whose omai is the set o all or which it coverges.

More information

Sequence A sequence is a function whose domain of definition is the set of natural numbers.

Sequence A sequence is a function whose domain of definition is the set of natural numbers. Chapter Sequeces Course Title: Real Aalysis Course Code: MTH3 Course istructor: Dr Atiq ur Rehma Class: MSc-I Course URL: wwwmathcityorg/atiq/fa8-mth3 Sequeces form a importat compoet of Mathematical Aalysis

More information

Introduction to Optimization Techniques

Introduction 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 information

Homework Set #3 - Solutions

Homework Set #3 - Solutions EE 15 - Applicatios of Covex Optimizatio i Sigal Processig ad Commuicatios Dr. Adre Tkaceko JPL Third Term 11-1 Homework Set #3 - Solutios 1. a) Note that x is closer to x tha to x l i the Euclidea orm

More information

A Pseudo Spline Methods for Solving an Initial Value Problem of Ordinary Differential Equation

A Pseudo Spline Methods for Solving an Initial Value Problem of Ordinary Differential Equation Joural of Matematics ad Statistics 4 (: 7-, 008 ISSN 549-3644 008 Sciece Publicatios A Pseudo Splie Metods for Solvig a Iitial Value Problem of Ordiary Differetial Equatio B.S. Ogudare ad G.E. Okeca Departmet

More information

1 1 2 = show that: over variables x and y. [2 marks] Write down necessary conditions involving first and second-order partial derivatives for ( x0, y

1 1 2 = show that: over variables x and y. [2 marks] Write down necessary conditions involving first and second-order partial derivatives for ( x0, y Questio (a) A square matrix A= A is called positive defiite if the quadratic form waw > 0 for every o-zero vector w [Note: Here (.) deotes the traspose of a matrix or a vector]. Let 0 A = 0 = show that:

More information

Chapter 3 Inner Product Spaces. Hilbert Spaces

Chapter 3 Inner Product Spaces. Hilbert Spaces Chapter 3 Ier Product Spaces. Hilbert Spaces 3. Ier Product Spaces. Hilbert Spaces 3.- Defiitio. A ier product space is a vector space X with a ier product defied o X. A Hilbert space is a complete ier

More information

SYMMETRIC POSITIVE SEMI-DEFINITE SOLUTIONS OF AX = B AND XC = D

SYMMETRIC POSITIVE SEMI-DEFINITE SOLUTIONS OF AX = B AND XC = D Joural of Pure ad Alied Mathematics: Advaces ad Alicatios olume, Number, 009, Pages 99-07 SYMMERIC POSIIE SEMI-DEFINIE SOLUIONS OF AX B AND XC D School of Mathematics ad Physics Jiagsu Uiversity of Sciece

More information

On the convergence, consistence and stability of a standard finite difference scheme

On the convergence, consistence and stability of a standard finite difference scheme AMERICAN JOURNAL OF SCIENTIFIC AND INDUSTRIAL RESEARCH 2, Sciece Huβ, ttp://www.sciub.org/ajsir ISSN: 253-649X, doi:.525/ajsir.2.2.2.74.78 O te covergece, cosistece ad stabilit of a stadard fiite differece

More information

Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Pearson Education, Inc.

Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Pearson Education, Inc. 2 Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES 2012 Pearso Educatio, Ic. Theorem 8: Let A be a square matrix. The the followig statemets are equivalet. That is, for a give A, the statemets

More information

Further Methods for Advanced Mathematics (FP2) WEDNESDAY 9 JANUARY 2008

Further Methods for Advanced Mathematics (FP2) WEDNESDAY 9 JANUARY 2008 ADVANCED GCE 7/ MATHEMATICS (MEI) Furter Metods for Advaced Matematics (F) WEDNESDAY 9 JANUARY 8 Additioal materials: Aswer Booklet (8 pages) Grap paper MEI Eamiatio Formulae ad Tables (MF) Afteroo Time:

More information

Definition 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.

Definition 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 information

5.1 Review of Singular Value Decomposition (SVD)

5.1 Review of Singular Value Decomposition (SVD) MGMT 69000: Topics i High-dimesioal Data Aalysis Falll 06 Lecture 5: Spectral Clusterig: Overview (cotd) ad Aalysis Lecturer: Jiamig Xu Scribe: Adarsh Barik, Taotao He, September 3, 06 Outlie Review of

More information

Complex Analysis Spring 2001 Homework I Solution

Complex Analysis Spring 2001 Homework I Solution Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle

More information

8. Applications To Linear Differential Equations

8. Applications To Linear Differential Equations 8. Applicatios To Liear Differetial Equatios 8.. Itroductio 8.. Review Of Results Cocerig Liear Differetial Equatios Of First Ad Secod Orders 8.3. Eercises 8.4. Liear Differetial Equatios Of Order N 8.5.

More information

LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK)

LECTURE 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 information

MATH10212 Linear Algebra B Proof Problems

MATH10212 Linear Algebra B Proof Problems MATH22 Liear Algebra Proof Problems 5 Jue 26 Each problem requests a proof of a simple statemet Problems placed lower i the list may use the results of previous oes Matrices ermiats If a b R the matrix

More information

How to Maximize a Function without Really Trying

How to Maximize a Function without Really Trying How to Maximize a Fuctio without Really Tryig MARK FLANAGAN School of Electrical, Electroic ad Commuicatios Egieerig Uiversity College Dubli We will prove a famous elemetary iequality called The Rearragemet

More information

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory 1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.

More information

4. The slope of the line 2x 7y = 8 is (a) 2/7 (b) 7/2 (c) 2 (d) 2/7 (e) None of these.

4. The slope of the line 2x 7y = 8 is (a) 2/7 (b) 7/2 (c) 2 (d) 2/7 (e) None of these. Mat 11. Test Form N Fall 016 Name. Instructions. Te first eleven problems are wort points eac. Te last six problems are wort 5 points eac. For te last six problems, you must use relevant metods of algebra

More information

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016 Lecture 3 Digital Sigal Processig Chapter 3 z-trasforms Mikael Swartlig Nedelko Grbic Begt Madersso rev. 06 Departmet of Electrical ad Iformatio Techology Lud Uiversity z-trasforms We defie the z-trasform

More information

Beyond simple iteration of a single function, or even a finite sequence of functions, results

Beyond simple iteration of a single function, or even a finite sequence of functions, results A Primer o the Elemetary Theory of Ifiite Compositios of Complex Fuctios Joh Gill Sprig 07 Abstract: Elemetary meas ot requirig the complex fuctios be holomorphic Theorem proofs are fairly simple ad are

More information

The Method of Least Squares. To understand least squares fitting of data.

The Method of Least Squares. To understand least squares fitting of data. The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve

More information

Matrix Algebra 2.2 THE INVERSE OF A MATRIX Pearson Education, Inc.

Matrix Algebra 2.2 THE INVERSE OF A MATRIX Pearson Education, Inc. 2 Matrix Algebra 2.2 THE INVERSE OF A MATRIX MATRIX OPERATIONS A matrix A is said to be ivertible if there is a matrix C such that CA = I ad AC = I where, the idetity matrix. I = I I this case, C is a

More information

A SHORT INTRODUCTION TO BANACH LATTICES AND

A SHORT INTRODUCTION TO BANACH LATTICES AND CHAPTER A SHORT INTRODUCTION TO BANACH LATTICES AND POSITIVE OPERATORS In tis capter we give a brief introduction to Banac lattices and positive operators. Most results of tis capter can be found, e.g.,

More information

Yuki Seo. Received May 23, 2010; revised August 15, 2010

Yuki Seo. Received May 23, 2010; revised August 15, 2010 Scietiae Mathematicae Japoicae Olie, e-00, 4 45 4 A GENERALIZED PÓLYA-SZEGÖ INEQUALITY FOR THE HADAMARD PRODUCT Yuki Seo Received May 3, 00; revised August 5, 00 Abstract. I this paper, we show a geeralized

More information

Basic Iterative Methods. Basic Iterative Methods

Basic Iterative Methods. Basic Iterative Methods Abel s heorem: he roots of a polyomial with degree greater tha or equal to 5 ad arbitrary coefficiets caot be foud with a fiite umber of operatios usig additio, subtractio, multiplicatio, divisio, ad extractio

More information

ON WELLPOSEDNESS QUADRATIC FUNCTION MINIMIZATION PROBLEM ON INTERSECTION OF TWO ELLIPSOIDS * M. JA]IMOVI], I. KRNI] 1.

ON WELLPOSEDNESS QUADRATIC FUNCTION MINIMIZATION PROBLEM ON INTERSECTION OF TWO ELLIPSOIDS * M. JA]IMOVI], I. KRNI] 1. Yugoslav Joural of Operatios Research 1 (00), Number 1, 49-60 ON WELLPOSEDNESS QUADRATIC FUNCTION MINIMIZATION PROBLEM ON INTERSECTION OF TWO ELLIPSOIDS M. JA]IMOVI], I. KRNI] Departmet of Mathematics

More information

On forward improvement iteration for stopping problems

On forward improvement iteration for stopping problems O forward improvemet iteratio for stoppig problems Mathematical Istitute, Uiversity of Kiel, Ludewig-Mey-Str. 4, D-24098 Kiel, Germay irle@math.ui-iel.de Albrecht Irle Abstract. We cosider the optimal

More information

k=1 s k (x) (3) and that the corresponding infinite series may also converge; moreover, if it converges, then it defines a function S through its sum

k=1 s k (x) (3) and that the corresponding infinite series may also converge; moreover, if it converges, then it defines a function S through its sum 0. L Hôpital s rule You alreay kow from Lecture 0 that ay sequece {s k } iuces a sequece of fiite sums {S } through S = s k, a that if s k 0 as k the {S } may coverge to the it k= S = s s s 3 s 4 = s k.

More information

Supplemental Material: Proofs

Supplemental Material: Proofs Proof to Theorem Supplemetal Material: Proofs Proof. Let be the miimal umber of traiig items to esure a uique solutio θ. First cosider the case. It happes if ad oly if θ ad Rak(A) d, which is a special

More information

AH Checklist (Unit 3) AH Checklist (Unit 3) Matrices

AH Checklist (Unit 3) AH Checklist (Unit 3) Matrices AH Checklist (Uit 3) AH Checklist (Uit 3) Matrices Skill Achieved? Kow that a matrix is a rectagular array of umbers (aka etries or elemets) i paretheses, each etry beig i a particular row ad colum Kow

More information

Probability 2 - Notes 10. Lemma. If X is a random variable and g(x) 0 for all x in the support of f X, then P(g(X) 1) E[g(X)].

Probability 2 - Notes 10. Lemma. If X is a random variable and g(x) 0 for all x in the support of f X, then P(g(X) 1) E[g(X)]. Probability 2 - Notes 0 Some Useful Iequalities. Lemma. If X is a radom variable ad g(x 0 for all x i the support of f X, the P(g(X E[g(X]. Proof. (cotiuous case P(g(X Corollaries x:g(x f X (xdx x:g(x

More information