TITLE

POSITIVE DEFINITE HANKEL MATRICES USING CHOLESKY FACTORIZATION

AUTHOR(S)
AL-HOMIDAN, S.; ALSHAHRANI, M.
PUB. DATE
July 2009
SOURCE
Computational Methods in Applied Mathematics;2009, Vol. 9 Issue 3, p221
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Real positive definite Hankel matrices arise in many important applications. They have spectral condition numbers which exponentially increase with their orders. We give a structural algorithm for finding positive definite Hankel matrices using the Cholesky factorization, compute it for orders less than or equal to 30, and compare our result with earlier results.
ACCESSION #
43536895

 

Related Articles

  • Block Factorization of Hankel Matrices and Euclidean Algorithm. Taik, A.; Belhaj, S. // Mathematical Modelling of Natural Phenomena;Dec2010, Vol. 5 Issue 7, p48 

    It is shown that a real Hankel matrix admits an approximate block diagonalization in which the successive transformation matrices are upper triangular Toeplitz matrices. The structure of this factorization was first fully discussed in [1]. This approach is extended to obtain the quotients and...

  • Hankel/Toeplitz matrices and the static output feedback stabilization problem. Astolfi, Alessandro; Colaneri, Patrizio // Mathematics of Control, Signals & Systems;Dec2005, Vol. 17 Issue 4, p231 

    The static output feedback (SOF) stabilization problem for general linear, continuous-time and discrete-time systems is discussed. A few novel necessary and sufficient conditions are proposed, and a modified SOF stabilization problem with performance is studied. For multiple-input single-output...

  • A nonnegative matrix factorization framework for semi-supervised document clustering with dual constraints. Ma, Huifang; Zhao, Weizhong; Shi, Zhongzhi // Knowledge & Information Systems;Sep2013, Vol. 36 Issue 3, p629 

    In this paper, we propose a new semi-supervised co-clustering algorithm Orthogonal Semi-Supervised Nonnegative Matrix Factorization (OSS-NMF) for document clustering. In this new approach, the clustering process is carried out by incorporating both prior domain knowledge of data points...

  • Finding Optimal Ordering of Sparse Matrices for Column-Oriented Parallel Cholesky Factorization. Lin, Wen-Yang // Journal of Supercomputing;Mar2003, Vol. 24 Issue 3, p259 

    In this paper, we consider the problem of finding fill-preserving sparse matrix orderings for parallel factorization. That is, given a large sparse symmetric and positive definite matrix A that has been ordered by some fill-reducing ordering, we want to determine a reordering that is appropriate...

  • A New Algorithm of Inverse for a Like Loewner Type Matrix. Lu Quan; Chen Fang; Xueming, Ren // Southeast Asian Bulletin of Mathematics;2006, Vol. 30 Issue 5, p915 

    In this paper, we introduce a fast algorithm which can be used to determine the triangular factorization of an inverse of a symmetric matrix of Loewner type by using O(n²) operations.

  • Computing the Invariant Polynomials of a Polynomial Matrix. I. Kublanovskaya, V. N. // Journal of Mathematical Sciences;Jun2004, Vol. 121 Issue 4, p2508 

    An algorithm for computing the invariant polynomials and the canonical triangular (trapezoidal) matrix for a polynomial matrix of full column rank is suggested. The algorithm is based on the Δ W-1 rank-factorization method for solving algebraic problems for polynomial matrices, previously...

  • Parallel algorithms for solving linear systems with sparse triangular matrices. Mayer, Jan // Computing;Nov2009, Vol. 86 Issue 4, p291 

    In this article, we present two new algorithms for solving given triangular systems in parallel on a shared memory architecture. Multilevel incomplete LU factorization based preconditioners, which have been very successful for solving linear systems iteratively, require these triangular solves....

  • A fast adaptive solver for hierarchically semiseparable representations. Chandrasekaran, S.; Gu, M.; Lyons, W. // Calcolo;Dec2005, Vol. 42 Issue 3/4, p171 

    We present a fast solver for matrices in hierarchically semi-separable form with highly non-uniform partition trees. The algorithm employed is based on an implicit ULV factorization. Numerical experiments are provided and demonstrate that the solution time scales linearly with problem size.

  • Identifying overlapping communities as well as hubs and outliers via nonnegative matrix factorization. Xiaochun Cao; Xiao Wang; Di Jin; Yixin Cao; Dongxiao He // Scientific Reports;10/21/2013, p1 

    Community detection is important for understanding networks. Previous studies observed that communities are not necessarily disjoint and might overlap. It is also agreed that some outlier vertices participate in no community, and some hubs in a community might take more important roles than...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics