Derivation of BiCG from the conditions defining Lanczos' method for solving a system of linear equations

Petr Tichý; Jan Zítko

Displaying similar documents to “Derivation of BiCG from the conditions defining Lanczos' method for solving a system of linear equations”

Using successive approximations for improving the convergence of GMRES method

Jan Zítko (1998)

Applications of Mathematics

Similarity:

In this paper, our attention is concentrated on the GMRES method for the solution of the system $(I - T) x = b$ of linear algebraic equations with a nonsymmetric matrix. We perform $m$ pre-iterations $y_{l + 1} = T y_{l} + b$ before starting GMRES and put $y_{m}$ for the initial approximation in GMRES. We derive an upper estimate for the norm of the error vector in dependence on the $m$ th powers of eigenvalues of the matrix $T$ . Further we study under what eigenvalues lay-out this upper estimate is the best one. The estimate shows and...

On the weighted Euclidean matching problem in $ℝ^{d}$

Birgit Anthes, Ludger Rüschendorf (2001)

Applicationes Mathematicae

Similarity:

A partitioning algorithm for the Euclidean matching problem in $ℝ^{d}$ is introduced and analyzed in a probabilistic model. The algorithm uses elements from the fixed dissection algorithm of Karp and Steele (1985) and the Zig-Zag algorithm of Halton and Terada (1982) for the traveling salesman problem. The algorithm runs in expected time $n {(l o g n)}^{p - 1}$ and approximates the optimal matching in the probabilistic sense.

A descent algorithm for $ε$ - approximation of continuous functions with values in unitary space

M. Janc (1982)

Matematički Vesnik

Similarity:

An improvement of Euclid's algorithm

Zítko, Jan, Kuřátko, Jan

Similarity:

The paper introduces the calculation of a greatest common divisor of two univariate polynomials. Euclid’s algorithm can be easily simulated by the reduction of the Sylvester matrix to an upper triangular form. This is performed by using $c$ - $s$ transformation and $Q R$ -factorization methods. Both procedures are described and numerically compared. Computations are performed in the floating point environment.

Implicitization of Parametric Hypersurfaces via Points

Ferruccio Orecchia, Isabella Ramella (2018)

Rendiconto dell’Accademia delle Scienze Fisiche e Matematiche

Similarity:

Given a parametric polynomial representation of an algebraic hypersurface $\mathbf{S}$ in the projective space we give a new algorithm for finding the implicit cartesian equation of $\mathbf{S}$ .The algorithm is based on finding a suitable finite number of points on $\mathbf{S}$ and computing, by linear algebra, the equation of the hypersurface of least degree that passes through the points. In particular the algorithm works for plane curves and surfaces in the ordinary three-dimensional space. Using C++ the algorithm...

A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays

Aziz Moukrim, Djamal Rebaine, Mehdi Serairi (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper we consider the problem of scheduling, on a two-machine flowshop, a set of unit-time operations subject to time delays with respect to the makespan. This problem is known to be $𝒩 P$ x1d4a9;x1d4ab; -hard in the strong sense. We propose an algorithm based on a branch and bound enumeration scheme. This algorithm includes the implementation of new lower and upper bound procedures, and dominance rules. A computer simulation to measure the performance of the algorithm is provided...

Greedy approximation and the multivariate Haar system

A. Kamont, V. N. Temlyakov (2004)

Studia Mathematica

Similarity:

We study nonlinear m-term approximation in a Banach space with regard to a basis. It is known that in the case of a greedy basis (like the Haar basis in $L_{p} ([0, 1])$ , 1 < p < ∞) a greedy type algorithm realizes nearly best m-term approximation for any individual function. In this paper we generalize this result in two directions. First, instead of a greedy algorithm we consider a weak greedy algorithm. Second, we study in detail unconditional nongreedy bases (like the multivariate Haar basis...

The general methods of finding the sum $S_{n}$ for all kinds of series

K. Orlov (1981)

Matematički Vesnik

Similarity:

Pivoting algorithm in class of ABS methods

Gabriela Kálnová (1996)

Archivum Mathematicum

Similarity:

Summary: The paper deals with a pivoting modification of the algorithm in the class of ABS methods. Numerical experiments compare this pivoting modification with the fundamental version. A hybrid algorithm for the solution of the linear system with the Hankel matrix is introduced.