Avoiding look-ahead in the Lanczos method and Padé approximation
نویسندگان
چکیده
منابع مشابه
New look-ahead Lanczos-type algorithms for linear systems
A breakdown (due to a division by zero) can arise in the algorithms for implementing Lanczos' method because of the non{existence of some formal orthogonal polynomials or because the recurrence relationship used is not appropriate. Such a breakdown can be avoided by jumping over the polynomials involved. This strategy was already used in some algorithms such as the MRZ and its variants. In this...
متن کاملA Parallel GNFS Algorithm Based on a Reliable Look-Ahead Block Lanczos Method for Integer Factorization
The Rivest-Shamir-Adleman (RSA) algorithm is a very popular and secure public key cryptosystem, but its security relies on the difficulty of factoring large integers. The General Number Field Sieve (GNFS) algorithm is currently the best known method for factoring large integers over 110 digits. Our previous work on the parallel GNFS algorithm, which integrated the Montgomery’s block Lanczos met...
متن کاملLook-Ahead Procedures for Lanczos-Type Product Methods Based on Three-Term Lanczos Recurrences
Lanczos-type product methods for solving large sparse non-Hermitian linear systems have as residual polynomials either the squares of the Lanczos polynomials or the products of the latter with another sequence of polynomials, which is normally chosen to enforce some local minimization of the residual norm. In either case, these methods inherit from the underlying Lanczos process the danger of b...
متن کاملAvoiding the Look-Ahead Pathology of Decision Tree Learning
Most decision-tree induction algorithms are using a local greedy strategy, where a leaf is always split on the best attribute according to a given attribute selection criterion. A more accurate model could possibly be found by looking ahead for alternative subtrees. However, some researchers argue that the look-ahead should not be used due to a negative effect (called ―decision tree pathology‖)...
متن کاملComparison of the Padé approximation method to perturbative QCD calculations.
We present a method of estimating perturbative coefficients in Quantum Field Theory using Padé Approximants. We test this method on various known QCD results, and find that the method works very well. ? Work supported by the Department of Energy, contract DE–AC03–76SF00515. † To appear in Phys. Rev. Lett. By using the first n coefficients in a series expansion, we have estimated the (n+ 1)-st p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1999
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-26-1-33-62