On the eigenvalue problem Tu -λ Su =0 with unbounded and nonsymetric operators T and S

In this paper we study both the theoretical problem of the existence and the practical problem of the approximate calculation of eigenvalues and eigenvectors of (i) = 0, where T and S are some linear (in general unbounded and nonhermitian) operators in a Hilbert space. After a short discussion of a class of K -symmetric operators, in section 2 the author proves the existence of eigenvalues and eigenvectors of (i) under various conditions on T and S and investigates conditions under which the set of eigenvectors of (i) is complete. Section 3 indicates briefly the applicability and the unifying property of the generalized method of moments to the approximate solution of (i). Section 4 presents and thoroughly studies a very general new iterative method for the approximate solution of (i). The advantage of this method is that it does not require the practically inconvenient preliminary reduction of (i) to an equivalent problem with bounded operators and that under certain rather general conditions the convergence is mono tonic. Furthermore, by specializing operators and parameters, our iterative method contains as a special case, almost every known iterative method for the calculation of eigenvalues (mostly proved previously only for symmetric matrices and bounded operators). Finally the applicability and the numerical effectiveness of the iterative method is illustrated by calculating the smallest eigenvalue for a selfadjoint and nonselfadjoint eigenvalue problems arising in the problems of elastic stability.

2019 ◽  
Vol 19 (1) ◽  
pp. 137-145 ◽  
Author(s):  
Ekaterina A. Muravleva ◽  
Ivan V. Oseledets

AbstractIn this paper we propose an efficient algorithm to compute low-rank approximation to the solution of so-called “Laplace-like” linear systems. The idea is to transform the problem into the frequency domain, and then use cross approximation. In this case, we do not need to form explicit approximation to the inverse operator, and can approximate the solution directly, which leads to reduced complexity. We demonstrate that our method is fast and robust by using it as a solver inside Uzawa iterative method for solving the Stokes problem.


Author(s):  
Sapto W. Indratno ◽  
Alexander G. Ramm

A new method for inverting the Laplace transform from the real axis is formulated. This method is based on a quadrature formula. We assume that the unknown function is continuous with (known) compact support. An adaptive iterative method and an adaptive stopping rule, which yield the convergence of the approximate solution to , are proposed in this paper.


Sign in / Sign up

Export Citation Format

Share Document