Finding Rightmost Eigenvalues of Large Sparse. Non-symmetric Parameterized Eigenvalue Problems. Abstract. Introduction
|
|
- Stanley Daniels
- 5 years ago
- Views:
Transcription
1 Finding Rightost Eigenvalues of Large Sparse Non-syetric Paraeterized Eigenvalue Probles Applied Matheatics and Scientific Coputation Progra Departent of Matheatics University of Maryland, College Par, MD Advisor: Professor Howard Elan Departent of Coputer Sciences University of Maryland, College Par, MD Abstract his report has four ain parts. In the first part, I state the eigenvalue proble I a trying to solve in y project, give a brief introduction to its bacground and application, and analyze the coputational difficulties. In the second part, I explain the ethods I use to solve the proble, ainly the eigenvalue solvers and atrix transforations. In the third part, I present the results I have obtained and the codes I develop to ipleent the ethods in the previous part. In the last part of y report, I give a outline of what I will do in the future (AMSC 664). Introduction Consider the eigenvalue proble A x S = λb x () S where A S and B S are large sparse non-syetric real N N atrices and S is a set of paraeters given by the underlying Partial Differential Equation (PDE). For siplicity, I will drop the subscript S in the following discussion. People are interested in coputing its rightost eigenvalues (naely, eigenvalues with the largest real parts). he otivation lies in the deterination of the stability of steady state solutions of non-linear systes of the for du N N N B = f ( u) f : R R, u R (2) dt
2 with large N and where u represents a state variable (velocity, pressure, teperature, etc). B is often called the ass atrix. Define the Jacabian atrix for the steady state u* by A=df/dx(u*), then u* is stable if all the eigenvalues of () have negative real parts. ypically, f arises fro the spatial discretization of a PDE. Interesting applications of this ind occur in stability analyses in fluid echanics, structural engineering and cheical reactions. he proble of finding rightost eigenvalues also frequently occurs in Marov chain odels, econoic odeling, siulation of power systes and agnetohydrodynaics. When finite differences are used to discretize a PDE, then often B=I and () is called a standard eigenproble. If the equations are discretized by finite eleents, then the ass atrix B I and () is called a generalized eigenvalue proble. For probles arising fro fluid echanics, B is often singular. Major coputational difficulties of this ind of probles are: () both A and B are large and sparse, so the algorith we use ust be efficient in dealing with large systes; (2) in any applications, the rightost eigenvalues are coplex, so we ust consider coplex arithetic; (3) B is often singular, so it will give rise to spurious eigenvalues. Beside the nuerical algorith in coputing the rightost eigenvalues of (), how the paraeter set S gives rise to the bifurcation phenoena, i.e, the steady state solution exchanges in stability, is also of people's interest. Exaples are the Rayleigh nuber in nonlinear diffusion equation (Olstead odel) and the Daöhler nuber in the tubular reactor odel. As the paraeters vary, the rightost eigenvalues ight cross the iaginary axis, thus the steady state solution becoes unstable. Methodology Eigenvalue Solvers Since both A and B are large and sparse, direct ethods such as the QZ-algorith for the generalized proble and the QR-algorith for the standard proble are not feasible. A ore efficient approach is the solution of the standard eigenvalue proble x = θx, which is a transforation of Ax = λbx, by iterative ethods lie Arnoldi's ethod, subspace iteration and Lanczos' ethod. Another reason why iterative ethods are ore suitable for this type of proble is that we are usually not interested in coputing the full spectru of the eigenvalue proble (). Instead, we are only interested in coputing a sall set of the spectru, which, in the project, is the rightost eigenvalues. he eigensolver I want to explore in y project is Arnoldi's algorith and its variants, such as the Iplicitly Restarted Arnoldi algorith. 2
3 . Basic Arnoldi Algorith Arnoldi algorith is an iterative eigensolver based on Krylov subspaces. Given a atrix A and a vector u, a -diensional Krylov subspace is spanned by the coluns of the following atrix: K 2 ( A, u ) = [ u Au A u L A u ] provided that they are linear independent. + steps of Arnoldi algorith give us the following decoposition: AU = U H + β u e (3) + where U is an orthonoral basis of the -diensional Krylov subspace and [U u +] is an orthonoral basis of the +-diensional Krylov subspace, H is a upper Hessenberg atrix, β is a scalar and e is a vector [ 0 0 L 0 ]. One thing worth entioning is that we usually select such that «N. Preultiply (3) by U : = U U H + U u + U AU β e = H. (4) herefore, H is the projection of A onto the -diensional Krylov subspace. We hope the eigenvalues of H can be good approxiation of those of A because if that is true, we can solve a uch saller eigenvalue proble instead. Suppose (λ,z) is an eigenpair of H. Mutiply (4) by z: U ( z) H z = λ z = λ( U U ) z = U λ( U z). A U = (5) hen (λ,u z) is an approxiation of an eigenpair of A and we define the residual to be A(U z) λ(u z).we can also obtain fro (5) the following: ( A( U z) ( U z) ) = 0 U λ. his tells us the residual is always orthogonal to the -diensional Krylov subspace. Fig. illustrate A(U z), λ(u z) and their residual: Fig. 3
4 As increases, the residual will decrease and eventually, when =N, A(U z) = λ(u z), which eans (λ,u z) is an exact eigenpair of A. hough Arnoldi algorith is powerful, it is not a good idea to apply it naïvely to our eigenvalue proble. here are basically two reasons: () since we are dealing with large systes, increasing to iprove the perforance of Arnoldi is not practical. For exaple, when A is of size 0,000 0,000 and = 00, then we need 0 egabytes to store the Krylov basis U 00 to double precision; (2) in any real world applications, atrix B is singular. his will give rise to spurious eigenvalues if we don't do anything clever. A lot of variants of Arnoldi algorith follow the line of restarting the Arnoldi process by using a ore carefully chosen starting vector u (in the basic Arnoldi algorith, u is randoly chosen). In y project I will explore one of the, the Iplicitly Restarted Arnoldi algorith (IRA). 2. Iplicitly Restarted Arnoldi (IRA) Algorith he basic idea of IRA is to filter out unwanted eigendirections fro the original starting vector u by using the ost recent spectru inforation and also a clever filtering technique. Suppose we first use Arnoldi algorith and find (>) approxiated eigenpairs: (μ,x ), (μ 2, x 2),, (μ, x ) (Re(μ i) Re(μ j), i<j) and the following Arnoldi decoposition: AU = U H + β u e. (6) We want to filter out the eigendirection x +,, x fro the starting vector u so that it can be richer in the eigendirections we are interested in. Suppose now we want to filter out eigendirection x + fro the starting vector. We first subtract μ +U fro both sides of (6): + ( μ I ) U = U ( H μ I ) β u e A then copute the QR decoposition of H - μ +I (suppose H - μ +I = Q R, Q is orthonoral and R is upper triangular): next, ultiply both sides of (7) by Q : ( I ) U = U Q R β u e A μ, (7) ( A + I )( U Q ) = ( U Q ) ( RQ ) + βu+ eq and add μ +U Q to both sides of (8): μ, (8) ( Q ) = ( U Q ) ( RQ + + I ) + βu+ eq A U his way we have a new Arnoldi decoposition: AU ( ) ( ) ( ) = U H + β u + μ. e Q 4
5 where U () = U Q and H () = R Q + μ +I results fro one QR step with shift μ + applied to H. he first colun of U () is proportional to (A- μ +I)u, so the unwanted eigendirection x + has been filtered out fro the starting vector. We repeat the process with μ +2,,μ and end up with the new Krylov basis U (-) whose first colun is proportional to (A μ +I) (A μ I)u. All the unwanted eigendirections have been filtered out fro the original starting vector u. So we don't need to restart Arnoldi process explicitly, instead, we apply the shifted QR algorith to the upper Hessenberg atrix H to obtain a new Arnoldi decoposition which is equivalent to the decoposition we will obtain if we start the Arnoldi process with the filtered vector. hat's why this ethod is called Iplicitly Restarted Arnoldi. A typical IRA circle consists of the following three steps:. Copute eigenpairs of H (<«N) 2. Apply Shifted QR algorith - ties (with shifts μ +,,μ ) to H to copute a new Arnoldi decoposition with filtered starting vector 3. Go bac to if the wanted eigenpairs do not converge Matrix ransforation Matrix transforation is crucial in solving probles lie (). here are two iportant reasons for this approach. First, a practical reason is that iterative ethods lie Arnoldi's ethod and subspace iteration cannot solve generalized eigenvalue probles, which aes a transforation necessary. A second reason is of a nuerical nature. It is well nown that iterative eigenvalue solvers applied to A quicly converge to the well-separated extree eigenvalues of A. When A arises fro the spatial discretization of a PDE, then the rightost eigenvalues of A are in general not well separated. his iplies slow convergence. he iterative ethod ay converge to a wrong eigenvalue. Instead, one applies eigenvalue solvers to a transforation with the ai of transforing the rightost eigenvalues of A to well-separated extreal eigenvalues of, which are easily found by the eigenvalue solvers we consider. I will explore two inds of atix transforation: Shift-invert transforation and Cayley transforation.. Shift Invert ransforation he definition of shift invert transforation is as following: ( A, B; σ ) = ( A σb) B SI where σ is called the shift. After the transforation, we solve the standard eigenvalue proble x SI = θx instead of the generalized eigenvalue proble Ax = λbx. After that, we use the relationship between λ and θ: 5
6 λ θ = λ σ to recover the eigenvalue of the original proble. Shift invert transforation aps λ that are close to σ away fro origin and aps λ far fro σ close to origin. Fig. 2 and Fig. 3 illustrate this property. Fig. 2 Fig. 3 So an obvious choice of σ is an approxiation of the eigenvalue we want to copute. 2. Cayley ransforation he Cayley transforation is defined by C ( A, B; σ, τ ) = I + ( σ τ ) = ( A σb) ( A τb) where σ is called the shift and τ is called the anti-shift. After the transforation, we solve the standard eigenvalue proble x C SI = θx instead of the generalized eigenvalue proble Ax = λbx. After that, we use the relationship between λ and θ: λ τ λ θ = λ σ to recover the eigenvalue of the original proble. Cayley transforation aps λ close to σ to θ away fro the unit circle and aps λ close to τ to θ with sall odulus. hat's why τ is called the anti-shift. he ost interesting property is that the line Re(λ) = (σ+τ)/2 is apped to the unit circle, and λ to the left of the line are apped inside the unit circle, λ to the right of the line are apped outside the unit circle. Fig.4 and Fig. 5 deonstrate this property. 6
7 Fig. 4 Fig. 5 So if we are interested in coputing r rightost eigenvalues, we should choose σ and τ such that λ r+ lies on the line Re(λ) = (σ+τ)/2. Discretization of PDEs In this project, finite difference and finite eleent ethod will be used to discretize the PDEs. hey are the ost coonly used ethods in the discretization of PDEs. Coplex Arithetic Since the rightost eigenvalues are coplex in any real-world probles, coplex arithetic is considered in this project. Mid-Year Progress Report Overview ie Schedule Progress AMSC 663 solve the first test proble Before Noveber explore the effect of Rayleigh nuber in the proble solve the second test proble - Noveber explore the effect of Daöhler nuber in the proble - Deceber odify the Iplicitly Restarted Arnoldi Algorith solve the third test proble 7
8 January & February March April finish idter report give idter presentation AMSC 664 ipleent iterative linear syste solver give id-ter presentation discretize a Navier-Stoes equation Solve the eigenvalue proble arises fro the discritization explore the effect of the paraeter in the last proble Start writing final report Finish final report May Give final presentation : finished -: in progess : not started he First est Proble: Olstead Model. Proble Stateent he first test proble is fro a paper by Olstead et al in 986. he odel is governed by a coupled syste of PDEs: with boundary condition: ut = S bst = xx + cu ( c) xx + Ru u u S u = S = 0, x = 0, π. 3 his odel represents the flow of a layer of viscoelastic fluid heated fro below. u is the speed of the fluid, S is a quantity related to viscoelatic forces, and b, c, R are all scalars. In particular, R is called the Rayleigh nuber and is the paraeter I study in this proble. 2. Discretization of PDEs I use second order centered difference ethod to discretize the syste of PDEs. Grid size is h = /(N/2). Order the unnowns by grid points, i.e: y = [ u S u2 S2 LuN / 2 SN / 2]. hen the syste can be written as dy/dt = f(y). Matrix B in this case is identity. We evaluate the Jacobian atrix A at the trivial (all 0) steady state solution y*: A = dy/dt(y*) with N = 000, b = 2, c = 0. and R = 0.6. he resulting atrix is a large ( ) sparse nonsyetric atrix with bandwidth 6. Fig. 6 illustrate its structure: 8
9 Fig. 6 he nonzero eleents of the atrix all sit on the six bands in the iddle. his ind of atrix structure is good for linear syste solvers. hat's why I order the unnowns by the grid points. 3. Matlab Ipleentation of Arnoldi Algorith o ipleent Arnoldi algorith together with the shift-invert atrix transforation, I write a Matlab routine: [v,x,u,h]=si_arnoldi(a,b,,siga). he input of the routine is: A, B: atrix A and B in the proble Ax = λbx; : the nuber of eigenpairs wanted; siga: the shift σ in shift-invert transforation. he output of the routine is: v: a vector of coputed eigenvalues; X: a atrix whose coluns are the eigenvectors; U: the orthonoral basis of the +-diensional Krylov subspace; H: the upper Hessenberg atrix. 4. Coputational Result Use = 0 and siga = i. As discussed in the "Matrix ransforation" section, a good choice of σ is an approxiation of the eigenvalue of interest. When b = 2, c = 0. and R = 0.3, the rightost eigenvalue is ±2.085i. So i can be viewed as an approxiation to the rightost eigenvalue when R = 0.6. he coputational result is: rightost eigenvalues: λ,2 = 0 ± i residual: Aλ i λ ix i = e-02, i =,2 and the result agrees with the literature. I also copute the critical Rayleigh nuber. Critical nuber Rayleigh nuber is the value of R under which the rightost eigenvalue just cross the iaginary axis 9
10 R and thus aes the steady state solution change fro stable to unstable. o copute the critical Rayleigh nuber R C, I fix b and c, start fro a large R, copute the rightost eigenvalue, and then decrease R, copute the rightost eigenvalue again using the rightost eigenvalue of the previous step as the σ, repeat this process until the rightost eigenvalue becoe negative. Fig. 7 shows the value of R C under different values of b and c. Fig. 7 he graph shows that R C follows the rule: = + c b C b c b > c which also agrees with the literature. he hird est Proble. Proble Stateent his test proble is fro a Paper by Meergergen and Spence (995). Consider the following eigenvalue proble: K C M 0 x x C = λ where K is a atrix, C is a atrix, and M is a atrix. hey are all of full ran. K, C and M are generated by using Matlab function "rand". 0
11 Although this proble is generated artificially, eigenvalue proble with this ind of bloc structure appears in the stability analysis of steady state solution of Navier Stoes equations for incopressible flow. Eventually, I want to solve the eigenvalue proble arises fro the discretization of Navier Stoes equations. 2. Matlab Ipleentation I use two algoriths to solve this proble and copare their perforance. he first one is the basic Arnoldi algorith and the second one is the Iplicitly Restarted Arnoldi (IRA) algorith. o ipleent the first algorith, I again use the Matlab code in the first proble. For the IRA, I use a code written by Fei Xue. he IRA code has the following iportant functions: Nae of the function IRADirectMain Main function Description ArnoldiExpd sglshiftqr, dblshiftqr contractionira Given a step Arnoldi decoposition,expands it to an step Arnoldi decoposition ( ) Ipleents the shifted QR algorith (sglshiftqr if the shift is real, dblshiftqr if the shift is coplex) Given an step Arnoldi decoposition, contracts it to a step Arnoldi decoposition( ) extracteigenpairs Outputs the eigenpairs of interest and also the error Fig. 8 illustrates the basic structure of the IRA code. Fig. 8
12 3. Coputational Result I first use Matlab function "eig" to copute the exact eigenvalues of the syste, and then use Arnoldi algorith and IRA to copute 0 rightost eigenvalues. he shift σ for both Arnoldi and IRA is 60. Fig. 9 shows their results: Fig. 9 he IRA gives very accurate result. But Arnoldi gives rise to spurious eigenvalues, which are highlighted by red color. he coputed eigenvalues highlighted by blue color are approxiation of the true eigenvalues, but unfortunately, they are not the 0 rightost eigenvalues. Not only does the Arnoldi give rise to spurious eigenvalues, it also coputes the wrong eigenvalues. It is obvious that IRA outperfors Arnoldi. Future Wor (AMSC 664). Finish test proble 2: tubular reactor odel 2. Ipleent iterative linear syste solvers and copare with direct solver 3. Ipleent Cayley atrix transforation and copare with Shift - invert 4. Apply the algorith to Navier Stoes equations Refernce. Meerbergen, K & Roose, D 996 Matrix transforation for coputing 2
13 rightost eigenvalues of large sparse non-syetric eigenvalue probles. SIAM J. Nuer. Anal. 6, Meergergen, K & Spence, A 997 Iplicitly restarted Arnoldi with purification for the shift-invert transforation. Math. Coput. 66, Olstead, W. E., Davis, W. E., Rosenblat, S. H., & Kath, W. L. 986 Bifurcation with eory. SIAM J. Appl. Math. 40, Stewart, G. W. 200 Matrix algoriths, volue II: eigensystes. SIAM 5. Sorensen, D. C. 992 Iplicitly application of polynoial filters in a step Arnoldi Method. SIAM J. Matrix Annal. Appl. 3, Meerbergen, K & Roose, D 997 he restarted Arnoldi ethod applied to iterative linear syste solvers for the coputation of rightost eigenvalues. SIAM J. Matrix Anal. Appl. 8, -20 3
Finding Rightmost Eigenvalues of Large, Sparse, Nonsymmetric Parameterized Eigenvalue Problems
Finding Rightmost Eigenvalues of Large, Sparse, Nonsymmetric Parameterized Eigenvalue Problems AMSC 663-664 Final Report Minghao Wu AMSC Program mwu@math.umd.edu Dr. Howard Elman Department of Computer
More informationFINDING RIGHTMOST EIGENVALUES OF LARGE SPARSE NONSYMMETRIC PARAMETERIZED EIGENVALUE PROBLEMS
FINDING RIGHTMOST EIGENVALUES OF LARGE SPARSE NONSYMMETRIC PARAMETERIZED EIGENVALUE PROBLEMS Department of Mathematics University of Maryland, College Park Advisor: Dr. Howard Elman Department of Computer
More informationRESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS
BIT Nuerical Matheatics 43: 459 466, 2003. 2003 Kluwer Acadeic Publishers. Printed in The Netherlands 459 RESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS V. SIMONCINI Dipartiento di
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationLecture 13 Eigenvalue Problems
Lecture 13 Eigenvalue Probles MIT 18.335J / 6.337J Introduction to Nuerical Methods Per-Olof Persson October 24, 2006 1 The Eigenvalue Decoposition Eigenvalue proble for atrix A: Ax = λx with eigenvalues
More informationChaotic Coupled Map Lattices
Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each
More informationIterative Linear Solvers and Jacobian-free Newton-Krylov Methods
Eric de Sturler Iterative Linear Solvers and Jacobian-free Newton-Krylov Methods Eric de Sturler Departent of Matheatics, Virginia Tech www.ath.vt.edu/people/sturler/index.htl sturler@vt.edu Efficient
More informationGeneralized AOR Method for Solving System of Linear Equations. Davod Khojasteh Salkuyeh. Department of Mathematics, University of Mohaghegh Ardabili,
Australian Journal of Basic and Applied Sciences, 5(3): 35-358, 20 ISSN 99-878 Generalized AOR Method for Solving Syste of Linear Equations Davod Khojasteh Salkuyeh Departent of Matheatics, University
More informationComparison of Stability of Selected Numerical Methods for Solving Stiff Semi- Linear Differential Equations
International Journal of Applied Science and Technology Vol. 7, No. 3, Septeber 217 Coparison of Stability of Selected Nuerical Methods for Solving Stiff Sei- Linear Differential Equations Kwaku Darkwah
More informationLeast Squares Fitting of Data
Least Squares Fitting of Data David Eberly, Geoetric Tools, Redond WA 98052 https://www.geoetrictools.co/ This work is licensed under the Creative Coons Attribution 4.0 International License. To view a
More informationPage 1 Lab 1 Elementary Matrix and Linear Algebra Spring 2011
Page Lab Eleentary Matri and Linear Algebra Spring 0 Nae Due /03/0 Score /5 Probles through 4 are each worth 4 points.. Go to the Linear Algebra oolkit site ransforing a atri to reduced row echelon for
More informationŞtefan ŞTEFĂNESCU * is the minimum global value for the function h (x)
7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not
More informationRECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS MEMBRANE
Proceedings of ICIPE rd International Conference on Inverse Probles in Engineering: Theory and Practice June -8, 999, Port Ludlow, Washington, USA : RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS
More informationSolving initial value problems by residual power series method
Theoretical Matheatics & Applications, vol.3, no.1, 13, 199-1 ISSN: 179-9687 (print), 179-979 (online) Scienpress Ltd, 13 Solving initial value probles by residual power series ethod Mohaed H. Al-Sadi
More informationExplicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes
Explicit solution of the polynoial least-squares approxiation proble on Chebyshev extrea nodes Alfredo Eisinberg, Giuseppe Fedele Dipartiento di Elettronica Inforatica e Sisteistica, Università degli Studi
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationNumerical Studies of a Nonlinear Heat Equation with Square Root Reaction Term
Nuerical Studies of a Nonlinear Heat Equation with Square Root Reaction Ter Ron Bucire, 1 Karl McMurtry, 1 Ronald E. Micens 2 1 Matheatics Departent, Occidental College, Los Angeles, California 90041 2
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationA new type of lower bound for the largest eigenvalue of a symmetric matrix
Linear Algebra and its Applications 47 7 9 9 www.elsevier.co/locate/laa A new type of lower bound for the largest eigenvalue of a syetric atrix Piet Van Mieghe Delft University of Technology, P.O. Box
More informationOBJECTIVES INTRODUCTION
M7 Chapter 3 Section 1 OBJECTIVES Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance, and
More informationPh 20.3 Numerical Solution of Ordinary Differential Equations
Ph 20.3 Nuerical Solution of Ordinary Differential Equations Due: Week 5 -v20170314- This Assignent So far, your assignents have tried to failiarize you with the hardware and software in the Physics Coputing
More informationON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN
More informationVariations on Backpropagation
2 Variations on Backpropagation 2 Variations Heuristic Modifications Moentu Variable Learning Rate Standard Nuerical Optiization Conjugate Gradient Newton s Method (Levenberg-Marquardt) 2 2 Perforance
More informationPOD-DEIM MODEL ORDER REDUCTION FOR THE MONODOMAIN REACTION-DIFFUSION EQUATION IN NEURO-MUSCULAR SYSTEM
6th European Conference on Coputational Mechanics (ECCM 6) 7th European Conference on Coputational Fluid Dynaics (ECFD 7) 1115 June 2018, Glasgow, UK POD-DEIM MODEL ORDER REDUCTION FOR THE MONODOMAIN REACTION-DIFFUSION
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationCh 12: Variations on Backpropagation
Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith
More informationFixed-Point Iterations, Krylov Spaces, and Krylov Methods
Fixed-Point Iterations, Krylov Spaces, and Krylov Methods Fixed-Point Iterations Solve nonsingular linear syste: Ax = b (solution ˆx = A b) Solve an approxiate, but sipler syste: Mx = b x = M b Iprove
More informationFinding The Rightmost Eigenvalues of Large Sparse Non-Symmetric Parameterized Eigenvalue Problem
Fndng he Rghtmost Egenvalues of Large Sparse Non-Symmetrc Parameterzed Egenvalue Problem Mnghao Wu AMSC Program mwu@math.umd.edu Advsor: Professor Howard Elman Department of Computer Scences elman@cs.umd.edu
More informationUsing EM To Estimate A Probablity Density With A Mixture Of Gaussians
Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points
More informationExplicit Approximate Solution for Finding the. Natural Frequency of the Motion of Pendulum. by Using the HAM
Applied Matheatical Sciences Vol. 3 9 no. 1 13-13 Explicit Approxiate Solution for Finding the Natural Frequency of the Motion of Pendulu by Using the HAM Ahad Doosthoseini * Mechanical Engineering Departent
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationarxiv: v1 [stat.ml] 31 Jan 2018
Increental kernel PCA and the Nyströ ethod arxiv:802.00043v [stat.ml] 3 Jan 208 Fredrik Hallgren Departent of Statistical Science University College London London WCE 6BT, United Kingdo fredrik.hallgren@ucl.ac.uk
More informationPHY307F/407F - Computational Physics Background Material for Expt. 3 - Heat Equation David Harrison
INTRODUCTION PHY37F/47F - Coputational Physics Background Material for Expt 3 - Heat Equation David Harrison In the Pendulu Experient, we studied the Runge-Kutta algorith for solving ordinary differential
More informationBernoulli Wavelet Based Numerical Method for Solving Fredholm Integral Equations of the Second Kind
ISSN 746-7659, England, UK Journal of Inforation and Coputing Science Vol., No., 6, pp.-9 Bernoulli Wavelet Based Nuerical Method for Solving Fredhol Integral Equations of the Second Kind S. C. Shiralashetti*,
More informationUsing a De-Convolution Window for Operating Modal Analysis
Using a De-Convolution Window for Operating Modal Analysis Brian Schwarz Vibrant Technology, Inc. Scotts Valley, CA Mark Richardson Vibrant Technology, Inc. Scotts Valley, CA Abstract Operating Modal Analysis
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
More informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More informationSharp Time Data Tradeoffs for Linear Inverse Problems
Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used
More informationAN APPLICATION OF CUBIC B-SPLINE FINITE ELEMENT METHOD FOR THE BURGERS EQUATION
Aksan, E..: An Applıcatıon of Cubıc B-Splıne Fınıte Eleent Method for... THERMAL SCIECE: Year 8, Vol., Suppl., pp. S95-S S95 A APPLICATIO OF CBIC B-SPLIE FIITE ELEMET METHOD FOR THE BRGERS EQATIO by Eine
More informationLinear Transformations
Linear Transforations Hopfield Network Questions Initial Condition Recurrent Layer p S x W S x S b n(t + ) a(t + ) S x S x D a(t) S x S S x S a(0) p a(t + ) satlins (Wa(t) + b) The network output is repeatedly
More informationPhysics 215 Winter The Density Matrix
Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it
More informationAnalysis of Impulsive Natural Phenomena through Finite Difference Methods A MATLAB Computational Project-Based Learning
Analysis of Ipulsive Natural Phenoena through Finite Difference Methods A MATLAB Coputational Project-Based Learning Nicholas Kuia, Christopher Chariah, Mechatronics Engineering, Vaughn College of Aeronautics
More informationIntroduction to Machine Learning. Recitation 11
Introduction to Machine Learning Lecturer: Regev Schweiger Recitation Fall Seester Scribe: Regev Schweiger. Kernel Ridge Regression We now take on the task of kernel-izing ridge regression. Let x,...,
More informationi ij j ( ) sin cos x y z x x x interchangeably.)
Tensor Operators Michael Fowler,2/3/12 Introduction: Cartesian Vectors and Tensors Physics is full of vectors: x, L, S and so on Classically, a (three-diensional) vector is defined by its properties under
More informationIntelligent Systems: Reasoning and Recognition. Artificial Neural Networks
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley MOSIG M1 Winter Seester 2018 Lesson 7 1 March 2018 Outline Artificial Neural Networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationAn Improved Particle Filter with Applications in Ballistic Target Tracking
Sensors & ransducers Vol. 72 Issue 6 June 204 pp. 96-20 Sensors & ransducers 204 by IFSA Publishing S. L. http://www.sensorsportal.co An Iproved Particle Filter with Applications in Ballistic arget racing
More informationKinematics and dynamics, a computational approach
Kineatics and dynaics, a coputational approach We begin the discussion of nuerical approaches to echanics with the definition for the velocity r r ( t t) r ( t) v( t) li li or r( t t) r( t) v( t) t for
More informationInteractive Markov Models of Evolutionary Algorithms
Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary
More informationStability Analysis of the Matrix-Free Linearly Implicit 2 Euler Method 3 UNCORRECTED PROOF
1 Stability Analysis of the Matrix-Free Linearly Iplicit 2 Euler Method 3 Adrian Sandu 1 andaikst-cyr 2 4 1 Coputational Science Laboratory, Departent of Coputer Science, Virginia 5 Polytechnic Institute,
More informationA Generalized Permanent Estimator and its Application in Computing Multi- Homogeneous Bézout Number
Research Journal of Applied Sciences, Engineering and Technology 4(23): 5206-52, 202 ISSN: 2040-7467 Maxwell Scientific Organization, 202 Subitted: April 25, 202 Accepted: May 3, 202 Published: Deceber
More informationThe linear sampling method and the MUSIC algorithm
INSTITUTE OF PHYSICS PUBLISHING INVERSE PROBLEMS Inverse Probles 17 (2001) 591 595 www.iop.org/journals/ip PII: S0266-5611(01)16989-3 The linear sapling ethod and the MUSIC algorith Margaret Cheney Departent
More informationA RESTARTED KRYLOV SUBSPACE METHOD FOR THE EVALUATION OF MATRIX FUNCTIONS. 1. Introduction. The evaluation of. f(a)b, where A C n n, b C n (1.
A RESTARTED KRYLOV SUBSPACE METHOD FOR THE EVALUATION OF MATRIX FUNCTIONS MICHAEL EIERMANN AND OLIVER G. ERNST Abstract. We show how the Arnoldi algorith for approxiating a function of a atrix ties a vector
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lessons 7 20 Dec 2017 Outline Artificial Neural networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationLecture 21. Interior Point Methods Setup and Algorithm
Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and
More informationNORMAL MATRIX POLYNOMIALS WITH NONSINGULAR LEADING COEFFICIENTS
NORMAL MATRIX POLYNOMIALS WITH NONSINGULAR LEADING COEFFICIENTS NIKOLAOS PAPATHANASIOU AND PANAYIOTIS PSARRAKOS Abstract. In this paper, we introduce the notions of weakly noral and noral atrix polynoials,
More informationExplicit Analytic Solution for an. Axisymmetric Stagnation Flow and. Heat Transfer on a Moving Plate
Int. J. Contep. Math. Sciences, Vol. 5,, no. 5, 699-7 Explicit Analytic Solution for an Axisyetric Stagnation Flow and Heat Transfer on a Moving Plate Haed Shahohaadi Mechanical Engineering Departent,
More informationExtension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels
Extension of CSRSM for the Paraetric Study of the Face Stability of Pressurized Tunnels Guilhe Mollon 1, Daniel Dias 2, and Abdul-Haid Soubra 3, M.ASCE 1 LGCIE, INSA Lyon, Université de Lyon, Doaine scientifique
More informationNUMERICAL MODELLING OF THE TYRE/ROAD CONTACT
NUMERICAL MODELLING OF THE TYRE/ROAD CONTACT PACS REFERENCE: 43.5.LJ Krister Larsson Departent of Applied Acoustics Chalers University of Technology SE-412 96 Sweden Tel: +46 ()31 772 22 Fax: +46 ()31
More informationMulti-Scale/Multi-Resolution: Wavelet Transform
Multi-Scale/Multi-Resolution: Wavelet Transfor Proble with Fourier Fourier analysis -- breaks down a signal into constituent sinusoids of different frequencies. A serious drawback in transforing to the
More informationA model reduction approach to numerical inversion for a parabolic partial differential equation
Inverse Probles Inverse Probles 30 (204) 250 (33pp) doi:0.088/0266-56/30/2/250 A odel reduction approach to nuerical inversion for a parabolic partial differential equation Liliana Borcea, Vladiir Drusin
More informationPrincipal Components Analysis
Principal Coponents Analysis Cheng Li, Bingyu Wang Noveber 3, 204 What s PCA Principal coponent analysis (PCA) is a statistical procedure that uses an orthogonal transforation to convert a set of observations
More informationFinite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields
Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for
More informationlecture 36: Linear Multistep Mehods: Zero Stability
95 lecture 36: Linear Multistep Mehods: Zero Stability 5.6 Linear ultistep ethods: zero stability Does consistency iply convergence for linear ultistep ethods? This is always the case for one-step ethods,
More informationGREY FORECASTING AND NEURAL NETWORK MODEL OF SPORT PERFORMANCE
Journal of heoretical and Applied Inforation echnology 3 st March 03 Vol 49 No3 005-03 JAI & LLS All rights reserved ISSN: 99-8645 wwwatitorg E-ISSN: 87-395 GREY FORECASING AND NEURAL NEWORK MODEL OF SPOR
More informationUSEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS. By: Ian Blokland, Augustana Campus, University of Alberta
1 USEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS By: Ian Bloland, Augustana Capus, University of Alberta For: Physics Olypiad Weeend, April 6, 008, UofA Introduction: Physicists often attept to solve
More informationPreconditioned inverse iteration and shift-invert Arnoldi method
Preconditioned inverse iteration and shift-invert Arnoldi method Melina Freitag Department of Mathematical Sciences University of Bath CSC Seminar Max-Planck-Institute for Dynamics of Complex Technical
More informationCHAPTER 19: Single-Loop IMC Control
When I coplete this chapter, I want to be able to do the following. Recognize that other feedback algoriths are possible Understand the IMC structure and how it provides the essential control features
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationA Quantum Observable for the Graph Isomorphism Problem
A Quantu Observable for the Graph Isoorphis Proble Mark Ettinger Los Alaos National Laboratory Peter Høyer BRICS Abstract Suppose we are given two graphs on n vertices. We define an observable in the Hilbert
More informationAn l 1 Regularized Method for Numerical Differentiation Using Empirical Eigenfunctions
Journal of Matheatical Research with Applications Jul., 207, Vol. 37, No. 4, pp. 496 504 DOI:0.3770/j.issn:2095-265.207.04.0 Http://jre.dlut.edu.cn An l Regularized Method for Nuerical Differentiation
More informationGenetic Algorithm Search for Stent Design Improvements
Genetic Algorith Search for Stent Design Iproveents K. Tesch, M.A. Atherton & M.W. Collins, South Bank University, London, UK Abstract This paper presents an optiisation process for finding iproved stent
More informationBulletin of the. Iranian Mathematical Society
ISSN: 1017-060X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Matheatical Society Vol. 41 (2015), No. 4, pp. 981 1001. Title: Convergence analysis of the global FOM and GMRES ethods for solving
More information12 Towards hydrodynamic equations J Nonlinear Dynamics II: Continuum Systems Lecture 12 Spring 2015
18.354J Nonlinear Dynaics II: Continuu Systes Lecture 12 Spring 2015 12 Towards hydrodynaic equations The previous classes focussed on the continuu description of static (tie-independent) elastic systes.
More informationlecture 37: Linear Multistep Methods: Absolute Stability, Part I lecture 38: Linear Multistep Methods: Absolute Stability, Part II
lecture 37: Linear Multistep Methods: Absolute Stability, Part I lecture 3: Linear Multistep Methods: Absolute Stability, Part II 5.7 Linear ultistep ethods: absolute stability At this point, it ay well
More informationDeflation of the I-O Series Some Technical Aspects. Giorgio Rampa University of Genoa April 2007
Deflation of the I-O Series 1959-2. Soe Technical Aspects Giorgio Rapa University of Genoa g.rapa@unige.it April 27 1. Introduction The nuber of sectors is 42 for the period 1965-2 and 38 for the initial
More informationCorrelated Bayesian Model Fusion: Efficient Performance Modeling of Large-Scale Tunable Analog/RF Integrated Circuits
Correlated Bayesian odel Fusion: Efficient Perforance odeling of Large-Scale unable Analog/RF Integrated Circuits Fa Wang and Xin Li ECE Departent, Carnegie ellon University, Pittsburgh, PA 53 {fwang,
More informationCOMPONENT MODE SYNTHESIS, FIXED-INTERFACE MODEL Revision A
COMPONEN MODE SYNHESS, FXED-NERFACE MODEL Revision A By o rvine Eail: toirvine@aol.co February, ntroduction Coponent ode synthesis is a ethod for analyzing the dynaic behavior of a syste consisting of
More informationReed-Muller Codes. m r inductive definition. Later, we shall explain how to construct Reed-Muller codes using the Kronecker product.
Coding Theory Massoud Malek Reed-Muller Codes An iportant class of linear block codes rich in algebraic and geoetric structure is the class of Reed-Muller codes, which includes the Extended Haing code.
More informationSpine Fin Efficiency A Three Sided Pyramidal Fin of Equilateral Triangular Cross-Sectional Area
Proceedings of the 006 WSEAS/IASME International Conference on Heat and Mass Transfer, Miai, Florida, USA, January 18-0, 006 (pp13-18) Spine Fin Efficiency A Three Sided Pyraidal Fin of Equilateral Triangular
More informationSupport Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
More informationNBN Algorithm Introduction Computational Fundamentals. Bogdan M. Wilamoswki Auburn University. Hao Yu Auburn University
NBN Algorith Bogdan M. Wilaoswki Auburn University Hao Yu Auburn University Nicholas Cotton Auburn University. Introduction. -. Coputational Fundaentals - Definition of Basic Concepts in Neural Network
More informationA remark on a success rate model for DPA and CPA
A reark on a success rate odel for DPA and CPA A. Wieers, BSI Version 0.5 andreas.wieers@bsi.bund.de Septeber 5, 2018 Abstract The success rate is the ost coon evaluation etric for easuring the perforance
More informationarxiv: v1 [math.na] 10 Oct 2016
GREEDY GAUSS-NEWTON ALGORITHM FOR FINDING SPARSE SOLUTIONS TO NONLINEAR UNDERDETERMINED SYSTEMS OF EQUATIONS MÅRTEN GULLIKSSON AND ANNA OLEYNIK arxiv:6.395v [ath.na] Oct 26 Abstract. We consider the proble
More informationThe Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
The Siplex Method is Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010 Abstract In this note we prove that the classic siplex ethod with the ost-negativereduced-cost
More informationOn the Use of A Priori Information for Sparse Signal Approximations
ITS TECHNICAL REPORT NO. 3/4 On the Use of A Priori Inforation for Sparse Signal Approxiations Oscar Divorra Escoda, Lorenzo Granai and Pierre Vandergheynst Signal Processing Institute ITS) Ecole Polytechnique
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationBipartite subgraphs and the smallest eigenvalue
Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More informationDedicated to Richard S. Varga on the occasion of his 80th birthday.
MATRICES, MOMENTS, AND RATIONAL QUADRATURE G. LÓPEZ LAGOMASINO, L. REICHEL, AND L. WUNDERLICH Dedicated to Richard S. Varga on the occasion of his 80th birthday. Abstract. Many probles in science and engineering
More informationUniversity of Maryland Department of Computer Science TR-5009 University of Maryland Institute for Advanced Computer Studies TR April 2012
University of Maryland Department of Computer Science TR-5009 University of Maryland Institute for Advanced Computer Studies TR-202-07 April 202 LYAPUNOV INVERSE ITERATION FOR COMPUTING A FEW RIGHTMOST
More informationRational Filter Wavelets*
Ž Journal of Matheatical Analysis and Applications 39, 744 1999 Article ID jaa19996550, available online at http:wwwidealibraryco on Rational Filter Wavelets* Kuang Zheng and Cui Minggen Departent of Matheatics,
More informationTowards Gauge Invariant Bundle Adjustment: A Solution Based on Gauge Dependent Damping
EXTENDED VERSION SHORT VERSION APPEARED IN THE 9TH ICCV, NICE, FRANCE, OCTOBER 003. Towards Gauge Invariant Bundle Adjustent: A Solution Based on Gauge Dependent Daping Adrien Bartoli INRIA Rhône-Alpes,
More informationThe Solution of One-Phase Inverse Stefan Problem. by Homotopy Analysis Method
Applied Matheatical Sciences, Vol. 8, 214, no. 53, 2635-2644 HIKARI Ltd, www.-hikari.co http://dx.doi.org/1.12988/as.214.43152 The Solution of One-Phase Inverse Stefan Proble by Hootopy Analysis Method
More informationSynchronization in large directed networks of coupled phase oscillators
CHAOS 16, 015107 2005 Synchronization in large directed networks of coupled phase oscillators Juan G. Restrepo a Institute for Research in Electronics and Applied Physics, University of Maryland, College
More informationInternet-Based Teleoperation of Carts Considering Effects of Time Delay via Continuous Pole Placement
Aerican Journal of Engineering and Applied Sciences Original Research Paper Internet-Based Teleoperation of Carts Considering Effects of Tie Delay via Continuous Pole Placeent Theophilus Okore-Hanson and
More informationScalable Symbolic Model Order Reduction
Scalable Sybolic Model Order Reduction Yiyu Shi Lei He -J Richard Shi Electrical Engineering Dept, ULA Electrical Engineering Dept, UW Los Angeles, alifornia, 924 Seattle, WA, 985 {yshi, lhe}eeuclaedu
More informationDesign of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding
IEEE TRANSACTIONS ON INFORMATION THEORY (SUBMITTED PAPER) 1 Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding Lai Wei, Student Meber, IEEE, David G. M. Mitchell, Meber, IEEE, Thoas
More informationArnoldi Methods in SLEPc
Scalable Library for Eigenvalue Problem Computations SLEPc Technical Report STR-4 Available at http://slepc.upv.es Arnoldi Methods in SLEPc V. Hernández J. E. Román A. Tomás V. Vidal Last update: October,
More information