Least-squares Rational Filters for the Solution of Interior Eigenvalue Problems

نویسنده

  • YOUSEF SAAD
چکیده

This paper presents a method for computing partial spectra of Hermitian matrices, based on a subspace iteration method combined with rational filtering. While the general approach is the same as that of the FEAST package, the emphasis of this paper is on the selection of the filter. Specifically, the goal is to show the appeal of a least-squares viewpoint for designing filters. In particular, the paper shows how to define filters with repeated poles and demonstrates that this option can be attractive when iterative methods are used.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-Linear Least-Squares Optimization of Rational Filters for the Solution of Interior Eigenvalue Problems

Rational filter functions improve convergence of contour-based eigensolvers, a popular algorithm family for the solution of the interior eigenvalue problem. We present an optimization method of these rational filters in the Least-Squares sense. Our filters out-perform existing filters on a large and representative problem set, which we show on the example of FEAST. We provide a framework for (n...

متن کامل

Designing rational filter functions for solving eigenvalue problems by contour integration

Solving (nonlinear) eigenvalue problems by contour integration, requires an e↵ective discretization for the corresponding contour integrals. In this paper it is shown that good rational filter functions can be computed using (nonlinear least squares) optimization techniques as opposed to designing those functions based on a thorough understanding of complex analysis. The conditions that such an...

متن کامل

A Fast Algorithm for Solving Regularized Total Least Squares Problems

The total least squares (TLS) method is a successful approach for linear problems if both the system matrix and the right hand side are contaminated by some noise. For ill-posed TLS problems Renaut and Guo [SIAM J. Matrix Anal. Appl., 26 (2005), pp. 457 476] suggested an iterative method which is based on a sequence of linear eigenvalue problems. Here we analyze this method carefully, and we ac...

متن کامل

Exact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach

We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...

متن کامل

A meshless discrete Galerkin method for solving the universe evolution differential equations based on the moving least squares approximation

In terms of observational data, there are some problems in the standard Big Bang cosmological model. Inflation era, early accelerated phase of the evolution of the universe, can successfully solve these problems. The inflation epoch can be explained by scalar inflaton field. The evolution of this field is presented by a non-linear differential equation. This equation is considered in FLRW model...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015