找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Separable Type Representations of Matrices and Fast Algorithms; Volume 2 Eigenvalue Yuli Eidelman,Israel Gohberg,Iulian Haimovici Book 201

[复制链接]
查看: 27127|回复: 56
发表于 2025-3-21 19:45:55 | 显示全部楼层 |阅读模式
书目名称Separable Type Representations of Matrices and Fast Algorithms
副标题Volume 2 Eigenvalue
编辑Yuli Eidelman,Israel Gohberg,Iulian Haimovici
视频video
概述Self-contained monograph with material developed over the last 30 years.Systematic theoretical and computational study of several types of generalizations of separable matrices.Many illustrative examp
丛书名称Operator Theory: Advances and Applications
图书封面Titlebook: Separable Type Representations of Matrices and Fast Algorithms; Volume 2 Eigenvalue  Yuli Eidelman,Israel Gohberg,Iulian Haimovici Book 201
描述.This two-volume work presents a systematic theoretical and computational study of several types of generalizations of separable matrices. The main attention is paid to fast algorithms (many of linear complexity) for matrices in semiseparable, quasiseparable, band and companion form. The work is focused on algorithms of multiplication, inversion and description of eigenstructure and includes a large number of illustrative examples throughout the different chapters. .The second volume, consisting of four parts, addresses the eigenvalue problem for matrices with quasiseparable structure and applications to the polynomial root finding problem. In the first part the properties of the characteristic polynomials of principal leading submatrices, the structure of eigenspaces and the basic methods to compute eigenvalues are studied in detail for matrices with quasiseparable representation of the first order. The second part is devoted to the divide and conquer method, with the main algorithms being derived also for matrices with quasiseparable representation of order one. The QR iteration method for some classes of matrices with quasiseparable of any order representations is studied in the
出版日期Book 2014
关键词Eigenvalue problems; Fast algorithms; Polynomial root finder problem; Quasiseparable representations; St
版次1
doihttps://doi.org/10.1007/978-3-0348-0612-1
isbn_ebook978-3-0348-0612-1Series ISSN 0255-0156 Series E-ISSN 2296-4878
issn_series 0255-0156
copyrightSpringer Basel 2014
The information of publication is updating

书目名称Separable Type Representations of Matrices and Fast Algorithms影响因子(影响力)




书目名称Separable Type Representations of Matrices and Fast Algorithms影响因子(影响力)学科排名




书目名称Separable Type Representations of Matrices and Fast Algorithms网络公开度




书目名称Separable Type Representations of Matrices and Fast Algorithms网络公开度学科排名




书目名称Separable Type Representations of Matrices and Fast Algorithms被引频次




书目名称Separable Type Representations of Matrices and Fast Algorithms被引频次学科排名




书目名称Separable Type Representations of Matrices and Fast Algorithms年度引用




书目名称Separable Type Representations of Matrices and Fast Algorithms年度引用学科排名




书目名称Separable Type Representations of Matrices and Fast Algorithms读者反馈




书目名称Separable Type Representations of Matrices and Fast Algorithms读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:43:20 | 显示全部楼层
发表于 2025-3-22 03:54:16 | 显示全部楼层
发表于 2025-3-22 07:22:15 | 显示全部楼层
发表于 2025-3-22 09:33:10 | 显示全部楼层
Eigenvalues with Geometric Multiplicity OneIn this chapter we study conditions under which the eigenspaces of quasiseparable of order one matrices are one-dimensional. We also derive explicit formulas for the corresponding eigenvectors.
发表于 2025-3-22 15:27:52 | 显示全部楼层
Kernels of Quasiseparable of Order One MatricesNext in this part we study the eigenspaces of quasiseparable of order one matrices. Notice that for a matrix A the matrix A – λ.. has the same lower and upper quasiseparable generators. This is the reason we study the properties of kernels of the considered matrices.
发表于 2025-3-22 19:22:01 | 显示全部楼层
发表于 2025-3-22 22:11:24 | 显示全部楼层
发表于 2025-3-23 04:30:56 | 显示全部楼层
发表于 2025-3-23 08:05:11 | 显示全部楼层
Complete Algorithm for Hermitian MatricesIn this chapter we study in detail the divide and conquer method for Hermitian matrices with quasiseparable representations. For Hermitian quasiseparable of order one matrices we obtain a complete algorithm to compute the eigenvalue decomposition of a matrix.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-23 09:16
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表