Close
Metadata

1. Identity statement
Reference TypeBook Section
Sitemtc-m21b.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier8JMKD3MGP3W34P/3PJ9Q6P
Repositorysid.inpe.br/mtc-m21b/2017/09.05.19.29   (restricted access)
Last Update2017:10.02.11.43.10 (UTC) administrator
Metadata Repositorysid.inpe.br/mtc-m21b/2017/09.05.19.29.18
Metadata Last Update2018:06.04.02.27.49 (UTC) administrator
Secondary KeyINPE--/
DOI10.1007/978-3-319-62392-4_1
ISBN978-331962391-7
Citation KeyOliveiraChagBern:2017:AnReAl
TitleAn analysis of reordering algorithms to reduce the computational cost of the jacobi-preconditioned cg solver using high-precision arithmetic
Year2017
Access Date2024, May 08
Secondary TypePRE LI
Number of Files1
Size485 KiB
2. Context
Author1 Oliveira, Sanderson L. G. de
2 Chagas, Guilherme Oliveira
3 Bernardes, J. Assis B.
Group1
2 CAP-COMP-SESPG-INPE-MCTIC-GOV-BR
Affiliation1
2 Instituto Nacional de Pesquisas Espaciais (INPE)
Author e-Mail Address1 sanderson@dcc.ufla.br
2 guilherme.o.chagas@gmail.com
3 jrassis@posgrad.ufla.br
EditorMurgante, B.
O., Apduhan. B.
Borruso, G.
Stankova, E.
Gervasi, O.
Misra, S.
Taniar, D.
Rocha, A. M. A. C.
Cuzzocrea, A.
Torre, C. M.
Book TitleLecture Notes in Computer Science
PublisherSpringer
Pages3-19
History (UTC)2017-09-05 19:29:26 :: simone -> administrator :: 2017
2017-09-07 10:45:42 :: administrator -> simone :: 2017
2017-10-02 11:43:10 :: simone -> administrator :: 2017
2018-06-04 02:27:49 :: administrator -> simone :: 2017
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Version Typepublisher
KeywordsBandwidth reduction
combinatorial optimization
conjugate gradient method
graph algorithm
graph labeling
heuristics
high-precision arithmetic Ordering Profile reduction Reordering algorithms
sparse matrices
sparse symmetric positive-definite linear systems
AbstractSeveral heuristics for bandwidth and profile reductions have been proposed since the 1960s. In systematic reviews, 133 heuristics applied to these problems have been found. The results of these heuristics have been analyzed so that, among them, 13 were selected in a manner that no simulation or comparison showed that these algorithms could be outperformed by any other algorithm in the publications analyzed, in terms of bandwidth or profile reductions and also considering the computational costs of the heuristics. Therefore, these 13 heuristics were selected as the most promising low-cost methods to solve these problems. Based on this experience, this article reports that in certain cases no heuristic for bandwidth or profile reduction can reduce the computational cost of the Jacobi-preconditioned Conjugate Gradient Method when using high-precision numerical computations.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção pgr ATUAIS > CAP > An analysis of...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 05/09/2017 16:29 1.8 KiB 
4. Conditions of access and use
Languageen
User Groupsimone
Visibilityshown
Read Permissiondeny from all
Update Permissionnot transferred
5. Allied materials
Next Higher Units8JMKD3MGPCW/3F2PHGS
DisseminationBNDEPOSITOLEGAL
Host Collectionsid.inpe.br/mtc-m21b/2013/09.26.14.25.20
6. Notes
Empty Fieldsarchivingpolicy archivist callnumber city copyholder copyright creatorhistory descriptionlevel e-mailaddress edition format issn label lineage mark mirrorrepository nextedition notes numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup resumeid rightsholder schedulinginformation secondarydate secondarymark serieseditor seriestitle session shorttitle sponsor subject targetfile tertiarymark tertiarytype translator url volume
7. Description control
e-Mail (login)simone
update 


Close