Derivative of a Determinant with Respect to an Eigenvalue in the LDU Decomposition of a Non-Symmetric Matrix
|
|
- Darren Lambert
- 6 years ago
- Views:
Transcription
1 Applied Mathematics, 203, 4, Published Olie March 203 ( Derivative of a Determiat with Respect to a Eigevalue i the LDU Decompositio of a No-Symmetric Matrix Mitsuhiro Kashiwagi Departmet of Architecture, School of Idustrial Egieerig, Tokai Uiversity, Toroku, Kumamoto, Japa mkashi@ktmail.tokai-u.jp Received October, 202; revised November, 202; accepted November 8, 202 ABSTRACT We demostrate that, whe computig the LDU decompositio (a typical example of a direct solutio method), it is possible to obtai the derivative of a determiat with respect to a eigevalue of a o-symmetric matrix. Our proposed method augmets a LDU decompositio program with a additioal routie to obtai a program for easily evaluatig the derivative of a determiat with respect to a eigevalue. The proposed method follows simply from the process of solvig simultaeous liear equatios ad is particularly effective for bad matrices, for which memory requiremets are sigificatly reduced compared to those for dese matrices. We discuss the theory uderlyig our proposed method ad preset detailed algorithms for implemetig it. Keywords: Derivative of Determiat; No-Symmetric Matrix; Eigevalue; Bad Matrix; LDU Decompositio. Itroductio I previous work, the author used the trace theorem ad the iverse matrix formula for the coefficiet matrix appearig i the cojugate gradiet method to propose a method for derivative a determiat i a eigevalue problem with respect to a eigevalue []. I particular, we applied this method to eigevalue aalysis ad demostrated its effectiveess i that settig [2-4]. However, the techique proposed i those studies was iteded for use with iterative methods such as the cojugate gradiet method ad was ot applicable to direct solutio methods such as the lower-diagoal-upper (LDU) decompositio, a typical example. Here, we discuss the derivative of a determiat with respect to eigevalues for problems ivolvig LDU decompositio, takig as a referece the equatios associated with the cojugate gradiet method []. Moreover, i the Newto-Raphso method, the solutio depeds o the derivative of a determiat, so the result of our proposed computatioal algorithm may be used to determie the step size i that method. Ideed, the step size may be set automatically, allowig a reductio i the umber of basic parameters, which has a sigificat impact o oliear aalysis. For both dese matrices ad bad matrices, which require sigificatly less memory tha dese matrices, our method performs calculatios usig oly the matrix elemets withi a certai bad of the matrix factors arisig from the LDU decompositio. This esures that calculatios o dese matrices proceed just as if they were bad matrices. Ideed, computatios o dese matrices usig our method are expected to require oly slightly more computatio time tha computatios o bad matrices performed without our proposed method. I what follows, we discuss the theory of our proposed method ad preset detailed algorithms for implemetig it. 2. Derivative of a Determiat with Respect to a Eigevalue Usig the LDU Decompositio The eigevalue problem may be expressed as follows. If A is a o-symmetric matrix of dimesio, the the usual eigevalue problem is Ax x, () where ad x deote respectively a eigevalue ad a correspodig eigevector. I order for Equatio () to have otrivial solutios, the matrix A I must be sigular, i.e., det A I 0. (2) We itroduce the otatio f for the left-had side of this equatio: f det A I. (3) Applyig the trace theorem, we obtai f trace A I A I f, (4) trace A I Copyright 203 SciRes.
2 M. KASHIWAGI 465 where a a2 a 22 A Ia. (5) a a2 a The LDU decompositio decomposes this matrix ito a product of three factors: A LDU, (6) where the L, D, ad U factors have the forms 2 L, (7) 2 Dd d d 22 d, (8) u2 u u 2 U u. (9) We write the iverse of the L factor i the form g 2 L g. (0) g g2 Expadig the relatio LL I (where I is the idetity matrix), we obtai the followig expressios for the elemets of L : i j g, i i j2 g g. () ik kj kj Next, we write the iverse of the U factor i the form h2 h h 2 U h. (2) Expadig the relatio U U I, we agai obtai expressios for the elemets of U : j i h u, j ji2 h u u h. (3) kj ik k i Equatios () ad (3) idicate that g ad h must be computed for all matrix elemets. However, for matrix elemets outside the half-bad, we have 0 ad u 0, ad thus the computatio requires oly elemets ad u withi the half-bad. Moreover, the arrower the half-bad, the more the computatio time is reduced. From Equatio (4), we see that evaluatig the derivative of a determiat requires oly the diagoal elemets of the iverse of the matrix A i (6). Usig Equatios (7)- (0), ad (2) to evaluate ad sum the diagoal elemets of the product U D L, we obtai the followig represetatio of Equatio (4): f gkih ik f i d. (4) d ii ki kk This equatio demostrates that the derivative of a determiat may be computed from the elemets of the iverses of the L, D, ad U matrices obtaied from the LDU decompositio of the origial matrix. As oted above, the calculatio uses oly the elemets of the matrices withi a certai bad ear the diagoal, so computatios o dese matrices may be hadled just as if they were bad matrices. Thus we expect a isigificat icrease i computatio time as compared to that required for bad matrices without our proposed method. By augmetig a LDU decompositio program with a additioal routie (which simply appeds two vectors), we easily obtai a program for evaluatig f f. Such computatios are useful for umerical aalysis usig algorithms such as the Newto-Raphso method or the Durad-Kerer method. Moreover, the proposed method follows easily from the process of solvig simultaeous liear equatios. 3. Algorithms for Implemetig the Proposed Method 3.. Algorithm for Dese Matrices We first discuss a algorithm for dese matrices. The arrays ad variables are as follows. ) LDU decompositio ad calculatio of the derivative of a determiat with respect to a eigevalue () Iput data A: give coefficiet matrix, 2-dimesioal array of the form A(,) b: work vector, -dimesioal array of the form b() c: work vector, -dimesioal array of the form c() : give order of matrix A ad vector b eps: parameter to check sigularity of the matrix A: L matrix, D matrix ad U matrix, 2-dimesioal array of the form A(,) fd: derivative of determiat Copyright 203 SciRes.
3 466 M. KASHIWAGI ierr; error code =0, for ormal executio =, for sigularity (3) LDU decompositio <d(i,i)> do k=,i- A(i,i)=A(i,i)-A(i,j)*A(j,j)*A(j,i) if (abs(a(i,i))<eps) the ierr= retur ed if <l(i,j) ad u(i,j)> do j=i+, do k=,i- A(j,i)=A(j,i)-A(j,k)*A(k,k)*A(k,i) A(i,j)=A(i,j)-A(i,k)*A(k,k)*A(k,j) A(j,i)=A(j,i)/A(i,i) A(i,j)=A(i,j)/A(i,i) ierr=0 (4) Derivative of a determiat with respect to a eigevalue fd=0 <(i,i)>. fd=fd-/a(i,i) <(i,j)> - do j=i+, b(j)=-a(j,i) c(j)=-a(i,j) do k=,j-i- b(j)=b(j)-a(j,i+k)*b(i+k) c(j)=c(j)-a(i+k,j)*c(i+k) fd=fd-b(j)*c(j)/a(j,j) 2) Calculatio of the solutio () Iput data A: L matrix, D matrix ad U matrix, 2-dimesioal array of the form A(,) b: give right-had side vector, -dimesioal array of the form b() : give order of matrix A ad vector b b: work ad solutio vector, -dimesioal array (3) Forward substitutio do j=i+, b(j)=b(j)-a(j,i)*b(i) (4) Backward substitutio b(i)=b(i)/a(i,i) ii=-i+ do j=,ii- b(j)=b(j)-a(j,ii)*b(ii) 3.2. Algorithm for Bad Matrices We ext discuss a algorithm for bad matrices. Figure depicts a schematic represetatio of a bad matrix. Here deotes the left half-badwidth, ad u deotes the right half-badwidth. These umbers do ot iclude the diagoal elemet, so the total badwidth is u. ) LDU decompositio ad calculatio of the derivative of a determiat with respect to a eigevalue () Iput data A: give coefficiet bad matrix, 2-dimesioal array of the form A(,l++u) b: work vector, -dimesioal array of the form b() c: work vector, -dimesioal array of the form c() : give order of matrix A l: give left half-bad width of matrix A u: give right half-bad width of matrix A eps: parameter to check sigularity of the matrix A: L matrix, D matrix ad U matrix, 2-dimesioal array of the form A(,l++u) fd: derivative of determiat ierr: error code =0, for ormal executio =, for sigularity (3) LDU decompositio <d(i,i)> u u Figure. Bad matrix. Copyright 203 SciRes.
4 M. KASHIWAGI 467 do j=max(,i-mi(l,u)),i- A(i,l+)=A(i,l+) -A(i,l+-(i-j))*A(j,l+)*A(j,l++(i-j)) if (abs(a(i,l+))<eps) the ierr= retur ed if <l(i,j)> do j=i+,mi(i+l,) sl=a(j,l+-(j-i)) do k=max(,j-l),i- sl=sl- A(j,l+-(j-k))*A(k,l+)*A(k,l++(i-k)) A(j,l+-(j-i))=sl/A(i,l+) <u(i,j)> do j=i+,mi(i+u,) su=a(i,l++(j-i)) do k=max(,j-u),i- su=su-a(i,l+-(i-k))*a(k,l+)*a(k,l++(j-k)) A(i,l++(j-i))=su/A(i,l+) ierr=0 (4) Derivative of a determiat with respect to a eigevalue fd=0 <(i,i)> fd=fd-/a(i,q) <(i,j)> - do j=i+,mi(i+l,) b(j)=-a(j,l+-(j-i)) do k=,j-i- b(j)=b(j)-a(j,l+-(j-i)+k)*b(i+k) do j=i+l+, b(j)=0.d0 do k=,l b(j)=b(j)-a(j,k)*b(j-l-+k) do j=i+,mi(i+u,) c(j)=-a(i,l++(j-i)) do k=,j-i- c(j)=c(j)-a(i+k,l++(j-i)-k)*c(i+k) do j=i+u+, c(j)=0.d0 do k=,u c(j)=c(j)-a(i,l++k)*c(j-l-+k) do j=i+, fd=fd-b(j)*c(j)/a(j,l+) 2) Calculatio of the solutio () Iput data A: give decomposed coefficiet bad matrix, 2-dimesioal array of the form A(,l++u) b: give right-had side vector, -dimesioal array of the form b() : give order of matrix A ad vector b l: give left half-bad width of matrix A u: give right half-bad width of matrix A b: solutio vector, -dimesioal array (3) Forward substitutio do j=max(,i-l),i- b(i)=b(i)-a(i,+-(i-j))*b(j) (4) Backward substitutio ii=-i+ b(ii)=b(ii)/a(ii,l+) do j=ii+,mi(,ii+u) b(ii)=b(ii)-a(ii,l++(j-ii))*b(j) 4. Coclusio We have demostrated that, whe computig the LDU decompositio (a typical example of a direct solutio method), it is possible simultaeously to obtai the derivative of a determiat with respect to a eigevalue. I additio, i the Newto-Raphso method, the solutio depeds o the derivative of a determiat, so the result of our proposed computatioal algorithm may be used to determie the step size i that method. Ideed, the step size may be set automatically, allowig a reductio i the umber of basic parameters, which has a sigificat impact o oliear aalysis. Our proposed method is based o the LDU decompositio, ad for bad matrices the memory required to store the LDU factors is sigificatly reduced compared to the case of dese matrices. By augmetig a LDU decompositio program with a additioal routie (which simply appeds two vectors), we easily obtai a program for evaluatig the derivative of a Copyright 203 SciRes.
5 468 M. KASHIWAGI determiat with respect to a eigevalue. The result of this computatio is useful for umerical aalysis usig such algorithms as those of the Newto-Raphso method ad the Durad-Kerer method. Moreover, the proposed method follows easily from the process of solvig simultaeous liear equatios ad should prove a effective techique for eigevalue problems ad oliear problems. REFERENCES [] M. Kashiwagi, A Eigesolutio Method for Solvig the Largest or Smallest Eigepair by the Cojugate Gradiet Method, Trasactios of the Japa Society for Aeroautical ad Space Scieces, Vol., 999, pp. -5. [2] M. Kashiwagi, A Method for Determiig Itermediate Eigesolutio of Sparse ad Symmetric Matrices by the Double Shifted Iverse Power Method, Trasactios of JSI, Vol. 9, No. 3, 2009, pp [3] M. Kashiwagi, A Method for Determiig Eigesolutios of Large, Sparse, Symmetric Matrices by the Precoditioed Cojugate Gradiet Method i the Geeralized Eigevalue Problem, Joural of Structural Egieerig, Vol. 73, No. 629, 2008, pp [4] M. Kashiwagi, A Method for Determiig Itermediate Eigepairs of Sparse Symmetric Matrices by Laczos ad Shifted Iverse Power Method i Geeralized Eigevalue Problems, Joural of Structural ad Costructio Egieerig, Vol. 76, No. 664, 20, pp doi:0.330/as.76.8 Copyright 203 SciRes.
Received 8 November 2013; revised 8 December 2013; accepted 15 December 2013
American Journal of Computational Mathematics, 204, 4, 93-03 Published Online March 204 in SciRes. http://www.scirp.org/journal/ajcm http://dx.doi.org/0.4236/jasmi.204.42009 Derivative of a Determinant
More informationPAijpam.eu ON TENSOR PRODUCT DECOMPOSITION
Iteratioal Joural of Pure ad Applied Mathematics Volume 103 No 3 2015, 537-545 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://wwwijpameu doi: http://dxdoiorg/1012732/ijpamv103i314
More informationStochastic Matrices in a Finite Field
Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices
More informationA Hadamard-type lower bound for symmetric diagonally dominant positive matrices
A Hadamard-type lower boud for symmetric diagoally domiat positive matrices Christopher J. Hillar, Adre Wibisoo Uiversity of Califoria, Berkeley Jauary 7, 205 Abstract We prove a ew lower-boud form of
More informationChimica Inorganica 3
himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule
More informationTMA4205 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 informationThe 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 informationCALCULATION OF STIFFNESS AND MASS ORTHOGONAL VECTORS
14. CALCULATION OF STIFFNESS AND MASS ORTHOGONAL VECTORS LDR Vectors are Always More Accurate tha Usig the Exact Eigevectors i a Mode Superpositio Aalysis 14.1 INTRODUCTION The major reaso to calculate
More informationTRACES OF HADAMARD AND KRONECKER PRODUCTS OF MATRICES. 1. Introduction
Math Appl 6 2017, 143 150 DOI: 1013164/ma201709 TRACES OF HADAMARD AND KRONECKER PRODUCTS OF MATRICES PANKAJ KUMAR DAS ad LALIT K VASHISHT Abstract We preset some iequality/equality for traces of Hadamard
More informationAnalytical solutions for multi-wave transfer matrices in layered structures
Joural of Physics: Coferece Series PAPER OPEN ACCESS Aalytical solutios for multi-wave trasfer matrices i layered structures To cite this article: Yu N Belyayev 018 J Phys: Cof Ser 109 01008 View the article
More informationSimilarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall
Iteratioal Mathematical Forum, Vol. 9, 04, o. 3, 465-475 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/imf.04.48 Similarity Solutios to Usteady Pseudoplastic Flow Near a Movig Wall W. Robi Egieerig
More informationA Block Cipher Using Linear Congruences
Joural of Computer Sciece 3 (7): 556-560, 2007 ISSN 1549-3636 2007 Sciece Publicatios A Block Cipher Usig Liear Cogrueces 1 V.U.K. Sastry ad 2 V. Jaaki 1 Academic Affairs, Sreeidhi Istitute of Sciece &
More informationEigenvalues 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 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 informationA Genetic Algorithm for Solving General System of Equations
A Geetic Algorithm for Solvig Geeral System of Equatios Győző Molárka, Edit Miletics Departmet of Mathematics, Szécheyi Istvá Uiversity, Győr, Hugary molarka@sze.hu, miletics@sze.hu Abstract: For solvig
More informationChandrasekhar Type Algorithms. for the Riccati Equation of Lainiotis Filter
Cotemporary Egieerig Scieces, Vol. 3, 00, o. 4, 9-00 Chadrasekhar ype Algorithms for the Riccati Equatio of Laiiotis Filter Nicholas Assimakis Departmet of Electroics echological Educatioal Istitute of
More informationENGI 9420 Engineering Analysis Assignment 3 Solutions
ENGI 9 Egieerig Aalysis Assigmet Solutios Fall [Series solutio of ODEs, matri algebra; umerical methods; Chapters, ad ]. Fid a power series solutio about =, as far as the term i 7, to the ordiary differetial
More informationDiscrete Orthogonal Moment Features Using Chebyshev Polynomials
Discrete Orthogoal Momet Features Usig Chebyshev Polyomials R. Mukuda, 1 S.H.Og ad P.A. Lee 3 1 Faculty of Iformatio Sciece ad Techology, Multimedia Uiversity 75450 Malacca, Malaysia. Istitute of Mathematical
More informationIterative method for computing a Schur form of symplectic matrix
Aals of the Uiversity of Craiova, Mathematics ad Computer Sciece Series Volume 421, 2015, Pages 158 166 ISSN: 1223-6934 Iterative method for computig a Schur form of symplectic matrix A Mesbahi, AH Betbib,
More informationLecture 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 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 informationEstimation 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 informationA GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca
Idia J Pure Appl Math 45): 75-89 February 204 c Idia Natioal Sciece Academy A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS Mircea Merca Departmet of Mathematics Uiversity
More informationAssignment 2 Solutions SOLUTION. ϕ 1 Â = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ.
PHYSICS 34 QUANTUM PHYSICS II (25) Assigmet 2 Solutios 1. With respect to a pair of orthoormal vectors ϕ 1 ad ϕ 2 that spa the Hilbert space H of a certai system, the operator  is defied by its actio
More informationDeterminants 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 informationOn the Determinants and Inverses of Skew Circulant and Skew Left Circulant Matrices with Fibonacci and Lucas Numbers
WSEAS TRANSACTIONS o MATHEMATICS Yu Gao Zhaoli Jiag Yapeg Gog O the Determiats ad Iverses of Skew Circulat ad Skew Left Circulat Matrices with Fiboacci ad Lucas Numbers YUN GAO Liyi Uiversity Departmet
More informationDECOMPOSITION METHOD FOR SOLVING A SYSTEM OF THIRD-ORDER BOUNDARY VALUE PROBLEMS. Park Road, Islamabad, Pakistan
Mathematical ad Computatioal Applicatios, Vol. 9, No. 3, pp. 30-40, 04 DECOMPOSITION METHOD FOR SOLVING A SYSTEM OF THIRD-ORDER BOUNDARY VALUE PROBLEMS Muhammad Aslam Noor, Khalida Iayat Noor ad Asif Waheed
More informationSession 5. (1) Principal component analysis and Karhunen-Loève transformation
200 Autum semester Patter Iformatio Processig Topic 2 Image compressio by orthogoal trasformatio Sessio 5 () Pricipal compoet aalysis ad Karhue-Loève trasformatio Topic 2 of this course explais the image
More informationVariable selection in principal components analysis of qualitative data using the accelerated ALS algorithm
Variable selectio i pricipal compoets aalysis of qualitative data usig the accelerated ALS algorithm Masahiro Kuroda Yuichi Mori Masaya Iizuka Michio Sakakihara (Okayama Uiversity of Sciece) (Okayama Uiversity
More informationModified Decomposition Method by Adomian and. Rach for Solving Nonlinear Volterra Integro- Differential Equations
Noliear Aalysis ad Differetial Equatios, Vol. 5, 27, o. 4, 57-7 HIKARI Ltd, www.m-hikari.com https://doi.org/.2988/ade.27.62 Modified Decompositio Method by Adomia ad Rach for Solvig Noliear Volterra Itegro-
More informationCALCULATING FIBONACCI VECTORS
THE GENERALIZED BINET FORMULA FOR CALCULATING FIBONACCI VECTORS Stuart D Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithacaedu ad Dai Novak Departmet
More informationComparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series
Applied Mathematical Scieces, Vol. 7, 03, o. 6, 3-337 HIKARI Ltd, www.m-hikari.com http://d.doi.org/0.988/ams.03.3430 Compariso Study of Series Approimatio ad Covergece betwee Chebyshev ad Legedre Series
More informationBounds 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 informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 9 Multicolliearity Dr Shalabh Departmet of Mathematics ad Statistics Idia Istitute of Techology Kapur Multicolliearity diagostics A importat questio that
More informationA NEW CLASS OF 2-STEP RATIONAL MULTISTEP METHODS
Jural Karya Asli Loreka Ahli Matematik Vol. No. (010) page 6-9. Jural Karya Asli Loreka Ahli Matematik A NEW CLASS OF -STEP RATIONAL MULTISTEP METHODS 1 Nazeeruddi Yaacob Teh Yua Yig Norma Alias 1 Departmet
More informationDamped Vibration of a Non-prismatic Beam with a Rotational Spring
Vibratios i Physical Systems Vol.6 (0) Damped Vibratio of a No-prismatic Beam with a Rotatioal Sprig Wojciech SOCHACK stitute of Mechaics ad Fudametals of Machiery Desig Uiversity of Techology, Czestochowa,
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationRecurrence 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 informationThe Jordan Normal Form: A General Approach to Solving Homogeneous Linear Systems. Mike Raugh. March 20, 2005
The Jorda Normal Form: A Geeral Approach to Solvig Homogeeous Liear Sstems Mike Raugh March 2, 25 What are we doig here? I this ote, we describe the Jorda ormal form of a matrix ad show how it ma be used
More informationState Space Representation
Optimal Cotrol, Guidace ad Estimatio Lecture 2 Overview of SS Approach ad Matrix heory Prof. Radhakat Padhi Dept. of Aerospace Egieerig Idia Istitute of Sciece - Bagalore State Space Represetatio Prof.
More informationWhy learn matrix algebra? Vectors & Matrices with statistical applications. Brief history of linear algebra
R Vectors & Matrices with statistical applicatios x RXX RXY y RYX RYY Why lear matrix algebra? Simple way to express liear combiatios of variables ad geeral solutios of equatios. Liear statistical models
More informationGenerating Functions for Laguerre Type Polynomials. Group Theoretic method
It. Joural of Math. Aalysis, Vol. 4, 2010, o. 48, 257-266 Geeratig Fuctios for Laguerre Type Polyomials α of Two Variables L ( xy, ) by Usig Group Theoretic method Ajay K. Shula* ad Sriata K. Meher** *Departmet
More informationMatrix 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 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 informationRight circulant matrices with ratio of the elements of Fibonacci and geometric sequence
Notes o Number Theory ad Discrete Mathematics Prit ISSN 1310 5132, Olie ISSN 2367 8275 Vol. 22, 2016, No. 3, 79 83 Right circulat matrices with ratio of the elemets of Fiboacci ad geometric sequece Aldous
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 informationSOME METHODS FOR SOLVING FULLY FUZZY LINEAR SYSTEM OF EQUATIONS
SOME METHODS FOR SOLVING FULLY FUZZY LINEAR SYSTEM OF EQUATIONS Thesis submitted i partial fulfillmet of the requiremet for The award of the degree of Masters of Sciece i Mathematics ad Computig Submitted
More informationSymmetric Matrices and Quadratic Forms
7 Symmetric Matrices ad Quadratic Forms 7.1 DIAGONALIZAION OF SYMMERIC MARICES SYMMERIC MARIX A symmetric matrix is a matrix A such that. A = A Such a matrix is ecessarily square. Its mai diagoal etries
More informationThe z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j
The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.
More information1 Last time: similar and diagonalizable matrices
Last time: similar ad diagoalizable matrices Let be a positive iteger Suppose A is a matrix, v R, ad λ R Recall that v a eigevector for A with eigevalue λ if v ad Av λv, or equivaletly if v is a ozero
More informationAlgorithm Analysis. Chapter 3
Data Structures Dr Ahmed Rafat Abas Computer Sciece Dept, Faculty of Computer ad Iformatio, Zagazig Uiversity arabas@zu.edu.eg http://www.arsaliem.faculty.zu.edu.eg/ Algorithm Aalysis Chapter 3 3. Itroductio
More informationSome Results on Certain Symmetric Circulant Matrices
Joural of Iformatics ad Mathematical Scieces Vol 7, No, pp 81 86, 015 ISSN 0975-5748 olie; 0974-875X prit Pulished y RGN Pulicatios http://wwwrgpulicatioscom Some Results o Certai Symmetric Circulat Matrices
More informationAddition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c
Notes for March 31 Fields: A field is a set of umbers with two (biary) operatios (usually called additio [+] ad multiplicatio [ ]) such that the followig properties hold: Additio: Name Descriptio Commutativity
More informationAlgorithms and Data Structures 2014 Exercises and Solutions Week 13
Algorithms ad Data Structures 204 Exercises ad Solutios Week 3 Toom-Cook (cotiued) Durig the last lecture, two polyomials A(x) a 0 + a x ad B(x) b 0 + b x both of degree were multiplied, first by evaluatig
More informationResearch Article Some E-J Generalized Hausdorff Matrices Not of Type M
Abstract ad Applied Aalysis Volume 2011, Article ID 527360, 5 pages doi:10.1155/2011/527360 Research Article Some E-J Geeralized Hausdorff Matrices Not of Type M T. Selmaogullari, 1 E. Savaş, 2 ad B. E.
More informationA LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II 1. INTRODUCTION
A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II C. T. LONG J. H. JORDAN* Washigto State Uiversity, Pullma, Washigto 1. INTRODUCTION I the first paper [2 ] i this series, we developed certai properties
More informationAn Alternative Scaling Factor In Broyden s Class Methods for Unconstrained Optimization
Joural of Mathematics ad Statistics 6 (): 63-67, 00 ISSN 549-3644 00 Sciece Publicatios A Alterative Scalig Factor I Broyde s Class Methods for Ucostraied Optimizatio Muhammad Fauzi bi Embog, Mustafa bi
More informationFor a 3 3 diagonal matrix we find. Thus e 1 is a eigenvector corresponding to eigenvalue λ = a 11. Thus matrix A has eigenvalues 2 and 3.
Closed Leotief Model Chapter 6 Eigevalues I a closed Leotief iput-output-model cosumptio ad productio coicide, i.e. V x = x = x Is this possible for the give techology matrix V? This is a special case
More informationIntensive Algorithms Lecture 11. DFT and DP. Lecturer: Daniel A. Spielman February 20, f(n) O(g(n) log c g(n)).
Itesive Algorithms Lecture 11 DFT ad DP Lecturer: Daiel A. Spielma February 20, 2018 11.1 Itroductio The purpose of this lecture is to lear how use the Discrete Fourier Trasform to save space i Dyamic
More informationProof of Fermat s Last Theorem by Algebra Identities and Linear Algebra
Proof of Fermat s Last Theorem by Algebra Idetities ad Liear Algebra Javad Babaee Ragai Youg Researchers ad Elite Club, Qaemshahr Brach, Islamic Azad Uiversity, Qaemshahr, Ira Departmet of Civil Egieerig,
More informationDecoupling Zeros of Positive Discrete-Time Linear Systems*
Circuits ad Systems,,, 4-48 doi:.436/cs..7 Published Olie October (http://www.scirp.org/oural/cs) Decouplig Zeros of Positive Discrete-Time Liear Systems* bstract Tadeusz Kaczorek Faculty of Electrical
More informationNumerical Solution of the Two Point Boundary Value Problems By Using Wavelet Bases of Hermite Cubic Spline Wavelets
Australia Joural of Basic ad Applied Scieces, 5(): 98-5, ISSN 99-878 Numerical Solutio of the Two Poit Boudary Value Problems By Usig Wavelet Bases of Hermite Cubic Splie Wavelets Mehdi Yousefi, Hesam-Aldie
More informationRandom Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices
Radom Matrices with Blocks of Itermediate Scale Strogly Correlated Bad Matrices Jiayi Tog Advisor: Dr. Todd Kemp May 30, 07 Departmet of Mathematics Uiversity of Califoria, Sa Diego Cotets Itroductio Notatio
More informationANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION
ANOTHER GENERALIZED FIBONACCI SEQUENCE MARCELLUS E. WADDILL A N D LOUIS SACKS Wake Forest College, Wisto Salem, N. C., ad Uiversity of ittsburgh, ittsburgh, a. 1. INTRODUCTION Recet issues of umerous periodicals
More information1 Adiabatic and diabatic representations
1 Adiabatic ad diabatic represetatios 1.1 Bor-Oppeheimer approximatio The time-idepedet Schrödiger equatio for both electroic ad uclear degrees of freedom is Ĥ Ψ(r, R) = E Ψ(r, R), (1) where the full molecular
More informationSolving a Nonlinear Equation Using a New Two-Step Derivative Free Iterative Methods
Applied ad Computatioal Mathematics 07; 6(6): 38-4 http://www.sciecepublishiggroup.com/j/acm doi: 0.648/j.acm.070606. ISSN: 38-5605 (Prit); ISSN: 38-563 (Olie) Solvig a Noliear Equatio Usig a New Two-Step
More informationA New Solution Method for the Finite-Horizon Discrete-Time EOQ Problem
This is the Pre-Published Versio. A New Solutio Method for the Fiite-Horizo Discrete-Time EOQ Problem Chug-Lu Li Departmet of Logistics The Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog Phoe: +852-2766-7410
More informationNumerical Solutions of Second Order Boundary Value Problems by Galerkin Residual Method on Using Legendre Polynomials
IOSR Joural of Mathematics (IOSR-JM) e-issn: 78-578, p-issn: 319-765X. Volume 11, Issue 6 Ver. IV (Nov. - Dec. 15), PP 1-11 www.iosrjourals.org Numerical Solutios of Secod Order Boudary Value Problems
More informationParallel Vector Algorithms David A. Padua
Parallel Vector Algorithms 1 of 32 Itroductio Next, we study several algorithms where parallelism ca be easily expressed i terms of array operatios. We will use Fortra 90 to represet these algorithms.
More informationUsing An Accelerating Method With The Trapezoidal And Mid-Point Rules To Evaluate The Double Integrals With Continuous Integrands Numerically
ISSN -50 (Paper) ISSN 5-05 (Olie) Vol.7, No., 017 Usig A Acceleratig Method With The Trapezoidal Ad Mid-Poit Rules To Evaluate The Double Itegrals With Cotiuous Itegrads Numerically Azal Taha Abdul Wahab
More informationPoisson s remarkable calculation - a method or a trick?
Poisso s remarkable calculatio - a method or a trick? Deis Bell 1 Departmet of Mathematics, Uiversity of North Florida 1 UNF Drive, Jacksoville, FL 34, U. S. A. email: dbell@uf.edu The Gaussia fuctio e
More informationNEW 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 informationTHE EIGENVALUE PROBLEM
November 5, 2013 APPENDIX D HE EIGENVALUE PROLEM Eigevalues ad Eigevectors are Properties of the Equatios that Simulate the ehavior of a Real Structure D.1 INRODUCION he classical mathematical eigevalue
More informationTaylor polynomial solution of difference equation with constant coefficients via time scales calculus
TMSCI 3, o 3, 129-135 (2015) 129 ew Treds i Mathematical Scieces http://wwwtmscicom Taylor polyomial solutio of differece equatio with costat coefficiets via time scales calculus Veysel Fuat Hatipoglu
More informationEigenvalues of Ikeda Lifts
Eigevalues of Ikeda Lifts Rodey Keato Abstract I this paper we compute explicit formulas for the Hecke eigevalues of Ikeda lifts These formulas, though complicated, are obtaied by purely elemetary techiques
More informationNumerical Conformal Mapping via a Fredholm Integral Equation using Fourier Method ABSTRACT INTRODUCTION
alaysia Joural of athematical Scieces 3(1): 83-93 (9) umerical Coformal appig via a Fredholm Itegral Equatio usig Fourier ethod 1 Ali Hassa ohamed urid ad Teh Yua Yig 1, Departmet of athematics, Faculty
More informationInternational Journal of Mathematical Archive-5(7), 2014, Available online through ISSN
Iteratioal Joural of Mathematical Archive-5(7), 04, 49-56 Available olie through wwwmaifo ISSN 9 5046 APPROXIMAION OF SMALLES EIGENVALUE AND IS CORRESPONDING EIGENVECOR BY POWER MEHOD Alaur Hussai Laskar
More informationl -State Solutions of a New Four-Parameter 1/r^2 Singular Radial Non-Conventional Potential via Asymptotic Iteration Method
America Joural of Computatioal ad Applied Mathematics 8, 8(): 7-3 DOI:.593/j.ajcam.88. l -State Solutios of a New Four-Parameter /r^ Sigular Radial No-Covetioal Potetial via Asymptotic Iteratio Method
More informationSome properties of Boubaker polynomials and applications
Some properties of Boubaker polyomials ad applicatios Gradimir V. Milovaović ad Duša Joksimović Citatio: AIP Cof. Proc. 179, 1050 (2012); doi: 10.1063/1.756326 View olie: http://dx.doi.org/10.1063/1.756326
More informationPrinciple Of Superposition
ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give
More informationSome Variants of Newton's Method with Fifth-Order and Fourth-Order Convergence for Solving Nonlinear Equations
Copyright, Darbose Iteratioal Joural o Applied Mathematics ad Computatio Volume (), pp -6, 9 http//: ijamc.darbose.com Some Variats o Newto's Method with Fith-Order ad Fourth-Order Covergece or Solvig
More informationc 2006 Society for Industrial and Applied Mathematics
SIAM J. MATRIX ANAL. APPL. Vol. 7, No. 3, pp. 851 860 c 006 Society for Idustrial ad Applied Mathematics EXTREMAL EIGENVALUES OF REAL SYMMETRIC MATRICES WITH ENTRIES IN AN INTERVAL XINGZHI ZHAN Abstract.
More informationREVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.
The mai ideas are: Idetities REVISION SHEET FP (MEI) ALGEBRA Before the exam you should kow: If a expressio is a idetity the it is true for all values of the variable it cotais The relatioships betwee
More informationThe Basic Space Model
The Basic Space Model Let x i be the ith idividual s (i=,, ) reported positio o the th issue ( =,, m) ad let X 0 be the by m matrix of observed data here the 0 subscript idicates that elemets are missig
More information5.3 Preconditioning. - M is easy to deal with in parallel (reduced approximate direct solver)
5.3 Precoditioig Direct solvers: Sequetial, loosig sparsity terative solvers: easy parallel ad sparse, but possibly slowly coverget Combiatio of both methods: clude precoditioer i the form - x - b, such
More informationOn the Inverse of a Certain Matrix Involving Binomial Coefficients
It. J. Cotemp. Math. Scieces, Vol. 3, 008, o. 3, 5-56 O the Iverse of a Certai Matrix Ivolvig Biomial Coefficiets Yoshiari Iaba Kitakuwada Seior High School Keihokushimoyuge, Ukyo-ku, Kyoto, 60-0534, Japa
More informationBasic 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 informationComputation for Jacobi-Gauss Lobatto Quadrature Based on Derivative Relation
Computatio for acobi-auss obatto Quadrature Based o Derivative Relatio Z.S. Zheg uaghui Huag Abstract. The three-term recurrece relatio for derivatives of acobi-type polyomial is derived ad the auss-obatto
More informationDIGITAL FILTER ORDER REDUCTION
DIGITAL FILTER RDER REDUTI VAHID RAISSI DEHKRDI, McGILL UIVERSITY, AADA, vahid@cim.mcgill.ca AMIR G. AGHDAM, RDIA UIVERSITY, AADA, aghdam@ece.cocordia.ca ABSTRAT I this paper, a method is proposed to reduce
More informationPolynomial Multiplication and Fast Fourier Transform
Polyomial Multiplicatio ad Fast Fourier Trasform Com S 477/577 Notes Ya-Bi Jia Sep 19, 2017 I this lecture we will describe the famous algorithm of fast Fourier trasform FFT, which has revolutioized digital
More informationMath 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 informationChapter 2 The Solution of Numerical Algebraic and Transcendental Equations
Chapter The Solutio of Numerical Algebraic ad Trascedetal Equatios Itroductio I this chapter we shall discuss some umerical methods for solvig algebraic ad trascedetal equatios. The equatio f( is said
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationAN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC MAPS
http://www.paper.edu.c Iteratioal Joural of Bifurcatio ad Chaos, Vol. 1, No. 5 () 119 15 c World Scietific Publishig Compay AN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC
More informationA 2nTH ORDER LINEAR DIFFERENCE EQUATION
A 2TH ORDER LINEAR DIFFERENCE EQUATION Doug Aderso Departmet of Mathematics ad Computer Sciece, Cocordia College Moorhead, MN 56562, USA ABSTRACT: We give a formulatio of geeralized zeros ad (, )-discojugacy
More informationComparison of Minimum Initial Capital with Investment and Non-investment Discrete Time Surplus Processes
The 22 d Aual Meetig i Mathematics (AMM 207) Departmet of Mathematics, Faculty of Sciece Chiag Mai Uiversity, Chiag Mai, Thailad Compariso of Miimum Iitial Capital with Ivestmet ad -ivestmet Discrete Time
More informationMATH10212 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 informationSolution of Differential Equation from the Transform Technique
Iteratioal Joural of Computatioal Sciece ad Mathematics ISSN 0974-3189 Volume 3, Number 1 (2011), pp 121-125 Iteratioal Research Publicatio House http://wwwirphousecom Solutio of Differetial Equatio from
More informationFeedback in Iterative Algorithms
Feedback i Iterative Algorithms Charles Byre (Charles Byre@uml.edu), Departmet of Mathematical Scieces, Uiversity of Massachusetts Lowell, Lowell, MA 01854 October 17, 2005 Abstract Whe the oegative system
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 information