Displaying 81 – 100 of 321

Showing per page

Bounds of modulus of eigenvalues based on Stein equation

Guang-Da Hu, Qiao Zhu (2010)

Kybernetika

This paper is concerned with bounds of eigenvalues of a complex matrix. Both lower and upper bounds of modulus of eigenvalues are given by the Stein equation. Furthermore, two sequences are presented which converge to the minimal and the maximal modulus of eigenvalues, respectively. We have to point out that the two sequences are not recommendable for practical use for finding the minimal and the maximal modulus of eigenvalues.

Complexity issues for the symmetric interval eigenvalue problem

Milan Hladík (2015)

Open Mathematics

We study the problem of computing the maximal and minimal possible eigenvalues of a symmetric matrix when the matrix entries vary within compact intervals. In particular, we focus on computational complexity of determining these extremal eigenvalues with some approximation error. Besides the classical absolute and relative approximation errors, which turn out not to be suitable for this problem, we adapt a less known one related to the relative error, and also propose a novel approximation error....

Convergence of approximation methods for eigenvalue problem for two forms

Teresa Regińska (1984)

Aplikace matematiky

The paper concerns an approximation of an eigenvalue problem for two forms on a Hilbert space X . We investigate some approximation methods generated by sequences of forms a n and b n defined on a dense subspace of X . The proof of convergence of the methods is based on the theory of the external approximation of eigenvalue problems. The general results are applied to Aronszajn’s method.

Currently displaying 81 – 100 of 321