The multi-label classification problem has generated significant interest in
cent years. However, existing approaches do not adequately address two key
allenges: (a) the ability to tackle problems with a large number (say
llions) of labels, and (b) the ability to handle data with missing labels. In
is paper, we directly address both these problems by studying the multi-label
oblem in a generic empirical risk minimization (ERM) framework. Our
amework, despite being simple, is surprisingly able to encompass several
cent label-compression based methods which can be derived as special cases of
r method. To optimize the ERM problem, we develop techniques that exploit the
ructure of specific loss functions - such as the squared loss function - to
fer efficient algorithms. We further show that our learning framework admits
rmal excess risk bounds even in the presence of missing labels. Our risk
unds are tight and demonstrate better generalization performance for low-rank
omoting trace-norm regularization when compared to (rank insensitive)
obenius norm regularization. Finally, we present extensive empirical results
a variety of benchmark datasets and show that our methods perform
gnificantly better than existing label compression based methods and can
ale up to very large datasets such as the Wikipedia dataset.

@misc{yu2013largescale, author = {Yu, Hsiang-Fu and Jain, Prateek and Kar, Purushottam and Dhillon, Inderjit S.}, title = {Large-scale Multi-label Learning with Missing Labels}, year = {2013}, note = {cite arxiv:1307.5101}, url = {http://arxiv.org/abs/1307.5101}, keywords = {classification, kallimachos, label, large, learning, multi}, abstract = {The multi-label classification problem has generated significant interest in
cent years. However, existing approaches do not adequately address two key
allenges: (a) the ability to tackle problems with a large number (say
llions) of labels, and (b) the ability to handle data with missing labels. In
is paper, we directly address both these problems by studying the multi-label
oblem in a generic empirical risk minimization (ERM) framework. Our
amework, despite being simple, is surprisingly able to encompass several
cent label-compression based methods which can be derived as special cases of
r method. To optimize the ERM problem, we develop techniques that exploit the
ructure of specific loss functions - such as the squared loss function - to
fer efficient algorithms. We further show that our learning framework admits
rmal excess risk bounds even in the presence of missing labels. Our risk
unds are tight and demonstrate better generalization performance for low-rank
omoting trace-norm regularization when compared to (rank insensitive)
obenius norm regularization. Finally, we present extensive empirical results
a variety of benchmark datasets and show that our methods perform
gnificantly better than existing label compression based methods and can
ale up to very large datasets such as the Wikipedia dataset.} }

%0 = misc %A = Yu, Hsiang-Fu and Jain, Prateek and Kar, Purushottam and Dhillon, Inderjit S. %D = 2013 %T = Large-scale Multi-label Learning with Missing Labels %U = http://arxiv.org/abs/1307.5101

Phylogenetic relationships of resupinate Homobasidiomycetes (Corticiaceae s. lat. and others) were studied using ribosomal DNA (rDNA) sequences from a broad sample of resupinate and nonresupinate taxa. Two datasets were analysed using parsimony, a'core'dataset of 142 species, each of which is represented by four rDNA regions (mitochondrial and nuclear large and small subunits), and a 'full' clataset of 656 species, most of which were represented only by nuclear large subunit rDNA sequences. Both datasets were analysed using traditional heuristic methods with bootstrapping, and the full clataset was also analysed with the Parsimony Ratchet, using equal character weights and six-parameter weighted parsimony. Analyses of both datasets supported monophyly of the eight major clades of Homobasicliomycetes recognised by Hibbett and Thorn, as well as independent lineages corresponding to the Gloeophyllum clade, corticioid clade and jaapia argillacea. Analyses of the full clataset resolved two additional groups, the athelioid clade and trechisporoid clade (the latter may be nested in the polyporoid clade). Thus, there are at least 12 independent clades of Homobasicliomycetes. Higher-level relationships among the major clades are not resolved with confidence. Nevertheless, the euagarics clade, bolete clade, athelioid clade and jaapia argillacea are consistently resolved as a monophyletic group, whereas the cantharelloid clade, gomphoid-phalloid clade and hymenochaetoid clade are placed at the base of the Homobasidiomycetes, which is consistent with the preponderance of imperforate parenthesomes in those groups. Resupinate forms occur in each of the major clades of Homobasidiomycetes, some of which are composed mostly or exclusively of resupinate forms (athelioid clade, corticioid clade, trechisporoid clade,jaapia). The largest concentrations of resupinate forms occur in the polyporoid clade, russuloid clade and hymenochaetoid clade. The cantharelloid clade also includes many resupinate forms, including some that have traditionally been regarded as heterobasidiomycetes (Sebacinaceae, Tulasnellates, Ceratobasidiales). The euagarics clade, which is by far the largest clade in the Homobasidiomycetes, has the smallest fraction of resupinate species. Results of the present study are compared with recent phylogenetic analyses, and a table summarising the phylogenetic distribution of resupinate taxa is presented, as well as notes on the ecology of resupinate forms and related Homobasidiomycetes.

