A small note on the scaling of symmetric positive definite semiseparable matrices
نویسندگان
چکیده
منابع مشابه
Scaling-Rotation Distance and Interpolation of Symmetric Positive-Definite Matrices
We introduce a new geometric framework for the set of symmetric positive-definite (SPD) matrices, aimed at characterizing deformations of SPD matrices by individual scaling of eigenvalues and rotation of eigenvectors of the SPD matrices. To characterize the deformation, the eigenvalue-eigenvector decomposition is used to find alternative representations of SPD matrices and to form a Riemannian ...
متن کاملDirection-Preserving and Schur-Monotonic Semiseparable Approximations of Symmetric Positive Definite Matrices
DIRECTION-PRESERVING AND SCHUR-MONOTONIC SEMISEPARABLE APPROXIMATIONS OF SYMMETRIC POSITIVE DEFINITE MATRICES∗ MING GU† , XIAOYE S. LI‡ , AND PANAYOT S. VASSILEVSKI§ Abstract. For a given symmetric positive definite matrix A ∈ RN×N , we develop a fast and backward stable algorithm to approximate A by a symmetric positive definite semiseparable matrix, accurate to a constant multiple of any pres...
متن کاملScaling symmetric positive definite matrices to prescribed row sums
We give a constructive proof of a theorem of Marshall and Olkin that any real symmetric positive definite matrix can be symmetrically scaled by a positive diagonal matrix to have arbitrary positive row sums. We give a slight extension of the result, showing that given a sign pattern, there is a unique diagonal scaling with that sign pattern, and we give upper and lower bounds on the entries of ...
متن کاملA Levinson-like algorithm for symmetric positive definite semiseparable plus diagonal matrices
In this paper a Levinson-like algorithm is derived for solving symmetric positive definite semiseparable plus diagonal systems of equations. In a first part we solve a Yule-Walker-like system of equations. Based on this O(n) solver an algorithm for a general right-hand side is derived. The new method has a linear complexity and takes 19n − 13 operations. The relation between the algorithm and a...
متن کاملDDtBe for Band Symmetric Positive Definite Matrices
We present a new parallel factorization for band symmetric positive definite (s.p.d) matrices and show some of its applications. Let A be a band s.p.d matrix of order n and half bandwidth m. We show how to factor A as A =DDt Be using approximately 4nm2 jp parallel operations where p =21: is the number of processors. Having this factorization, we improve the time to solve Ax = b by a factor of m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2006
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-006-9014-x