Approximating functions of a large sparse positive definite matrix using a spectral splitting method
نویسندگان
چکیده
منابع مشابه
A Randomized Algorithm for Approximating the Log Determinant of a Symmetric Positive Definite Matrix
We introduce a novel algorithm for approximating the logarithm of the determinant of a symmetric positive definite matrix. The algorithm is randomized and proceeds in two steps: first, it finds an approximation to the largest eigenvalue of the matrix after running a few iterations of the so-called “power method” from the numerical linear algebra literature. Then, using this information, it appr...
متن کاملInteger Factorization of a Positive-Definite Matrix
This paper establishes that every positive-definite matrix can be written as a positive linear combination of outer products of integer-valued vectors whose entries are bounded by the geometric mean of the condition number and the dimension of the matrix.
متن کاملA Numerical Solution of Fractional Optimal Control Problems Using Spectral Method and Hybrid Functions
In this paper, a modern method is presented to solve a class of fractional optimal control problems (FOCPs) indirectly. First, the necessary optimality conditions for the FOCP are obtained in the form of two fractional differential equations (FDEs). Then, the unknown functions are approximated by the hybrid functions, including Bernoulli polynomials and Block-pulse functions based o...
متن کاملVertex Corrections for Positive-Definite Spectral Functions of Simple Metals.
We present a systematic study of vertex corrections in a homogeneous electron gas at metallic densities. The vertex diagrams are built using a recently proposed positive-definite diagrammatic expansion for the spectral function. The vertex function not only provides corrections to the well known plasmon and particle-hole scatterings, but also gives rise to new physical processes such as the gen...
متن کاملA parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion
A parallel computational method SDPARA-C is presented for SDPs (semidefinite programs). It combines two methods SDPARA and SDPA-C proposed by the authors who developed a software package SDPA. SDPARA is a parallel implementation of SDPA and it features parallel computation of the elements of the Schur complement equation system and a parallel Cholesky factorization of its coefficient matrix. SD...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ANZIAM Journal
سال: 2005
ISSN: 1445-8810
DOI: 10.21914/anziamj.v46i0.972