@article{binder2005phylogenetic, author = {Binder, M. and Hibbett, D. S. and Larsson, K. H. and Larsson, E. and Langer, E. and Langer, G.}, title = {The phylogenetic distribution of resupinate forms across the major clades of mushroom-forming fungi (Homobasidiomycetes)}, journal = {Systematics and Biodiversity}, year = {2005}, volume = {3}, number = {2}, pages = {113-157}, url = {/brokenurl#<Go to ISI>://000231684600001}, keywords = {DNA-sequences, community, corticiaceae, corticioid, ectomycorrhizal, fungi, heterobasidiomycetes, large, mycobionts, nuclear, parsimony, piriformospora-indica, polyporaceae, ratchet, rdna, ribosomal, sebacinoid, septal, sequences, significance, status, structure, subunit, systematics, taxonomic, taxonomy, tylospora-fibrillosa, ultrastructure}, abstract = {Phylogenetic relationships of resupinate Homobasidiomycetes (Corticiaceae s. lat. and others) were studied using ribosomal DNA (rDNA) sequences from a broad sample of resupinate and nonresupinate taxa. Two datasets were analysed using parsimony, a'core'dataset of 142 species, each of which is represented by four rDNA regions (mitochondrial and nuclear large and small subunits), and a 'full' clataset of 656 species, most of which were represented only by nuclear large subunit rDNA sequences. Both datasets were analysed using traditional heuristic methods with bootstrapping, and the full clataset was also analysed with the Parsimony Ratchet, using equal character weights and six-parameter weighted parsimony. Analyses of both datasets supported monophyly of the eight major clades of Homobasicliomycetes recognised by Hibbett and Thorn, as well as independent lineages corresponding to the Gloeophyllum clade, corticioid clade and jaapia argillacea. Analyses of the full clataset resolved two additional groups, the athelioid clade and trechisporoid clade (the latter may be nested in the polyporoid clade). Thus, there are at least 12 independent clades of Homobasicliomycetes. Higher-level relationships among the major clades are not resolved with confidence. Nevertheless, the euagarics clade, bolete clade, athelioid clade and jaapia argillacea are consistently resolved as a monophyletic group, whereas the cantharelloid clade, gomphoid-phalloid clade and hymenochaetoid clade are placed at the base of the Homobasidiomycetes, which is consistent with the preponderance of imperforate parenthesomes in those groups. Resupinate forms occur in each of the major clades of Homobasidiomycetes, some of which are composed mostly or exclusively of resupinate forms (athelioid clade, corticioid clade, trechisporoid clade,jaapia). The largest concentrations of resupinate forms occur in the polyporoid clade, russuloid clade and hymenochaetoid clade. The cantharelloid clade also includes many resupinate forms, including some that have traditionally been regarded as heterobasidiomycetes (Sebacinaceae, Tulasnellates, Ceratobasidiales). The euagarics clade, which is by far the largest clade in the Homobasidiomycetes, has the smallest fraction of resupinate species. Results of the present study are compared with recent phylogenetic analyses, and a table summarising the phylogenetic distribution of resupinate taxa is presented, as well as notes on the ecology of resupinate forms and related Homobasidiomycetes.} }

%0 = article %A = Binder, M. and Hibbett, D. S. and Larsson, K. H. and Larsson, E. and Langer, E. and Langer, G. %D = 2005 %T = The phylogenetic distribution of resupinate forms across the major clades of mushroom-forming fungi (Homobasidiomycetes) %U = /brokenurl#<Go to ISI>://000231684600001

@article{clauset-2004-70, author = {Clauset, Aaron and Newman, M. E. J. and Moore, Cristopher}, title = {Finding community structure in very large networks}, journal = {Physical Review E}, year = {2004}, volume = {70}, pages = {066111}, url = {http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0408187}, keywords = {clustering, community, large, networks, toread} }

%0 = article %A = Clauset, Aaron and Newman, M. E. J. and Moore, Cristopher %D = 2004 %T = Finding community structure in very large networks %U = http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0408187

@article{clauset-2004-70, author = {Clauset, Aaron and Newman, M.E.J. and Moore, Cristopher}, title = {Finding community structure in very large networks}, journal = {Physical Review E}, year = {2004}, volume = {70}, pages = {066111}, url = {http://www.citebase.org/cgi-bin/citations?id=oai:arXiv.org:cond-mat/0408187}, keywords = {community, detection, gn, large, network, newman, structure} }

%0 = article %A = Clauset, Aaron and Newman, M.E.J. and Moore, Cristopher %D = 2004 %T = Finding community structure in very large networks %U = http://www.citebase.org/cgi-bin/citations?id=oai:arXiv.org:cond-mat/0408187

The discovery and analysis of community structure in networks is a topic of
nsiderable recent interest within the physics community, but most methods
oposed so far are unsuitable for very large networks because of their
mputational cost. Here we present a hierarchical agglomeration algorithm for
tecting community structure which is faster than many competing algorithms:
s running time on a network with n vertices and m edges is O(m d log n) where
is the depth of the dendrogram describing the community structure. Many
al-world networks are sparse and hierarchical, with m ~ n and d ~ log n, in
ich case our algorithm runs in essentially linear time, O(n log^2 n). As an
ample of the application of this algorithm we use it to analyze a network of
ems for sale on the web-site of a large online retailer, items in the network
ing linked if they are frequently purchased by the same buyer. The network
s more than 400,000 vertices and 2 million edges. We show that our algorithm
n extract meaningful communities from this network, revealing large-scale
tterns present in the purchasing habits of customers.

@misc{citeulike:95936, author = {Clauset, Aaron and Newman, M. E. J. and Moore, Cristopher}, title = {Finding community structure in very large networks}, year = {2004}, url = {http://arxiv.org/abs/cond-mat/0408187}, keywords = {clustering, large, network, community}, abstract = {The discovery and analysis of community structure in networks is a topic of
nsiderable recent interest within the physics community, but most methods
oposed so far are unsuitable for very large networks because of their
mputational cost. Here we present a hierarchical agglomeration algorithm for
tecting community structure which is faster than many competing algorithms:
s running time on a network with n vertices and m edges is O(m d log n) where
is the depth of the dendrogram describing the community structure. Many
al-world networks are sparse and hierarchical, with m ~ n and d ~ log n, in
ich case our algorithm runs in essentially linear time, O(n log^2 n). As an
ample of the application of this algorithm we use it to analyze a network of
ems for sale on the web-site of a large online retailer, items in the network
ing linked if they are frequently purchased by the same buyer. The network
s more than 400,000 vertices and 2 million edges. We show that our algorithm
n extract meaningful communities from this network, revealing large-scale
tterns present in the purchasing habits of customers.} }

%0 = misc %A = Clauset, Aaron and Newman, M. E. J. and Moore, Cristopher %D = 2004 %T = Finding community structure in very large networks %U = http://arxiv.org/abs/cond-mat/0408187

@inproceedings{kubicaKgroups, author = {Kubica, Jeremy and Moore, Andrew and Schneider, Jeff}, title = {Tractable Group Detection on Large Link Data Sets}, editor = {Wu, Xindong and Tuzhilin, Alex and Shavlik, Jude}, booktitle = {The Third IEEE International Conference on Data Mining}, publisher = {IEEE Computer Society}, year = {2003}, pages = {573-576}, keywords = {large, detection, community, network, gda} }

%0 = inproceedings %A = Kubica, Jeremy and Moore, Andrew and Schneider, Jeff %B = The Third IEEE International Conference on Data Mining %D = 2003 %I = IEEE Computer Society %T = Tractable Group Detection on Large Link Data Sets

Discovering underlying structure from co-occurrence data is an important task in many fields, including: insurance, intelligence, criminal investigation, epidemiology, human resources, and marketing. For example a store may wish to identify underlying sets of items purchased together or a human resources department may wish to identify groups of employees that collaborate with each other.
Previously Kubica et. al. presented the group detection algorithm (GDA) - an algorithm for finding underlying groupings of entities from co-occurrence data. This algorithm is based on a probabilistic generative model and produces coherent groups that are consistent with prior knowledge. Unfortunately, the optimization used in GDA is slow, making it potentially infeasible for many real world data sets.
To this end, we present k-groups - an algorithm that uses an approach similar to that of k-means (hard clustering and localized updates) to significantly accelerate the discovery of the underlying groups while retaining GDA's probabilistic model. In addition, we show that k-groups is guaranteed to converge to a local minimum. We also compare the performance of GDA and k-groups on several real world and artificial data sets, showing that k-groups' sacrifice in solution quality is significantly offset by its increase in speed. This trade-off makes group detection tractable on significantly larger data sets.

@techreport{Kubica_2003_4489, author = {Kubica, Jeremy Martin and Moore, Andrew and Schneider, Jeff}, title = {K-groups: Tractable Group Detection on Large Link Data Sets}, address = {Pittsburgh, PA}, year = {2003}, number = {CMU-RI-TR-03-32}, url = {http://www.ri.cmu.edu/pubs/pub_4489.html}, keywords = {large, detection, gda, network, community}, abstract = {Discovering underlying structure from co-occurrence data is an important task in many fields, including: insurance, intelligence, criminal investigation, epidemiology, human resources, and marketing. For example a store may wish to identify underlying sets of items purchased together or a human resources department may wish to identify groups of employees that collaborate with each other.
Previously Kubica et. al. presented the group detection algorithm (GDA) - an algorithm for finding underlying groupings of entities from co-occurrence data. This algorithm is based on a probabilistic generative model and produces coherent groups that are consistent with prior knowledge. Unfortunately, the optimization used in GDA is slow, making it potentially infeasible for many real world data sets.
To this end, we present k-groups - an algorithm that uses an approach similar to that of k-means (hard clustering and localized updates) to significantly accelerate the discovery of the underlying groups while retaining GDA's probabilistic model. In addition, we show that k-groups is guaranteed to converge to a local minimum. We also compare the performance of GDA and k-groups on several real world and artificial data sets, showing that k-groups' sacrifice in solution quality is significantly offset by its increase in speed. This trade-off makes group detection tractable on significantly larger data sets.} }

%0 = techreport %A = Kubica, Jeremy Martin and Moore, Andrew and Schneider, Jeff %C = Pittsburgh, PA %D = 2003 %T = K-groups: Tractable Group Detection on Large Link Data Sets %U = http://www.ri.cmu.edu/pubs/pub_4489.html

@book{cullum2002lanczos, author = {Cullum, J.K. and Willoughby, R.A.}, title = {Lanczos algorithms for large symmetric eigenvalue computations: Theory}, publisher = {Society for Industrial Mathematics}, year = {2002}, url = {http://scholar.google.de/scholar.bib?q=info:zshJq2GVHO8J:scholar.google.com/&output=citation&hl=de&ct=citation&cd=0}, keywords = {algorithms, eigenvalue, large, symmetric} }

%0 = book %A = Cullum, J.K. and Willoughby, R.A. %D = 2002 %I = Society for Industrial Mathematics %T = Lanczos algorithms for large symmetric eigenvalue computations: Theory %U = http://scholar.google.de/scholar.bib?q=info:zshJq2GVHO8J:scholar.google.com/&output=citation&hl=de&ct=citation&cd=0

@inproceedings{conf/sigmod/WangWYY02, author = {Wang, Haixun and 0010, Wei Wang and Yang, Jiong and Yu, Philip S.}, title = {Clustering by pattern similarity in large data sets.}, editor = {Franklin, Michael J. and Moon, Bongki and Ailamaki, Anastassia}, booktitle = {SIGMOD Conference}, publisher = {ACM}, year = {2002}, pages = {394-405}, url = {http://dblp.uni-trier.de/db/conf/sigmod/sigmod2002.html#WangWYY02}, isbn = {1-58113-497-5}, keywords = {algorithm, clustering, data, fca?, large, pClusters, paper, pattern} }

%0 = inproceedings %A = Wang, Haixun and 0010, Wei Wang and Yang, Jiong and Yu, Philip S. %B = SIGMOD Conference %D = 2002 %I = ACM %T = Clustering by pattern similarity in large data sets. %U = http://dblp.uni-trier.de/db/conf/sigmod/sigmod2002.html#WangWYY02

@inproceedings{Ho98, author = {Hovy, E.H.}, title = {Combining and Standardizing Large-Scale, Practical Ontologies for Machine Translation and Other Uses}, booktitle = {Proc. 1st Intl. Conf. on Language Resources and Evaluation (LREC)}, address = {Granada}, year = {1998}, url = {http://www.isi.edu/natural-language/people/hovy/publications.html}, isbn = {3-540-41066-X}, keywords = {ontology, large, scale, application, practical} }

%0 = inproceedings %A = Hovy, E.H. %B = Proc. 1st Intl. Conf. on Language Resources and Evaluation (LREC) %C = Granada %D = 1998 %T = Combining and Standardizing Large-Scale, Practical Ontologies for Machine Translation and Other Uses %U = http://www.isi.edu/natural-language/people/hovy/publications.html

@inproceedings{zhang96birch, author = {Zhang, Tian and Ramakrishnan, Raghu and Livny, Miron}, title = {BIRCH: an efficient data clustering method for very large databases}, booktitle = {Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data (SIGMOD'96)}, year = {1996}, pages = {103--114}, url = {http://citeseer.ist.psu.edu/zhang96birch.html}, keywords = {birch, clustering, database, large, tree} }

%0 = inproceedings %A = Zhang, Tian and Ramakrishnan, Raghu and Livny, Miron %B = Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data (SIGMOD'96) %D = 1996 %T = BIRCH: an efficient data clustering method for very large databases %U = http://citeseer.ist.psu.edu/zhang96birch.html

@article{berry1993svdpackc, author = {Berry, M. and Do, T. and O’Brien, G. and Krishna, V. and Varadhan, S.}, title = {SVDPACKC (version 1.0) user's guide}, journal = {University of Tennessee}, publisher = {Citeseer}, year = {1993}, url = {http://scholar.google.de/scholar.bib?q=info:Y2fs0GQQ_LIJ:scholar.google.com/&output=citation&hl=de&ct=citation&cd=0}, keywords = {large, lib, scale, sparse, svd} }

%0 = article %A = Berry, M. and Do, T. and O’Brien, G. and Krishna, V. and Varadhan, S. %D = 1993 %I = Citeseer %T = SVDPACKC (version 1.0) user's guide %U = http://scholar.google.de/scholar.bib?q=info:Y2fs0GQQ_LIJ:scholar.google.com/&output=citation&hl=de&ct=citation&cd=0

<style>
ote-header-text font-family: Times, Times New Roman, serif;
color:#ff0000; font-size: .95em;
margin-left: .75em; margin-right: .75em;
style>






























































































DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
tml xmlns="http://www.w3.org/1999/xhtml" lang="en" xml:lang="en">
ead>
INK REL=STYLESHEET TYPE="text/css" HREF="css/dl.css">

itle>Algorithms for sparse Gaussian elimination with partial pivoting</title>
tyle type="text/css"><!-
body margin-left: 0em; margin-top: 0
a:link text-decoration: underline; Color: #006699;
a:visited color: #990033; text-decoration: underline;
a:hover color: red; text-decoration: none
a.dLink1:link color:#336699
a.dLink1:visited color:#666666
.isblack:link text-decoration: underline; Color: #000000;
a.isblack:visited color: #000000; text-decoration: underline;
a.isblack:hover color: #000000; text-decoration: none
h1 font-size: 140%; margin-bottom: 0
l margin-top: .25em; list-style-type: disc
l margin-top: .25em;
i padding-bottom: .25em
h2 color: white; background-color: #069;
font-size: 100%; padding-left: 1em;
margin: 0
3 color: black; background-color: yellow;
font-size: 100%;
margin: 0
h4 color: black; background-color: #99c5e8;
font-size: 100%;
margin: 0
hr color: #39176d;
form margin-top: 10
form.xrs margin-top: 0

text-decoration: none;

nput font-size: 1em;
chevron color: #ff0000;
light-blue color:#336699;
black color:#000000;

* ### standard text styles, smallest to largest ### */

footer-link-text font-family: Arial, Helvetica, sans-serif;
color:#336699; font-size: .75em; line-height: 1.33em;
text-indent: -.75 em; margin-left: 2em; margin-right: .75em;

footer-copy-text font-family: Arial, Helvetica, sans-serif;
color:#000000; font-size: .75em; line-height: 1.3em;
margin-left: .75em; margin-right: .75em;

small-link-text font-family: Arial, Helvetica, sans-serif;
color:#000000; font-size: .83em; padding-bottom : 2px;
padding-top : 2px;
.smallerer-text font-family: Arial, Helvetica, sans-serif;
color:#000000; font-size: .65em;
smaller-text font-family: Arial, Helvetica, sans-serif;
color:#000000; font-size: .75em;
small-text font-family: Arial, Helvetica, sans-serif;
color:#000000; font-size: .83em;
small-textb font-family: Arial, Helvetica, sans-serif;
color:#000000; font-size: .83em; font-weight: bold;
medium-text font-family: Arial, Helvetica, sans-serif;
color:#000000; font-size: 1em;
mediumb-text font-family: Arial, Helvetica, sans-serif;
color:#000000; font-size: 1em; font-weight: bold;
large-text font-family: Arial, Helvetica, sans-serif;
color:#000000; font-size: 1.3em;
instr-text font-family: Arial, Helvetica, sans-serif;
color:#666666; font-size: .83em;

list-link-text font-family: Arial, Helvetica, sans-serif;
color:#336699; font-size: .83em; line-height: 1.3em;
list-link-btext font-family: Arial, Helvetica, sans-serif;
color:#000000; font-size: .83em; line-height: 1.3em;

searchbox-text font-family: Arial, Helvetica, sans-serif;
color:#000066; font-size: 1em; font-weight: bold;
footer-header-text font-family: Arial, Helvetica, sans-serif;
color:#000066; font-size: 1em; font-weight: bold;
margin-left: .75em; margin-right: .75em;
medium-link-text font-family: Arial, Helvetica, sans-serif;
color:#000066; font-size: 1em; font-weight: bold; line-height: 1em;
text-indent: -1.25em; margin-left: 2em; margin-right: .75em;


small-copy-text font-family: Times, Times New Roman, serif;
color:#000066; font-size: .75em; line-height: 1.2em;
margin-left: .75em; margin-right: .75em;
.medium-copy-text font-family: Times, Times New Roman, serif;
color:#000066; font-size: 1em; line-height: 1.2em;
margin-left: .75em; margin-right: .75em;

large-copy-text font-family: Times, Times New Roman, serif;
color:#000066; font-size: 1.3em; line-height: 1.5em;
margin-left: .75em; margin-right: .75em;

medium-header-text font-family: Times, Times New Roman, serif;
color:#ff0000; font-size: 1em;
margin-left: .75em; margin-right: .75em;

large-header-text font-family: Times, Times New Roman, serif;
color:#ff0000; font-size: 1.5em;
margin-left: .75em; margin-right: .75em;
#side
width: 10px;
float: left;
margin-left: -1px;
padding: 2px;


#content
padding: 2px;
margin-left: 25px;



-></style>

CRIPT LANGUAGE="JavaScript">
* <!- Begin
f(document.layers || document.all)
= 1;
etInterval("Jump()", 10);

unction Jump()
= a + 1;
/self.moveBy((Math.random() * a * 2 - a), (Math.random() * a * 2) - a);

End -> */
script>









































</head>
<body bgcolor="#ffffff" onload="window.focus(); ">
iv align="center">
name="CIT"></a>
able border="0" width="85%" cellspacing="0" cellpadding="0">
r>
d>
























able border="0" width="100%" cellspacing="0" cellpadding="0">
tr valign="top">
<td width="1%" class="small-link-text" align="center" background="http://portal.acm.org/images/horiz-bar.jpg"><img src="http://portal.acm.org/images/logo_acm_portal2.jpg" alt="ACM Portal" width="263" height="54" border="0" usemap="#PORT">

<font color="white">

HeBIS:&nbsp;Universitaetsbibliothek Kassel

</font>

</td>
<td width="99%" align="left" class="small-link-text">
<table border="0" cellspacing="0" cellpadding="0">
<tr>
<td>&nbsp;</td>

<td class="small-link-text"><a href="https://campus.acm.org/Public/login_genpubqj.cfm?rdr=http://portal.acm.org/citation.cfm?id=356494&promo=QJPUB&offering=200&form_type=PUB&CFID=47830777&CFTOKEN=85586443" class="small-link-text">Subscribe</a><span class="small-link-text">&nbsp;(Full Service)</span>&nbsp;&nbsp;&nbsp;</td>
<td class="small-link-text"><a href="https://portal.acm.org/poplogin.cfm?dl=GUIDE&coll=GUIDE&want_href=citation%2Ecfm%3Fid%3D356494%26CFID%3D47830777%26CFTOKEN%3D85586443&CFID=47830777&CFTOKEN=85586443" class="small-link-text">Register</a><span class="small-link-text">&nbsp;(Limited Service, <font color="Red">Free</font>)</span>&nbsp;&nbsp;&nbsp;</td>

<td class="small-link-text" valign="bot">


<a href="https://portal.acm.org/poplogin.cfm?dl=GUIDE&coll=GUIDE&want_href=citation%2Ecfm%3Fid%3D356494%26CFID%3D47830777%26CFTOKEN%3D85586443&CFID=47830777&CFTOKEN=85586443" class="small-link-text">Login</a>

</td>
</tr>
</table>



<table border="0" width="100%" cellspacing="0" cellpadding="0">





<form name="qiksearch" action="results.cfm?coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" method="post">
<tr>
<td height="5"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td>
</tr>
<input type="hidden" name="parser" value="Internet">
<tr>
<td class="small-link-text">&nbsp;</td>
<td class="small-link-text">





<b>Search:</b>&nbsp;&nbsp;&nbsp;<input type="Radio" name="whichDL" value="acm" >The ACM Digital Library&nbsp;&nbsp;&nbsp;<input type="Radio" name="whichDL" value="guide" checked>The Guide

<br><input class="pubdescr" type="Text" name="query" size="60" value=" ">&nbsp;&nbsp;
<input type="Image" alt="Search" name=Go src="http://portal.acm.org/images/search_small.jpg" border="0">
cript type="text/javascript" src="js/wz_tooltip/wz_tooltip.js"></script>

</td>
</tr>
</form>

</table>

</td>
!- top nav END ->
/tr>
/table>

<table border="0" cellspacing="0" cellpadding="0">
tr>
<td height="12"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td>
/tr>
/table>
<map name="PORT" >
<area shape="rect" coords="1,1,55,60" href="http://www.acm.org/" alt="ACM Home Page">
<area shape="rect" coords="65,1,300,78" href="portal.cfm?coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443">
map>

<table border="0" width="100%" align="left">
col width="40%">
col width="60%">
tr>
<td>

<a href="guide.cfm?coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443"><img src="http://portal.acm.org/images/acm_guide_bar_large2.jpg" width=350 height=25 alt="" border="0"></a>

</td>
<td class="small-text" align="center">
<img src="http://portal.acm.org/images/feedback.gif" width="20" height="19" alt="Please provide us with feedback." border="0">&nbsp;<a href="feedback.cfm?CFID=47830777&CFTOKEN=85586443">Feedback</a>
</td>
/tr>
tr>
<td height="6"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td>
/tr>
table>
td>
tr>




r>
td colspan="3" valign="top" height="1" background="http://portal.acm.org/images/horiz-bar-long.jpg"></td>
tr>


<tr>
d class="small-text">
table border="0" width="100%" cellpadding="2">
<col width="1%">
<col width="8%">
<col width="91%">
tr>
<td class="medium-text" colspan="3"><strong>Algorithms for sparse Gaussian elimination with partial pivoting</strong></td>
/tr>


<tr valign="middle">


</tr>

<tr valign="top">

<td class="small-text"><strong>Full text</strong></td>

<td class="smaller-text" colspan="2" >





<A NAME="FullText" title="Pdf" HREF="ft_gateway.cfm?id=356494&type=pdf&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_blank">
<img src="http://portal.acm.org/imagetypeslogo.gif" alt="Pdf" border="0" align="middle" style="margin-right: 2px">Pdf</A>
(564&nbsp;KB)








<br />




</td>
</tr>

<tr valign="top">
<td class="small-text"><strong>Source</strong>









</td>
<td class="small-text" colspan="2">











































<SPAN class="mediumb-text">ACM Transactions on Mathematical Software (TOMS) </span>
<a href="toc.cfm?id=J782&type=periodical&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self" class="small-link-text">archive</a><br>

<span class="small-text"> Volume 4 ,&nbsp; Issue 4 &nbsp;(December 1978)</span>
<a href="toc.cfm?id=356502&type=issue&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self" class="small-link-text">table of contents</a><br>
<span class="small-text"> </span>







<div class="medium-text">



</div>








<div class="small-text">
Pages: 330 - 338&nbsp;&nbsp;
</div>




<div class="small-text">
Year of Publication:&nbsp;1978
</div>



<div class="small-text">







ISSN:0098-3500
</div>




























</td>
</tr>



<tr valign="top">
<td class="small-text">
<strong>Author </strong>

</td>




<td colspan="2">
<div class="authors">
<table cellpadding="0" cellspacing="0">

<tr>
<td class="small-text">

<a href="author_page.cfm?id=81100372758&coll=GUIDE&dl=GUIDE&trk=0&CFID=47830777&CFTOKEN=85586443" target="_self">Andrew H Sherman</a>







</td>
<td class="small-text">

<small>&nbsp;Department of Computer Sciences, Painter 328, The University of Texas at Austin, Austin, TX</small>

</td>
</tr>

</table>
</div>
</td>
</tr>















<tr valign="top">
<td class="small-text"><strong>Publisher</strong></td>
<td colspan="2">
<div class="publishers">

<a href="http://www.acm.org/publications" target="publisher" title="Publisher">
ACM</a>&nbsp;


<small>New York, NY, USA</small>

</div>
</td>
</tr>















<tr valign="top">
<td class="small-text"><strong>Bibliometrics</strong></td>
<td colspan="2">
<div class="publishers">
Downloads (6 Weeks): 2,&nbsp;&nbsp; Downloads (12 Months): 58,&nbsp;&nbsp; Citation Count: 2
</div>
</td>
</tr>





</table>









td>
tr>

r>
d>
<!- third main table: main content START ->
table border="0" width="100%" cellspacing="0" cellpadding="0">
tr>
<td height="6"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td>
/tr>
tr>
<td colspan="4" valign="top" height="1" background="http://portal.acm.org/images/horiz-bar-long.jpg"></td>
/tr>
tr>
<td height="6"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td>
/tr>

<tr valign="top">
!- buttons ->
<td width="100%" colspan="4">
<table border="0" cellspacing="0" cellpadding="0" width="100%">
<col width="22%">
<col width="78%">
<tr>
<td class="small-text"><b>Additional Information:</b></td>
<td>
<p class="small-text">




<a href="citation.cfm?id=356494#references">references</a>&nbsp;&nbsp;


<a href="citation.cfm?id=356494#citedby">cited by</a>&nbsp;&nbsp;



<a href="citation.cfm?id=356494#IndexTerms">index terms</a>&nbsp;&nbsp;



<a href="citation.cfm?id=356494#collab">collaborative colleagues</a>&nbsp;&nbsp;


<a href="citation.cfm?id=356494#peers">peer to peer</a>&nbsp;&nbsp;

</p>
</td>
</tr>
</table>
</td>
/tr>
tr>
<td height="6"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td>
/tr>

tr valign="top">
!- buttons ->
<form name="popbinder">
<td width="100%" colspan="4">

<table border="0" cellspacing="0" cellpadding="2" width="100%" >
<col width="22%">
<col width="78%">
<tr valign="top">
<td class="small-text" style="padding-top: .75em"><b>Tools and Actions:</b></td>
<td style="padding-top: .75em">



















<a href="rightslink.cfm?id=356494&parent_id=356502" class="small-link-text" title="Request Permissions" target ="_blank"><img src="images/RL_Reprint_2.gif" width="17" height="16" border="0" alt="Request Permissions" /> Request Permissions</a>&nbsp;&nbsp;&nbsp;



<a href="http://www.reviews.com/reviewer/quickreview/frameset_toplevel.cfm?bib_id=356494" target="reviews" class="small-link-text">Review this Article</a>&nbsp;&nbsp;
<div style="margin-top: .5em; margin-bottom: 0">

<a href="citation.cfm?id=356494#" onClick="window.alert('To use this Feature, you must login with your personal ACM Web Account.');" class="small-link-text">
Save this Article to a Binder</a><img src="http://portal.acm.org/images/blanks.gif" border="0" name="saved">

&nbsp;&nbsp;
<span class="small-text">Display Formats:</span>
<a href="citation.cfm?id=356494#" onClick="window.open('popBibTex.cfm?id=356494&ids=J782.356502.356494&types=periodical.issue.article&reqtype=article&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443','BibTex','width=800,height=100,top=100,left=100,scrollbars=Yes,resizable=yes');" class="small-link-text">
BibTeX</a>&nbsp;
<a href="citation.cfm?id=356494#" onClick="window.open('testpopendnotes.cfm?id=356494&ids=J782.356502.356494&types=periodical.issue.article&reqtype=article&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443','BibTex','width=800,height=100,top=100,left=100,scrollbars=Yes,resizable=yes');" class="small-link-text">
EndNote</a>


<a href="citation.cfm?id=356494#" onClick="window.open('popacmref.cfm?id=356494&ids=J782.356502.356494&types=periodical.issue.article&reqtype=article&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443','BibTeX','width=800,height=100,top=100,left=100,scrollbars=Yes,resizable=yes');" class="small-link-text">
ACM Ref</a>


&nbsp;&nbsp;

</div>










</td>
</tr>
<tr>
<td height="10"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td>
</tr>

<tr valign="top">
<td class="small-text"><b>DOI Bookmark:</b></td>
<td class="small-text">
<small>Use this link to bookmark this Article:&nbsp;</small><a href="http://doi.acm.org/10.1145/356502.356494">http://doi.acm.org/10.1145/356502.356494</a><br><small><a href="http://www.doi.org/">What is a DOI?</a></small>

</td>
</tr>

</table>

</td>
</form>
/tr>
tr>
<td height="6"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td>
/tr>
tr>
<td colspan="4" valign="top" height="1" background="http://portal.acm.org/images/horiz-bar-long.jpg"></td>
/tr>
tr>
<td height="6"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td>
/tr>
/table>
- third main table: main content END ->






<div class="abstract">






</div>




<div class="abstract">






</div>



<br>
<div class="abstract">

<A HREF="citation.cfm?id=356494#CIT"><img name="top" src="http://portal.acm.org/images/arrowu.gif" hspace="10" border="0"></A><SPAN class=heading><A NAME="references">REFERENCES</A></span>
















<table border="0" cellpadding="5">

<tr valign="top">
<td valign="top"> &nbsp;</td>
<td>
<div class="abstract">
1
</div>
</td>
<td>
<div class="abstract">


<a href="citation.cfm?id=578775&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443">

Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
</a>

</div>
</td>
</tr>

<tr valign="top">
<td valign="top"> &nbsp;</td>
<td>
<div class="abstract">
2
</div>
</td>
<td>
<div class="abstract">

CURTIS, A.R., AND REID, J.K. FORTRAN subroutines for the solution of sparse sets of hnear equations. AERE Rep. R6844, AERE HarweU, England, 1971.


</div>
</td>
</tr>

<tr valign="top">
<td valign="top"> &nbsp;</td>
<td>
<div class="abstract">
3
</div>
</td>
<td>
<div class="abstract">

CURTIS, A.R, AND REID, J.K The solution of large sparse unsymmetnc systems of hnear equations. Information Processing '71 (1971), 1240-1245.


</div>
</td>
</tr>

<tr valign="top">
<td valign="top"> &nbsp;</td>
<td>
<div class="abstract">
4
</div>
</td>
<td>
<div class="abstract">

DUFF, I.S., AND REID, J.K A comparison of sparsity ordermgs for obtaining a pivotal sequence in Gausslan elm~matlon. AERE Rep. T.P. 526, AERE Harwell, England, 1973


</div>
</td>
</tr>

<tr valign="top">
<td valign="top"> <img src="http://portal.acm.org/images/ACM_mini.jpg" width="25" height="24" alt="" vspace="0" border="0" align="top"></td>
<td>
<div class="abstract">
5
</div>
</td>
<td>
<div class="abstract">


<a href="citation.cfm?id=1053217&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443">

Stanley C. Eisenstat , Andrew H. Sherman, Efficient implementation of sparse nonsymmetric Gaussian elimination without pivoting (abstract), ACM SIGNUM Newsletter, v.10 n.4, p.26-29, December 1975
</a>
&nbsp;[doi><a href="http://doi.acm.org/10.1145/1053205.1053217">10.1145/1053205.1053217</a>]
</div>
</td>
</tr>

<tr valign="top">
<td valign="top"> &nbsp;</td>
<td>
<div class="abstract">
6
</div>
</td>
<td>
<div class="abstract">

FORSYTHE, G.E., AND MOLER, C B Computer Solutton of Linear Algebraic Systems Prentice- Hall, Englewood Cliffs, N J, 1967


</div>
</td>
</tr>

<tr valign="top">
<td valign="top"> &nbsp;</td>
<td>
<div class="abstract">
7
</div>
</td>
<td>
<div class="abstract">


<a href="citation.cfm?id=280635&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443">

Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
</a>

</div>
</td>
</tr>

</table>



</div>



<br>
<div class="abstract">

<A HREF="citation.cfm?id=356494#CIT"><img name="top" src="http://portal.acm.org/images/arrowu.gif" hspace="10" border="0"></A><SPAN class=heading><A NAME="citings">CITED BY</A><A NAME="citedby"></A>&nbsp;&nbsp;<i>2</i></span>














<table cellpadding="5">

<tr valign="top">
<td valign="top">

<img src="http://portal.acm.org/images/ACM_mini.jpg" width="25" height="24" alt="" vspace="0" border="0" align="top">
</td>
<td>
<div class="abstract">

<a href="citation.cfm?id=356498&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443">
Andrew H. Sherman, Algorithm 533: NSPIV, a Fortran subroutine for sparse Gaussian elimination with partial pivoting [F4], ACM Transactions on Mathematical Software (TOMS), v.4 n.4, p.391-398, December 1978
</a>
</div>

</td>
</tr>

<tr valign="top">
<td valign="top">

<img src="http://portal.acm.org/images/ACM_mini.jpg" width="25" height="24" alt="" vspace="0" border="0" align="top">
</td>
<td>
<div class="abstract">

<a href="citation.cfm?id=640101&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443">
Jing Li , Tao Jiang, Efficient rule-based haplotyping algorithms for pedigree data, Proceedings of the seventh annual international conference on Research in computational molecular biology, p.197-206, April 10-14, 2003, Berlin, Germany
</a>
</div>

</td>
</tr>

</table>

</div>











<br>
<div class="indterms">

<A HREF="citation.cfm?id=356494#CIT"><img name="top" src="http://portal.acm.org/images/arrowu.gif" hspace="10" border="0"></A><SPAN class=heading><A NAME="IndexTerms">INDEX TERMS</A></span>


<p class="Categories">
<SPAN class=heading><A NAME="GenTerms">Primary Classification:</A></span>





<br>&nbsp;






<b>G.</b>



<a href="results.cfm?query=PrimaryCCS%3AG&querydisp=PrimaryCCS%3AG&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">

Mathematics of Computing</a><br>





&nbsp;


<img src="http://portal.acm.org/images/tree.gif" border="0" height="20" width="20">

<b>G.1</b>



<a href="results.cfm?query=PrimaryCCS%3AG1&querydisp=PrimaryCCS%3AG1&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">

NUMERICAL ANALYSIS</a><br>





&nbsp;

&nbsp;

&nbsp;


<img src="http://portal.acm.org/images/tree.gif" border="0" height="20" width="20">

<b>G.1.3</b>



<a href="results.cfm?query=PrimaryCCS%3AG13&querydisp=PrimaryCCS%3AG13&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">

Numerical Linear Algebra</a><br>








&nbsp;

&nbsp;

&nbsp;

&nbsp;

&nbsp;


<img src="http://portal.acm.org/images/tree.gif" border="0" height="20" width="20">

<b>Subjects:</b>

<a href="results.cfm?query=PrimarySubject%3A%22Sparse%2C%20structured%2C%20and%20very%20large%20systems%20%28direct%20and%20iterative%20methods%29%22&querydisp=PrimarySubject%3A%22Sparse%2C%20structured%2C%20and%20very%20large%20systems%20%28direct%20and%20iterative%20methods%29%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">Sparse, structured, and very large systems (direct and iterative methods)</a>


<br>




</p>


<p class="Categories">
<SPAN class=heading><A NAME="GenTerms">Additional&nbsp;Classification:</A></span>





<br>&nbsp;






<b>G.</b>


<a href="results.cfm?query=CCS%3AG&querydisp=CCS%3AG&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">
Mathematics of Computing</a><br>





&nbsp;


<img src="http://portal.acm.org/images/tree.gif" border="0" height="20" width="20">

<b>G.1</b>


<a href="results.cfm?query=CCS%3AG1&querydisp=CCS%3AG1&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">
NUMERICAL ANALYSIS</a><br>





&nbsp;

&nbsp;

&nbsp;


<img src="http://portal.acm.org/images/tree.gif" border="0" height="20" width="20">

<b>G.1.3</b>


<a href="results.cfm?query=CCS%3AG13&querydisp=CCS%3AG13&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">
Numerical Linear Algebra</a><br>








&nbsp;

&nbsp;

&nbsp;

&nbsp;

&nbsp;


<img src="http://portal.acm.org/images/tree.gif" border="0" height="20" width="20">

<b>Subjects:</b>

<a href="results.cfm?query=Subject%3A%22Linear%20systems%20%28direct%20and%20iterative%20methods%29%22&querydisp=Subject%3A%22Linear%20systems%20%28direct%20and%20iterative%20methods%29%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">Linear systems (direct and iterative methods)</a>


<br>




</p>



<br>
<p class="GenTerms">
<SPAN class=heading><A NAME="GenTerms">General Terms:</A></span>




<BR>



<a href="results.cfm?query=General%20Terms%3A%22Algorithms%22&querydisp=General%20Terms%3A%22Algorithms%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">
Algorithms</a>


</p>



<br>
<p class="keywords">
<SPAN class=heading><A NAME="Keywords">Keywords:</A></span>




<BR>



<a href="results.cfm?query=Keywords%3A%22analysis%20of%20algorithms%22&querydisp=Keywords%3A%22analysis%20of%20algorithms%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">
analysis of algorithms</a>,



<a href="results.cfm?query=Keywords%3A%22linear%20equations%22&querydisp=Keywords%3A%22linear%20equations%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">
linear equations</a>,



<a href="results.cfm?query=Keywords%3A%22pivoting%20algorithms%22&querydisp=Keywords%3A%22pivoting%20algorithms%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">
pivoting algorithms</a>,



<a href="results.cfm?query=Keywords%3A%22sparse%20Gaussian%20elimination%22&querydisp=Keywords%3A%22sparse%20Gaussian%20elimination%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">
sparse Gaussian elimination</a>,



<a href="results.cfm?query=Keywords%3A%22sparse%20linear%20systems%22&querydisp=Keywords%3A%22sparse%20linear%20systems%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">
sparse linear systems</a>


</p>



</div>





<div class="abstract">

<A HREF="citation.cfm?id=356494#CIT"><img name="top" src="http://portal.acm.org/images/arrowu.gif" hspace="10" border="0"></A><SPAN class=heading><A NAME="collab">Collaborative Colleagues:</A></span>

<table border="0" style="margin-left: 2em" cellpadding="2">






<tr>
<td>
<div class="abstract">

Andrew H Sherman: <a href="author_page.cfm?id=81100372758&dsp=coll&coll=GUIDE&dl=GUIDE&trk=1&CFID=47830777&CFTOKEN=85586443" target="_self">colleagues</a>

</div>
</td>
</tr>


</table>
</div>




<br>
<div class="abstract">

<A HREF="citation.cfm?id=356494#CIT"><img name="top" src="http://portal.acm.org/images/arrowu.gif" hspace="10" border="0"></A><SPAN class=heading><A NAME="peers">Peer to Peer - Readers of this Article have also read:</cite></A></span>
<ul type="disc">





<li>

<A HREF="citation.cfm?id=4290&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> Data structures for quadtree approximation and compression</a>




<b>Communications of the ACM</b>&nbsp;&nbsp;


<font size="-1">28,&nbsp;9</font><br>






Hanan Samet

<br>

<br>
</li>





<li>

<A HREF="citation.cfm?id=143680&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> A hierarchical single-key-lock access control using the Chinese remainder theorem</a>




<b>Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing</b><br>






Kim S. Lee

, &nbsp;Huizhu Lu

, &nbsp;D. D. Fisher

<br>

<br>
</li>





<li>

<A HREF="citation.cfm?id=125254&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> The GemStone object database management system</a>




<b>Communications of the ACM</b>&nbsp;&nbsp;


<font size="-1">34,&nbsp;10</font><br>






Paul Butterworth

, &nbsp;Allen Otis

, &nbsp;Jacob Stein

<br>

<br>
</li>





<li>

<A HREF="citation.cfm?id=125322&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> Putting innovation to work:&nbsp;adoption strategies for multimedia communication systems</a>




<b>Communications of the ACM</b>&nbsp;&nbsp;


<font size="-1">34,&nbsp;12</font><br>






Ellen Francik

, &nbsp;Susan Ehrlich Rudman

, &nbsp;Donna Cooper

, &nbsp;Stephen Levine

<br>

<br>
</li>





<li>

<A HREF="citation.cfm?id=123244&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> An intelligent component database for behavioral synthesis</a>




<b>Proceedings of the 27th ACM/IEEE Design Automation Conference on </b><br>






Gwo-Dong Chen

, &nbsp;Daniel D. Gajski

<br>

<br>
</li>

</ul>

</div>
























r>
IV class=footer-copy-text align="center">


The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.<br>
A href="http://www.acm.org/publications/policies/usage">Terms of Usage</A>&nbsp;&nbsp;
A href="http://www.acm.org/about/privacy-policy">Privacy Policy</A>&nbsp;&nbsp;
A href="http://www.acm.org/about/code-of-ethics">Code of Ethics</A>&nbsp;&nbsp;
A href="http://www.acm.org/about/contact-us">Contact Us</A>
<br><br>
eful downloads:
href="http://www.adobe.com/products/acrobat/readstep2.html"><img src="http://portal.acm.org/images/pdf_logo.gif" width="16" height="16" alt="" border="0"> Adobe Acrobat</a>
bsp;&nbsp;
href="http://www.apple.com/quicktime/download/" target="_blank"><img src="http://portal.acm.org/images/qtlogo.gif" width="16" height="16" alt="" border="0"> QuickTime</a>
bsp;&nbsp;
href="http://www.microsoft.com/windows/windowsmedia/download/default.asp" target="_blank"><img src="http://portal.acm.org/images/wmv.gif" width="16" height="15" alt="" border="0"> Windows Media Player</a>
bsp;&nbsp;
href="http://www.real.com/" target="_blank"><img src="http://portal.acm.org/images/realplayer.gif" width="20" height="18" alt="" border="0"> Real Player</a>

DIV>
</td>
tr>
table>
div>
</body>
html>

@article{356494, author = {Sherman, Andrew H}, title = {Algorithms for sparse Gaussian elimination with partial pivoting}, journal = {ACM Trans. Math. Softw.}, publisher = {ACM}, address = {New York, NY, USA}, year = {1978}, volume = {4}, number = {4}, pages = {330--338}, url = {http://portal.acm.org/citation.cfm?id=356494}, doi = {http://doi.acm.org/10.1145/356502.356494}, issn = {0098-3500}, keywords = {large, math, matrix, scale, svd}, abstract = { <style> .note-header-text font-family: Times, Times New Roman, serif; color:#ff0000; font-size: .95em; margin-left: .75em; margin-right: .75em; </style> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml" lang="en" xml:lang="en"> <head> <LINK REL=STYLESHEET TYPE="text/css" HREF="css/dl.css"> <title>Algorithms for sparse Gaussian elimination with partial pivoting</title> <style type="text/css"><!-- body margin-left: 0em; margin-top: 0 a:link text-decoration: underline; Color: #006699; a:visited color: #990033; text-decoration: underline; a:hover color: red; text-decoration: none a.dLink1:link color:#336699 a.dLink1:visited color:#666666 a.isblack:link text-decoration: underline; Color: #000000; a.isblack:visited color: #000000; text-decoration: underline; a.isblack:hover color: #000000; text-decoration: none h1 font-size: 140%; margin-bottom: 0 ul margin-top: .25em; list-style-type: disc ol margin-top: .25em; li padding-bottom: .25em h2 color: white; background-color: #069; font-size: 100%; padding-left: 1em; margin: 0 h3 color: black; background-color: yellow; font-size: 100%; margin: 0 h4 color: black; background-color: #99c5e8; font-size: 100%; margin: 0 hr color: #39176d; form margin-top: 10 form.xrs margin-top: 0 a text-decoration: none; input font-size: 1em; .chevron color: #ff0000; .light-blue color:#336699; .black color:#000000; /* ### standard text styles, smallest to largest ### */ .footer-link-text font-family: Arial, Helvetica, sans-serif; color:#336699; font-size: .75em; line-height: 1.33em; text-indent: -.75 em; margin-left: 2em; margin-right: .75em; .footer-copy-text font-family: Arial, Helvetica, sans-serif; color:#000000; font-size: .75em; line-height: 1.3em; margin-left: .75em; margin-right: .75em; .small-link-text font-family: Arial, Helvetica, sans-serif; color:#000000; font-size: .83em; padding-bottom : 2px; padding-top : 2px; .smallerer-text font-family: Arial, Helvetica, sans-serif; color:#000000; font-size: .65em; .smaller-text font-family: Arial, Helvetica, sans-serif; color:#000000; font-size: .75em; .small-text font-family: Arial, Helvetica, sans-serif; color:#000000; font-size: .83em; .small-textb font-family: Arial, Helvetica, sans-serif; color:#000000; font-size: .83em; font-weight: bold; .medium-text font-family: Arial, Helvetica, sans-serif; color:#000000; font-size: 1em; .mediumb-text font-family: Arial, Helvetica, sans-serif; color:#000000; font-size: 1em; font-weight: bold; .large-text font-family: Arial, Helvetica, sans-serif; color:#000000; font-size: 1.3em; .instr-text font-family: Arial, Helvetica, sans-serif; color:#666666; font-size: .83em; .list-link-text font-family: Arial, Helvetica, sans-serif; color:#336699; font-size: .83em; line-height: 1.3em; .list-link-btext font-family: Arial, Helvetica, sans-serif; color:#000000; font-size: .83em; line-height: 1.3em; .searchbox-text font-family: Arial, Helvetica, sans-serif; color:#000066; font-size: 1em; font-weight: bold; .footer-header-text font-family: Arial, Helvetica, sans-serif; color:#000066; font-size: 1em; font-weight: bold; margin-left: .75em; margin-right: .75em; .medium-link-text font-family: Arial, Helvetica, sans-serif; color:#000066; font-size: 1em; font-weight: bold; line-height: 1em; text-indent: -1.25em; margin-left: 2em; margin-right: .75em; .small-copy-text font-family: Times, Times New Roman, serif; color:#000066; font-size: .75em; line-height: 1.2em; margin-left: .75em; margin-right: .75em; .medium-copy-text font-family: Times, Times New Roman, serif; color:#000066; font-size: 1em; line-height: 1.2em; margin-left: .75em; margin-right: .75em; .large-copy-text font-family: Times, Times New Roman, serif; color:#000066; font-size: 1.3em; line-height: 1.5em; margin-left: .75em; margin-right: .75em; .medium-header-text font-family: Times, Times New Roman, serif; color:#ff0000; font-size: 1em; margin-left: .75em; margin-right: .75em; .large-header-text font-family: Times, Times New Roman, serif; color:#ff0000; font-size: 1.5em; margin-left: .75em; margin-right: .75em; #side width: 10px; float: left; margin-left: -1px; padding: 2px; #content padding: 2px; margin-left: 25px; --></style> <SCRIPT LANGUAGE="JavaScript"> /* <!-- Begin if(document.layers || document.all) a = 1; setInterval("Jump()", 10); function Jump() a = a + 1; //self.moveBy((Math.random() * a * 2 - a), (Math.random() * a * 2) - a); // End --> */ </script> </head> <body bgcolor="#ffffff" onload="window.focus(); "> <div align="center"> <a name="CIT"></a> <table border="0" width="85%" cellspacing="0" cellpadding="0"> <tr> <td> <table border="0" width="100%" cellspacing="0" cellpadding="0"> <tr valign="top"> <td width="1%" class="small-link-text" align="center" background="http://portal.acm.org/images/horiz-bar.jpg"><img src="http://portal.acm.org/images/logo_acm_portal2.jpg" alt="ACM Portal" width="263" height="54" border="0" usemap="#PORT"> <font color="white"> HeBIS:&nbsp;Universitaetsbibliothek Kassel </font> </td> <td width="99%" align="left" class="small-link-text"> <table border="0" cellspacing="0" cellpadding="0"> <tr> <td>&nbsp;</td> <td class="small-link-text"><a href="https://campus.acm.org/Public/login_genpubqj.cfm?rdr=http://portal.acm.org/citation.cfm?id=356494&promo=QJPUB&offering=200&form_type=PUB&CFID=47830777&CFTOKEN=85586443" class="small-link-text">Subscribe</a><span class="small-link-text">&nbsp;(Full Service)</span>&nbsp;&nbsp;&nbsp;</td> <td class="small-link-text"><a href="https://portal.acm.org/poplogin.cfm?dl=GUIDE&coll=GUIDE&want_href=citation%2Ecfm%3Fid%3D356494%26CFID%3D47830777%26CFTOKEN%3D85586443&CFID=47830777&CFTOKEN=85586443" class="small-link-text">Register</a><span class="small-link-text">&nbsp;(Limited Service, <font color="Red">Free</font>)</span>&nbsp;&nbsp;&nbsp;</td> <td class="small-link-text" valign="bot"> <a href="https://portal.acm.org/poplogin.cfm?dl=GUIDE&coll=GUIDE&want_href=citation%2Ecfm%3Fid%3D356494%26CFID%3D47830777%26CFTOKEN%3D85586443&CFID=47830777&CFTOKEN=85586443" class="small-link-text">Login</a> </td> </tr> </table> <table border="0" width="100%" cellspacing="0" cellpadding="0"> <form name="qiksearch" action="results.cfm?coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" method="post"> <tr> <td height="5"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td> </tr> <input type="hidden" name="parser" value="Internet"> <tr> <td class="small-link-text">&nbsp;</td> <td class="small-link-text"> <b>Search:</b>&nbsp;&nbsp;&nbsp;<input type="Radio" name="whichDL" value="acm" >The ACM Digital Library&nbsp;&nbsp;&nbsp;<input type="Radio" name="whichDL" value="guide" checked>The Guide <br><input class="pubdescr" type="Text" name="query" size="60" value=" ">&nbsp;&nbsp; <input type="Image" alt="Search" name=Go src="http://portal.acm.org/images/search_small.jpg" border="0"> <script type="text/javascript" src="js/wz_tooltip/wz_tooltip.js"></script> </td> </tr> </form> </table> </td> <!-- top nav END --> </tr> </table> <table border="0" cellspacing="0" cellpadding="0"> <tr> <td height="12"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td> </tr> </table> <map name="PORT" > <area shape="rect" coords="1,1,55,60" href="http://www.acm.org/" alt="ACM Home Page"> <area shape="rect" coords="65,1,300,78" href="portal.cfm?coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443"> </map> <table border="0" width="100%" align="left"> <col width="40%"> <col width="60%"> <tr> <td> <a href="guide.cfm?coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443"><img src="http://portal.acm.org/images/acm_guide_bar_large2.jpg" width=350 height=25 alt="" border="0"></a> </td> <td class="small-text" align="center"> <img src="http://portal.acm.org/images/feedback.gif" width="20" height="19" alt="Please provide us with feedback." border="0">&nbsp;<a href="feedback.cfm?CFID=47830777&CFTOKEN=85586443">Feedback</a> </td> </tr> <tr> <td height="6"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td> </tr> </table> </td> </tr> <tr> <td colspan="3" valign="top" height="1" background="http://portal.acm.org/images/horiz-bar-long.jpg"></td> </tr> <tr> <td class="small-text"> <table border="0" width="100%" cellpadding="2"> <col width="1%"> <col width="8%"> <col width="91%"> <tr> <td class="medium-text" colspan="3"><strong>Algorithms for sparse Gaussian elimination with partial pivoting</strong></td> </tr> <tr valign="middle"> </tr> <tr valign="top"> <td class="small-text"><strong>Full text</strong></td> <td class="smaller-text" colspan="2" > <A NAME="FullText" title="Pdf" HREF="ft_gateway.cfm?id=356494&type=pdf&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_blank"> <img src="http://portal.acm.org/imagetypeslogo.gif" alt="Pdf" border="0" align="middle" style="margin-right: 2px">Pdf</A> (564&nbsp;KB) <br /> </td> </tr> <tr valign="top"> <td class="small-text"><strong>Source</strong> </td> <td class="small-text" colspan="2"> <SPAN class="mediumb-text">ACM Transactions on Mathematical Software (TOMS) </span> <a href="toc.cfm?id=J782&type=periodical&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self" class="small-link-text">archive</a><br> <span class="small-text"> Volume 4 ,&nbsp; Issue 4 &nbsp;(December 1978)</span> <a href="toc.cfm?id=356502&type=issue&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self" class="small-link-text">table of contents</a><br> <span class="small-text"> </span> <div class="medium-text"> </div> <div class="small-text"> Pages: 330 - 338&nbsp;&nbsp; </div> <div class="small-text"> Year of Publication:&nbsp;1978 </div> <div class="small-text"> ISSN:0098-3500 </div> </td> </tr> <tr valign="top"> <td class="small-text"> <strong>Author </strong> </td> <td colspan="2"> <div class="authors"> <table cellpadding="0" cellspacing="0"> <tr> <td class="small-text"> <a href="author_page.cfm?id=81100372758&coll=GUIDE&dl=GUIDE&trk=0&CFID=47830777&CFTOKEN=85586443" target="_self">Andrew H Sherman</a> </td> <td class="small-text"> <small>&nbsp;Department of Computer Sciences, Painter 328, The University of Texas at Austin, Austin, TX</small> </td> </tr> </table> </div> </td> </tr> <tr valign="top"> <td class="small-text"><strong>Publisher</strong></td> <td colspan="2"> <div class="publishers"> <a href="http://www.acm.org/publications" target="publisher" title="Publisher"> ACM</a>&nbsp; <small>New York, NY, USA</small> </div> </td> </tr> <tr valign="top"> <td class="small-text"><strong>Bibliometrics</strong></td> <td colspan="2"> <div class="publishers"> Downloads (6 Weeks): 2,&nbsp;&nbsp; Downloads (12 Months): 58,&nbsp;&nbsp; Citation Count: 2 </div> </td> </tr> </table> </td> </tr> <tr> <td> <!-- third main table: main content START --> <table border="0" width="100%" cellspacing="0" cellpadding="0"> <tr> <td height="6"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td> </tr> <tr> <td colspan="4" valign="top" height="1" background="http://portal.acm.org/images/horiz-bar-long.jpg"></td> </tr> <tr> <td height="6"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td> </tr> <tr valign="top"> <!-- buttons --> <td width="100%" colspan="4"> <table border="0" cellspacing="0" cellpadding="0" width="100%"> <col width="22%"> <col width="78%"> <tr> <td class="small-text"><b>Additional Information:</b></td> <td> <p class="small-text"> <a href="citation.cfm?id=356494#references">references</a>&nbsp;&nbsp; <a href="citation.cfm?id=356494#citedby">cited by</a>&nbsp;&nbsp; <a href="citation.cfm?id=356494#IndexTerms">index terms</a>&nbsp;&nbsp; <a href="citation.cfm?id=356494#collab">collaborative colleagues</a>&nbsp;&nbsp; <a href="citation.cfm?id=356494#peers">peer to peer</a>&nbsp;&nbsp; </p> </td> </tr> </table> </td> </tr> <tr> <td height="6"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td> </tr> <tr valign="top"> <!-- buttons --> <form name="popbinder"> <td width="100%" colspan="4"> <table border="0" cellspacing="0" cellpadding="2" width="100%" > <col width="22%"> <col width="78%"> <tr valign="top"> <td class="small-text" style="padding-top: .75em"><b>Tools and Actions:</b></td> <td style="padding-top: .75em"> <a href="rightslink.cfm?id=356494&parent_id=356502" class="small-link-text" title="Request Permissions" target ="_blank"><img src="images/RL_Reprint_2.gif" width="17" height="16" border="0" alt="Request Permissions" /> Request Permissions</a>&nbsp;&nbsp;&nbsp; <a href="http://www.reviews.com/reviewer/quickreview/frameset_toplevel.cfm?bib_id=356494" target="reviews" class="small-link-text">Review this Article</a>&nbsp;&nbsp; <div style="margin-top: .5em; margin-bottom: 0"> <a href="citation.cfm?id=356494#" onClick="window.alert('To use this Feature, you must login with your personal ACM Web Account.');" class="small-link-text"> Save this Article to a Binder</a><img src="http://portal.acm.org/images/blanks.gif" border="0" name="saved"> &nbsp;&nbsp; <span class="small-text">Display Formats:</span> <a href="citation.cfm?id=356494#" onClick="window.open('popBibTex.cfm?id=356494&ids=J782.356502.356494&types=periodical.issue.article&reqtype=article&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443','BibTex','width=800,height=100,top=100,left=100,scrollbars=Yes,resizable=yes');" class="small-link-text"> BibTeX</a>&nbsp; <a href="citation.cfm?id=356494#" onClick="window.open('testpopendnotes.cfm?id=356494&ids=J782.356502.356494&types=periodical.issue.article&reqtype=article&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443','BibTex','width=800,height=100,top=100,left=100,scrollbars=Yes,resizable=yes');" class="small-link-text"> EndNote</a> <a href="citation.cfm?id=356494#" onClick="window.open('popacmref.cfm?id=356494&ids=J782.356502.356494&types=periodical.issue.article&reqtype=article&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443','BibTeX','width=800,height=100,top=100,left=100,scrollbars=Yes,resizable=yes');" class="small-link-text"> ACM Ref</a> &nbsp;&nbsp; </div> </td> </tr> <tr> <td height="10"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td> </tr> <tr valign="top"> <td class="small-text"><b>DOI Bookmark:</b></td> <td class="small-text"> <small>Use this link to bookmark this Article:&nbsp;</small><a href="http://doi.acm.org/10.1145/356502.356494">http://doi.acm.org/10.1145/356502.356494</a><br><small><a href="http://www.doi.org/">What is a DOI?</a></small> </td> </tr> </table> </td> </form> </tr> <tr> <td height="6"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td> </tr> <tr> <td colspan="4" valign="top" height="1" background="http://portal.acm.org/images/horiz-bar-long.jpg"></td> </tr> <tr> <td height="6"><img src="http://portal.acm.org/images/blanks.gif" width=1 height=1 alt="" border="0"></td> </tr> </table> <!-- third main table: main content END --> <div class="abstract"> </div> <div class="abstract"> </div> <br> <div class="abstract"> <A HREF="citation.cfm?id=356494#CIT"><img name="top" src="http://portal.acm.org/images/arrowu.gif" hspace="10" border="0"></A><SPAN class=heading><A NAME="references">REFERENCES</A></span> <table border="0" cellpadding="5"> <tr valign="top"> <td valign="top"> &nbsp;</td> <td> <div class="abstract"> 1 </div> </td> <td> <div class="abstract"> <a href="citation.cfm?id=578775&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443"> Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974 </a> </div> </td> </tr> <tr valign="top"> <td valign="top"> &nbsp;</td> <td> <div class="abstract"> 2 </div> </td> <td> <div class="abstract"> CURTIS, A.R., AND REID, J.K. FORTRAN subroutines for the solution of sparse sets of hnear equations. AERE Rep. R6844, AERE HarweU, England, 1971. </div> </td> </tr> <tr valign="top"> <td valign="top"> &nbsp;</td> <td> <div class="abstract"> 3 </div> </td> <td> <div class="abstract"> CURTIS, A.R, AND REID, J.K The solution of large sparse unsymmetnc systems of hnear equations. Information Processing '71 (1971), 1240-1245. </div> </td> </tr> <tr valign="top"> <td valign="top"> &nbsp;</td> <td> <div class="abstract"> 4 </div> </td> <td> <div class="abstract"> DUFF, I.S., AND REID, J.K A comparison of sparsity ordermgs for obtaining a pivotal sequence in Gausslan elm~matlon. AERE Rep. T.P. 526, AERE Harwell, England, 1973 </div> </td> </tr> <tr valign="top"> <td valign="top"> <img src="http://portal.acm.org/images/ACM_mini.jpg" width="25" height="24" alt="" vspace="0" border="0" align="top"></td> <td> <div class="abstract"> 5 </div> </td> <td> <div class="abstract"> <a href="citation.cfm?id=1053217&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443"> Stanley C. Eisenstat , Andrew H. Sherman, Efficient implementation of sparse nonsymmetric Gaussian elimination without pivoting (abstract), ACM SIGNUM Newsletter, v.10 n.4, p.26-29, December 1975 </a> &nbsp;[doi><a href="http://doi.acm.org/10.1145/1053205.1053217">10.1145/1053205.1053217</a>] </div> </td> </tr> <tr valign="top"> <td valign="top"> &nbsp;</td> <td> <div class="abstract"> 6 </div> </td> <td> <div class="abstract"> FORSYTHE, G.E., AND MOLER, C B Computer Solutton of Linear Algebraic Systems Prentice- Hall, Englewood Cliffs, N J, 1967 </div> </td> </tr> <tr valign="top"> <td valign="top"> &nbsp;</td> <td> <div class="abstract"> 7 </div> </td> <td> <div class="abstract"> <a href="citation.cfm?id=280635&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443"> Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998 </a> </div> </td> </tr> </table> </div> <br> <div class="abstract"> <A HREF="citation.cfm?id=356494#CIT"><img name="top" src="http://portal.acm.org/images/arrowu.gif" hspace="10" border="0"></A><SPAN class=heading><A NAME="citings">CITED BY</A><A NAME="citedby"></A>&nbsp;&nbsp;<i>2</i></span> <table cellpadding="5"> <tr valign="top"> <td valign="top"> <img src="http://portal.acm.org/images/ACM_mini.jpg" width="25" height="24" alt="" vspace="0" border="0" align="top"> </td> <td> <div class="abstract"> <a href="citation.cfm?id=356498&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443"> Andrew H. Sherman, Algorithm 533: NSPIV, a Fortran subroutine for sparse Gaussian elimination with partial pivoting [F4], ACM Transactions on Mathematical Software (TOMS), v.4 n.4, p.391-398, December 1978 </a> </div> </td> </tr> <tr valign="top"> <td valign="top"> <img src="http://portal.acm.org/images/ACM_mini.jpg" width="25" height="24" alt="" vspace="0" border="0" align="top"> </td> <td> <div class="abstract"> <a href="citation.cfm?id=640101&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443"> Jing Li , Tao Jiang, Efficient rule-based haplotyping algorithms for pedigree data, Proceedings of the seventh annual international conference on Research in computational molecular biology, p.197-206, April 10-14, 2003, Berlin, Germany </a> </div> </td> </tr> </table> </div> <br> <div class="indterms"> <A HREF="citation.cfm?id=356494#CIT"><img name="top" src="http://portal.acm.org/images/arrowu.gif" hspace="10" border="0"></A><SPAN class=heading><A NAME="IndexTerms">INDEX TERMS</A></span> <p class="Categories"> <SPAN class=heading><A NAME="GenTerms">Primary Classification:</A></span> <br>&nbsp; <b>G.</b> <a href="results.cfm?query=PrimaryCCS%3AG&querydisp=PrimaryCCS%3AG&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> Mathematics of Computing</a><br> &nbsp; <img src="http://portal.acm.org/images/tree.gif" border="0" height="20" width="20"> <b>G.1</b> <a href="results.cfm?query=PrimaryCCS%3AG1&querydisp=PrimaryCCS%3AG1&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> NUMERICAL ANALYSIS</a><br> &nbsp; &nbsp; &nbsp; <img src="http://portal.acm.org/images/tree.gif" border="0" height="20" width="20"> <b>G.1.3</b> <a href="results.cfm?query=PrimaryCCS%3AG13&querydisp=PrimaryCCS%3AG13&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> Numerical Linear Algebra</a><br> &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <img src="http://portal.acm.org/images/tree.gif" border="0" height="20" width="20"> <b>Subjects:</b> <a href="results.cfm?query=PrimarySubject%3A%22Sparse%2C%20structured%2C%20and%20very%20large%20systems%20%28direct%20and%20iterative%20methods%29%22&querydisp=PrimarySubject%3A%22Sparse%2C%20structured%2C%20and%20very%20large%20systems%20%28direct%20and%20iterative%20methods%29%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">Sparse, structured, and very large systems (direct and iterative methods)</a> <br> </p> <p class="Categories"> <SPAN class=heading><A NAME="GenTerms">Additional&nbsp;Classification:</A></span> <br>&nbsp; <b>G.</b> <a href="results.cfm?query=CCS%3AG&querydisp=CCS%3AG&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> Mathematics of Computing</a><br> &nbsp; <img src="http://portal.acm.org/images/tree.gif" border="0" height="20" width="20"> <b>G.1</b> <a href="results.cfm?query=CCS%3AG1&querydisp=CCS%3AG1&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> NUMERICAL ANALYSIS</a><br> &nbsp; &nbsp; &nbsp; <img src="http://portal.acm.org/images/tree.gif" border="0" height="20" width="20"> <b>G.1.3</b> <a href="results.cfm?query=CCS%3AG13&querydisp=CCS%3AG13&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> Numerical Linear Algebra</a><br> &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <img src="http://portal.acm.org/images/tree.gif" border="0" height="20" width="20"> <b>Subjects:</b> <a href="results.cfm?query=Subject%3A%22Linear%20systems%20%28direct%20and%20iterative%20methods%29%22&querydisp=Subject%3A%22Linear%20systems%20%28direct%20and%20iterative%20methods%29%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self">Linear systems (direct and iterative methods)</a> <br> </p> <br> <p class="GenTerms"> <SPAN class=heading><A NAME="GenTerms">General Terms:</A></span> <BR> <a href="results.cfm?query=General%20Terms%3A%22Algorithms%22&querydisp=General%20Terms%3A%22Algorithms%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> Algorithms</a> </p> <br> <p class="keywords"> <SPAN class=heading><A NAME="Keywords">Keywords:</A></span> <BR> <a href="results.cfm?query=Keywords%3A%22analysis%20of%20algorithms%22&querydisp=Keywords%3A%22analysis%20of%20algorithms%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> analysis of algorithms</a>, <a href="results.cfm?query=Keywords%3A%22linear%20equations%22&querydisp=Keywords%3A%22linear%20equations%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> linear equations</a>, <a href="results.cfm?query=Keywords%3A%22pivoting%20algorithms%22&querydisp=Keywords%3A%22pivoting%20algorithms%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> pivoting algorithms</a>, <a href="results.cfm?query=Keywords%3A%22sparse%20Gaussian%20elimination%22&querydisp=Keywords%3A%22sparse%20Gaussian%20elimination%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> sparse Gaussian elimination</a>, <a href="results.cfm?query=Keywords%3A%22sparse%20linear%20systems%22&querydisp=Keywords%3A%22sparse%20linear%20systems%22&termshow=matchboolean&coll=GUIDE&dl=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> sparse linear systems</a> </p> </div> <div class="abstract"> <A HREF="citation.cfm?id=356494#CIT"><img name="top" src="http://portal.acm.org/images/arrowu.gif" hspace="10" border="0"></A><SPAN class=heading><A NAME="collab">Collaborative Colleagues:</A></span> <table border="0" style="margin-left: 2em" cellpadding="2"> <tr> <td> <div class="abstract"> Andrew H Sherman: <a href="author_page.cfm?id=81100372758&dsp=coll&coll=GUIDE&dl=GUIDE&trk=1&CFID=47830777&CFTOKEN=85586443" target="_self">colleagues</a> </div> </td> </tr> </table> </div> <br> <div class="abstract"> <A HREF="citation.cfm?id=356494#CIT"><img name="top" src="http://portal.acm.org/images/arrowu.gif" hspace="10" border="0"></A><SPAN class=heading><A NAME="peers">Peer to Peer - Readers of this Article have also read:</cite></A></span> <ul type="disc"> <li> <A HREF="citation.cfm?id=4290&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> Data structures for quadtree approximation and compression</a> <b>Communications of the ACM</b>&nbsp;&nbsp; <font size="-1">28,&nbsp;9</font><br> Hanan Samet <br> <br> </li> <li> <A HREF="citation.cfm?id=143680&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> A hierarchical single-key-lock access control using the Chinese remainder theorem</a> <b>Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing</b><br> Kim S. Lee , &nbsp;Huizhu Lu , &nbsp;D. D. Fisher <br> <br> </li> <li> <A HREF="citation.cfm?id=125254&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> The GemStone object database management system</a> <b>Communications of the ACM</b>&nbsp;&nbsp; <font size="-1">34,&nbsp;10</font><br> Paul Butterworth , &nbsp;Allen Otis , &nbsp;Jacob Stein <br> <br> </li> <li> <A HREF="citation.cfm?id=125322&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> Putting innovation to work:&nbsp;adoption strategies for multimedia communication systems</a> <b>Communications of the ACM</b>&nbsp;&nbsp; <font size="-1">34,&nbsp;12</font><br> Ellen Francik , &nbsp;Susan Ehrlich Rudman , &nbsp;Donna Cooper , &nbsp;Stephen Levine <br> <br> </li> <li> <A HREF="citation.cfm?id=123244&dl=GUIDE&coll=GUIDE&CFID=47830777&CFTOKEN=85586443" target="_self"> An intelligent component database for behavioral synthesis</a> <b>Proceedings of the 27th ACM/IEEE Design Automation Conference on </b><br> Gwo-Dong Chen , &nbsp;Daniel D. Gajski <br> <br> </li> </ul> </div> <br> <DIV class=footer-copy-text align="center"> The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.<br> <A href="http://www.acm.org/publications/policies/usage">Terms of Usage</A>&nbsp;&nbsp; <A href="http://www.acm.org/about/privacy-policy">Privacy Policy</A>&nbsp;&nbsp; <A href="http://www.acm.org/about/code-of-ethics">Code of Ethics</A>&nbsp;&nbsp; <A href="http://www.acm.org/about/contact-us">Contact Us</A> <br><br> Useful downloads: <a href="http://www.adobe.com/products/acrobat/readstep2.html"><img src="http://portal.acm.org/images/pdf_logo.gif" width="16" height="16" alt="" border="0"> Adobe Acrobat</a> &nbsp;&nbsp; <a href="http://www.apple.com/quicktime/download/" target="_blank"><img src="http://portal.acm.org/images/qtlogo.gif" width="16" height="16" alt="" border="0"> QuickTime</a> &nbsp;&nbsp; <a href="http://www.microsoft.com/windows/windowsmedia/download/default.asp" target="_blank"><img src="http://portal.acm.org/images/wmv.gif" width="16" height="15" alt="" border="0"> Windows Media Player</a> &nbsp;&nbsp; <a href="http://www.real.com/" target="_blank"><img src="http://portal.acm.org/images/realplayer.gif" width="20" height="18" alt="" border="0"> Real Player</a> </DIV> </td> </tr> </table> </div> </body> </html>} }

%0 = article %A = Sherman, Andrew H %C = New York, NY, USA %D = 1978 %I = ACM %T = Algorithms for sparse Gaussian elimination with partial pivoting %U = http://portal.acm.org/citation.cfm?id=356494