RESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS
|
|
- Ethelbert Austin Hall
- 6 years ago
- Views:
Transcription
1 BIT Nuerical Matheatics 43: , Kluwer Acadeic Publishers. Printed in The Netherlands 459 RESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS V. SIMONCINI Dipartiento di Mateatica, Università di Bologna, and Istituto di Mateatica Applicata e Tecnologie Inforatiche del CNR, via Ferrata 1, Pavia, Italy. eail: val@iati.cnr.it. Abstract. RestartedGMRESisknowntobeinefficientforsolvingshiftedsysteswhenthe shifts are handled siultaneously. Variants have been proposed to enhance its perforance. We show that another restarted ethod, restarted Full Orthogonalization Method (FOM, can effectively be eployed. The total nuber of iterations of restarted FOM applied to all shifted systes siultaneously is the sae as that obtained by applying restarted FOM to the shifted systewith slowest convergence rate, while the coputational cost grows only sub-linearly with the nuber of shifts. Nuerical experients are reported. AMS subject classification: 65F10, 65F15, 15A06, 15A18. Key words: Shifted algebraic linear systes. Krylov subspace ethods. Iterative non syetric solver. 1 Introduction. Given a real large n n nonsyetric atrix A, we are interested in the siultaneous solution of the shifted nonsingular linear syste (1.1 (A σix = b, for several (say a few hundreds; see, e.g., [2] tabulated values of the paraeter σ. (I stands for the identity atrix. This type of proble arises in any applications, such as control theory, structural dynaics, tie dependent PDEs and quantu chroodynaics; see [1, 2, 5, 6] and references therein. One such application is discussed in the experients section. Krylov subspace techniques are particularly appealing since they rely on a shift invariance property, which allows to obtain approxiation iterates for all paraeter values by only constructing one approxiation subspace. Indeed, the Krylov subspace K (A, v =span{v,av,...,a 1 v} satisfies K (A, v =K (A σi, v. In the linear syste setting, the generating vector v is the residual associated with a starting approxiate solution. A widely known and appreciated schee, the Generalized Miniu residual ethod (GMRES, has been shown to be effective on (1.1, see [1]. However, in several circustances, the approxiation Received August Revised Noveber Counicated by Olavi Nevanlinna.
2 460 V. SIMONCINI space required to satisfactorily approxiate all shifted systes appears to be too large, and the ethod needs to be restarted, taking the current syste residual as new generating vector. Coputational efficiency can be aintained after restart if the new Krylov subspace is the sae for all shifted systes. This happens when the generating vectors, in our case the current residuals, are collinear. Since in general the coputed GMRES shifted residuals are not collinear, after the first restart, restarted GMRES can only be applied to each shifted syste separately. Several alternative strategies can be considered within the Krylov subspace setting with restarting: 1 Run GMRES on a seed syste, e.g. the syste with zero shift, and then generate the approxiate solutions to the shifted systes iposing collinearity with the coputed seed residual. This idea was investigated in [5]. Note that only the seed syste residual is iniized, whereas no iniization property is satisfied by the shifted systes residuals. 2 Take as seed syste one of the shifted systes, on which restarted GMRES is applied, and generate approxiate solutions to the reaining shifted systes iposing collinearity. Possibly a new seed is selected at each restart, choosing as seed the syste with larger residual nor. This is a siple variant of the previous schee, which was used in [2] to cure isconvergence of the original approach in [5]. Note that in general, at each restarting phase a different syste residual is iniized. 3 Use a restarted Krylov subspace ethod other than restarted GMRES, that naturally generates collinear residuals. To the best of our knowledge, the third option above has not been considered in the past. The ai of this contribution is to draw attention to the fact that another restarted ethod, the Full Orthogonalization ethod (FOM, can be naturally applied to shifted systes since all residuals are naturally collinear. It will becoe apparent that the convergence history is the sae as that obtained by applying restarted FOM to each shifted syste independently, while coputational cost and eory requireents 1 are substantially reduced, since a single approxiation space is constructed for all shifted systes. Alternative approaches that do not require restarting are based on CG and Lanczos recurrences. These include the shifted TFQMR ethod, proposed by R. Freund [4], and the Shifted two-sided Lanczos ethod [9]. Meory requireents however ay liit their applicability to general shifted probles, since additional long vectors need to be stored for each shifted syste siultaneously handled. We refer to [2, 9] for nuerical experiences on applications on which variants of these solvers are particularly effective. We refer to [6] for a coparison of unrestarted FOM and GMRES in the syetric shifted case. All experients were run using Matlab 6 on one processor of a Sun Enterprise Exact arithetic is assued throughout the paper. 1 Order n eory requireents are the sae as for standard restarted FOM if this is applied to each shifted syste sequentially.
3 RESTARTED FOM FOR SHIFTED LINEAR SYSTEMS The algorith. Given a nonsyetric linear syste Ax = b and a starting guess x 0,consider the Krylov subspace K (A, r 0, where r 0 = b Ax 0. Letting V be an orthogonal basis of K (A, r 0 andh be the projection and restriction of A onto K (A, r 0, then the FOM approxiation x = x 0 +z to x is deterined in x 0 +K (A, r 0 so that the associated residual r = b Ax is orthogonal to the approxiation space K (A, r 0. More precisely, x = x 0 + V y,wherey solves the reduced syste H y = β 0 e 1,withβ 0 = r 0 [7]. Here and below, e i denotes the ith colun of the identity atrix, whose diension is clear fro the context; is the vector 2 nor. If the obtained approxiate solution is not sufficiently accurate, then the FOM ethod is restarted, by using r = b Ax as new starting residual. The generation of the Krylov subspace can be carried out by eans of the Arnoldi algorith, which constructs V,H so that the first basis vector v 1 is v 1 = r 0 /β 0,and (2.1 AV = V H + h +1, v +1 e T. e T indicates the real transpose of e. Consider now the shifted syste (1.1. Shifting transfors (2.1 into (2.2 (A σiv = V (H σi +h +1, v +1 e T, where I is the identity atrix of size. Thanks to (2.2, the only difference in FOM is that y is coputed by solving the reduced shifted syste (H σi y = β 0 e 1. Therefore, the expensive step of constructing the orthogonal basis V is perfored only once for all values of σ of interest, σ {σ 1,...,σ s }, whereas s reduced systes of size need be solved. This is the case if the right hand sides are collinear. In the following, we shall assue that x 0 =0so that all shifted systes have the sae right-hand side. Restarting can also be eployed in the shifted case. The key fact is that the FOM residual r is a ultiple of the basis vector v +1, that is r = h +1, v +1 (y ; see e.g. [7]. In the last expression, (y is the th coponent of the vector y. The next proposition shows that collinearity still holds in the shifted case when FOM is applied. Proposition 2.1. For each i =1,...,s,letx (i = V y (i be a FOM approxiate solution to (A σ i Ix = b in K (A σ i I,b, withv satisfying (2.2 with σ = σ i. Then there exists β (i Proof. Fori =1,...,s,wehave r (i Setting β (i = b (A σ i Ix (i R such that r (i = r 0 (A σ i IV y (i = b (A σ i Ix (i = V β 0 e 1 V H y (i + σ iv y (i h +1,v +1 (y (i = h +1, v +1 (y (i. = h +1, (y (i, i =1,...,s,wehaver (i = β (i v +1. = β (i v +1.
4 462 V. SIMONCINI The Shifted FOM ethod can be restarted by using any of the shifted syste residuals r (i, i =1,...,s as new generating vector. Let thus ˆv 1 be the first vector of the new basis ˆV after restart 2.Notethat ˆv 1 = r (i /β (i = ±v +1, i =1,...,s. Hence the new proble reads: For each i =1,...,s, find ˆx (i = x (i + ˆV ŷ (i with Range( ˆV =K (A, ˆv 1 whereŷ (i solves the reduced syste (Ĥ σ i I ŷ = β (i e 1. For each shifted syste, the new residual can be coputed as ˆr (i = r (i (A σ i I ˆV ŷ (i = ĥ+1,ˆv +1 (ŷ (i, showing that all new residuals are collinear to the +1st basis vector, hence the process can be repeated. In particular, we have shown that collinearity holds also when the original right-hand sides are different but collinear. The final algorith can be written as follows. Algorith. Restarted Shifted FOM: Given A, b, x 0 =0,,{σ 1,...,σ s }, I = {1,...,s}: 1. Set r 0 = b, β (i = r 0,x (i = x 0,i=1,...,s.Setv 1 = r 0 /β (i. 2. Generate V,H associated with K (A, v 1 3. For each i I y (i =(H σ i I 1 e 1 β (i Update x (i x (i + V y (i 4. Eliinate converged systes. Update I. IfI = exit. 5. Set β (i 6. Set v 1 v +1.Goto2 = h +1, (y (i for each i I The convergence history of the shifted restarted ethod on each syste is the sae as the convergence of the usual restarted ethod applied individually to each shifted syste. This can be clearly observed by noticing that both the sequence of Krylov subspace systes and approxiation iterates are the sae as those coputed by standard restarted FOM. In particular, this iplies that Shifted Restarted FOM only generates one sequence of bases {V } for all shifted systes siultaneously solved and that no degradation of perforance is caused by the inforation sharing. 3 Nuerical experients. In this section we report the results of soe nuerical experients we have carried out. We copare the Froer and Glässner correction of restarted GMRES( for shifted systes (hereafter g s (, its variant proposed in [2] (hereafter g sv ( and restarted FOM(. Restarted Arnoldi-type ethods 2 To avoid indexing overwheling we shall adopt the hat sybol ˆ for the coputed quantities after restart.
5 RESTARTED FOM FOR SHIFTED LINEAR SYSTEMS 463 are known to suffer when A is indefinite. The presence of the shift ay exacerbate the situation aking the shifted syste particularly hard to solve when the spectru of the coefficient atrix A σi surrounds the origin. Nuerical experients with restarted FOM are less coon in the literature than with restarted GMRES; see e.g. [8, 7]. Perforance evaluation of g s ( and g sv ( can be found in [5] and in [2], respectively. Far fro being exhaustive, our nuerical experients ai to describe typical convergence behavior of the discussed ethods in situations where the shift ay deteriorate convergence. Our convergence stopping criterion is based on the residual nor, r (i. Depending on the proble at hand, different strategies ay be ore relevant; see the discussion below on the structural dynaics proble g s (10,σ nor of relative residual g s (10,σ 2 g s (10,σ 1 nor of relative residual g s (10,σ 2 g sv (10,σ 1 g sv (10,σ 2 fo(10,σ 2 fo(10,σ 1 g sv (10,σ 1 g sv (10,σ nuber of restarts fo(10,σ 1 fo(10,σ nuber of restarts Figure 3.1: Left: Exaple with bidiagonal atrix and σ 1 = 1, σ 2 = 1. Right: Exaple with operator L(u andσ 1 =0.5, σ 2 = 0.5. The first exaple considers a upper bidiagonal atrix A with diagonal the vector d =[0.01, 0.02, 0.03, 0.04, 10, 11,, 105] and super-diagonal the vector of all ones; see e.g. [8]. The right hand side is the vector of all ones, noralized to have unit nor, and we consider two values for the shift paraeter, σ = 1, 1. The results are reported in the left plot of Figure 3.1 for =10and stopping tolerance ε =10 8. While g s (10 stagnates on both shifted systes, its variant is able to converge, although the convergence is slowed down, copared with running restarted GMRES on each shifted syste separately. Indeed, restarted GMRES with = 10 would converge in 16 restarts on A + I and in 22 restarts on A I. Therefore, the restarting strategy that chooses as seed the slower converging shifted syste in practice affects the convergence of all systes. Note also that a different ordering of the shifts at start tie (when all residuals equal the right hand side b would yield a quite different convergence history of g sv on the two systes. We next consider the atrix corresponding to the discretization of the operator L(u = u +10u x on the unit square with Dirichlet boundary
6 464 V. SIMONCINI conditions. We setb and stopping tolerance as before, and σ = 0.5, 0.5. Results are suarized in the right plot of Figure 3.1. Standard restarted GMRES applied to each shifted syste separately with = 10 would converge in 4 restarts on A +0.5 I and in 172 restarts on A 0.5 I. The difference in perforance is ore pronounced on this exaple. Note that g sv converges very rapidly on σ 2 so that only σ 1 is processed in later restarts. The atrices in our next exaple ste fro a structural dynaics engineering proble, whose algebraic forulation was discussed in detail in [9]. Direct frequency analysis leads to the solution of the following algebraic linear syste (3.1 (σ 2 A + σb + Cx = b, for several values of the frequency-related paraeter σ. Here A, B and C are coplex syetric. Linearization yields the syste [( ( ] [ ] [ ] B C A 0 y b C T + σ 0 0 C T = (T σsz = f. x 0 Note that only a portion of the approxiation to z is eployed to approxiate x in (3.1. We refer to [9] for a detailed analysis of the connections between the two algebraic approxiation probles and for stopping criteria that take the original proble (3.1 into account nor of relative residual 10 2 g sv (10, σ fo(10,σ 1 fo(10,σ 2 g sv (10,σ nuber of restarts Figure 3.2: Exaple fro structural dynaics. σ 1 =(5 2π 1,σ 2 =(8 2π 1. Whenever S is nonsingular, we can write the proble above as in (1.1, naely (TS 1 σiẑ = f, Sz =ẑ. We consider test case C in [9] and for the sake of siplicity, we only report results for two paraeters σ 1 =(5 2π 1,σ 2 = (8 2π 1. The linearized proble has diension 3947 and the right-hand side
7 RESTARTED FOM FOR SHIFTED LINEAR SYSTEMS 465 is f = e e Convergence curves with shifted restarted FOM and with g sv and = 10 are displayed in Figure 3.2. The stopping tolerance was set to ε =10 3, a loose value which is typical in this kind of applications [9]. FOM is faster than g sv with both shifts. Again, different shifting affects the whole coputation in g sv : restarted GMRES with = 10 would converge in 9 restarts for σ 1 andin29restartsforσ 2. This suggests that in g sv other strategies should be devised to select the seed syste, to prevent convergence delay. 4 Conclusions and further rearks. We have shown that a known Arnoldi-based ethod, the restarted Full Orthogonalization Method, can efficiently solve shifted algebraic linear systes, at the cost that grows only odestly as the nuber of shifts increases. Liited nuerical experients see to show its copetitiveness with respect to other restarted ethods. Note also that the various ethods can be cobined by switching to any of the strategies at restart tie. Our experience sees to show that known probles associated with restarting (see, e.g., [8], are exacerbated in the shifting setting in GMRES-based ethods; other strategies to select the collinearity restarting vector should perhaps be considered. The natural ipleentation of FOM in the shifted context is particularly attractive when both A and b are real, while the shift is coplex. More precisely, let σ C and consider (A σix = b A R n n,b R n. The subspace K (A, b aswellash and V are real, whereas only the approxiate solution in the projected space, y =(H σi 1 e 1 β,hascoplex entries; see [3] for siilar considerations. At restart tie, all (coplex residuals are collinear to the + 1st basis vector, which is real. Therefore, the new approxiation basis after restart can still be iposed to be real, while the collinearity coefficients β (i are coplex. As a consequence, at each restart, the expensive step of constructing the orthogonal basis is done in real arithetic, whereas ost of the reaining coputation, of order, is done in coplex arithetic. Acknowledgent. We thank Daniel Szyld for carefully reading an earlier draft of this anuscript. REFERENCES 1. B. N. Datta and Y. Saad, Arnoldi ethods for large Sylvester-like observer atrix equations,and an associated algorith for partial spectru assignent, Linear Algebra Appl., (1991, pp A. Feriani, F. Perotti, and V. Sioncini, Iterative syste solvers for the frequency analysis of linear echanical systes, in Coputer Methods in Applied Mechanics and Engineering, 190 (13 14 (2000, pp
8 466 V. SIMONCINI 3. R. F. Freund, On conjugate gradient type ethods and polynoial preconditioners for a class of coplex non-heritian atrices, Nuer. Math., 57 (1990, pp R. F. Freund, Solution of shifted linear systes by quasi-inial residual iterations, in Nuerical Linear Algebra, L. Reichel, A. Ruttan, and R. S. Varga, eds., W. de Gruyter. Berlin, 1993, pp A. Froer and U. Glässner, Restarted GMRES for shifted linear systes, SIAM J. Sci. Coput., 19(1 (1998, pp K. Meerbergen, The solution of paraetrized syetric linear systes, SIAMJ. on Matrix Analysis and Applications, 24(4 (2003, pp Y. Saad, Iterative Methods for Sparse Linear Systes, The PWS Publishing Copany, Boston, V. Sioncini, On the convergence of restarted Krylov subspace ethods, SIAM J. Matrix Anal. Appl., 22 (2000, pp V. Sioncini and F. Perotti, On the nuerical solution of (λ 2 A + λb + Cx = b and application to structural dynaics, SIAM J. Scientific Coput., 23 (2002, pp
Generalized 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 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 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 informationFinding Rightmost Eigenvalues of Large Sparse. Non-symmetric Parameterized Eigenvalue Problems. Abstract. Introduction
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,
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 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 information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
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 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 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 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 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 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 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 informationFast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials
Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter
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 informationDistributed Subgradient Methods for Multi-agent Optimization
1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions
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 informationExperimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis
City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna
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 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 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 informationThe Methods of Solution for Constrained Nonlinear Programming
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained
More informationEfficient Filter Banks And Interpolators
Efficient Filter Banks And Interpolators A. G. DEMPSTER AND N. P. MURPHY Departent of Electronic Systes University of Westinster 115 New Cavendish St, London W1M 8JS United Kingdo Abstract: - Graphical
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
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 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 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 informationA note on the realignment criterion
A note on the realignent criterion Chi-Kwong Li 1, Yiu-Tung Poon and Nung-Sing Sze 3 1 Departent of Matheatics, College of Willia & Mary, Williasburg, VA 3185, USA Departent of Matheatics, Iowa State University,
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 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 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 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 informationTopic 5a Introduction to Curve Fitting & Linear Regression
/7/08 Course Instructor Dr. Rayond C. Rup Oice: A 337 Phone: (95) 747 6958 E ail: rcrup@utep.edu opic 5a Introduction to Curve Fitting & Linear Regression EE 4386/530 Coputational ethods in EE Outline
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 informationGenetic Quantum Algorithm and its Application to Combinatorial Optimization Problem
Genetic Quantu Algorith and its Application to Cobinatorial Optiization Proble Kuk-Hyun Han Dept. of Electrical Engineering, KAIST, 373-, Kusong-dong Yusong-gu Taejon, 305-70, Republic of Korea khhan@vivaldi.kaist.ac.kr
More informationOn the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation
journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation
More informationInspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information
Cite as: Straub D. (2014). Value of inforation analysis with structural reliability ethods. Structural Safety, 49: 75-86. Value of Inforation Analysis with Structural Reliability Methods Daniel Straub
More informationLeast squares fitting with elliptic paraboloids
MATHEMATICAL COMMUNICATIONS 409 Math. Coun. 18(013), 409 415 Least squares fitting with elliptic paraboloids Heluth Späth 1, 1 Departent of Matheatics, University of Oldenburg, Postfach 503, D-6 111 Oldenburg,
More informationarxiv: v1 [cs.ds] 29 Jan 2012
A parallel approxiation algorith for ixed packing covering seidefinite progras arxiv:1201.6090v1 [cs.ds] 29 Jan 2012 Rahul Jain National U. Singapore January 28, 2012 Abstract Penghui Yao National U. Singapore
More informationData-Driven Imaging in Anisotropic Media
18 th World Conference on Non destructive Testing, 16- April 1, Durban, South Africa Data-Driven Iaging in Anisotropic Media Arno VOLKER 1 and Alan HUNTER 1 TNO Stieltjesweg 1, 6 AD, Delft, The Netherlands
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 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 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 informationThe Fundamental Basis Theorem of Geometry from an algebraic point of view
Journal of Physics: Conference Series PAPER OPEN ACCESS The Fundaental Basis Theore of Geoetry fro an algebraic point of view To cite this article: U Bekbaev 2017 J Phys: Conf Ser 819 012013 View the article
More informationResearch Article Approximate Multidegree Reduction of λ-bézier Curves
Matheatical Probles in Engineering Volue 6 Article ID 87 pages http://dxdoiorg//6/87 Research Article Approxiate Multidegree Reduction of λ-bézier Curves Gang Hu Huanxin Cao and Suxia Zhang Departent of
More informationA Model for the Selection of Internet Service Providers
ISSN 0146-4116, Autoatic Control and Coputer Sciences, 2008, Vol. 42, No. 5, pp. 249 254. Allerton Press, Inc., 2008. Original Russian Text I.M. Aliev, 2008, published in Avtoatika i Vychislitel naya Tekhnika,
More informationPolynomial Division By Convolution
Applied Matheatics E-Notes, (0), 9 c ISSN 0-0 Available free at irror sites of http://wwwathnthuedutw/aen/ Polynoial Division By Convolution Feng Cheng Chang y Received 9 March 0 Abstract The division
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016 Lessons 7 14 Dec 2016 Outline Artificial Neural networks Notation...2 1. Introduction...3... 3 The Artificial
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 informationAlgorithms for parallel processor scheduling with distinct due windows and unit-time jobs
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and
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 informationarxiv: v1 [math.na] 9 Mar 2015
APPROXIMATION OF FUNCTIONS OF LARGE MATRICES WITH KRONECKER STRUCTURE MICHELE BENZI AND VALERIA SIMONCINI arxiv:53.265v [ath.na] 9 Mar 25 Abstract. We consider the nuerical approxiation of f(a)b where
More informationAn Inverse Interpolation Method Utilizing In-Flight Strain Measurements for Determining Loads and Structural Response of Aerospace Vehicles
An Inverse Interpolation Method Utilizing In-Flight Strain Measureents for Deterining Loads and Structural Response of Aerospace Vehicles S. Shkarayev and R. Krashantisa University of Arizona, Tucson,
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 informationA BLOCK MONOTONE DOMAIN DECOMPOSITION ALGORITHM FOR A NONLINEAR SINGULARLY PERTURBED PARABOLIC PROBLEM
INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volue 3, Nuber 2, Pages 211 231 c 2006 Institute for Scientific Coputing and Inforation A BLOCK MONOTONE DOMAIN DECOMPOSITION ALGORITHM FOR A NONLINEAR
More information1. Introduction. This paper is concerned with the study of convergence of Krylov subspace methods for solving linear systems of equations,
ANALYSIS OF SOME KRYLOV SUBSPACE METODS FOR NORMAL MATRICES VIA APPROXIMATION TEORY AND CONVEX OPTIMIZATION M BELLALIJ, Y SAAD, AND SADOK Dedicated to Gerard Meurant at the occasion of his 60th birthday
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 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 informationAnisotropic reference media and the possible linearized approximations for phase velocities of qs waves in weakly anisotropic media
INSTITUTE OF PHYSICS PUBLISHING JOURNAL OF PHYSICS D: APPLIED PHYSICS J. Phys. D: Appl. Phys. 5 00 007 04 PII: S00-770867-6 Anisotropic reference edia and the possible linearized approxiations for phase
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 informationP016 Toward Gauss-Newton and Exact Newton Optimization for Full Waveform Inversion
P016 Toward Gauss-Newton and Exact Newton Optiization for Full Wavefor Inversion L. Métivier* ISTerre, R. Brossier ISTerre, J. Virieux ISTerre & S. Operto Géoazur SUMMARY Full Wavefor Inversion FWI applications
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 informationADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE
ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE CHRISTOPHER J. HILLAR Abstract. A long-standing conjecture asserts that the polynoial p(t = Tr(A + tb ] has nonnegative coefficients whenever is
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 informatione-companion ONLY AVAILABLE IN ELECTRONIC FORM
OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer
More informationwhich together show that the Lax-Milgram lemma can be applied. (c) We have the basic Galerkin orthogonality
UPPSALA UNIVERSITY Departent of Inforation Technology Division of Scientific Coputing Solutions to exa in Finite eleent ethods II 14-6-5 Stefan Engblo, Daniel Elfverson Question 1 Note: a inus sign in
More informationOn the approximation of Feynman-Kac path integrals
On the approxiation of Feynan-Kac path integrals Stephen D. Bond, Brian B. Laird, and Benedict J. Leikuhler University of California, San Diego, Departents of Matheatics and Cheistry, La Jolla, CA 993,
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 informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
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 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 informationKernel Methods and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic
More informationDecentralized Adaptive Control of Nonlinear Systems Using Radial Basis Neural Networks
050 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 44, NO., NOVEMBER 999 Decentralized Adaptive Control of Nonlinear Systes Using Radial Basis Neural Networks Jeffrey T. Spooner and Kevin M. Passino Abstract
More informationConvolutional Codes. Lecture Notes 8: Trellis Codes. Example: K=3,M=2, rate 1/2 code. Figure 95: Convolutional Encoder
Convolutional Codes Lecture Notes 8: Trellis Codes In this lecture we discuss construction of signals via a trellis. That is, signals are constructed by labeling the branches of an infinite trellis with
More informationEfficient Numerical Solution of Diffusion Convection Problem of Chemical Engineering
Cheical and Process Engineering Research ISSN 4-7467 (Paper) ISSN 5-9 (Online) Vol, 5 Efficient Nuerical Solution of Diffusion Convection Proble of Cheical Engineering Bharti Gupta VK Kukreja * Departent
More informationNew Classes of Positive Semi-Definite Hankel Tensors
Miniax Theory and its Applications Volue 017, No., 1 xxx New Classes of Positive Sei-Definite Hankel Tensors Qun Wang Dept. of Applied Matheatics, The Hong Kong Polytechnic University, Hung Ho, Kowloon,
More informationOn Constant Power Water-filling
On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives
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 informationA Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay
A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer
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 informationMatrix Inversion-Less Signal Detection Using SOR Method for Uplink Large-Scale MIMO Systems
Matrix Inversion-Less Signal Detection Using SOR Method for Uplin Large-Scale MIMO Systes Xinyu Gao, Linglong Dai, Yuting Hu, Zhongxu Wang, and Zhaocheng Wang Tsinghua National Laboratory for Inforation
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 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 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 informationA Note on the Applied Use of MDL Approximations
A Note on the Applied Use of MDL Approxiations Daniel J. Navarro Departent of Psychology Ohio State University Abstract An applied proble is discussed in which two nested psychological odels of retention
More informationA Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness
A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,
More informationEMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS
EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS Jochen Till, Sebastian Engell, Sebastian Panek, and Olaf Stursberg Process Control Lab (CT-AST), University of Dortund,
More informationA Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)
1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu
More informationPhysically Based Modeling CS Notes Spring 1997 Particle Collision and Contact
Physically Based Modeling CS 15-863 Notes Spring 1997 Particle Collision and Contact 1 Collisions with Springs Suppose we wanted to ipleent a particle siulator with a floor : a solid horizontal plane which
More informationOPTIMIZATION in multi-agent networks has attracted
Distributed constrained optiization and consensus in uncertain networks via proxial iniization Kostas Margellos, Alessandro Falsone, Sione Garatti and Maria Prandini arxiv:603.039v3 [ath.oc] 3 May 07 Abstract
More informationProbability Distributions
Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples
More informationDERIVING PROPER UNIFORM PRIORS FOR REGRESSION COEFFICIENTS
DERIVING PROPER UNIFORM PRIORS FOR REGRESSION COEFFICIENTS N. van Erp and P. van Gelder Structural Hydraulic and Probabilistic Design, TU Delft Delft, The Netherlands Abstract. In probles of odel coparison
More informationMethods for Large Unsymmetric Linear. Systems. Zhongxiao Jia y. Abstract. The convergence problem of Krylov subspace methods, e.g.
The Convergence of Krylov Subspace Methods for Large Unsyetric Linear Systes Zhongxiao Jia y Abstract The convergence proble of Krylov subspace ethods, e.g. OM, MRES, CR and any others, for solving large
More informationASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical
IEEE TRANSACTIONS ON INFORMATION THEORY Large Alphabet Source Coding using Independent Coponent Analysis Aichai Painsky, Meber, IEEE, Saharon Rosset and Meir Feder, Fellow, IEEE arxiv:67.7v [cs.it] Jul
More informationList Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More informationHybrid System Identification: An SDP Approach
49th IEEE Conference on Decision and Control Deceber 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA Hybrid Syste Identification: An SDP Approach C Feng, C M Lagoa, N Ozay and M Sznaier Abstract The
More informationPhysics 139B Solutions to Homework Set 3 Fall 2009
Physics 139B Solutions to Hoework Set 3 Fall 009 1. Consider a particle of ass attached to a rigid assless rod of fixed length R whose other end is fixed at the origin. The rod is free to rotate about
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 information