找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Hierarchical Matrices: Algorithms and Analysis; Wolfgang Hackbusch Book 2015 Springer-Verlag Berlin Heidelberg 2015 efficient matrix algor

[复制链接]
查看: 40461|回复: 55
发表于 2025-3-21 16:12:25 | 显示全部楼层 |阅读模式
书目名称Hierarchical Matrices: Algorithms and Analysis
编辑Wolfgang Hackbusch
视频video
概述Matrix algorithms of almost linear cost.Application to matrix equations and matrix functions.Self-contained contents by means of five appendices.Includes supplementary material:
丛书名称Springer Series in Computational Mathematics
图书封面Titlebook: Hierarchical Matrices: Algorithms and Analysis;  Wolfgang Hackbusch Book 2015 Springer-Verlag Berlin Heidelberg 2015 efficient matrix algor
描述.This self-contained monograph presents matrix algorithms and their analysis. The new technique enables not only the solution of linear systems but also the approximation of matrix functions, e.g., the matrix exponential. Other applications include the solution of matrix equations, e.g., the Lyapunov or Riccati equation. The required mathematical background can be found in the appendix..The numerical treatment of fully populated large-scale matrices is usually rather costly. However, the technique of hierarchical matrices makes it possible to store matrices and to perform matrix operations approximately with almost linear cost and a controllable degree of approximation error. For important classes of matrices, the computational cost increases only logarithmically with the approximation error. The operations provided include the matrix inversion and LU decomposition..Since large-scale linear algebra problems are standard in scientific computing, the subject of hierarchicalmatrices is of interest to scientists in computational mathematics, physics, chemistry and engineering..
出版日期Book 2015
关键词efficient matrix algorithms; matrix equations; matrix functions; matrix inversion and LU decomposition;
版次1
doihttps://doi.org/10.1007/978-3-662-47324-5
isbn_softcover978-3-662-56894-1
isbn_ebook978-3-662-47324-5Series ISSN 0179-3632 Series E-ISSN 2198-3712
issn_series 0179-3632
copyrightSpringer-Verlag Berlin Heidelberg 2015
The information of publication is updating

书目名称Hierarchical Matrices: Algorithms and Analysis影响因子(影响力)




书目名称Hierarchical Matrices: Algorithms and Analysis影响因子(影响力)学科排名




书目名称Hierarchical Matrices: Algorithms and Analysis网络公开度




书目名称Hierarchical Matrices: Algorithms and Analysis网络公开度学科排名




书目名称Hierarchical Matrices: Algorithms and Analysis被引频次




书目名称Hierarchical Matrices: Algorithms and Analysis被引频次学科排名




书目名称Hierarchical Matrices: Algorithms and Analysis年度引用




书目名称Hierarchical Matrices: Algorithms and Analysis年度引用学科排名




书目名称Hierarchical Matrices: Algorithms and Analysis读者反馈




书目名称Hierarchical Matrices: Algorithms and Analysis读者反馈学科排名




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

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-22 00:07:23 | 显示全部楼层
Wolfgang Hackbuschiedert, so daß durch sie eine rasche Orientierung und Übersicht nicht behindert wird... Abschließend sei noch auf die Auflistung der Generics und der Handelsnamen sowie auf das umfassende und vorzügliche Sachwortverzeichnis hingewiesen, die die praktische Nutzbarkeit des Büchleins entscheidend mitbestimmen." 978-3-662-05776-6
发表于 2025-3-22 03:30:17 | 显示全部楼层
发表于 2025-3-22 05:27:00 | 显示全部楼层
Wolfgang Hackbuschiedert, so daß durch sie eine rasche Orientierung und Übersicht nicht behindert wird... Abschließend sei noch auf die Auflistung der Generics und der Handelsnamen sowie auf das umfassende und vorzügliche Sachwortverzeichnis hingewiesen, die die praktische Nutzbarkeit des Büchleins entscheidend mitbestimmen." 978-3-662-05776-6
发表于 2025-3-22 11:27:22 | 显示全部楼层
发表于 2025-3-22 16:30:04 | 显示全部楼层
Separable Expansions and Low-Rank Matricesparability follows from an admissibility condition (§4.2.3) for the domain X × Y where κ(·, ·) is evaluated..In Section 4.3 we discuss separable expansions via polynomials. The Taylor expansion (§4.3.1) is a possible tool to obtain approximating polynomials, but interpolation (§4.3.2) is the easiest
发表于 2025-3-22 17:43:07 | 显示全部楼层
发表于 2025-3-22 22:38:29 | 显示全部楼层
Formatted Matrix Operations for Hierarchical Matricesamard product. The analysis of the computational work required by these operations is given in Section 7.8. Concerning parallel implementations one finds details in Kriemann [176, 177, 178, 181], Bebendorf–Kriemann [28], and Izadi [163].
发表于 2025-3-23 05:28:13 | 显示全部楼层
-Matrices without any logarithmic factor (see Section 8.6). The matrix-vector multiplication by .-matrices and the corresponding work is described in Section 8.7. The multiplication algorithm for two .-matrices is given in Section 8.9. Also in §9.3.3 we shall refer to .-matrices.
发表于 2025-3-23 07:48:41 | 显示全部楼层
Matrix Equationsnonlinear matrix equation and cannot be solved via the matrix-vector multiplication. Examples are the linear Lyapunov and Sylvester equations as well as the quadratic Riccati equation, which arise, e.g., in optimal control problems for partial differential equations and in model reduction methods..T
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-21 18:52
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表