找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 40528|回復(fù): 55
樓主
發(fā)表于 2025-3-21 16:12:25 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Hierarchical Matrices: Algorithms and Analysis
編輯Wolfgang Hackbusch
視頻videohttp://file.papertrans.cn/427/426137/426137.mp4
概述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
關(guān)鍵詞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影響因子(影響力)學(xué)科排名




書目名稱Hierarchical Matrices: Algorithms and Analysis網(wǎng)絡(luò)公開度




書目名稱Hierarchical Matrices: Algorithms and Analysis網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Hierarchical Matrices: Algorithms and Analysis被引頻次




書目名稱Hierarchical Matrices: Algorithms and Analysis被引頻次學(xué)科排名




書目名稱Hierarchical Matrices: Algorithms and Analysis年度引用




書目名稱Hierarchical Matrices: Algorithms and Analysis年度引用學(xué)科排名




書目名稱Hierarchical Matrices: Algorithms and Analysis讀者反饋




書目名稱Hierarchical Matrices: Algorithms and Analysis讀者反饋學(xué)科排名




單選投票, 共有 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

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 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
板凳
發(fā)表于 2025-3-22 03:30:17 | 只看該作者
地板
發(fā)表于 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
5#
發(fā)表于 2025-3-22 11:27:22 | 只看該作者
6#
發(fā)表于 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
7#
發(fā)表于 2025-3-22 17:43:07 | 只看該作者
8#
發(fā)表于 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].
9#
發(fā)表于 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.
10#
發(fā)表于 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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-13 14:19
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
通化县| 萝北县| 丹阳市| 巫山县| 汝阳县| 宿州市| 丰原市| 德清县| 清涧县| 康保县| 洮南市| 廊坊市| 精河县| 张北县| 蒲城县| 旺苍县| 易门县| 株洲市| 无锡市| 白银市| 马关县| 城口县| 启东市| 民乐县| 睢宁县| 东方市| 呼玛县| 宁陕县| 吴江市| 遂溪县| 侯马市| 兴文县| 山阳县| 西藏| 通江县| 巴马| 喀喇沁旗| 巴东县| 岳池县| 永福县| 宜宾县|