Numerically stable improved Chebyshev–Halley type schemes for matrix sign function

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerically stable cointegration analysis

Cointegration analysis involves the solution of a generalized eigenproblem involving moment matrices and inverted moment matrices. These formulae are unsuitable for actual computations because the condition numbers of the resulting matrices are unnecessarily increased. Our note discusses how to use the structure of the problem to achieve numerically stable computations, based on QR and singular...

متن کامل

A Stable Scaling of Newton-schulz for Improving the Sign Function Computation of a Hermitian Matrix

The Newton-Schulz iteration is a quadratically convergent, inversion-free method for computing the sign function of a matrix. It is advantageous over other methods for high-performance computing because it is rich in matrix-matrix multiplications. In this paper we propose a variant for Hermitian matrices that improves the initially slow convergence of the iteration. The main idea is to scale th...

متن کامل

Numerically Stable Algorithm for Cycloidal Splines

We propose a knot insertion algorithm for splines that are piecewisely in L{1, x, sin x, cos x}. Since an ECC–system on [0, 2π] in this case does not exist, we construct a CCC–system by choosing the appropriate measures in the canonical representation. In this way, a B-basis can be constructed in much the same way as for weighted and tension splines. Thus we develop a corner cutting algorithm f...

متن کامل

Treba: Efficient Numerically Stable EM for PFA

Training probabilistic finite automata with the EM/Baum-Welch algorithm is computationally very intensive, especially if random ergodic automata are used initially, and additional strategies such as deterministic annealing are used. In this paper we present some optimization and parallelization strategies to the Baum-Welch algorithm that often allow for training of much larger automata with a l...

متن کامل

A new numerically stable implementation of the T-matrix method for electromagnetic scattering by spheroidal particles

We propose, describe, and demonstrate a new numerically stable implementation of the extended boundary-condition method (EBCM) to compute the T-matrix for electromagnetic scattering by spheroidal particles. Our approach relies on the fact that for many of the EBCM integrals in the special case of spheroids, a leading part of the integrand integrates exactly to zero, which causes catastrophic lo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2017

ISSN: 0377-0427

DOI: 10.1016/j.cam.2016.10.025