Baltzer Journals April 24, Bounds for the Trace of the Inverse and the Determinant. of Symmetric Positive Denite Matrices
|
|
- Gerard Franklin
- 6 years ago
- Views:
Transcription
1 Baltzer Journals April 4, 996 Bounds for the Trace of the Inverse and the Determinant of Symmetric Positive Denite Matrices haojun Bai ; and Gene H. Golub ; y Department of Mathematics, University of Kentucky, Lexington, KY bai@ms.uky.edu Scientic Computing and Computational Mathematics Program, Computer Science Department, Stanford University, Stanford, CA golub@sccm.stanford.edu. Dedicated to T. Rivlin on the occasion of his 70th birthday Lower and upper bounds are given for the trace of the inverse tr(a? ) and the determinant det(a) of a symmetric positive denite matrix A. They are derived by applying Gaussian quadrature and related theory. The bounds for det(a) appears to be new. For the bounds of tr(a? ), the Kantorovich inequality is available for providing such bounds. In a number of examples, our bounds are found to be tighter when simple trial vectors are used in Kantorovich's bound. The new bounds are equivalent to Robinson and Wathen's variational bounds. But our bounds are directly derived for the quantity instead of the summation of bounds for each diagonal entry of A?. Subject classication: AMS(MOS) 65F0 Keywords: trace, inverse, determinant, quadrature Introduction There are a number of applications where it is desired to estimate the bounds for the quantities of the trace of the inverse tr(a? ) and the determinant det(a) of a matrix A, such as in the study of fractals [4, 8], lattice Quantum Chromodynamics (QCD) [5, 3], crystals [, ], the generalized cross-validation and its applications (see [7] and references therein). In this paper, we focus on deriving lower and upper bounds for the quantities tr(a? ) The author was supported in part by by an NSF grant ASC and in part by an DOE grant DE-FG03-94ER59. y The work of this author was in part supported by NSF under grant CCR
2 Bai and Golub / Bounds for tr(a? ) and det(a) and det(a) of a symmetric positive denite matrix A. Throughout this paper, A will denote an n-by-n symmetric positive denite matrix with eigenvalues n : (A) is the set of all eigenvalues. The parameters and denote the bounds for the smallest and largest eigenvalues and n of A, 0 < ; n : a ij or (A) ij will denote the (i; j) entry of a matrix A. Using the eigenvalue decomposition and the denition of matrix function [6], it is easy to prove the identity ln(det(a)) = tr(ln(a)) () for a symmetric positive denite matrix A. Therefore, instead of bounding det(a), we will bound ln(det(a)), which is turned into bounding tr(ln(a)). Under this reformulation, the problems of bounding the quantities tr(a? ) and det(a) are unied to bound tr(f(a)) for f() =? and ln, respectively. We rst note that the Kantorovich inequality (x T A? x)(x T Ax) 4 n + n + (x T x) holds for all vectors x. For derivation of this inequality, see [9]. By using a simple trial vector x = (0; : : : ; 0; ; 0; : : :; 0) T in the inequality and noting that the upper bound is monotonically increasing in n =, it yields (A? ) ii 4a ii + + : () The summation of the upper bound for all diagonal entries of A? gives a Kantorovich's upper bound for tr(a? ). Another approach for bounding tr(a? ) is to use variational functional, Robinson and Wathen [3] show that + (? a ii) (a ii? s ii ) (A? ) ii? (a ii? ) (s ii? a ii ) ; (3) where s ii = P n k= a ik. Hence the sums of the lower and upper bounds for all diagonal entries of A? give Robinson and Wathen's lower and upper bounds for tr(a? ), respectively. Two other types of bounds for (A? ) ii are also presented in [3], but more information is required. The third approach is to use Gaussian quadrature and related theory. As discussed in [4, 5, ], one rst bounds the quantity x T f(a)x for a given vector x, then probabilistic bounds and estimates can be obtained for tr(f(a)) by using Monte Carlo simulation. We refer to [] for details. The new bounds derived in this paper also use Gaussian quadrature and related theory. But they are exact lower and upper bounds for tr(f(a)) instead of probabilistic
3 Bai and Golub / Bounds for tr(a? ) and det(a) 3 bounds as given in []. The new bounds are derived by directly considering the quantity tr(f(a)) instead of each diagonal entry of f(a). They are very cheap to compute. In a number of examples our bounds are found to be tighter than Kantorovich's upper bound, and are equivalent to the Robinson and Wathen's bounds, which is computationally more expensive. Our experiences indicate that the probabilistic bounds presented in [] are the most accurate, but they are also the most expensive ones in terms of computational costs and memory requirement. In section we present the lower and upper bounds for tr(a? ) and tr(ln(a)). A number of examples, coming from the dierent applications, and comparisons with the Kantorovich's upper bound, Robinson and Wathen's bounds and the estimates using Monte Carlo simulation are given in section 3. We give concluding remarks in section 4. Bounds for tr(a? ) and tr(ln(a)) Let r = tr(a r ) = nx i= r i = r d(); (4) where the weight function () of the Stieltjes integral is () = P n j= I(? j), and I() is the unit step function: I() = 0 if < 0 and I() = if 0. Note that one can easily compute 0 = n; = nx i= a ii ; = nx i;j= a ij = kak F : Our rst task is to use 0, and and the parameters and to determine a lower and an upper bound for? = tr(a? ). The approach is to use the classical Gaussian quadrature and related theory, see for example []. Specically, we use the Gauss-Radau quadrature rule. By the rule, the integral in (4) can be written as r = r d() = r + R[ r ]; (5) where r is the following quadrature formula r = w 0 t r 0 + w t r ; (6) w 0 and w are weights and to be determined. t 0 and t are nodes. The node t 0 is prescribed, say t 0 = or. t is unknown and to be determined. The remainder R[ r ] = 6 r(r? )(r? )r?3 (? t 0 )(? t ) d() for some < <. If R[ r ] 0, r is a lower bound of r and if R[ r ] 0, r is a upper bound of r. From (6), we see that r satises a second order dierence equation c r + d r?? r? = 0 (7)
4 Bai and Golub / Bounds for tr(a? ) and det(a) 4 for certain coecients c and d. The nodes t 0 and t are the roots of the characteristic polynomial p() = c + d? : (8) To determine the coecients c and d, by using (7) with the fact r = r for r = 0; ;, and the prescribed node t 0 being the root of the characteristic polynomial (8), we have c + d? 0 = 0; ct 0 + dt 0? = 0: Solving the above linear equations for c and d yields c = d t 0 t 0? 0 Once having the coecients c and d, the node t of the quadrature r is given by t =?=(t 0 c). For determining the weights w 0 and w, we note that Then i.e., w0 w = w 0 t 0 + w t ; = w 0 t 0 + w t : = t0 t t 0 t? To bound tr(a? ) =?, writing the dierence equation (7) with r =, we have c + d 0?? = 0:? = c + d 0 = 0 t 0 t 0? 0 : By the Gauss-Radau quadrature rule (5) with r =?, we have where the remainder? =? + R[? ]; R[? ] =? (? t 4 0 )(? t ) d() for some < <. If the prescribed node t 0 =, R[? ] 0, then? is an upper bound of?. If t 0 =, R[? ] 0, then? is a lower bound of?. In summary, we have the following bounds for tr(a? ). :
5 Bai and Golub / Bounds for tr(a? ) and det(a) 5 Theorem (Lower and upper bounds for tr(a? )) Let A be an n-by-n symmetric positive denite matrix, = tr(a), = kak F and (A) [; ] with > 0, then n? n tr(a? ) n? n Let us turn to our second task for bounding tr(ln(a)). Note that the identity () can be further written as ln(det(a)) = tr(ln A) = nx i= (ln i ) = (ln )d(); where the weight function () of the Stieltjes integral is the same as the weight function dened in (4). Again, by using the Gauss-Radau quadrature rule, we have tr(ln(a)) = where the quadrature term I[ln ] is The remainder (ln )d() = I[ln ] + R[ln ]; I[ln ] = w 0 ln(t 0 ) + w ln(t ): R[ln ] = (? t )(? t ) d() for some < <. Therefore, if t 0 =, R[ln ] 0, then I[ln ] is a lower bound of tr(ln(a)). If t 0 =, R[ln ] 0, then I[ln ] is an upper bound. Therefore, we derive the following bounds for tr(ln(a)). Theorem (Lower and upper bounds for tr(ln(a))) Let A be an n-by-n symmetric positive denite matrix, = tr(a), = kak F and (A) [; ] with > 0, then ln ln t t t? where tr(ln(a)) ln ln t t t t =? n? and t =? n?? The bounds (9) and (0) involve only the trace of the lower orders of the matrix power A r, namely, 0 = tr(a 0 ) = n, = tr(a ) and = tr(a ). They can be easily computed. If the trace of the higher orders of the matrix power A r, r 3, are available, then using the principles discussed above, we can derive tighter bounds. The parameters and for the bounds of eigenvalues of A must be provided, which happens to be required in all such bounds discussed in Section. (9) (0)
6 Bai and Golub / Bounds for tr(a? ) and det(a) 6 Table Lower and upper bounds for tr(a? ) Matrix (order) \Exact" MC estimation Lower bound Upper bound Poisson (900) 5: :00 0 : : Wathen (34) 6:60 0 6:09 0 4: :945 0 Heat ow (65) 3: : : : Examples In this section, we use four examples to show the tightness of the bounds given in (9) and (0). We will also compare with the Kantorovich's upper bound (), Robinson and Wathen's bounds (3) and the approach using Monte Carlo simulation (henceforth the MC estimation) described in []. Numerical experiments are carried out in Matlab environment on a SUN Sparcstation 0. The so-called \exact" value of tr(a? ) is computed by analytic formulas if available, or by rst computing the inverse using function inv in Matlab, and then calculating the trace. For the \exact" value of tr(ln(a)) = ln(det(a)), we use the analytic formula if available, or rst compute the Cholesky decomposition of A using Matlab function chol and then compute the natural logarithm of the product of diagonals of Cholesky factor. Example (Pei matrix): Consider the so-called n-by-n Pei matrix A = I + uu T, where u = (; ; : : :; ) T [8]. It is easy to see that A has two distinct eigenvalues and n +. The eigenvalue has multiplicity n?. If > 0, A is symmetric positive denite. By the Sherman-Morrison formula [6], the inverse of A can be written as A? = I? ( + n) uut Then tr(a? ) = n? n and tr(ln(a)) = (n? ) ln + ln( + n). It is easy to compute (+n) that = tr(a) = ( +)n and = tr(a ) = n +( +)n. If let parameters = and = n+, then by straightforward algebraic calculation, both lower and upper bounds for tr(a? ) in (9) are equal to the exact value. Similarly, one can also easily show that both lower and upper bounds for tr(ln(a)) in (0) are also equal to the exact value. For this example, the bounds (9) and (0) are perfect! Of course, one can also verify that for this example, there are no intergration errors (the remainders are zero) in the Gauss-Radau quadrature rule. For this example, Robinson and Wathen's bounds for tr(a? ) are also equal to the exact value. Example (Poisson matrix): The matrix of order m is a block tridiagonal matrix from the 5-point central dierence discretization of the -D Poisson's equation on a m m square mesh [8]. It can be shown that the parameters and for the bounds of the smallest and largest eigenvalues are = m+ and = 8, respectively. In Tables and, we have tabulated the exact values for tr(a? ) and tr(ln(a)), the estimated values by the MC estimation []. and the lower and upper bounds given in (9) and (0) for the 900 by 900 Poisson matrix (i.e., m = 30).
7 Bai and Golub / Bounds for tr(a? ) and det(a) 7 Table Lower and upper bounds for tr(ln(a)) Matrix (order) \Exact" MC estimation Lower bound Upper bound Poisson (900) : : : : Wathen (34)?:007 0?:063 0?:0065 0?6: Heat ow (65) 3: : : : The Kantorovich's upper bound for tr(a? ) is : Robinson and Wathen's lower and upper bounds are : and 8: Note that the estimates from the Monte Carlo simulation for tr(a? ) and tr(ln(a)) are only at % and 0.4% of relative errors of the actual values, respectively []. Example 3 (Wathen matrix): The matrix A is \wathen(n x ; n y )" in the set of Matlab test matrices collection by Higham [8]. It is a consistent mass matrix in nite element computations for a regular n x -by-n y grid of 8-node (serendipity) elements in space dimensions (see [6]). The resulting matrix is of order n = 3n x n y + n x + n y +. Let D be the diagonals of A, then realistic bounds for the eigenvalues of D? A are given by Wathen [7]. In our numerical experiment, we let n x = n y = 0. Then the matrix A is of order n = 34 and = 0:5 and = 4:5. The bounds for tr(d A? D ) and tr(ln(d? AD? )) are tabulated in Table and. The Kantorovich's upper bound for tr(d A? D ) is : and the Robinson and Wathen's lower and upper bounds are 4: and 9:995 0, respectively. Again, note that the estimated values of the MC estimation are only at 0.8% and 0.% of relative errors of the actual values. Example 4: This test matrix is from [0], see also [3]. The matrix is resulted from the implicit nite dierent discretization of a linear heat ow problem. It is a m by m block tridiagonal matrix of the form A = 0 D C C D C C D where D is a m m tridiagonal matrix with + 4 on diagonal, and? on super- and sub-diagonal, and C is a diagonal matrix with diagonal entries. is the ratio of the time step and the square of grid size. The Gershgorin circle theorem gives = and = + 8 for the eigenvalue bounds of A. We have tabulated in Tables and the bounds for tr(a? ) and tr(ln(a)), respectively, where n = 65 (m = 5) and = 0:5. The Kantorovich's upper bound for tr(a? ) is 4:369 0 and the Robinson and Wathen's lower and upper bounds are 3: and 3:7397 0, respectively. C A ;
8 Bai and Golub / Bounds for tr(a? ) and det(a) 8 4 Concluding Remarks Simple bounds for tr(a? ) and tr(ln(a)) of a symmetric positive denite matrix A are derived by using Gaussian quadrature and related theory. The bounds involve only n (the order of A), tr(a) and kak F and the parameters and, namely for the bounds of eigenvalues of A. From the numerical examples presented in Section 3 and numerous other experiments conducted, our bounds for tr(a? ) are found to be tighter when simple trial vectors are used in the Kantorovich's bound, and are equivalent to the Robinson and Wathen's bounds. But it is generally poorer than the probablistic bounds and estimations for tr(a? ) and ln(det(a)) derived by using Gaussian quadrature and Monte Carlo simulation []. The latter costs signicantly more arithmetic operations and memory. But a fully parallelism scheme can be developed for the simulation []. We point out that using Gaussian quadrature and related theory, we have the advantage of easily extending the approach for tr(a? ) to tr(ln(a)), while the approaches based on Kantorovich inequality and variational inequality do not enjoy. If the traces of higher orders of the matrix power A r, r 3, are available, then bounds can be further tightened by using the same technique. Moreover, one could use modied moments to get improved estimates of the quadrature rule. 5 Afternote While we were nishing up this paper, we read an article by Ortner and Krauter on lower bounds for the determinant and the trace of the inverse in the most recent issue of Linear Algebra and its Applications []. One central problem studied by Ortner and Krauter is to nd lower bounds of tr(p? ) and det(p? ), where P = m XT X, X is a given m- by-n (m n) full rank matrix, whose rows have unit length. This problem arises from accuracy considerations in real second-rank tensor measurements of single crystals []. By using standard matrix theory, one can show that the condition number of the matrix X is related to the quantity tr(p? ), namely, F (X) = kxk F kx y k F = p tr(p? ): where X y is the Moore-Penrose inverse of X [6]. Therefore, a lower bound of tr(p? ) also gives a lower bound of the condition number of X. Using an approach based on matrix theory and combinatorics, various lower bounds of tr(p? ) are derived in []. The sharpness of those lower bounds are demonstrated for small m and n ([, Example 3]). Our approach yields the same lower bounds for their set of test problems, provided that the extreme eigenvalues of P are available. As indicated by Ortner and Krauter [], in most cases, it is very hard, if not impossible, to nd a suitable conguration of the row vectors of X to attain the optimal lower bound. Since our approach gives both lower and upper bounds of the quantity tr(p? ), it might provide a way to assess how far a given conguration is from the optimal conguration. It would be interesting to make further investigations in this direction.
9 Bai and Golub / Bounds for tr(a? ) and det(a) 9 References []. Bai, M. Fahey, and G. Golub. Some large scale matrix computation problems. J. of Comput. and Appl. Math., 996. to appear. [] P. Davis and P. Rabinowitz. Methods of Numerical Integration. Academic Press, NY, 984. [3] S. Dong and K. Liu. Stochastic estimation with z noise. Physics Letters B, 38 (994) 30{36. [4] G. Golub and G. Meurant. Matrices, moments and quadrature. in Proceedings of the 5th Dundee Conference, June 993, D. F. Griths and G. A. Watson, Eds., Longman Scientic & Technical, 994. [5] G. Golub and. Strakos. Estimates in quadratic formulas. Numerical Algorithms, 8 (994) [6] G. Golub and C. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, MD, nd edition, 989. [7] G. Golub and U. Von Matt. Generalized cross-validation for large scale problems. Report SCCM-96-05, Stanford University, Stanford, 996. [8] N. J. Higham. The test matrix toolbox for Matlab. Numerical Analysis Report 37, University of Manchester, Manchester, 993. [9] A. S. Householder. The Theory of Matrices in Numerical Analysis. Blaisdell, New York, NY, 964. Dover edition 975. [0] A. R. Mitchell and D. F. Griths. The Finite Dierence Method in Partial Dierential Equations. Wiley, NY, 980. [] B. Ortner. On the selection of measurement directions in second-rank tensor (e.g. elastic strain) determination of single crystals. J. Appl. Cryst., (989) 6{. [] B. Ortner and A. R. Krauter. Lower bounds for the determinant and the trace of a class of Hermitian matrices. Lin. Alg. and Appl., 36 (996) 47{80. [3] P. Robinson and A. J. Wathen. Variational bounds on the entries of the inverse of a matrix. IMA Journal of Numerical Analysis, (99) 463{486. [4] B. Sapoval, Th. Gobron, and A. Margolina. Vibrations of fractal drums. Phy. Rev. Lett., 67 (99) 974{977. [5] J. C. Sexton and D. H. Weingarten. Systematic expansion for full QCD based on the valence approximation, IBM T. J. Watson Research Center, Preprint, 994 [6] G. Strang and G. Fix. An Analysis of the Finite Element Method. Prentice Hall, Englewood Clis, NJ, 973. [7] A. J. Wathen. Realistic eigenvalue bounds for the Galerkin mass matrix. IMA Journal of Numerical Analysis, 7 (987) 449{457. [8] S. Y. Wu, J. A. Cocks, and C. S. Jayanthi. An accelerated inversion algorithm using the resolvent matrix method. Comput. Phy. Comm., 7 (99) 5{33.
ESTIMATES OF THE TRACE OF THE INVERSE OF A SYMMETRIC MATRIX USING THE MODIFIED CHEBYSHEV ALGORITHM
ESTIMATES OF THE TRACE OF THE INVERSE OF A SYMMETRIC MATRIX USING THE MODIFIED CHEBYSHEV ALGORITHM GÉRARD MEURANT In memory of Gene H. Golub Abstract. In this paper we study how to compute an estimate
More informationPositive Denite Matrix. Ya Yan Lu 1. Department of Mathematics. City University of Hong Kong. Kowloon, Hong Kong. Abstract
Computing the Logarithm of a Symmetric Positive Denite Matrix Ya Yan Lu Department of Mathematics City University of Hong Kong Kowloon, Hong Kong Abstract A numerical method for computing the logarithm
More informationAutomatica, 33(9): , September 1997.
A Parallel Algorithm for Principal nth Roots of Matrices C. K. Koc and M. _ Inceoglu Abstract An iterative algorithm for computing the principal nth root of a positive denite matrix is presented. The algorithm
More informationOUTLINE 1. Introduction 1.1 Notation 1.2 Special matrices 2. Gaussian Elimination 2.1 Vector and matrix norms 2.2 Finite precision arithmetic 2.3 Fact
Computational Linear Algebra Course: (MATH: 6800, CSCI: 6800) Semester: Fall 1998 Instructors: { Joseph E. Flaherty, aherje@cs.rpi.edu { Franklin T. Luk, luk@cs.rpi.edu { Wesley Turner, turnerw@cs.rpi.edu
More informationPROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS
PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS Abstract. We present elementary proofs of the Cauchy-Binet Theorem on determinants and of the fact that the eigenvalues of a matrix
More information216 S. Chandrasearan and I.C.F. Isen Our results dier from those of Sun [14] in two asects: we assume that comuted eigenvalues or singular values are
Numer. Math. 68: 215{223 (1994) Numerische Mathemati c Sringer-Verlag 1994 Electronic Edition Bacward errors for eigenvalue and singular value decomositions? S. Chandrasearan??, I.C.F. Isen??? Deartment
More informationLinear Regression and Its Applications
Linear Regression and Its Applications Predrag Radivojac October 13, 2014 Given a data set D = {(x i, y i )} n the objective is to learn the relationship between features and the target. We usually start
More informationarxiv:quant-ph/ v1 22 Aug 2005
Conditions for separability in generalized Laplacian matrices and nonnegative matrices as density matrices arxiv:quant-ph/58163v1 22 Aug 25 Abstract Chai Wah Wu IBM Research Division, Thomas J. Watson
More informationLinear Algebra: Characteristic Value Problem
Linear Algebra: Characteristic Value Problem . The Characteristic Value Problem Let < be the set of real numbers and { be the set of complex numbers. Given an n n real matrix A; does there exist a number
More informationThe restarted QR-algorithm for eigenvalue computation of structured matrices
Journal of Computational and Applied Mathematics 149 (2002) 415 422 www.elsevier.com/locate/cam The restarted QR-algorithm for eigenvalue computation of structured matrices Daniela Calvetti a; 1, Sun-Mi
More informationNP-hardness of the stable matrix in unit interval family problem in discrete time
Systems & Control Letters 42 21 261 265 www.elsevier.com/locate/sysconle NP-hardness of the stable matrix in unit interval family problem in discrete time Alejandra Mercado, K.J. Ray Liu Electrical and
More informationIntroduction. Chapter One
Chapter One Introduction The aim of this book is to describe and explain the beautiful mathematical relationships between matrices, moments, orthogonal polynomials, quadrature rules and the Lanczos and
More informationA MULTIGRID ALGORITHM FOR. Richard E. Ewing and Jian Shen. Institute for Scientic Computation. Texas A&M University. College Station, Texas SUMMARY
A MULTIGRID ALGORITHM FOR THE CELL-CENTERED FINITE DIFFERENCE SCHEME Richard E. Ewing and Jian Shen Institute for Scientic Computation Texas A&M University College Station, Texas SUMMARY In this article,
More informationIn: Proc. BENELEARN-98, 8th Belgian-Dutch Conference on Machine Learning, pp 9-46, 998 Linear Quadratic Regulation using Reinforcement Learning Stephan ten Hagen? and Ben Krose Department of Mathematics,
More informationTotal least squares. Gérard MEURANT. October, 2008
Total least squares Gérard MEURANT October, 2008 1 Introduction to total least squares 2 Approximation of the TLS secular equation 3 Numerical experiments Introduction to total least squares In least squares
More informationthen kaxk 1 = j a ij x j j ja ij jjx j j: Changing the order of summation, we can separate the summands, kaxk 1 ja ij jjx j j: let then c = max 1jn ja
Homework Haimanot Kassa, Jeremy Morris & Isaac Ben Jeppsen October 7, 004 Exercise 1 : We can say that kxk = kx y + yk And likewise So we get kxk kx yk + kyk kxk kyk kx yk kyk = ky x + xk kyk ky xk + kxk
More informationA Note on Eigenvalues of Perturbed Hermitian Matrices
A Note on Eigenvalues of Perturbed Hermitian Matrices Chi-Kwong Li Ren-Cang Li July 2004 Let ( H1 E A = E H 2 Abstract and à = ( H1 H 2 be Hermitian matrices with eigenvalues λ 1 λ k and λ 1 λ k, respectively.
More informationMATH 425-Spring 2010 HOMEWORK ASSIGNMENTS
MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS Instructor: Shmuel Friedland Department of Mathematics, Statistics and Computer Science email: friedlan@uic.edu Last update April 18, 2010 1 HOMEWORK ASSIGNMENT
More informationContribution of Wo¹niakowski, Strako²,... The conjugate gradient method in nite precision computa
Contribution of Wo¹niakowski, Strako²,... The conjugate gradient method in nite precision computations ªaw University of Technology Institute of Mathematics and Computer Science Warsaw, October 7, 2006
More information2 Computing complex square roots of a real matrix
On computing complex square roots of real matrices Zhongyun Liu a,, Yulin Zhang b, Jorge Santos c and Rui Ralha b a School of Math., Changsha University of Science & Technology, Hunan, 410076, China b
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationIBM Research Report. Conditions for Separability in Generalized Laplacian Matrices and Diagonally Dominant Matrices as Density Matrices
RC23758 (W58-118) October 18, 25 Physics IBM Research Report Conditions for Separability in Generalized Laplacian Matrices and Diagonally Dominant Matrices as Density Matrices Chai Wah Wu IBM Research
More informationON THE HÖLDER CONTINUITY OF MATRIX FUNCTIONS FOR NORMAL MATRICES
Volume 10 (2009), Issue 4, Article 91, 5 pp. ON THE HÖLDER CONTINUITY O MATRIX UNCTIONS OR NORMAL MATRICES THOMAS P. WIHLER MATHEMATICS INSTITUTE UNIVERSITY O BERN SIDLERSTRASSE 5, CH-3012 BERN SWITZERLAND.
More informationWe first repeat some well known facts about condition numbers for normwise and componentwise perturbations. Consider the matrix
BIT 39(1), pp. 143 151, 1999 ILL-CONDITIONEDNESS NEEDS NOT BE COMPONENTWISE NEAR TO ILL-POSEDNESS FOR LEAST SQUARES PROBLEMS SIEGFRIED M. RUMP Abstract. The condition number of a problem measures the sensitivity
More informationKey words. conjugate gradients, normwise backward error, incremental norm estimation.
Proceedings of ALGORITMY 2016 pp. 323 332 ON ERROR ESTIMATION IN THE CONJUGATE GRADIENT METHOD: NORMWISE BACKWARD ERROR PETR TICHÝ Abstract. Using an idea of Duff and Vömel [BIT, 42 (2002), pp. 300 322
More information[3] (b) Find a reduced row-echelon matrix row-equivalent to ,1 2 2
MATH Key for sample nal exam, August 998 []. (a) Dene the term \reduced row-echelon matrix". A matrix is reduced row-echelon if the following conditions are satised. every zero row lies below every nonzero
More informationMA2501 Numerical Methods Spring 2015
Norwegian University of Science and Technology Department of Mathematics MA2501 Numerical Methods Spring 2015 Solutions to exercise set 3 1 Attempt to verify experimentally the calculation from class that
More informationSplitting of Expanded Tridiagonal Matrices. Seongjai Kim. Abstract. The article addresses a regular splitting of tridiagonal matrices.
Splitting of Expanded Tridiagonal Matrices ga = B? R for Which (B?1 R) = 0 Seongai Kim Abstract The article addresses a regular splitting of tridiagonal matrices. The given tridiagonal matrix A is rst
More informationLinear Algebra, 4th day, Thursday 7/1/04 REU Info:
Linear Algebra, 4th day, Thursday 7/1/04 REU 004. Info http//people.cs.uchicago.edu/laci/reu04. Instructor Laszlo Babai Scribe Nick Gurski 1 Linear maps We shall study the notion of maps between vector
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationPerturbation results for nearly uncoupled Markov. chains with applications to iterative methods. Jesse L. Barlow. December 9, 1992.
Perturbation results for nearly uncoupled Markov chains with applications to iterative methods Jesse L. Barlow December 9, 992 Abstract The standard perturbation theory for linear equations states that
More information4.1 Eigenvalues, Eigenvectors, and The Characteristic Polynomial
Linear Algebra (part 4): Eigenvalues, Diagonalization, and the Jordan Form (by Evan Dummit, 27, v ) Contents 4 Eigenvalues, Diagonalization, and the Jordan Canonical Form 4 Eigenvalues, Eigenvectors, and
More informationA Parallel Implementation of the. Yuan-Jye Jason Wu y. September 2, Abstract. The GTH algorithm is a very accurate direct method for nding
A Parallel Implementation of the Block-GTH algorithm Yuan-Jye Jason Wu y September 2, 1994 Abstract The GTH algorithm is a very accurate direct method for nding the stationary distribution of a nite-state,
More informationCentro de Processamento de Dados, Universidade Federal do Rio Grande do Sul,
A COMPARISON OF ACCELERATION TECHNIQUES APPLIED TO THE METHOD RUDNEI DIAS DA CUNHA Computing Laboratory, University of Kent at Canterbury, U.K. Centro de Processamento de Dados, Universidade Federal do
More informationCalculus and linear algebra for biomedical engineering Week 3: Matrices, linear systems of equations, and the Gauss algorithm
Calculus and linear algebra for biomedical engineering Week 3: Matrices, linear systems of equations, and the Gauss algorithm Hartmut Führ fuehr@matha.rwth-aachen.de Lehrstuhl A für Mathematik, RWTH Aachen
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More information1 Matrices and Systems of Linear Equations
Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 207, v 260) Contents Matrices and Systems of Linear Equations Systems of Linear Equations Elimination, Matrix Formulation
More informationPreconditioning of elliptic problems by approximation in the transform domain
TR-CS-97-2 Preconditioning of elliptic problems by approximation in the transform domain Michael K. Ng July 997 Joint Computer Science Technical Report Series Department of Computer Science Faculty of
More informationMatrices, Moments and Quadrature, cont d
Jim Lambers CME 335 Spring Quarter 2010-11 Lecture 4 Notes Matrices, Moments and Quadrature, cont d Estimation of the Regularization Parameter Consider the least squares problem of finding x such that
More informationLinear Algebra (part 1) : Matrices and Systems of Linear Equations (by Evan Dummit, 2016, v. 2.02)
Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 206, v 202) Contents 2 Matrices and Systems of Linear Equations 2 Systems of Linear Equations 2 Elimination, Matrix Formulation
More informationXIAO-CHUAN CAI AND MAKSYMILIAN DRYJA. strongly elliptic equations discretized by the nite element methods.
Contemporary Mathematics Volume 00, 0000 Domain Decomposition Methods for Monotone Nonlinear Elliptic Problems XIAO-CHUAN CAI AND MAKSYMILIAN DRYJA Abstract. In this paper, we study several overlapping
More informationPart I: Preliminary Results. Pak K. Chan, Martine Schlag and Jason Zien. Computer Engineering Board of Studies. University of California, Santa Cruz
Spectral K-Way Ratio-Cut Partitioning Part I: Preliminary Results Pak K. Chan, Martine Schlag and Jason Zien Computer Engineering Board of Studies University of California, Santa Cruz May, 99 Abstract
More informationScalable kernel methods and their use in black-box optimization
with derivatives Scalable kernel methods and their use in black-box optimization David Eriksson Center for Applied Mathematics Cornell University dme65@cornell.edu November 9, 2018 1 2 3 4 1/37 with derivatives
More informationInstitute for Advanced Computer Studies. Department of Computer Science. On the Perturbation of. LU and Cholesky Factors. G. W.
University of Maryland Institute for Advanced Computer Studies Department of Computer Science College Park TR{95{93 TR{3535 On the Perturbation of LU and Cholesky Factors G. W. Stewart y October, 1995
More informationImplicitly Defined High-Order Operator Splittings for Parabolic and Hyperbolic Variable-Coefficient PDE Using Modified Moments
Implicitly Defined High-Order Operator Splittings for Parabolic and Hyperbolic Variable-Coefficient PDE Using Modified Moments James V. Lambers September 24, 2008 Abstract This paper presents a reformulation
More informationQR FACTORIZATIONS USING A RESTRICTED SET OF ROTATIONS
QR FACTORIZATIONS USING A RESTRICTED SET OF ROTATIONS DIANNE P. O LEARY AND STEPHEN S. BULLOCK Dedicated to Alan George on the occasion of his 60th birthday Abstract. Any matrix A of dimension m n (m n)
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 1: Course Overview & Matrix-Vector Multiplication Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 20 Outline 1 Course
More informationON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, BAHMAN KALANTARI
ON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, MATRIX SCALING, AND GORDAN'S THEOREM BAHMAN KALANTARI Abstract. It is a classical inequality that the minimum of
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationAlthough the rich theory of dierential equations can often be put to use, the dynamics of many of the proposed dierential systems are not completely u
A List of Matrix Flows with Applications Moody T. Chu Department of Mathematics North Carolina State University Raleigh, North Carolina 7695-805 Abstract Many mathematical problems, such as existence questions,
More informationSolutions Preliminary Examination in Numerical Analysis January, 2017
Solutions Preliminary Examination in Numerical Analysis January, 07 Root Finding The roots are -,0, a) First consider x 0 > Let x n+ = + ε and x n = + δ with δ > 0 The iteration gives 0 < ε δ < 3, which
More informationReduction of two-loop Feynman integrals. Rob Verheyen
Reduction of two-loop Feynman integrals Rob Verheyen July 3, 2012 Contents 1 The Fundamentals at One Loop 2 1.1 Introduction.............................. 2 1.2 Reducing the One-loop Case.....................
More informationInstitute for Advanced Computer Studies. Department of Computer Science. On the Adjoint Matrix. G. W. Stewart y ABSTRACT
University of Maryland Institute for Advanced Computer Studies Department of Computer Science College Park TR{97{02 TR{3864 On the Adjoint Matrix G. W. Stewart y ABSTRACT The adjoint A A of a matrix A
More informationMatrices and Moments: Least Squares Problems
Matrices and Moments: Least Squares Problems Gene Golub, SungEun Jo, Zheng Su Comparative study (with David Gleich) Computer Science Department Stanford University Matrices and Moments: Least Squares Problems
More informationMatrix Algebra: Summary
May, 27 Appendix E Matrix Algebra: Summary ontents E. Vectors and Matrtices.......................... 2 E.. Notation.................................. 2 E..2 Special Types of Vectors.........................
More informationOutline Background Schur-Horn Theorem Mirsky Theorem Sing-Thompson Theorem Weyl-Horn Theorem A Recursive Algorithm The Building Block Case The Origina
A Fast Recursive Algorithm for Constructing Matrices with Prescribed Eigenvalues and Singular Values by Moody T. Chu North Carolina State University Outline Background Schur-Horn Theorem Mirsky Theorem
More informationApplications and fundamental results on random Vandermon
Applications and fundamental results on random Vandermonde matrices May 2008 Some important concepts from classical probability Random variables are functions (i.e. they commute w.r.t. multiplication)
More informationThe Best Circulant Preconditioners for Hermitian Toeplitz Systems II: The Multiple-Zero Case Raymond H. Chan Michael K. Ng y Andy M. Yip z Abstract In
The Best Circulant Preconditioners for Hermitian Toeplitz Systems II: The Multiple-ero Case Raymond H. Chan Michael K. Ng y Andy M. Yip z Abstract In [0, 4], circulant-type preconditioners have been proposed
More informationSolution of the Two-Dimensional Steady State Heat Conduction using the Finite Volume Method
Ninth International Conference on Computational Fluid Dynamics (ICCFD9), Istanbul, Turkey, July 11-15, 2016 ICCFD9-0113 Solution of the Two-Dimensional Steady State Heat Conduction using the Finite Volume
More informationThe Lanczos and conjugate gradient algorithms
The Lanczos and conjugate gradient algorithms Gérard MEURANT October, 2008 1 The Lanczos algorithm 2 The Lanczos algorithm in finite precision 3 The nonsymmetric Lanczos algorithm 4 The Golub Kahan bidiagonalization
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences)
AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences) Lecture 1: Course Overview; Matrix Multiplication Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical
More informationMATH 5524 MATRIX THEORY Problem Set 4
MATH 5524 MATRIX THEORY Problem Set 4 Posted Tuesday 28 March 217. Due Tuesday 4 April 217. [Corrected 3 April 217.] [Late work is due on Wednesday 5 April.] Complete any four problems, 25 points each.
More informationPerformance Comparison of Two Implementations of the Leaky. LMS Adaptive Filter. Scott C. Douglas. University of Utah. Salt Lake City, Utah 84112
Performance Comparison of Two Implementations of the Leaky LMS Adaptive Filter Scott C. Douglas Department of Electrical Engineering University of Utah Salt Lake City, Utah 8411 Abstract{ The leaky LMS
More informationlinearly indepedent eigenvectors as the multiplicity of the root, but in general there may be no more than one. For further discussion, assume matrice
3. Eigenvalues and Eigenvectors, Spectral Representation 3.. Eigenvalues and Eigenvectors A vector ' is eigenvector of a matrix K, if K' is parallel to ' and ' 6, i.e., K' k' k is the eigenvalue. If is
More informationEigenvalue problems and optimization
Notes for 2016-04-27 Seeking structure For the past three weeks, we have discussed rather general-purpose optimization methods for nonlinear equation solving and optimization. In practice, of course, we
More informationAPPROXIMATING THE COMPLEXITY MEASURE OF. Levent Tuncel. November 10, C&O Research Report: 98{51. Abstract
APPROXIMATING THE COMPLEXITY MEASURE OF VAVASIS-YE ALGORITHM IS NP-HARD Levent Tuncel November 0, 998 C&O Research Report: 98{5 Abstract Given an m n integer matrix A of full row rank, we consider the
More information1 Vectors. Notes for Bindel, Spring 2017 Numerical Analysis (CS 4220)
Notes for 2017-01-30 Most of mathematics is best learned by doing. Linear algebra is no exception. You have had a previous class in which you learned the basics of linear algebra, and you will have plenty
More informationChapter 3 Least Squares Solution of y = A x 3.1 Introduction We turn to a problem that is dual to the overconstrained estimation problems considered s
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology 1 1 c Chapter
More informationOn Orthogonal Block Elimination. Christian Bischof and Xiaobai Sun. Argonne, IL Argonne Preprint MCS-P
On Orthogonal Block Elimination Christian Bischof and iaobai Sun Mathematics and Computer Science Division Argonne National Laboratory Argonne, IL 6439 fbischof,xiaobaig@mcs.anl.gov Argonne Preprint MCS-P45-794
More informationFast Approximate Matrix Multiplication by Solving Linear Systems
Electronic Colloquium on Computational Complexity, Report No. 117 (2014) Fast Approximate Matrix Multiplication by Solving Linear Systems Shiva Manne 1 and Manjish Pal 2 1 Birla Institute of Technology,
More information1 Number Systems and Errors 1
Contents 1 Number Systems and Errors 1 1.1 Introduction................................ 1 1.2 Number Representation and Base of Numbers............. 1 1.2.1 Normalized Floating-point Representation...........
More informationPade approximants and noise: rational functions
Journal of Computational and Applied Mathematics 105 (1999) 285 297 Pade approximants and noise: rational functions Jacek Gilewicz a; a; b;1, Maciej Pindor a Centre de Physique Theorique, Unite Propre
More informationNon-stationary extremal eigenvalue approximations in iterative solutions of linear systems and estimators for relative error
on-stationary extremal eigenvalue approximations in iterative solutions of linear systems and estimators for relative error Divya Anand Subba and Murugesan Venatapathi* Supercomputer Education and Research
More informationValidating an A Priori Enclosure Using. High-Order Taylor Series. George F. Corliss and Robert Rihm. Abstract
Validating an A Priori Enclosure Using High-Order Taylor Series George F. Corliss and Robert Rihm Abstract We use Taylor series plus an enclosure of the remainder term to validate the existence of a unique
More informationLinear Algebra. Shan-Hung Wu. Department of Computer Science, National Tsing Hua University, Taiwan. Large-Scale ML, Fall 2016
Linear Algebra Shan-Hung Wu shwu@cs.nthu.edu.tw Department of Computer Science, National Tsing Hua University, Taiwan Large-Scale ML, Fall 2016 Shan-Hung Wu (CS, NTHU) Linear Algebra Large-Scale ML, Fall
More informationReduced Synchronization Overhead on. December 3, Abstract. The standard formulation of the conjugate gradient algorithm involves
Lapack Working Note 56 Conjugate Gradient Algorithms with Reduced Synchronization Overhead on Distributed Memory Multiprocessors E. F. D'Azevedo y, V.L. Eijkhout z, C. H. Romine y December 3, 1999 Abstract
More informationdeviation of D and D from similarity (Theorem 6.). The bound is tight when the perturbation is a similarity transformation D = D? or when ^ = 0. From
RELATIVE PERTURBATION RESULTS FOR EIGENVALUES AND EIGENVECTORS OF DIAGONALISABLE MATRICES STANLEY C. EISENSTAT AND ILSE C. F. IPSEN y Abstract. Let ^ and ^x be a perturbed eigenpair of a diagonalisable
More information5 Eigenvalues and Diagonalization
Linear Algebra (part 5): Eigenvalues and Diagonalization (by Evan Dummit, 27, v 5) Contents 5 Eigenvalues and Diagonalization 5 Eigenvalues, Eigenvectors, and The Characteristic Polynomial 5 Eigenvalues
More informationMODELLING OF FLEXIBLE MECHANICAL SYSTEMS THROUGH APPROXIMATED EIGENFUNCTIONS L. Menini A. Tornambe L. Zaccarian Dip. Informatica, Sistemi e Produzione
MODELLING OF FLEXIBLE MECHANICAL SYSTEMS THROUGH APPROXIMATED EIGENFUNCTIONS L. Menini A. Tornambe L. Zaccarian Dip. Informatica, Sistemi e Produzione, Univ. di Roma Tor Vergata, via di Tor Vergata 11,
More informationContents. 2.1 Vectors in R n. Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v. 2.50) 2 Vector Spaces
Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v 250) Contents 2 Vector Spaces 1 21 Vectors in R n 1 22 The Formal Denition of a Vector Space 4 23 Subspaces 6 24 Linear Combinations and
More informationSecond-order approximation of dynamic models without the use of tensors
Second-order approximation of dynamic models without the use of tensors Paul Klein a, a University of Western Ontario First draft: May 17, 2005 This version: January 24, 2006 Abstract Several approaches
More informationNumerical Integration exact integration is not needed to achieve the optimal convergence rate of nite element solutions ([, 9, 11], and Chapter 7). In
Chapter 6 Numerical Integration 6.1 Introduction After transformation to a canonical element,typical integrals in the element stiness or mass matrices (cf. (5.5.8)) have the forms Q = T ( )N s Nt det(j
More informationSpectra of Multiplication Operators as a Numerical Tool. B. Vioreanu and V. Rokhlin Technical Report YALEU/DCS/TR-1443 March 3, 2011
We introduce a numerical procedure for the construction of interpolation and quadrature formulae on bounded convex regions in the plane. The construction is based on the behavior of spectra of certain
More informationRobust linear optimization under general norms
Operations Research Letters 3 (004) 50 56 Operations Research Letters www.elsevier.com/locate/dsw Robust linear optimization under general norms Dimitris Bertsimas a; ;, Dessislava Pachamanova b, Melvyn
More informationInstitute for Advanced Computer Studies. Department of Computer Science. Iterative methods for solving Ax = b. GMRES/FOM versus QMR/BiCG
University of Maryland Institute for Advanced Computer Studies Department of Computer Science College Park TR{96{2 TR{3587 Iterative methods for solving Ax = b GMRES/FOM versus QMR/BiCG Jane K. Cullum
More informationStructured Condition Numbers of Symmetric Algebraic Riccati Equations
Proceedings of the 2 nd International Conference of Control Dynamic Systems and Robotics Ottawa Ontario Canada May 7-8 2015 Paper No. 183 Structured Condition Numbers of Symmetric Algebraic Riccati Equations
More information= a. a = Let us now study what is a? c ( a A a )
7636S ADVANCED QUANTUM MECHANICS Solutions 1 Spring 010 1 Warm up a Show that the eigenvalues of a Hermitian operator A are real and that the eigenkets of A corresponding to dierent eigenvalues are orthogonal
More information114 EUROPHYSICS LETTERS i) We put the question of the expansion over the set in connection with the Schrodinger operator under consideration (an accur
EUROPHYSICS LETTERS 15 April 1998 Europhys. Lett., 42 (2), pp. 113-117 (1998) Schrodinger operator in an overfull set A. N. Gorban and I. V. Karlin( ) Computing Center RAS - Krasnoyars 660036, Russia (received
More informationChapter 5 HIGH ACCURACY CUBIC SPLINE APPROXIMATION FOR TWO DIMENSIONAL QUASI-LINEAR ELLIPTIC BOUNDARY VALUE PROBLEMS
Chapter 5 HIGH ACCURACY CUBIC SPLINE APPROXIMATION FOR TWO DIMENSIONAL QUASI-LINEAR ELLIPTIC BOUNDARY VALUE PROBLEMS 5.1 Introduction When a physical system depends on more than one variable a general
More informationWhat is the meaning of the graph energy after all?
What is the meaning of the graph energy after all? Ernesto Estrada and Michele Benzi Department of Mathematics & Statistics, University of Strathclyde, 6 Richmond Street, Glasgow GXQ, UK Department of
More informationRecurrence Relations and Fast Algorithms
Recurrence Relations and Fast Algorithms Mark Tygert Research Report YALEU/DCS/RR-343 December 29, 2005 Abstract We construct fast algorithms for decomposing into and reconstructing from linear combinations
More informationTaylor series based nite dierence approximations of higher-degree derivatives
Journal of Computational and Applied Mathematics 54 (3) 5 4 www.elsevier.com/locate/cam Taylor series based nite dierence approximations of higher-degree derivatives Ishtiaq Rasool Khan a;b;, Ryoji Ohba
More informationarxiv: v4 [quant-ph] 8 Mar 2013
Decomposition of unitary matrices and quantum gates Chi-Kwong Li, Rebecca Roberts Department of Mathematics, College of William and Mary, Williamsburg, VA 2387, USA. (E-mail: ckli@math.wm.edu, rlroberts@email.wm.edu)
More informationn i,j+1/2 q i,j * qi+1,j * S i+1/2,j
Helsinki University of Technology CFD-group/ The Laboratory of Applied Thermodynamics MEMO No CFD/TERMO-5-97 DATE: December 9,997 TITLE A comparison of complete vs. simplied viscous terms in boundary layer
More informationDiscrete Variable Representation
Discrete Variable Representation Rocco Martinazzo E-mail: rocco.martinazzo@unimi.it Contents Denition and properties 2 Finite Basis Representations 3 3 Simple examples 4 Introduction Discrete Variable
More informationExponentials of Symmetric Matrices through Tridiagonal Reductions
Exponentials of Symmetric Matrices through Tridiagonal Reductions Ya Yan Lu Department of Mathematics City University of Hong Kong Kowloon, Hong Kong Abstract A simple and efficient numerical algorithm
More informationCongurations of periodic orbits for equations with delayed positive feedback
Congurations of periodic orbits for equations with delayed positive feedback Dedicated to Professor Tibor Krisztin on the occasion of his 60th birthday Gabriella Vas 1 MTA-SZTE Analysis and Stochastics
More informationA Note on Inverse Iteration
A Note on Inverse Iteration Klaus Neymeyr Universität Rostock, Fachbereich Mathematik, Universitätsplatz 1, 18051 Rostock, Germany; SUMMARY Inverse iteration, if applied to a symmetric positive definite
More informationSTABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin
On the stability of invariant subspaces of commuting matrices Tomaz Kosir and Bor Plestenjak September 18, 001 Abstract We study the stability of (joint) invariant subspaces of a nite set of commuting
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 14, pp. 2-35, 22. Copyright 22,. ISSN 168-9613. ETNA L-CURVE CURVATURE BOUNDS VIA LANCZOS BIDIAGONALIZATION D. CALVETTI, P. C. HANSEN, AND L. REICHEL
More information