๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some inverse eigenproblems for Jacobi and arrow matrices

โœ Scribed by Carlos F. Borges; Ruggero Frezza; William B. Gragg

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
401 KB
Volume
2
Category
Article
ISSN
1070-5325

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The solvability conditions for inverse e
The solvability conditions for inverse eigenproblem of symmetric and anti-persymmetric matrices and its approximation
โœ Dongxiu Xie; Xiyan Hu; Lei Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 104 KB

## Abstract The problem of generating a matrix __A__ with specified eigenโ€pair, where __A__ is a symmetric and antiโ€persymmetric matrix, is presented. An existence theorem is given and proved. A general expression of such a matrix is provided. We denote the set of such matrices by ๐’ฎ๐’œ๐’ฎ~E~^__n__^. Th

The convergence of Jacobiโ€“Davidson itera
The convergence of Jacobiโ€“Davidson iterations for Hermitian eigenproblems
โœ Jasper van den Eshof ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 140 KB

## Abstract Rayleigh quotient iteration is an iterative method with some attractive convergence properties for finding (interior) eigenvalues of large sparse Hermitian matrices. However, the method requires the accurate (and, hence, often expensive) solution of a linear system in every iteration st

Factorization for efficient solution of
Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products
โœ A. Kaveh; H. Rahami ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 483 KB

## Abstract Many structural models can be generated as the graph products of two or three subgraphs known as their generators. The main types of graph products consist of Cartesian, strong Cartesian, direct, and lexicographic products. In this paper, a general method is presented for the factorizat