A Parallel Implementation of Davidson Methods for Large-Scale Eigenvalue Problems in SLEPc
In the context of large-scale eigenvalue problems, methods of Davidson type such as Jacobi-Davidson can be competitive with respect to other types of algorithms, especially in some particularly difficult situations such as computing interior eigenvalues or when matrix factorization is prohibitive or...
Gespeichert in:
Veröffentlicht in: | ACM transactions on mathematical software 2014-02, Vol.40 (2), p.1-29 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 29 |
---|---|
container_issue | 2 |
container_start_page | 1 |
container_title | ACM transactions on mathematical software |
container_volume | 40 |
creator | ROMERO, Eloy ROMAN, Jose E |
description | In the context of large-scale eigenvalue problems, methods of Davidson type such as Jacobi-Davidson can be competitive with respect to other types of algorithms, especially in some particularly difficult situations such as computing interior eigenvalues or when matrix factorization is prohibitive or highly inefficient. However, these types of methods are not generally available in the form of high-quality parallel implementations, especially for the case of non-Hermitian eigenproblems. We present our implementation of various Davidson-type methods in SLEPc, the Scalable Library for Eigenvalue Problem Computations. The solvers incorporate many algorithmic variants for subspace expansion and extraction, and cover a wide range of eigenproblems including standard and generalized, Hermitian and non-Hermitian, with either real or complex arithmetic. We provide performance results on a large battery of test problems. |
doi_str_mv | 10.1145/2543696 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1793240766</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1793240766</sourcerecordid><originalsourceid>FETCH-LOGICAL-c321t-512baf11e078d2d08c2582108bea4f318e99a9ad02d164d0277c9cdc6179b0e3</originalsourceid><addsrcrecordid>eNo9kM9LwzAcxYMoOKf4L-QieqkmadM0xzHnD6g42E5eyrfpt7OSNjPpBv73RjY8vXf4vAfvEXLN2T3nmXwQMktznZ-QCZdSJUpoeUomjOkiSSVj5-QihC_GmOCKT8jHjC7Bg7Vo6Wu_tdjjMMLYuYG6lj7CvmtC9G84from0NZ5WoLfYLIyYJEuug0Oe7A7pEvv6hgPtBvoqlwszSU5a8EGvDrqlKyfFuv5S1K-P7_OZ2ViUsHHRHJRQ8s5MlU0omGFEbIQnBU1QtamvECtQUPDRMPzLIpSRpvG5FzpmmE6JXeH2q133zsMY9V3waC1MKDbhSpiqciYyvOI3h5Q410IHttq67se_E_FWfV3XnU8L5I3x1IIcWjrYTBd-MdFIUWmZJ7-AmhmbIg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1793240766</pqid></control><display><type>article</type><title>A Parallel Implementation of Davidson Methods for Large-Scale Eigenvalue Problems in SLEPc</title><source>ACM Digital Library</source><creator>ROMERO, Eloy ; ROMAN, Jose E</creator><creatorcontrib>ROMERO, Eloy ; ROMAN, Jose E</creatorcontrib><description>In the context of large-scale eigenvalue problems, methods of Davidson type such as Jacobi-Davidson can be competitive with respect to other types of algorithms, especially in some particularly difficult situations such as computing interior eigenvalues or when matrix factorization is prohibitive or highly inefficient. However, these types of methods are not generally available in the form of high-quality parallel implementations, especially for the case of non-Hermitian eigenproblems. We present our implementation of various Davidson-type methods in SLEPc, the Scalable Library for Eigenvalue Problem Computations. The solvers incorporate many algorithmic variants for subspace expansion and extraction, and cover a wide range of eigenproblems including standard and generalized, Hermitian and non-Hermitian, with either real or complex arithmetic. We provide performance results on a large battery of test problems.</description><identifier>ISSN: 0098-3500</identifier><identifier>EISSN: 1557-7295</identifier><identifier>DOI: 10.1145/2543696</identifier><identifier>CODEN: ACMSCU</identifier><language>eng</language><publisher>New York, NY: Association for Computing Machinery</publisher><subject>Algebra ; Algorithms ; Applied sciences ; Battery ; Computation ; Computer programs ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Eigenvalues ; Exact sciences and technology ; Factorization ; Information retrieval. Graph ; Linear and multilinear algebra, matrix theory ; Mathematics ; Sciences and techniques of general use ; Software ; Solvers ; Theoretical computing</subject><ispartof>ACM transactions on mathematical software, 2014-02, Vol.40 (2), p.1-29</ispartof><rights>2015 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c321t-512baf11e078d2d08c2582108bea4f318e99a9ad02d164d0277c9cdc6179b0e3</citedby><cites>FETCH-LOGICAL-c321t-512baf11e078d2d08c2582108bea4f318e99a9ad02d164d0277c9cdc6179b0e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,778,782,27911,27912</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28524756$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>ROMERO, Eloy</creatorcontrib><creatorcontrib>ROMAN, Jose E</creatorcontrib><title>A Parallel Implementation of Davidson Methods for Large-Scale Eigenvalue Problems in SLEPc</title><title>ACM transactions on mathematical software</title><description>In the context of large-scale eigenvalue problems, methods of Davidson type such as Jacobi-Davidson can be competitive with respect to other types of algorithms, especially in some particularly difficult situations such as computing interior eigenvalues or when matrix factorization is prohibitive or highly inefficient. However, these types of methods are not generally available in the form of high-quality parallel implementations, especially for the case of non-Hermitian eigenproblems. We present our implementation of various Davidson-type methods in SLEPc, the Scalable Library for Eigenvalue Problem Computations. The solvers incorporate many algorithmic variants for subspace expansion and extraction, and cover a wide range of eigenproblems including standard and generalized, Hermitian and non-Hermitian, with either real or complex arithmetic. We provide performance results on a large battery of test problems.</description><subject>Algebra</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Battery</subject><subject>Computation</subject><subject>Computer programs</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Eigenvalues</subject><subject>Exact sciences and technology</subject><subject>Factorization</subject><subject>Information retrieval. Graph</subject><subject>Linear and multilinear algebra, matrix theory</subject><subject>Mathematics</subject><subject>Sciences and techniques of general use</subject><subject>Software</subject><subject>Solvers</subject><subject>Theoretical computing</subject><issn>0098-3500</issn><issn>1557-7295</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNo9kM9LwzAcxYMoOKf4L-QieqkmadM0xzHnD6g42E5eyrfpt7OSNjPpBv73RjY8vXf4vAfvEXLN2T3nmXwQMktznZ-QCZdSJUpoeUomjOkiSSVj5-QihC_GmOCKT8jHjC7Bg7Vo6Wu_tdjjMMLYuYG6lj7CvmtC9G84from0NZ5WoLfYLIyYJEuug0Oe7A7pEvv6hgPtBvoqlwszSU5a8EGvDrqlKyfFuv5S1K-P7_OZ2ViUsHHRHJRQ8s5MlU0omGFEbIQnBU1QtamvECtQUPDRMPzLIpSRpvG5FzpmmE6JXeH2q133zsMY9V3waC1MKDbhSpiqciYyvOI3h5Q410IHttq67se_E_FWfV3XnU8L5I3x1IIcWjrYTBd-MdFIUWmZJ7-AmhmbIg</recordid><startdate>20140201</startdate><enddate>20140201</enddate><creator>ROMERO, Eloy</creator><creator>ROMAN, Jose E</creator><general>Association for Computing Machinery</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20140201</creationdate><title>A Parallel Implementation of Davidson Methods for Large-Scale Eigenvalue Problems in SLEPc</title><author>ROMERO, Eloy ; ROMAN, Jose E</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c321t-512baf11e078d2d08c2582108bea4f318e99a9ad02d164d0277c9cdc6179b0e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algebra</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Battery</topic><topic>Computation</topic><topic>Computer programs</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Eigenvalues</topic><topic>Exact sciences and technology</topic><topic>Factorization</topic><topic>Information retrieval. Graph</topic><topic>Linear and multilinear algebra, matrix theory</topic><topic>Mathematics</topic><topic>Sciences and techniques of general use</topic><topic>Software</topic><topic>Solvers</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>ROMERO, Eloy</creatorcontrib><creatorcontrib>ROMAN, Jose E</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>ACM transactions on mathematical software</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>ROMERO, Eloy</au><au>ROMAN, Jose E</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Parallel Implementation of Davidson Methods for Large-Scale Eigenvalue Problems in SLEPc</atitle><jtitle>ACM transactions on mathematical software</jtitle><date>2014-02-01</date><risdate>2014</risdate><volume>40</volume><issue>2</issue><spage>1</spage><epage>29</epage><pages>1-29</pages><issn>0098-3500</issn><eissn>1557-7295</eissn><coden>ACMSCU</coden><abstract>In the context of large-scale eigenvalue problems, methods of Davidson type such as Jacobi-Davidson can be competitive with respect to other types of algorithms, especially in some particularly difficult situations such as computing interior eigenvalues or when matrix factorization is prohibitive or highly inefficient. However, these types of methods are not generally available in the form of high-quality parallel implementations, especially for the case of non-Hermitian eigenproblems. We present our implementation of various Davidson-type methods in SLEPc, the Scalable Library for Eigenvalue Problem Computations. The solvers incorporate many algorithmic variants for subspace expansion and extraction, and cover a wide range of eigenproblems including standard and generalized, Hermitian and non-Hermitian, with either real or complex arithmetic. We provide performance results on a large battery of test problems.</abstract><cop>New York, NY</cop><pub>Association for Computing Machinery</pub><doi>10.1145/2543696</doi><tpages>29</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0098-3500 |
ispartof | ACM transactions on mathematical software, 2014-02, Vol.40 (2), p.1-29 |
issn | 0098-3500 1557-7295 |
language | eng |
recordid | cdi_proquest_miscellaneous_1793240766 |
source | ACM Digital Library |
subjects | Algebra Algorithms Applied sciences Battery Computation Computer programs Computer science control theory systems Computer systems and distributed systems. User interface Eigenvalues Exact sciences and technology Factorization Information retrieval. Graph Linear and multilinear algebra, matrix theory Mathematics Sciences and techniques of general use Software Solvers Theoretical computing |
title | A Parallel Implementation of Davidson Methods for Large-Scale Eigenvalue Problems in SLEPc |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T20%3A02%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Parallel%20Implementation%20of%20Davidson%20Methods%20for%20Large-Scale%20Eigenvalue%20Problems%20in%20SLEPc&rft.jtitle=ACM%20transactions%20on%20mathematical%20software&rft.au=ROMERO,%20Eloy&rft.date=2014-02-01&rft.volume=40&rft.issue=2&rft.spage=1&rft.epage=29&rft.pages=1-29&rft.issn=0098-3500&rft.eissn=1557-7295&rft.coden=ACMSCU&rft_id=info:doi/10.1145/2543696&rft_dat=%3Cproquest_cross%3E1793240766%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1793240766&rft_id=info:pmid/&rfr_iscdi=true |