An even faster solver for general systems of equations
Identifieur interne : 002D35 ( Main/Merge ); précédent : 002D34; suivant : 002D36An 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.
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 001421
- to stream PascalFrancis, to step Curation: 001571
- to stream PascalFrancis, to step Checkpoint: 001233
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><idno type="wicri:doubleKey">0302-9743:1996:Fecht C:an:even:faster</idno><idno type="wicri:Area/Main/Merge">002D35</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><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/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002D35 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 002D35 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Merge
|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. |  |