Pivoting East

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

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

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

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

منابع مشابه

Stability of the Diagonal Pivoting Method with Partial Pivoting

LAPACK and LINPACK both solve symmetric indefinite linear systems using the diagonal pivoting method with the partial pivoting strategy of Bunch and Kaufman [Math. Comp., 31 (1977), pp. 163–179]. No proof of the stability of this method has appeared in the literature. It is tempting to argue that the diagonal pivoting method is stable for a given pivoting strategy if the growth factor is small....

متن کامل

Symmetric Pivoting in ScaLAPACK

Recently codes have been developed for computing the Cholesky factorization with complete pivoting of a symmetric positive semidefinite matrix for the serial LAPACK library. In the parallel ScaLAPACK library there are only routines for the unpivoted factorization in the positive definite case and no algorithms use complete pivoting. We aim to assess the feasibility of complete pivoting in ScaLA...

متن کامل

Matching graphs by pivoting

Motivated by a recent (continuous) quadratic formulation, in this paper we present a pivoting-based heuristic for graph matching based on the corresponding linear complementarity problem. Experiments are presented which demonstrate the potential of the proposed method. 2002 Elsevier Science B.V. All rights reserved.

متن کامل

Stability of the Diagonal Pivoting

LAPACK and LINPACK both solve symmetric indeenite linear systems using the diagonal pivoting method with the partial pivoting strategy of Bunch and Kaufman (1977). No proof of the stability of this method has appeared in the literature. It is tempting to argue that the diagonal pivoting method is stable for a given pivoting strategy if the growth factor is small. We show that this argument is f...

متن کامل

Reinforcement Learning for Pivoting Task

In this work we propose an approach to learn a robust policy for solving the pivoting task. Recently, several model-free continuous control algorithms were shown to learn successful policies without prior knowledge of the dynamics of the task. However, obtaining successful policies required thousands to millions of training episodes, limiting the applicability of these approaches to real hardwa...

متن کامل

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


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

ژورنال

عنوان ژورنال: Documenta Praehistorica

سال: 2019

ISSN: 1854-2492,1408-967X

DOI: 10.4312/dp.45-6