Language:
English
繁體中文
Help
回圖書館首頁
手機版館藏查詢
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
High Efficiency Spectral Analysis an...
~
Duersch, Jed Alma.
Linked to FindBook
Google Book
Amazon
博客來
High Efficiency Spectral Analysis and BLAS-3 Randomized QRCP with Low-Rank Approximations.
Record Type:
Electronic resources : Monograph/item
Title/Author:
High Efficiency Spectral Analysis and BLAS-3 Randomized QRCP with Low-Rank Approximations./
Author:
Duersch, Jed Alma.
Description:
103 p.
Notes:
Source: Dissertation Abstracts International, Volume: 77-08(E), Section: B.
Contained By:
Dissertation Abstracts International77-08B(E).
Subject:
Applied mathematics. -
Online resource:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10086101
ISBN:
9781339592343
High Efficiency Spectral Analysis and BLAS-3 Randomized QRCP with Low-Rank Approximations.
Duersch, Jed Alma.
High Efficiency Spectral Analysis and BLAS-3 Randomized QRCP with Low-Rank Approximations.
- 103 p.
Source: Dissertation Abstracts International, Volume: 77-08(E), Section: B.
Thesis (Ph.D.)--University of California, Berkeley, 2015.
The purpose of this work is to improve stability and performance of selected matrix decompositions in numerical linear algebra. Chapter 1 examines the Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) algorithm used to compute eigenvector-eigenvalue pairs for large sparse symmetric matrices or symmetric matrix pencils. Modifications are developed and analyzed to improve both performance and reliability. Numerical experiments demonstrate the final algorithm often operates several times faster than competing versions and succeeds in processing difficult matrices for which other versions fail.
ISBN: 9781339592343Subjects--Topical Terms:
2122814
Applied mathematics.
High Efficiency Spectral Analysis and BLAS-3 Randomized QRCP with Low-Rank Approximations.
LDR
:02872nmm a2200277 4500
001
2070592
005
20160617121821.5
008
170521s2015 ||||||||||||||||| ||eng d
020
$a
9781339592343
035
$a
(MiAaPQ)AAI10086101
035
$a
AAI10086101
040
$a
MiAaPQ
$c
MiAaPQ
100
1
$a
Duersch, Jed Alma.
$3
3185652
245
1 0
$a
High Efficiency Spectral Analysis and BLAS-3 Randomized QRCP with Low-Rank Approximations.
300
$a
103 p.
500
$a
Source: Dissertation Abstracts International, Volume: 77-08(E), Section: B.
500
$a
Adviser: Ming Gu.
502
$a
Thesis (Ph.D.)--University of California, Berkeley, 2015.
520
$a
The purpose of this work is to improve stability and performance of selected matrix decompositions in numerical linear algebra. Chapter 1 examines the Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) algorithm used to compute eigenvector-eigenvalue pairs for large sparse symmetric matrices or symmetric matrix pencils. Modifications are developed and analyzed to improve both performance and reliability. Numerical experiments demonstrate the final algorithm often operates several times faster than competing versions and succeeds in processing difficult matrices for which other versions fail.
520
$a
Chapters 2 extends the work on symmetric eigenvalue problems by developing an algorithm specialized to resolve eigenpairs in the interior of the spectrum of a symmetric matrix. An new Spectral Target Residual Descent (STRD) algorithm is proposed based on LOBPCG. This algorithm is demonstrated to reduce the number of iterations required to achieve convergence by roughly half. The component subroutines of STRD also have generalized versions to process interior eigenvalues of symmetric matrix pencils. Chapter 3 explores a variation on the QR decomposition with Column Pivoting using randomized-sampling to process pivoting decisions. Randomized QRCP eliminates the leading order of communication by processing column pivots on a much smaller sample matrix. This produces blocks of column pivots that are processed with BLAS-3 operations on the original matrix. Sample update formulations are explored that allow full matrices to be factorized without re-compressing the matrix after each block iteration. Related low-rank factorizations are also developed and compared in numerical experiments. These experiments show approximation quality for structured matrices to be comparable, and often better than, approximations based on QRCP. Furthermore, performance is shown to be nearly as good as QR without pivoting, which is often an order of magnitude faster than QRCP.
590
$a
School code: 0028.
650
4
$a
Applied mathematics.
$3
2122814
690
$a
0364
710
2
$a
University of California, Berkeley.
$b
Applied Mathematics.
$3
3185653
773
0
$t
Dissertation Abstracts International
$g
77-08B(E).
790
$a
0028
791
$a
Ph.D.
792
$a
2015
793
$a
English
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10086101
based on 0 review(s)
Location:
ALL
電子資源
Year:
Volume Number:
Items
1 records • Pages 1 •
1
Inventory Number
Location Name
Item Class
Material type
Call number
Usage Class
Loan Status
No. of reservations
Opac note
Attachments
W9303460
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
On shelf
0
1 records • Pages 1 •
1
Multimedia
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login