Improved permutation in sparse matrix reduction (computer-aided circuit analysis)

Improved permutation in sparse matrix reduction (computer-aided circuit analysis)

The problem of sparse matrix permutation, which is an essential part of the sparse matrix reduction (SMR) method, is discussed. SMR is an efficient method for reducing large sparse equation sets occurring in computer-aided circuit analysis. By permutation of the set of circuit equations, the variabl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bratkovic, F., Tuma, T.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Ambient intelligence
Circuit analysis computing
Equations
Sparse matrices
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 57 vol.1
container_issue
container_start_page 54
container_title
container_volume
creator Bratkovic, F.
Tuma, T.
description The problem of sparse matrix permutation, which is an essential part of the sparse matrix reduction (SMR) method, is discussed. SMR is an efficient method for reducing large sparse equation sets occurring in computer-aided circuit analysis. By permutation of the set of circuit equations, the variable vector is divided into a subvector of dependent variables and a much smaller subvector of independent variables. The permutation method is a carefully balanced trade-off between the minimal number of independent variables and the permutation execution time.< >
doi_str_mv 10.1109/MELCON.1991.161777
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_161777</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>161777</ieee_id><sourcerecordid>161777</sourcerecordid><originalsourceid>FETCH-LOGICAL-i104t-6f3c1d2d595f9a9d7b8336e848d5e5129d31ee35bcb8eb160c42ad334c5c4fcd3</originalsourceid><addsrcrecordid>eNotj01LAzEURQMiqLV_oKssdTFj3iSZSZYyVC2MlkJdl0zyBiKdD5KM2H9vsd7NXRzugUvIClgOwPTT-7qptx85aA05lFBV1RW5Y6rSoiilhBuyjPGLnSMkgFS3ZLfppzB-o6MThn5OJvlxoH6gcTIhIu1NCv6HBnSz_UMPduynOWHIjHfnmfXBzj5RM5jjKfr4eE-uO3OMuPzvBfl8We_rt6zZvm7q5ybzwETKyo5bcIWTWnbaaFe1ivMSlVBOooRCOw6IXLa2VdhCyawojONcWGlFZx1fkNXF6xHxMAXfm3A6XE7zX4WUT28</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Improved permutation in sparse matrix reduction (computer-aided circuit analysis)</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Bratkovic, F. ; Tuma, T.</creator><creatorcontrib>Bratkovic, F. ; Tuma, T.</creatorcontrib><description>The problem of sparse matrix permutation, which is an essential part of the sparse matrix reduction (SMR) method, is discussed. SMR is an efficient method for reducing large sparse equation sets occurring in computer-aided circuit analysis. By permutation of the set of circuit equations, the variable vector is divided into a subvector of dependent variables and a much smaller subvector of independent variables. The permutation method is a carefully balanced trade-off between the minimal number of independent variables and the permutation execution time.&lt; &gt;</description><identifier>ISBN: 0879426551</identifier><identifier>ISBN: 9780879426552</identifier><identifier>DOI: 10.1109/MELCON.1991.161777</identifier><language>eng</language><publisher>IEEE</publisher><subject>Ambient intelligence ; Circuit analysis computing ; Equations ; Sparse matrices</subject><ispartof>[1991 Proceedings] 6th Mediterranean Electrotechnical Conference, 1991, p.54-57 vol.1</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/161777$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/161777$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bratkovic, F.</creatorcontrib><creatorcontrib>Tuma, T.</creatorcontrib><title>Improved permutation in sparse matrix reduction (computer-aided circuit analysis)</title><title>[1991 Proceedings] 6th Mediterranean Electrotechnical Conference</title><addtitle>MELCON</addtitle><description>The problem of sparse matrix permutation, which is an essential part of the sparse matrix reduction (SMR) method, is discussed. SMR is an efficient method for reducing large sparse equation sets occurring in computer-aided circuit analysis. By permutation of the set of circuit equations, the variable vector is divided into a subvector of dependent variables and a much smaller subvector of independent variables. The permutation method is a carefully balanced trade-off between the minimal number of independent variables and the permutation execution time.&lt; &gt;</description><subject>Ambient intelligence</subject><subject>Circuit analysis computing</subject><subject>Equations</subject><subject>Sparse matrices</subject><isbn>0879426551</isbn><isbn>9780879426552</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1991</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj01LAzEURQMiqLV_oKssdTFj3iSZSZYyVC2MlkJdl0zyBiKdD5KM2H9vsd7NXRzugUvIClgOwPTT-7qptx85aA05lFBV1RW5Y6rSoiilhBuyjPGLnSMkgFS3ZLfppzB-o6MThn5OJvlxoH6gcTIhIu1NCv6HBnSz_UMPduynOWHIjHfnmfXBzj5RM5jjKfr4eE-uO3OMuPzvBfl8We_rt6zZvm7q5ybzwETKyo5bcIWTWnbaaFe1ivMSlVBOooRCOw6IXLa2VdhCyawojONcWGlFZx1fkNXF6xHxMAXfm3A6XE7zX4WUT28</recordid><startdate>1991</startdate><enddate>1991</enddate><creator>Bratkovic, F.</creator><creator>Tuma, T.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1991</creationdate><title>Improved permutation in sparse matrix reduction (computer-aided circuit analysis)</title><author>Bratkovic, F. ; Tuma, T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i104t-6f3c1d2d595f9a9d7b8336e848d5e5129d31ee35bcb8eb160c42ad334c5c4fcd3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1991</creationdate><topic>Ambient intelligence</topic><topic>Circuit analysis computing</topic><topic>Equations</topic><topic>Sparse matrices</topic><toplevel>online_resources</toplevel><creatorcontrib>Bratkovic, F.</creatorcontrib><creatorcontrib>Tuma, T.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bratkovic, F.</au><au>Tuma, T.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Improved permutation in sparse matrix reduction (computer-aided circuit analysis)</atitle><btitle>[1991 Proceedings] 6th Mediterranean Electrotechnical Conference</btitle><stitle>MELCON</stitle><date>1991</date><risdate>1991</risdate><spage>54</spage><epage>57 vol.1</epage><pages>54-57 vol.1</pages><isbn>0879426551</isbn><isbn>9780879426552</isbn><abstract>The problem of sparse matrix permutation, which is an essential part of the sparse matrix reduction (SMR) method, is discussed. SMR is an efficient method for reducing large sparse equation sets occurring in computer-aided circuit analysis. By permutation of the set of circuit equations, the variable vector is divided into a subvector of dependent variables and a much smaller subvector of independent variables. The permutation method is a carefully balanced trade-off between the minimal number of independent variables and the permutation execution time.&lt; &gt;</abstract><pub>IEEE</pub><doi>10.1109/MELCON.1991.161777</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0879426551
ispartof [1991 Proceedings] 6th Mediterranean Electrotechnical Conference, 1991, p.54-57 vol.1
issn
language eng
recordid cdi_ieee_primary_161777
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Ambient intelligence
Circuit analysis computing
Equations
Sparse matrices
title Improved permutation in sparse matrix reduction (computer-aided circuit analysis)
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T01%3A16%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Improved%20permutation%20in%20sparse%20matrix%20reduction%20(computer-aided%20circuit%20analysis)&rft.btitle=%5B1991%20Proceedings%5D%206th%20Mediterranean%20Electrotechnical%20Conference&rft.au=Bratkovic,%20F.&rft.date=1991&rft.spage=54&rft.epage=57%20vol.1&rft.pages=54-57%20vol.1&rft.isbn=0879426551&rft.isbn_list=9780879426552&rft_id=info:doi/10.1109/MELCON.1991.161777&rft_dat=%3Cieee_6IE%3E161777%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=161777&rfr_iscdi=true