An even faster solver for general systems of equations
Identifieur interne : 001233 ( PascalFrancis/Checkpoint ); précédent : 001232; suivant : 001234An even faster solver for general systems of equations
Auteurs : C. Fecht [Allemagne] ; H. Seidl [France]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 1996.
Descripteurs français
- Pascal (Inist)
English descriptors
Abstract
We present a new algorithm which computes a partial approximate solution for a system of equations. It is local in that it considers as few variables as necessary in order to compute the values of those variables we are interested in, it is generic in that it makes no assumptions on the application domain, and it is general in that the algorithm does not depend on any specific properties of right-hand sides of equations. For instance, monotonicity is not required. However, in case the right-hand sides satisfy some weak monotonicity property, our algorithm returns the (uniquely defined) least solution. The algorithm meets the best known theoretical worstcase complexity of similar algorithms. For the application of analyzing logic languages, it also gives the best practical results on most of our real world benchmark programs.
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:97-0022184Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">An even faster solver for general systems of equations</title><author><name sortKey="Fecht, C" sort="Fecht, C" uniqKey="Fecht C" first="C." last="Fecht">C. Fecht</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>Universität des Saarlandes, Postfach 151150</s1><s2>66041 Saarbrücken</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation></author><author><name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>Fachbereich IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Trier</settlement></placeName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">97-0022184</idno><date when="1996">1996</date><idno type="stanalyst">PASCAL 97-0022184 INIST</idno><idno type="RBID">Pascal:97-0022184</idno><idno type="wicri:Area/PascalFrancis/Corpus">001421</idno><idno type="wicri:Area/PascalFrancis/Curation">001571</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">001233</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">001233</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">An even faster solver for general systems of equations</title><author><name sortKey="Fecht, C" sort="Fecht, C" uniqKey="Fecht C" first="C." last="Fecht">C. Fecht</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>Universität des Saarlandes, Postfach 151150</s1><s2>66041 Saarbrücken</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation></author><author><name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>Fachbereich IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Trier</settlement></placeName></affiliation></author></analytic><series><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno><imprint><date when="1996">1996</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm complexity</term><term>Equation system solving</term><term>Fast algorithm</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Algorithme rapide</term><term>Résolution système équation</term><term>Complexité algorithme</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We present a new algorithm which computes a partial approximate solution for a system of equations. It is local in that it considers as few variables as necessary in order to compute the values of those variables we are interested in, it is generic in that it makes no assumptions on the application domain, and it is general in that the algorithm does not depend on any specific properties of right-hand sides of equations. For instance, monotonicity is not required. However, in case the right-hand sides satisfy some weak monotonicity property, our algorithm returns the (uniquely defined) least solution. The algorithm meets the best known theoretical worstcase complexity of similar algorithms. For the application of analyzing logic languages, it also gives the best practical results on most of our real world benchmark programs.</div></front></TEI><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0></fA01><fA05><s2>1145</s2></fA05><fA08 i1="01" i2="1" l="ENG"><s1>An even faster solver for general systems of equations</s1></fA08><fA09 i1="01" i2="1" l="ENG"><s1>Static analysis : Aachen, September 24-26, 1996</s1></fA09><fA11 i1="01" i2="1"><s1>FECHT (C.)</s1></fA11><fA11 i1="02" i2="1"><s1>SEIDL (H.)</s1></fA11><fA12 i1="01" i2="1"><s1>COUSOT (Radhia)</s1><s9>ed.</s9></fA12><fA12 i1="02" i2="1"><s1>SCHMIDT (David A.)</s1><s9>ed.</s9></fA12><fA14 i1="01"><s1>Universität des Saarlandes, Postfach 151150</s1><s2>66041 Saarbrücken</s2><s3>DEU</s3><sZ>1 aut.</sZ></fA14><fA14 i1="02"><s1>Fachbereich IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>FRA</s3><sZ>2 aut.</sZ></fA14><fA20><s1>189-204</s1></fA20><fA21><s1>1996</s1></fA21><fA23 i1="01"><s0>ENG</s0></fA23><fA43 i1="01"><s1>INIST</s1><s2>16343</s2><s5>354000063990760140</s5></fA43><fA44><s0>0000</s0><s1>© 1997 INIST-CNRS. All rights reserved.</s1></fA44><fA45><s0>18 ref.</s0></fA45><fA47 i1="01" i2="1"><s0>97-0022184</s0></fA47><fA60><s1>P</s1><s2>C</s2></fA60><fA61><s0>A</s0></fA61><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0></fA64><fA66 i1="01"><s0>DEU</s0></fA66><fA66 i1="02"><s0>USA</s0></fA66><fC01 i1="01" l="ENG"><s0>We present a new algorithm which computes a partial approximate solution for a system of equations. It is local in that it considers as few variables as necessary in order to compute the values of those variables we are interested in, it is generic in that it makes no assumptions on the application domain, and it is general in that the algorithm does not depend on any specific properties of right-hand sides of equations. For instance, monotonicity is not required. However, in case the right-hand sides satisfy some weak monotonicity property, our algorithm returns the (uniquely defined) least solution. The algorithm meets the best known theoretical worstcase complexity of similar algorithms. For the application of analyzing logic languages, it also gives the best practical results on most of our real world benchmark programs.</s0></fC01><fC02 i1="01" i2="X"><s0>001D02A05</s0></fC02><fC03 i1="01" i2="X" l="FRE"><s0>Algorithme rapide</s0><s5>01</s5></fC03><fC03 i1="01" i2="X" l="ENG"><s0>Fast algorithm</s0><s5>01</s5></fC03><fC03 i1="01" i2="X" l="SPA"><s0>Algoritmo rápido</s0><s5>01</s5></fC03><fC03 i1="02" i2="X" l="FRE"><s0>Résolution système équation</s0><s5>02</s5></fC03><fC03 i1="02" i2="X" l="ENG"><s0>Equation system solving</s0><s5>02</s5></fC03><fC03 i1="02" i2="X" l="SPA"><s0>Resolución sistema ecuación</s0><s5>02</s5></fC03><fC03 i1="03" i2="X" l="FRE"><s0>Complexité algorithme</s0><s5>03</s5></fC03><fC03 i1="03" i2="X" l="ENG"><s0>Algorithm complexity</s0><s5>03</s5></fC03><fC03 i1="03" i2="X" l="SPA"><s0>Complejidad algoritmo</s0><s5>03</s5></fC03><fN21><s1>006</s1></fN21></pA><pR><fA30 i1="01" i2="1" l="ENG"><s1>SAS '96 : international symposium on statis analysis</s1><s2>3</s2><s3>Aachen DEU</s3><s4>1996-09-24</s4></fA30></pR></standard></inist><affiliations><list><country><li>Allemagne</li><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li><li>Sarre (Land)</li></region><settlement><li>Sarrebruck</li><li>Trier</li></settlement></list><tree><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Fecht, C" sort="Fecht, C" uniqKey="Fecht C" first="C." last="Fecht">C. Fecht</name></region></country><country name="France"><region name="Grand Est"><name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001233 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 001233 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= PascalFrancis
|étape= Checkpoint
|type= RBID
|clé= Pascal:97-0022184
|texte= An even faster solver for general systems of equations
}}
| This area was generated with Dilib version V0.6.31. |  |