The Rayleigh-Ritz (RR) method finds the stationary values, called Ritz values, of the Rayleigh quotient on a given trial subspace as approximations to eigenvalues of a Hermitian operator A. If the trial subspace is A-invariant, the Ritz values are exactly some of the eigenvalues of A. Given two subspaces X and Y of the same finite dimension, such that X is A-invariant, the absolute changes in t...

This paper deals with the computation of the eigenvalues of a three-parameter Sturm-Liouville problem in the form of ordinary differential equation using Rayleigh-Ritz Method, a method which is based on the principle of variational methods. This method has been effective in computing the eigenvalues of self-adjoint problems. The resulting equations obtained in applying Rayleigh-Ritz method on t...

Generalized block Lanczos methods for large unsymmetric eigenproblems are presented, which contain the block Arnoldi method, and the block Arnoldi algorithms are developed. The convergence of this class of methods is analyzed when the matrix A is diagonalizable. Upper bounds for the distances between normalized eigenvectors and a block Krylov subspace are derived, and a priori theoretical error...

The purpose of this note is to study the Euclidean condition number of the matrix resulting from using the well-known RayleighRitz-Galerkin method with finite dimensional subspaces of polynomial spline functions to approximate the solution of a linear, selfadjoint* two-point boundary value problem. Roughly speaking, we consider a model class of such problems of order In and determine upper boun...

a new approach for analyzing cracked problems in 2d orthotropic materials using the well-known element free galerkin method and orthotropic enrichment functions is proposed. the element free galerkin method is a meshfree method which enables discontinuous problems to be modeled efficiently. in this study, element free galerkin is extrinsically enriched by the recently developed crack-tip orthot...

The harmonic Lanczos bidiagonalization method can be used to compute the smallest singular triplets of a large matrix A. We prove that for good enough projection subspaces harmonic Ritz values converge if the columns of A are strongly linearly independent. On the other hand, harmonic Ritz values may miss some desired singular values when the columns of A are almost linearly dependent. Furthermo...

A general theory is given for discretized versions of the Galerkin method for solving Fredholm integral equations of the second kind. The discretized Galerkin method is obtained from using numerical integration to evaluate the integrals occurring in the Galerkin method. The theoretical framework that is given parallels that of the regular Galerkin method, including the error analysis of the sup...

We describe the development of a method for the efficient computation of the smallest singular values and corresponding vectors for large sparse matrices [4]. The method combines state-of-the-art techniques that make it a useful computational tool appropriate for large scale computations. The method relies upon Lanczos bidiagonalization (LBD) with partial reorthogonalization [6], enhanced with ...