Slobodan Lakić. Communicated by R. Van Keer
|
|
- Candace Underwood
- 5 years ago
- Views:
Transcription
1
2 Serdca Math. J. 21 (1995), AN ITERATIVE METHOD FOR THE MATRIX PRINCIPAL n-th ROOT Slobodan Lakć Councated by R. Van Keer In ths paper we gve an teratve ethod to copute the prncpal n-th root and the prncpal nvee n-th root of a gven atrx. As we shall show ths ethod s locally convergent. Ths ethod s analyzed and ts nuercal stablty s nvestgated. 1. Introducton. Coputaton ethods for the n-th root of soe atrces have been proposed n [1], [2], [3], etc. In Secton 2 an teratve ethod wth hgh convergence rates s developed. In Secton 3 we shall show that ths ethod s locally stable. In Secton 4 we llustrate the perforance of the ethod by nuercal exaples. Let a = re t C, where r,t R and r 0, t ( π,π]. Defnton 1.1. The prncpal n-th root of a s defned as a 1/n = r 1/n e t/n, where the nuber r 1/n s the unque real and non-negatve n-th root of r. of A. Let A C,, σ(a) = {a, = 1,...,}, a 0, where a are the egenvalues Defnton 1.2. The prncpal nvee n-th root of A s defned as X = A 1/n C, and AX n = I, each egenvalue of A 1/n s the prncpal n-th root of each 1/a Matheatcs Subject Classfcaton: 65F30 Key words: teratve ethods, atrx functon
3 336 Slobodan Lakć Defnton 1.3. The prncpal n-th root of A s defned as X = A 1/n C, and X n = A, each egenvalue of A 1/n s the prncpal n-th root of each a. 2. Coputaton of A 1/k and A 1/k. Theore 2.1. Let f k (z) = (1 z) 1/k, where (1 z) 1/k s the prncpal k-th root of 1 z, k N, k 2, z C, j N, R j 1 (z) = b z, b = f () k (0)/!. Then t holds (k 1)(j 1) (2.1) 1 (1 z)rj 1(z) k = z j for soe postve constants c,k = c,k (k,j), c,k z (2.2) = 0,...,(k 1)(j 1) and (k 1)(j 1) c,k = 1. Proof. By atheatcal nducton for j = 1 1 (1 z)r k j 1(z) = 1 (1 z) = z = zc 0 where c 0 = 1. We assue that (2.1) holds for k 2. Then 1 (1 z)rj k (z) = 1 (1 z)(r j 1(z) + b j z j ) k ( ) k k = 1 (1 z) R j 1(z)b k j z (k )j = 1 (1 z)rj 1 k (z) (1 z)bk j zkj k(1 z)b k 1 j z (k 1)j R j 1 (z) ( ) k 1 ( 1)(j 1) k + b k j z (k )j 1 + z j c, z =2 k 1 = z j ( ) k b k j z (k 1)j z j kb k 1 +z j b k j z1+j(k 1) + kb 1+j(k 2) j R j 1 (z) + j =1 k =2 [ = z j b k jz 1+j(k 1) + b k 1 j z (k 1)j (kb j 1 b j ) b z (k 2)j+ ( k ) b k j z (k )j ( 1)(j 1) c, z
4 j 1 +kb k 1 j =1 An Iteratve Method for the Matrx Prncpal n-th Root 337 +(c 0,k kb j ) + Now we prove (b 1 b )z +j(k 2) + k =2 ( ) k k 1 =2 b k j z j(k ) b k j z j(k ) ( 1)(j 1) =1 (2.3) c 0, = f(j) (0). j! Fro (2.1) t follows that (2.4) R (j) j 1 (z) = (h (z)f (z)) (j) (( ) ( ) k k c 0, )b j 1 ] c, z where h (z) = g (T(z)), g (T) = T 1/ and T(z) = 1 z j ( 1)(j 1) (2.4) t follows that Snce ( ) j j 0 = f (j) (z) + h () (z)f(j ) (z). =1 h () (z) = (! T (k) ) nk (z) n 1,...,n n 1!n 2!... n! g(s) (T), k! k=1 s = n 1 + n n, where n 1,...,n 0 are the nteger solutons of the equaton n 1 + 2n n =, c, z. Fro and snce T () (0) = 0 for 1 j 1, we have h () (0) = 0 for 1 j 1, and fnally h (j) (0) = g (1)T (j) (0). Now 0 = f (j) (0) j!c 0,.e. (2.3). (k 1)(kj + 1) j 1 (( 1)k + 1) Snce kb j 1 b j = j!k j 0 for k N, b 1 b = k 1!k 0 for 1 j 1 and k N, ( ) ( ) k k c 0, b j = 1 k! j!( 1)!(k )! j ( ) 1 + j ( ) 1 k + =1 =1 k(k + 1) > 0
5 338 Slobodan Lakć for k >, and c 0,k kb = 0 we have 1 (1 z)r k j c 0,... c (k 1)j are the postve constants. Settng z = 1 gves (2.2). (k 1)j (z) = zj+1 c z where Theore 2.2. sequence {z n } by Let w be a coplex nuber such that w 0. We defne the (2.5) z n+1 = z n b (1 wzn) k where b, k are as n Theore 2.1, j N, j 2 and 1 wz0 k < 1. Then (2.6) 1 wz k n 1 wz k 0 jn and (2.7) l n z n = 1 w 1/k where w 1/k s the k-th prncpal root of w. P r o o f. Usng Theore 2.1 we have (k 1)(j 1) 1 wz1 k = (1 wz0) k j c,k (1 wz k 0) and 1 wz1 k 1 wzk 0 j. Repeatng ths arguent we have (2.6). Fro (2.6) t holds l 1 n wzk n = 0.e. (2.7). For our analyss we assue that A s dagonalzable, that s there exsts a nonsngular atrx V such that (2.8) V 1 AV = D where D=dag{a 1,...,a } and a 1,...,a are the egenvalues of A. We defne the sequences {X n } and {S n } as follows X n+1 = X n b (I S n ) X 0 C n,n, (I) k S n+1 = S n b (I S n ), S 0 = AX0 k,
6 An Iteratve Method for the Matrx Prncpal n-th Root 339 where X 0 s a functon of A, and j, k, b are as n Theore 2.2. Theore 2.3. Let A C, be nonsngular and dagonalzable. Let {X n }, {S n } be the sequences defned by (I) and (2.9) I S 0 < 1 Then l X n = A 1/k, l S n = I, I AX k n n n = O( I AXk n 1 j ), where A 1/k s the prncpal nvee k-th root of A. Proof. Let (2.10) L n = V 1 X n V, H n = V 1 S n V. Now (2.11) L n+1 = L n + b (I H n ), H n+1 = H n b (I S n ) k L 0 = V 1 X 0 V, H 0 = DL k 0. Fro the equatons (2.11) t follows that L n and H n are dagonal atrces. Let L n = dag {l (n) 1,...,l(n) }, H n = dag {h (n) Equaton (2.11) s equvalent to sequence of equatons. (2.12) l (n+1) h (n+1) = l (n) = h (n) 1,...,h(n) }. b (1 h (n) ), l (0) C, Fro (2.12) one can show that (2.13) l (n+1) = l (n) b (1 h (n) k ), h (0) = a l (0). b ( 1 a (l (n) ) k), l (0) C. Snce the atrx I AX k 0 s dagonalzable, ts atrx nor satsfes I AX k 0 = ρ(i AX k 0) = ρ(i DL k 0) = I DL k 0.
7 340 Slobodan Lakć So we have (2.14) I DL k 0 < 1. Fro (2.14) t follows that (2.15) 1 a (l (0) ) k < 1, = 1,...,. Fro (2.13) and (2.15) usng Theore 2.2 t follows that (2.16) l n l(n) = a 1/k, = 1,...,. Fro (2.12) and (2.16) t follows that So, l n h(n) = 1, = 1,...,n. (2.17) l n L n = D 1/k, l H n = I. n Fro (2.17), (2.10) and (2.8) t follows l X n = A 1/k, n l S n = I. n Fro (2.13) usng Theore 2.1 t follows 1 a (l (n) ) k = (1 a (l (n 1) ) k ) j I DL k n So, I AX k n = (I AX k n 1 (j 1)(k 1) (j 1)(k 1) = (I DL k n 1 )j (j 1)(k 1) )j above equaton, the bound n the theore s establshed. Reark. If S 0 = A 1 X k 0 c,k (1 a (l (n 1) ) k ), c,k (I DL k n 1 ). c,k (I AX k n 1 ). Takng the nor of the then l n X n = A 1/k. s R, Theore 2.4. Let A C n,n be a hertan postve defnte atrx, X 0 = si, 2 n a 1 n 0 < s < ρ 2 (A) 1/k,
8 An Iteratve Method for the Matrx Prncpal n-th Root 341 then l X n = A 1/k, where A 1/k s the prncpal nvee k-th root of A. n Proof. It s known that each hertan atrx s dagonalzable. Then the atrx nor of I s k A satsfes I s k A = ρ(i s k A) = ax 1 1 n sk a = ax 1 n 1 2s k a + s 2k a 2 1 2s k n 1 n a + s 2k ρ 2 (A) < Stablty Analyss. Assue that at the n-th step erro P n and Q n are ntroduced n X n and S n respectvely, where P n = O(ε) and Q n = O(ε). Let X n and S n be the coputed atrces of ths step. Now X n = X n + P n, S n = S n + Q n. We defne P n = V 1 P n V, Qn = V 1 Q n V. Usng the perturbaton result n [4] fro X n+1 = X n gve (A + B) 1 = A 1 A 1 BA 1 + O( B 2 ), [ b (I S n ) and S n+1 = S n b (I S n ) ] k drect calculatons P n+1 Q n+1 1 = L n b (I H n ) Qn (I H n ) 1 + P n b (I h n ) + O(ε 2 ) =1 l k 1 j 1 = H n b (I H n ) 1 b (I H n ) Qn (I H n ) 1 l=0 =1 k l 1 k b (I H n ) + Q n b (I H n ) + O(ε 2 ). Wrtng the above equatons eleent-wse we have, r, s = 1,..., n, where q (n+1) = d (n) q (n), p (n+1) = v (n) q (n) + g (n) p (n), v (n) g (n) = d (n) j 1 = l r (n) 1 b = h (n) r =1 ( b (1 h (n) s ), 1 h (n) r ) ( k 1 ( b 1 h (n) r l=0 1 h (n) s ) l j 1 ) 1, =1 1 b ( 1 h (n) r ) ( 1 h (n) s ) 1
9 342 Slobodan Lakć k l 1 k ( ) j 1 b 1 h (n) ( ) s + b 1 h (n) s. Let e (n) = q(n) p (n). Now we have e (n+1) = W (n) e (n) + O(ε 2 ) where W (n) = d(n) 0 v (n) g (n). W (n) Snce l n d(n) as W (n) = W + O = 1 kb 1 = 0, l (ε (n)) n g(n) = 1, l n v(n) = 1 ka 1/k, we can wrte W = ka 1/k 1, where ε (n) s suffcently sall for large n. The atrx W has egenvalues 0 and 1, let z 0 and z 1 be the correspondng egenvecto, so e (n) = u (n) 0 z 0 + u (n) 1 z 1. For suffcently sall ε and large n we have Consequently e (n+) e (n+) = W e(n) = u(n) 1 z 1 = 1,2,.... = e (n+1) and ethod (I) s locally stable. flops. The usual assupton that the ultplcaton of two n n atrces requres n 3 For ethod (I) f the atrx A s general, the cost s approxatelly (j 1 + B k + log 2 k )n 3
10 An Iteratve Method for the Matrx Prncpal n-th Root 343 flops per teraton, where B k =nuber of ones n bnary representaton of k, log 2 k denotes the largest nteger not exceedng log 2 k, and the nuber of flops s deterned as follows (1) (2) (3) (j 2)n 3 flops to fnd b (I S n ) (B k + log 2 k )n 3 flops to fnd S n+1 [5] n 3 flops to fnd X n+1. If the atrx A s hertan, the cost s approxately (j 1 + B k + log 2 k ) n 3 2 flops per teraton. If the condton I S 0 < 1 n Theore 2.3 s not satsfed then the start ethod (I) ust be used untl I 0 S < Nuercal Exaples. In ths secton we wll use the Frobenus atrx nor A F = a,j 2, the error e n = X n X n 1 F and the followng defnton.,j Defnton 4.1. The ethod (I) converges wthn n teratons f e n δ, where δ s a gven error tollerance. Exaple 1. A = It s desred to fnd A 1/3. We wll use ethod (I) wth 3-rd order convergence rate (j = 3). The atrx A s not dagonalzable. If X 0 = I then I A 1 X0 3 F = If δ = 10 7 then ethod (I) converges wthn 6 teratons. Ths exaple llustrates that the condtons n Theore 2.3 are not necessary condtons. Exaple 2. In ths exaple we copare ethod (I) wth the quadratcally convergent ethod n [3]. Let A be the atrx defned by 1 f = j a j = 1 f < j. 0 f > j It s desred to fnd A 1/3. For the quadratcally convergent ethod n [3] the cost s approxately (2 + k(3k + 1)/2)n 3 flops per teraton. Let δ = The ethod n [3] converges wthn 5.
11 344 Slobodan Lakć teratons and the error e 5 = 8.71E 6. The costs (for 5 teratons) are approxately flops n total. We shall use ethod (I) wth 5-th order covergence rate and X 0 = I. The ethod (I) converges wthn 3 teratons and the error e 3 < 1.0E 8. The costs (for 3 teratons) are approxately flops n total. We see that the ethod (I) converges 4 tes faster than the ethod n [3]. Sngle precson calculatons were used for the two exaples. REFERENCES [1] E. D. Denan. Roots of real atrces. Lnear Algebra Appl., 36 (1981), [2] W. D. Hoskns, D. J. Walton. A faster ore stable ethod for coputng the n-th roots of postve defnte atrces. Lnear Algebra Appl., 26 (1979), [3] Y. T. Tsay, L. S. Sheh, J. S. H. Tsa. A fast ethod for coputng the prncpal n-th roots of coplex atrces, Lnear Algebra Appl., 76 (1986), [4] G. W. Stewart. Introducton to atrx coputaton. New York, Acadec Press, [5] D. E. Knuth. The Art of Coputer Prograng, vol. 2. Addson-Wesley, Don Mlls, Unvety of Nov Sad Techncal Faculty Mhajlo Pupn Zrenjann Yugoslava Receved Deceber 30, 1994 Revsed July 7, 1995
Modified parallel multisplitting iterative methods for non-hermitian positive definite systems
Adv Coput ath DOI 0.007/s0444-0-9262-8 odfed parallel ultsplttng teratve ethods for non-hertan postve defnte systes Chuan-Long Wang Guo-Yan eng Xue-Rong Yong Receved: Septeber 20 / Accepted: 4 Noveber
More informationApplied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationThe Parity of the Number of Irreducible Factors for Some Pentanomials
The Party of the Nuber of Irreducble Factors for Soe Pentanoals Wolfra Koepf 1, Ryul K 1 Departent of Matheatcs Unversty of Kassel, Kassel, F. R. Gerany Faculty of Matheatcs and Mechancs K Il Sung Unversty,
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationExcess Error, Approximation Error, and Estimation Error
E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationFinite Fields and Their Applications
Fnte Felds and Ther Applcatons 5 009 796 807 Contents lsts avalable at ScenceDrect Fnte Felds and Ther Applcatons www.elsever.co/locate/ffa Typcal prtve polynoals over nteger resdue rngs Tan Tan a, Wen-Feng
More informationDenote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form
SET OF METHODS FO SOUTION THE AUHY POBEM FO STIFF SYSTEMS OF ODINAY DIFFEENTIA EUATIONS AF atypov and YuV Nulchev Insttute of Theoretcal and Appled Mechancs SB AS 639 Novosbrs ussa Introducton A constructon
More informationOur focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e.
SSTEM MODELLIN In order to solve a control syste proble, the descrptons of the syste and ts coponents ust be put nto a for sutable for analyss and evaluaton. The followng ethods can be used to odel physcal
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationInexact Newton Methods for Inverse Eigenvalue Problems
Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.
More informationMinimization of l 2 -Norm of the KSOR Operator
ournal of Matheatcs and Statstcs 8 (): 6-70, 0 ISSN 59-36 0 Scence Publcatons do:0.38/jssp.0.6.70 Publshed Onlne 8 () 0 (http://www.thescpub.co/jss.toc) Mnzaton of l -Nor of the KSOR Operator Youssef,
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng
More informationOn Finite Rank Perturbation of Diagonalizable Operators
Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2015. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng
More informationIntroduction. - The Second Lyapunov Method. - The First Lyapunov Method
Stablty Analyss A. Khak Sedgh Control Systems Group Faculty of Electrcal and Computer Engneerng K. N. Toos Unversty of Technology February 2009 1 Introducton Stablty s the most promnent characterstc of
More informationComputational and Statistical Learning theory Assignment 4
Coputatonal and Statstcal Learnng theory Assgnent 4 Due: March 2nd Eal solutons to : karthk at ttc dot edu Notatons/Defntons Recall the defnton of saple based Radeacher coplexty : [ ] R S F) := E ɛ {±}
More informationInternational Journal of Mathematical Archive-9(3), 2018, Available online through ISSN
Internatonal Journal of Matheatcal Archve-9(3), 208, 20-24 Avalable onlne through www.ja.nfo ISSN 2229 5046 CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS T. SHEKAR GOUD, JAGAN MOHAN RAO M AND N.CH.
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationOn Pfaff s solution of the Pfaff problem
Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of
More informationWhat is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.
(C) 998 Gerald B Sheblé, all rghts reserved Lnear Prograng Introducton Contents I. What s LP? II. LP Theor III. The Splex Method IV. Refneents to the Splex Method What s LP? LP s an optzaton technque that
More informationGradient Descent Learning and Backpropagation
Artfcal Neural Networks (art 2) Chrstan Jacob Gradent Descent Learnng and Backpropagaton CSC 533 Wnter 200 Learnng by Gradent Descent Defnton of the Learnng roble Let us start wth the sple case of lnear
More informationMATH Homework #2
MATH609-601 Homework #2 September 27, 2012 1. Problems Ths contans a set of possble solutons to all problems of HW-2. Be vglant snce typos are possble (and nevtable). (1) Problem 1 (20 pts) For a matrx
More informationBy M. O'Neill,* I. G. Sinclairf and Francis J. Smith
52 Polynoal curve fttng when abscssas and ordnates are both subject to error By M. O'Nell,* I. G. Snclarf and Francs J. Sth Departents of Coputer Scence and Appled Matheatcs, School of Physcs and Appled
More informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationQuantum Mechanics for Scientists and Engineers
Quantu Mechancs or Scentsts and Engneers Sangn K Advanced Coputatonal Electroagnetcs Lab redkd@yonse.ac.kr Nov. 4 th, 26 Outlne Quantu Mechancs or Scentsts and Engneers Blnear expanson o lnear operators
More informationfor Linear Systems With Strictly Diagonally Dominant Matrix
MATHEMATICS OF COMPUTATION, VOLUME 35, NUMBER 152 OCTOBER 1980, PAGES 1269-1273 On an Accelerated Overrelaxaton Iteratve Method for Lnear Systems Wth Strctly Dagonally Domnant Matrx By M. Madalena Martns*
More informationTHE ADJACENCY-PELL-HURWITZ NUMBERS. Josh Hiller Department of Mathematics and Computer Science, Adelpi University, New York
#A8 INTEGERS 8 (8) THE ADJACENCY-PELL-HURWITZ NUMBERS Josh Hller Departent of Matheatcs and Coputer Scence Adelp Unversty New York johller@adelphedu Yeş Aküzü Faculty of Scence and Letters Kafkas Unversty
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationRiccati Equation Solution Method for the Computation of the Solutions of X + A T X 1 A = Q and X A T X 1 A = Q
he Open Appled Inforatcs Journal, 009, 3, -33 Open Access Rccat Euaton Soluton Method for the Coputaton of the Solutons of X A X A Q and X A X A Q Mara Ada *, Ncholas Assas, Grgors zallas and Francesca
More informationFinite Vector Space Representations Ross Bannister Data Assimilation Research Centre, Reading, UK Last updated: 2nd August 2003
Fnte Vector Space epresentatons oss Bannster Data Asslaton esearch Centre, eadng, UK ast updated: 2nd August 2003 Contents What s a lnear vector space?......... 1 About ths docuent............ 2 1. Orthogonal
More informationDescription of the Force Method Procedure. Indeterminate Analysis Force Method 1. Force Method con t. Force Method con t
Indeternate Analyss Force Method The force (flexblty) ethod expresses the relatonshps between dsplaceents and forces that exst n a structure. Prary objectve of the force ethod s to deterne the chosen set
More informationSolutions Homework 4 March 5, 2018
1 Solutons Homework 4 March 5, 018 Soluton to Exercse 5.1.8: Let a IR be a translaton and c > 0 be a re-scalng. ˆb1 (cx + a) cx n + a (cx 1 + a) c x n x 1 cˆb 1 (x), whch shows ˆb 1 s locaton nvarant and
More informationThe Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices
Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan
More informationy new = M x old Feature Selection: Linear Transformations Constraint Optimization (insertion)
Feature Selecton: Lnear ransforatons new = M x old Constrant Optzaton (nserton) 3 Proble: Gven an objectve functon f(x) to be optzed and let constrants be gven b h k (x)=c k, ovng constants to the left,
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationA property of the elementary symmetric functions
Calcolo manuscrpt No. (wll be nserted by the edtor) A property of the elementary symmetrc functons A. Esnberg, G. Fedele Dp. Elettronca Informatca e Sstemstca, Unverstà degl Stud della Calabra, 87036,
More informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
More informationOn Syndrome Decoding of Punctured Reed-Solomon and Gabidulin Codes 1
Ffteenth Internatonal Workshop on Algebrac and Cobnatoral Codng Theory June 18-24, 2016, Albena, Bulgara pp. 35 40 On Syndroe Decodng of Punctured Reed-Soloon and Gabduln Codes 1 Hannes Bartz hannes.bartz@tu.de
More information1. Statement of the problem
Volue 14, 010 15 ON THE ITERATIVE SOUTION OF A SYSTEM OF DISCRETE TIMOSHENKO EQUATIONS Peradze J. and Tsklaur Z. I. Javakhshvl Tbls State Uversty,, Uversty St., Tbls 0186, Georga Georgan Techcal Uversty,
More informationFixed-Point Iterations, Krylov Spaces, and Krylov Methods
Fxed-Pont Iteratons, Krylov Spaces, and Krylov Methods Fxed-Pont Iteratons Solve nonsngular lnear syste: Ax = b (soluton ˆx = A b) Solve an approxate, but spler syste: Mx = b x = M b Iprove the soluton
More information1 Review From Last Time
COS 5: Foundatons of Machne Learnng Rob Schapre Lecture #8 Scrbe: Monrul I Sharf Aprl 0, 2003 Revew Fro Last Te Last te, we were talkng about how to odel dstrbutons, and we had ths setup: Gven - exaples
More informationPARTITIONS WITH PARTS IN A FINITE SET
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volue 28, Nuber 5, Pages 269 273 S 0002-9939(0005606-9 Artcle electroncally publshe on February 7, 2000 PARTITIONS WITH PARTS IN A FINITE SET MELVYN B.
More informationρ some λ THE INVERSE POWER METHOD (or INVERSE ITERATION) , for , or (more usually) to
THE INVERSE POWER METHOD (or INVERSE ITERATION) -- applcaton of the Power method to A some fxed constant ρ (whch s called a shft), x λ ρ If the egenpars of A are { ( λ, x ) } ( ), or (more usually) to,
More informationXiangwen Li. March 8th and March 13th, 2001
CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an
More informationCHAPTER 7 CONSTRAINED OPTIMIZATION 1: THE KARUSH-KUHN-TUCKER CONDITIONS
CHAPER 7 CONSRAINED OPIMIZAION : HE KARUSH-KUHN-UCKER CONDIIONS 7. Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based unconstraned
More informationA new eigenvalue inclusion set for tensors with its applications
COMPUTATIONAL SCIENCE RESEARCH ARTICLE A new egenvalue ncluson set for tensors wth ts applcatons Cal Sang 1 and Janxng Zhao 1 * Receved: 30 Deceber 2016 Accepted: 12 Aprl 2017 Frst Publshed: 20 Aprl 2017
More informationGadjah Mada University, Indonesia. Yogyakarta State University, Indonesia Karangmalang Yogyakarta 55281
Reducng Fuzzy Relatons of Fuzzy Te Seres odel Usng QR Factorzaton ethod and Its Applcaton to Forecastng Interest Rate of Bank Indonesa Certfcate Agus aan Abad Subanar Wdodo 3 Sasubar Saleh 4 Ph.D Student
More informationarxiv: v2 [math.co] 3 Sep 2017
On the Approxate Asyptotc Statstcal Independence of the Peranents of 0- Matrces arxv:705.0868v2 ath.co 3 Sep 207 Paul Federbush Departent of Matheatcs Unversty of Mchgan Ann Arbor, MI, 4809-043 Septeber
More informationFORMULAS FOR BINOMIAL SUMS INCLUDING POWERS OF FIBONACCI AND LUCAS NUMBERS
U.P.B. Sc. Bull., Seres A, Vol. 77, Iss. 4, 015 ISSN 13-707 FORMULAS FOR BINOMIAL SUMS INCLUDING POWERS OF FIBONACCI AND LUCAS NUMBERS Erah KILIÇ 1, Iler AKKUS, Neşe ÖMÜR, Yücel Türer ULUTAŞ3 Recently
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationCHAPTER 6 CONSTRAINED OPTIMIZATION 1: K-T CONDITIONS
Chapter 6: Constraned Optzaton CHAPER 6 CONSRAINED OPIMIZAION : K- CONDIIONS Introducton We now begn our dscusson of gradent-based constraned optzaton. Recall that n Chapter 3 we looked at gradent-based
More informationVector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.
Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm
More informationDesigning Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate
The Frst Internatonal Senar on Scence and Technology, Islac Unversty of Indonesa, 4-5 January 009. Desgnng Fuzzy Te Seres odel Usng Generalzed Wang s ethod and Its applcaton to Forecastng Interest Rate
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationMATH Sensitivity of Eigenvalue Problems
MATH 537- Senstvty of Egenvalue Problems Prelmnares Let A be an n n matrx, and let λ be an egenvalue of A, correspondngly there are vectors x and y such that Ax = λx and y H A = λy H Then x s called A
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationImplicit scaling of linear least squares problems
RAL-TR-98-07 1 Iplct scalng of lnear least squares probles by J. K. Red Abstract We consder the soluton of weghted lnear least squares probles by Householder transforatons wth plct scalng, that s, wth
More informationDeriving the X-Z Identity from Auxiliary Space Method
Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA 92697 chenlong@math.uc.edu 1 Iteratve Methods In ths paper we dscuss teratve
More informationA FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX
Hacettepe Journal of Mathematcs and Statstcs Volume 393 0 35 33 FORMUL FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIGONL MTRIX H Kıyak I Gürses F Yılmaz and D Bozkurt Receved :08 :009 : ccepted 5
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES
Journal of Algebra, Nuber Theory: Advances and Applcatons Volue 3, Nuber, 05, Pages 3-8 ON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES Feldstrasse 45 CH-8004, Zürch Swtzerland e-al: whurlann@bluewn.ch
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
More informationSolving Fuzzy Linear Programming Problem With Fuzzy Relational Equation Constraint
Intern. J. Fuzz Maeatcal Archve Vol., 0, -0 ISSN: 0 (P, 0 0 (onlne Publshed on 0 Septeber 0 www.researchasc.org Internatonal Journal of Solvng Fuzz Lnear Prograng Proble W Fuzz Relatonal Equaton Constrant
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationLECTURE :FACTOR ANALYSIS
LCUR :FACOR ANALYSIS Rta Osadchy Based on Lecture Notes by A. Ng Motvaton Dstrbuton coes fro MoG Have suffcent aount of data: >>n denson Use M to ft Mture of Gaussans nu. of tranng ponts If
More information{ In general, we are presented with a quadratic function of a random vector X
Quadratc VAR odel Mchael Carter à Prelnares Introducton Suppose we wsh to quantfy the value-at-rsk of a Japanese etals tradng fr that has exposure to forward and opton postons n platnu. Soe of the postons
More informationDISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization
DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.
More informationA Radon-Nikodym Theorem for Completely Positive Maps
A Radon-Nody Theore for Copletely Postve Maps V P Belavn School of Matheatcal Scences, Unversty of Nottngha, Nottngha NG7 RD E-al: vpb@aths.nott.ac.u and P Staszews Insttute of Physcs, Ncholas Coperncus
More informationSeveral generation methods of multinomial distributed random number Tian Lei 1, a,linxihe 1,b,Zhigang Zhang 1,c
Internatonal Conference on Appled Scence and Engneerng Innovaton (ASEI 205) Several generaton ethods of ultnoal dstrbuted rando nuber Tan Le, a,lnhe,b,zhgang Zhang,c School of Matheatcs and Physcs, USTB,
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More information= m 1. sin π( ai z ) )
EXACT COVERING SYSTEMS AND THE GAUSS-LEGENDRE MULTIPLICATION FORMULA FOR THE GAMMA FUNCTION John Beeee Unversty of Alaska Anchorage July 0 199 The Gauss-Legendre ultplcaton forula for the gaa functon s
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationCONDITIONS FOR INVARIANT SUBMANIFOLD OF A MANIFOLD WITH THE (ϕ, ξ, η, G)-STRUCTURE. Jovanka Nikić
147 Kragujevac J. Math. 25 (2003) 147 154. CONDITIONS FOR INVARIANT SUBMANIFOLD OF A MANIFOLD WITH THE (ϕ, ξ, η, G)-STRUCTURE Jovanka Nkć Faculty of Techncal Scences, Unversty of Nov Sad, Trg Dosteja Obradovća
More informationCOS 511: Theoretical Machine Learning
COS 5: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #0 Scrbe: José Sões Ferrera March 06, 203 In the last lecture the concept of Radeacher coplexty was ntroduced, wth the goal of showng that
More informationBinomial transforms of the modified k-fibonacci-like sequence
Internatonal Journal of Mathematcs and Computer Scence, 14(2019, no. 1, 47 59 M CS Bnomal transforms of the modfed k-fbonacc-lke sequence Youngwoo Kwon Department of mathematcs Korea Unversty Seoul, Republc
More informationChapter 12 Lyes KADEM [Thermodynamics II] 2007
Chapter 2 Lyes KDEM [Therodynacs II] 2007 Gas Mxtures In ths chapter we wll develop ethods for deternng therodynac propertes of a xture n order to apply the frst law to systes nvolvng xtures. Ths wll be
More informationQuantum Particle Motion in Physical Space
Adv. Studes Theor. Phys., Vol. 8, 014, no. 1, 7-34 HIKARI Ltd, www.-hkar.co http://dx.do.org/10.1988/astp.014.311136 Quantu Partcle Moton n Physcal Space A. Yu. Saarn Dept. of Physcs, Saara State Techncal
More informationA Numerical Algorithm for Reconstructing Continuous-Time Linear Models with Pure Integrators from Their Discrete-Time Equivalents
A Nuercal Algorth for Reconstructng Contnuous-Te Lnear Models wth Pure Integrators fro Ther Dscrete-Te Equvalents Zaher M Kassas and Greg Morrow Abstract A nuercal algorth for reconstructng contnuous-te
More informationScattering by a perfectly conducting infinite cylinder
Scatterng by a perfectly conductng nfnte cylnder Reeber that ths s the full soluton everywhere. We are actually nterested n the scatterng n the far feld lt. We agan use the asyptotc relatonshp exp exp
More informationChapter 1. Theory of Gravitation
Chapter 1 Theory of Gravtaton In ths chapter a theory of gravtaton n flat space-te s studed whch was consdered n several artcles by the author. Let us assue a flat space-te etrc. Denote by x the co-ordnates
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More information,..., k N. , k 2. ,..., k i. The derivative with respect to temperature T is calculated by using the chain rule: & ( (5) dj j dt = "J j. k i.
Suppleentary Materal Dervaton of Eq. 1a. Assue j s a functon of the rate constants for the N coponent reactons: j j (k 1,,..., k,..., k N ( The dervatve wth respect to teperature T s calculated by usng
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationLECTURE 8-9: THE BAKER-CAMPBELL-HAUSDORFF FORMULA
LECTURE 8-9: THE BAKER-CAMPBELL-HAUSDORFF FORMULA As we have seen, 1. Taylor s expanson on Le group, Y ] a(y ). So f G s an abelan group, then c(g) : G G s the entty ap for all g G. As a consequence, a()
More informationChapter 7 Generalized and Weighted Least Squares Estimation. In this method, the deviation between the observed and expected values of
Chapter 7 Generalzed and Weghted Least Squares Estmaton The usual lnear regresson model assumes that all the random error components are dentcally and ndependently dstrbuted wth constant varance. When
More information