# Publications by Tamara G. Kolda

http://www.sandia.gov/~tgkolda/ref#KlGlKoXX
| |||||

BibTeX:
@inproceedings{KlGlKoXX, author = {Christine Klymko and David F. Gleich and Tamara G. Kolda}, title = {Using Triangles to Improve Community Detection in Directed Networks}, booktitle = {The Second ASE International Conference on Big Data Science and Computing, BigDataScience}, venue = {Stanford, CA}, eventdate = {2014-05-27/2014-05-31}, note = {accepted 2014-04-16}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#KoPiPlSeXXb older version}
| |||||

BibTeX:
@article{KoPiPlSeXXb, author = {Tamara G. Kolda and Ali Pinar and Todd Plantenga and C. Seshadhri}, title = {A Scalable Generative Graph Model with Community Structure}, journal = {SIAM Journal on Scientific Computing}, note = {accepted 2014-03-28}, eprint = {1302.6636}, eprintclass = {cs.SI}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#ScLoVaKoXX older version}
| |||||

BibTeX:
@article{ScLoVaKoXX, author = {Martin D. Schatz and Tze-Meng Low and Robert A. {van de Geijn} and Tamara G. Kolda}, title = {Exploiting Symmetry in Tensors for High Performance}, journal = {SIAM Journal on Scientific Computing}, note = {accepted 2014-03-11}, eprint = {1301.7744}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#kcore-arXiv-1403.2226
| |||||

BibTeX:
@misc{kcore-arXiv-1403.2226, author = {Chengbin Peng and Tamara G. Kolda and Ali Pinar}, title = {Accelerating Community Detection by Using {K-core} Subgraphs}, month = {March}, year = {2014}, eprint = {1403.2226}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SePiKoXX older version}
| |||||

BibTeX:
@article{SePiKoXX, author = {C. Seshadhri and Ali Pinar and Tamara G. Kolda}, title = {Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs}, journal = {Statistical Analysis and Data Mining}, note = {accepted 2014-02-18}, eprint = {1309.3321}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#GTEP-arXiv-1401.1183
| |||||

BibTeX:
@misc{GTEP-arXiv-1401.1183, author = {Tamara G. Kolda and Jackson R. Mayo}, title = {An Adaptive Shifted Power Method for Computing Generalized Tensor Eigenpairs}, month = {January}, year = {2014}, eprint = {1401.1183}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#KoPiPlSeXX older version}
| |||||

BibTeX:
@article{KoPiPlSeXX, author = {Tamara G. Kolda and Ali Pinar and Todd Plantenga and C. Seshadhri and Christine Task}, title = {Counting Triangles in Massive Graphs with {MapReduce}}, journal = {SIAM Journal on Scientific Computing}, note = {accepted 2013-12-04}, eprint = {1301.5887}, eprintclass = {cs.SI}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#Wedges-arXiv:1309.3321 newer version}
| |||||

BibTeX:
@misc{Wedges-arXiv:1309.3321, author = {C. Seshadhri and Ali Pinar and Tamara G. Kolda}, title = {Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs}, month = {September}, year = {2013}, eprint = {1309.3321}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SiSuSrKo13 older version}
| |||||

BibTeX:
@inproceedings{SiSuSrKo13, author = {Singhal, Ayush and Subbian, Karthik and Srivastava, Jaideep and Kolda, Tamara G. and Pinar, Ali}, title = {Dynamics of Trust Reciprocation in Multi-relational Networks}, booktitle = {ASONAM '13: Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining}, venue = {Niagara Falls, Canada}, eventdate = {2013-08-25/2013-08-28}, publisher = {ACM}, pages = {661--665}, year = {2013}, doi = {10.1145/2492517.2555242}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SIAMNEWS-CSE13 | |||||

BibTeX:
@article{SIAMNEWS-CSE13, author = {Tamara G. Kolda and Ali Pinar}, title = {Large-scale Network Analysis at SIAM CSE Conference}, journal = {SIAM News}, volume = {46}, number = {5}, month = {June}, year = {2013}, url = {http://www.siam.org/news/news.php?id=2079}, urldate = {2014-04-03}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SePiKo13a older version}
| |||||

BibTeX:
@inproceedings{SePiKo13a, author = {C. Seshadhri and Ali Pinar and Tamara G. Kolda}, title = {Triadic Measures on Graphs: The Power of Wedge Sampling}, booktitle = {SDM13: Proceedings of the 2013 SIAM International Conference on Data Mining}, venue = {Austin, TX}, eventdate = {2013-05-02/2013-05-04}, pages = {10--18}, year = {2013}, doi = {10.1137/1.9781611972832.2}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#DuKoPiSe13 older version}
| |||||

BibTeX:
@inproceedings{DuKoPiSe13, author = {Nurcan Durak and Tamara G. Kolda and Ali Pinar and C. Seshadhri}, title = {A Scalable Null Model for Directed Graphs Matching All Degree Distributions: In, Out, and Reciprocal}, booktitle = {NSW 2013: Proceedings of IEEE 2013 2nd International Network Science Workshop}, pages = {23--30}, month = {April}, year = {2013}, eprint = {1210.5288}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#PTF-arXiv-1304.4964
| |||||

BibTeX:
@misc{PTF-arXiv-1304.4964, author = {Samantha Hansen and Todd Plantenga and Tamara G. Kolda}, title = {Newton-Based Optimization for Nonnegative Tensor Factorizations}, month = {April}, year = {2013}, eprint = {1304.4964}, eprintclass = {math.NA}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SePiKo13 older version}
| |||||

BibTeX:
@article{SePiKo13, author = {C. Seshadhri and Ali Pinar and Tamara G. Kolda}, title = {An In-Depth Analysis of Stochastic {Kronecker} Graphs}, journal = {Journal of the ACM}, volume = {60}, number = {2}, eid = {13}, pagetotal = {32} month = {April}, year = {2013}, doi = {10.1145/2450142.2450149}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#MMOG-arXiv-1303.6385 newer version}
| |||||

BibTeX:
@misc{MMOG-arXiv-1303.6385, author = {Karthik Subbian and Ayush Singhal and Tamara G. Kolda and Ali Pinar and Jaideep Srivastava}, title = {Dynamics of Trust Reciprocation in Heterogeneous {MMOG} Networks}, month = {March}, year = {2013}, eprint = {1303.6385}, eprintclass = {cs.SI}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#BTER-arXiv-1302.6636 newer version}
| |||||

BibTeX:
@misc{BTER-arXiv-1302.6636, author = {Tamara G. Kolda and Ali Pinar and Todd Plantenga and C. Seshadhri}, title = {A Scalable Generative Graph Model with Community Structure}, month = {February}, year = {2013}, eprint = {1302.6636}, eprintclass = {cs.SI}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#DirectedTriangles-arXiv-1302.6220
| |||||

BibTeX:
@misc{DirectedTriangles-arXiv-1302.6220, author = {C. Seshadhri and Ali Pinar and Nurcan Durak and Tamara G. Kolda}, title = {Directed Closure Measures for Networks with Reciprocity}, month = {February}, year = {2013}, eprint = {1302.6220}, eprintclass = {cs.SI}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SymTen-arXiv-1301.7744 newer version}
| |||||

BibTeX:
@misc{SymTen-arXiv-1301.7744, author = {Martin D. Schatz and Tze Meng Low and Robert A. {van de Geijn} and Tamara G. Kolda}, title = {Exploiting Symmetry in Tensors for High Performance}, month = {January}, year = {2013}, eprint = {1301.7744}, eprintclass = {math.NA}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#TriMR-arXiv-1301.5887 newer version}
| |||||

BibTeX:
@misc{TriMR-arXiv-1301.5887, author = {Tamara G. Kolda and Ali Pinar and Todd Plantenga and C. Seshadhri and Christine Task}, title = {Counting Triangles in Massive Graphs with {MapReduce}}, month = {January}, year = {2013}, eprint = {1301.5887}, eprintclass = {cs.SI}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#ChKo12 older version}
| |||||

BibTeX:
@article{ChKo12, author = {Eric C. Chi and Tamara G. Kolda}, title = {On Tensors, Sparsity, and Nonnegative Factorizations}, journal = {SIAM Journal on Matrix Analysis and Applications}, volume = {33}, number = {4}, pages = {1272-1299}, month = {December}, year = {2012}, doi = {10.1137/110859063}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#DuPiKoSe12 older version}
| |||||

BibTeX:
@inproceedings{DuPiKoSe12, author = {Durak, Nurcan and Pinar, Ali and Kolda, Tamara G. and Seshadhri, C.}, title = {Degree Relations of Triangles in Real-world Networks and Graph Models}, booktitle = {CIKM '12: Proceedings of the 21st ACM International Conference on Information and Knowledge Management}, venue = {Maui, Hawaii}, eventdate = {2012-10-29/2012-11-02}, publisher = {ACM}, pages = {1712--1716}, year = {2012}, doi = {10.1145/2396761.2398503}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#FRD-arXiv-1210.5288 newer version}
| |||||

BibTeX:
@misc{FRD-arXiv-1210.5288, author = {Nurcan Durak and Tamara G. Kolda and Ali Pinar and C. Seshadhri}, title = {A Scalable Null Model for Directed Graphs Matching All Degree Distributions: In, Out, and Reciprocal}, month = {October}, year = {2012}, eprint = {1210.5288}, eprintclass = {cs.SI}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#TriProp-arXiv_1207.7125 newer version}
| |||||

BibTeX:
@misc{TriProp-arXiv_1207.7125, author = {Nurcan Durak and Ali Pinar and Tamara G. Kolda and C. Seshadhri}, title = {Degree Relations of Triangles in Real-world Networks and Models}, month = {July}, year = {2012}, eprint = {1207.7125}, eprintclass = {cs.SI}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SeKoPi12 older version}
| |||||

BibTeX:
@article{SeKoPi12, author = {C. Seshadhri and Tamara G. Kolda and Ali Pinar}, title = {Community Structure and Scale-free Collections of {Erd\H{o}s-R\'enyi} Graphs}, journal = {Physical Review E}, volume = {85}, number = {5}, eid = {056109}, pagetotal = {9} month = {May}, year = {2012}, doi = {10.1103/PhysRevE.85.056109}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#PiSeKo12 older version}
| |||||

BibTeX:
@inproceedings{PiSeKo12, author = {Ali Pinar and C. Seshadhri and Tamara G. Kolda}, title = {The Similarity between Stochastic {Kronecker} and {Chung-Lu} Graph Models}, booktitle = {SDM12: Proceedings of the Twelfth SIAM International Conference on Data Mining}, venue = {Anaheim, CA}, eventdate = {2012-04-26/2012-04-28}, pages = {1071-1082}, year = {2012}, doi = {10.1137/1.9781611972825.92}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2012-3087
| |||||

BibTeX:
@techreport{SAND2012-3087, author = {Todd D. Plantenga and Tamara G. Kolda}, title = {C++ Tensor Toolbox User Manual}, number = {SAND2012-3087}, institution = {Sandia National Laboratories}, month = {April}, year = {2012}, doi = {10.2172/1039397}, url = {http://www.osti.gov/scitech/biblio/1039397}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#Triangles-arXiv-1202.5230 newer version}
| |||||

BibTeX:
@misc{Triangles-arXiv-1202.5230, author = {C. Seshadhri and Ali Pinar and Tamara G. Kolda}, title = {Triadic Measures on Graphs: The Power of Wedge Sampling}, month = {February}, year = {2012}, eprint = {1202.5230}, eprintclass = {cs.SI}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#BTER-arXiv-1112.3644 newer version}
| |||||

BibTeX:
@misc{BTER-arXiv-1112.3644, author = {C. Seshadhri and Tamara G. Kolda and Ali Pinar}, title = {Community Structure and Scale-free Collections of {Erd\H{o}s-R\'enyi} Graphs}, month = {December}, year = {2011}, eprint = {1112.3644}, eprintclass = {cs.SI}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#PTF-arXiv-1112.2414 newer version}
| |||||

BibTeX:
@misc{PTF-arXiv-1112.2414, author = {Eric C. Chi and Tamara G. Kolda}, title = {On Tensors, Sparsity, and Nonnegative Factorizations}, month = {December}, year = {2011}, eprint = {1112.2414}, eprintclass = {math.NA}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#BaMuKoDi11 older version}
| |||||

BibTeX:
@inproceedings{BaMuKoDi11, author = {Justin D. Basilico and M. Arthur Munson and Tamara G. Kolda and Kevin R. Dixon and W. Philip Kegelmeyer}, title = {{COMET}: A Recipe for Learning and Using Large Ensembles on Massive Data}, booktitle = {ICDM 2011: Proceedings of the 2011 IEEE International Conference on Data Mining}, venue = {Vancouver, BC}, eventdate = {2011-12-11/2011-12-14}, pages = {41--50}, year = {2011}, doi = {10.1109/ICDM.2011.39}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SePiKo11 older version}
{newer version}
| |||||

BibTeX:
@inproceedings{SePiKo11, author = {C. Seshadhri and Ali Pinar and Tamara G. Kolda}, title = {An In-Depth Study of Stochastic {Kronecker} Graphs}, booktitle = {ICDM 2011: Proceedings of the 2011 IEEE International Conference on Data Mining}, venue = {Vancouver, BC}, eventdate = {2011-12-11/2011-12-14}, pages = {587--596}, year = {2011}, doi = {10.1109/ICDM.2011.23}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SKG-CL-arXiv-1110.4925 newer version}
| |||||

BibTeX:
@misc{SKG-CL-arXiv-1110.4925, author = {Ali Pinar and C. Seshadhri and Tamara G. Kolda}, title = {The Similarity between Stochastic {Kronecker} and {Chung-Lu} Graph Models}, month = {October}, year = {2011}, eprint = {1110.4925}, eprintclass = {cs.SI}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#KoMa11 older version}
| |||||

BibTeX:
@article{KoMa11, author = {Tamara G. Kolda and Jackson R. Mayo}, title = {Shifted Power Method for Computing Tensor Eigenpairs}, journal = {SIAM Journal on Matrix Analysis and Applications}, volume = {32}, number = {4}, pages = {1095-1124}, month = {October}, year = {2011}, doi = {10.1137/100801482}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SKG-arXiv-1102.5046 newer version}
| |||||

BibTeX:
@misc{SKG-arXiv-1102.5046, author = {C. Seshadhri and Ali Pinar and Tamara G. Kolda}, title = {An In-Depth Analysis of Stochastic {Kronecker} Graphs}, month = {February}, year = {2011}, eprint = {1102.5046}, eprintclass = {cs.SI}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#DuKoKe11 older version}
| |||||

BibTeX:
@incollection{DuKoKe11, author = {Daniel M. Dunlavy and Tamara G. Kolda and W. Philip Kegelmeyer}, title = {Multilinear Algebra for Analyzing Data with Multiple Linkages}, booktitle = {Graph Algorithms in the Language of Linear Algebra}, editor = {Jeremy Kepner and John Gilbert}, series = {Fundamentals of Algorithms}, publisher = {SIAM}, pages = {85--114}, year = {2011}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#AcKoDu11
| |||||

BibTeX:
@inproceedings{AcKoDu11, author = {Evrim Acar and Tamara G. Kolda and Daniel M. Dunlavy}, title = {All-at-once Optimization for Coupled Matrix and Tensor Factorizations}, booktitle = {MLG'11: Proceedings of Mining and Learning with Graphs}, month = {August}, year = {2011}, eprint = {1105.3422}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#BaKoPl11 older version}
| |||||

BibTeX:
@inproceedings{BaKoPl11, author = {Grey Ballard and Tamara G. Kolda and Todd Plantenga}, title = {Efficiently Computing Tensor Eigenvalues on a {GPU}}, booktitle = {IPDPSW'11: Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum}, eventtitle = {12th IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC-11)}, venue = {Anchorage, Alaska}, eventdate = {2011-05-16/2011-05-20}, publisher = {IEEE Computer Society}, pages = {1340--1348}, month = {May}, year = {2011}, doi = {10.1109/IPDPS.2011.287}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2011-3786
| |||||

BibTeX:
@techreport{SAND2011-3786, author = {Todd D. Plantenga and Tamara G. Kolda}, title = {Analytics for Cyber Network Defense}, number = {SAND2011-3786}, institution = {Sandia National Laboratories}, month = {May}, year = {2011}, url = {http://www.osti.gov/scitech/biblio/1113857}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SIAM-News-Top-Ten | |||||

BibTeX:
@article{SIAM-News-Top-Ten, author = {Tamara G. Kolda and Virginia J. Torczon}, title = {Top Ten Ways to Lose an Audience}, journal = {SIAM News}, volume = {44}, number = {3}, month = {April}, year = {2011}, url = {http://www.siam.org/news/news.php?id=1876}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2011-1877
| |||||

BibTeX:
@techreport{SAND2011-1877, author = {Eric C. Chi and Tamara G. Kolda}, title = {Making Tensor Factorizations Robust to Non-{Gaussian} Noise}, number = {SAND2011-1877}, institution = {Sandia National Laboratories}, month = {March}, year = {2011}, doi = {10.2172/1011706}, url = {http://www.osti.gov/scitech/biblio/1011706}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#COMET newer version}
| |||||

BibTeX:
@misc{COMET, author = {Justin D. Basilico and M. Arthur Munson and Tamara G. Kolda and Kevin R. Dixon and W. Philip Kegelmeyer}, title = {{COMET}: A Recipe for Learning and Using Large Ensembles on Massive Data}, month = {March}, year = {2011}, eprint = {1103.2068}, eprintclass = {cs.LG}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#AcDuKoMo11 older version}
| |||||

BibTeX:
@article{AcDuKoMo11, author = {Evrim Acar and Daniel M. Dunlavy and Tamara G. Kolda and Morten M{\o}rup}, title = {Scalable Tensor Factorizations for Incomplete Data}, journal = {Chemometrics and Intelligent Laboratory Systems}, issuetitle = {Special Issue on Multiway and Multiset Data Analysis}, volume = {106}, number = {1}, pages = {41--56}, month = {March}, year = {2011}, doi = {10.1016/j.chemolab.2010.08.004}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#DuKoAc11 older version}
| |||||

BibTeX:
@article{DuKoAc11, author = {Daniel M. Dunlavy and Tamara G. Kolda and Evrim Acar}, title = {Temporal Link Prediction using Matrix and Tensor Factorizations}, journal = {ACM Transactions on Knowledge Discovery from Data}, issuetitle = {Special Issue on Large-scale Data Mining: Theory and Applications.}, volume = {5}, number = {2}, pages = {10 (27 pages)}, month = {February}, year = {2011}, doi = {10.1145/1921632.1921636}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#AcDuKo11 older version}
| |||||

BibTeX:
@article{AcDuKo11, author = {Evrim Acar and Daniel M. Dunlavy and Tamara G. Kolda}, title = {A Scalable Optimization Approach for Fitting Canonical Tensor Decompositions}, journal = {Journal of Chemometrics}, volume = {25}, number = {2}, pages = {67--86}, month = {February}, year = {2011}, doi = {10.1002/cem.1335}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#arXiv_1010.3043
| |||||

BibTeX:
@inproceedings{arXiv_1010.3043, author = {Eric C. Chi and Tamara G. Kolda}, title = {Making Tensor Factorizations Robust to Non-{G}aussian Noise}, booktitle = {NIPS Workshop on Tensors, Kernels, and Machine Learning}, venue = {Whistler, BC}, eventdate = {2010-12-10}, month = {October}, year = {2010}, eprint = {1010.3043}, eprintclass = {math.NA}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#BallardStudentPaper2010 newer version}
| |||||

BibTeX:
@inproceedings{BallardStudentPaper2010, author = {Grey Ballard and Tamara G. Kolda and Todd Plantenga}, title = {Efficiently Computing Tensor Eigenvalues on a {GPU}}, booktitle = {CSRI Summer Proceedings 2010, Technical Report SAND2010-8783P, Sandia National Laboratories}, editor = {Eric C. Cyr and S. Scott Collis}, pages = {59--75}, year = {2010}, url = {http://csri.sandia.gov/Proceedings/CSRI-Summer-2010.pdf}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#arXiv_1007.1267 newer version}
| |||||

BibTeX:
@misc{arXiv_1007.1267, author = {Tamara G. Kolda and Jackson R. Mayo}, title = {Shifted Power Method for Computing Tensor Eigenpairs}, month = {July}, year = {2011}, eprint = {1007.1267}, eprintclass = {math.NA}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#arXiv_1005.4006 newer version}
| |||||

BibTeX:
@misc{arXiv_1005.4006, author = {Daniel M. Dunlavy and Tamara G. Kolda and Evrim Acar}, title = {Temporal Link Prediction using Matrix and Tensor Factorizations}, month = {May}, year = {2010}, note = {revised June 2010}, eprint = {1005.4006}, eprintclass = {math.NA}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#arXiv_1005.2197 newer version}
| |||||

BibTeX:
@misc{arXiv_1005.2197, author = {Evrim Acar and Daniel M. Dunlavy and Tamara G. Kolda and Morten M{\o}rup}, title = {Scalable Tensor Factorizations for Incomplete Data}, month = {May}, year = {2010}, eprint = {1005.2197}, eprintclass = {math.NA}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#AcDuKoM10 older version}
| |||||

BibTeX:
@inproceedings{AcDuKoM10, author = {Evrim Acar and Daniel M. Dunlavy and Tamara G. Kolda and Morten M{\o}rup}, title = {Scalable Tensor Factorizations with Missing Data}, booktitle = {SDM10: Proceedings of the 2010 SIAM International Conference on Data Mining}, venue = {Columbus, Ohio}, eventdate = {2010-04-29/2010-05-01}, pages = {701--712}, year = {2010}, doi = {10.1137/1.9781611972801.61}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#GrKo10 older version}
| |||||

BibTeX:
@article{GrKo10, author = {Joshua D. Griffin and Tamara G. Kolda}, title = {Nonlinearly-constrained Optimization Using Heuristic Penalty Methods and Asynchronous Parallel Generating Set Search}, journal = {Applied Mathematics Research eXpress}, volume = {25}, number = {5}, pages = {36--62}, month = {October}, year = {2010}, doi = {10.1093/amrx/abq003}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2010-1422
| |||||

BibTeX:
@techreport{SAND2010-1422, author = {Daniel M. Dunlavy and Tamara G. Kolda and Evrim Acar}, title = {Poblano v1.0: A Matlab Toolbox for Gradient-Based Optimization}, number = {SAND2010-1422}, institution = {Sandia National Laboratories}, month = {March}, year = {2010}, doi = {10.2172/989350}, url = {http://www.osti.gov/scitech/biblio/989350}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#AcDuKo09
| |||||

BibTeX:
@inproceedings{AcDuKo09, author = {Evrim Acar and Daniel M. Dunlavy and Tamara G. Kolda}, title = {Link Prediction on Evolving Data using Matrix and Tensor Factorizations}, booktitle = {ICDMW'09: Proceedings of the 2009 IEEE International Conference on Data Mining Workshops}, venue = {Miami, FL}, eventdate = {2009-12-06}, pages = {262--269}, month = {December}, year = {2009}, doi = {10.1109/ICDMW.2009.54}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2009-6764 newer version}
| |||||

BibTeX:
@techreport{SAND2009-6764, author = {Evrim Acar and Daniel M. Dunlavy and Morten M{\o}rup and Tamara G. Kolda}, title = {Scalable Tensor Factorizations with Missing Data}, number = {SAND2009-6764}, institution = {Sandia National Laboratories}, month = {October}, year = {2009}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2009-6670
| |||||

BibTeX:
@techreport{SAND2009-6670, author = {Tamara G. Kolda and Michael J. Procopio}, title = {Generalized BadRank with Graduated Trust}, number = {SAND2009-6670}, institution = {Sandia National Laboratories}, month = {October}, year = {2009}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#KoBa09 older version}
© 2009 Society for Industrial and Applied Mathematics | |||||

BibTeX:
@article{KoBa09, author = {Tamara G. Kolda and Brett W. Bader}, title = {Tensor Decompositions and Applications}, journal = {SIAM Review}, volume = {51}, number = {3}, pages = {455--500}, month = {September}, year = {2009}, doi = {10.1137/07070111X}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#GrKo10a older version}
| |||||

BibTeX:
@article{GrKo10a, author = {Joshua D. Griffin and Tamara G. Kolda}, title = {Asynchronous Parallel Hybrid Optimization Combining {DIRECT} and {GSS}}, journal = {Optimization Methods and Software}, volume = {25}, number = {5}, pages = {797-817}, month = {October}, year = {2010}, doi = {10.1080/10556780903039893}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2009-0857 newer version}
| |||||

BibTeX:
@techreport{SAND2009-0857, author = {Evrim Acar and Tamara G. Kolda and Daniel M. Dunlavy}, title = {An Optimization Approach for Fitting Canonical Tensor Decompositions}, number = {SAND2009-0857}, institution = {Sandia National Laboratories}, month = {February}, year = {2009}, doi = {10.2172/978916}, url = {http://www.osti.gov/scitech/biblio/978916}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2009-0805
| |||||

BibTeX:
@techreport{SAND2009-0805, author = {Daniel M. Dunlavy and Bruce Hendrickson and Tamara G. Kolda}, title = {Mathematical Challenges in Cybersecurity}, number = {SAND 2009-0805}, institution = {Sandia National Laboratories}, month = {February}, year = {2009}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#KoSu08
| |||||

BibTeX:
@inproceedings{KoSu08, author = {Tamara G. Kolda and Jimeng Sun}, title = {Scalable Tensor Decompositions for Multi-aspect Data Mining}, booktitle = {ICDM 2008: Proceedings of the 8th IEEE International Conference on Data Mining}, venue = {Pisa, Italy}, eventdate = {2008-12-15/2008-12-19}, pages = {363--372}, year = {2008}, doi = {10.1109/ICDM.2008.89}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#CASTA2008 | |||||

BibTeX:
@inproceedings{CASTA2008, author = {Evrim Acar and Daniel M. Dunlavy and Tamara G. Kolda}, title = {CPOPT: Optimization for Fitting {CANDECOMP/PARAFAC} Models (extended abstact)}, booktitle = {CASTA 2008: Workshop on Computational Algebraic Statistics, Theories and Applications}, venue = {Kyoto, Japan}, eventdate = {2008-12-10/2008-12-12}, year = {2008}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2008-6553 newer version}
| |||||

BibTeX:
@techreport{SAND2008-6553, author = {Joshua D. Griffin and Tamara G. Kolda}, title = {Asynchronous Parallel Hybrid Optimization Combining {DIRECT} and {GSS}}, number = {SAND2008-6553}, institution = {Sandia National Laboratories}, month = {October}, year = {2008}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2008-5844
| |||||

BibTeX:
@techreport{SAND2008-5844, author = {Noam Goldberg and Tamara G. Kolda and Ann S. Yoshimura}, title = {Concurrent Optimization with {DUET}: {DIRECT} Using External Trial Points}, number = {SAND2008-5844}, institution = {Sandia National Laboratories}, month = {September}, year = {2008}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2008-6109 | |||||

BibTeX:
@incollection{SAND2008-6109, author = {Tamara G. Kolda and Brett W. Bader}, title = {Multi-way Data Analysis and Applications (extended abstract)}, booktitle = {Proceedings of the 2008 Sandia Workshop on Data Mining and Data Analysis}, editor = {James M. Brandt and Daniel M. Dunlavy and Ann C. Gentile}, number = {SAND2008-6109}, publisher = {Sandia National Laboratories}, pages = {42--45}, month = {September}, year = {2008}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#GrKoLe08 older version}
© 2008 Society for Industrial and Applied Mathematics | |||||

BibTeX:
@article{GrKoLe08, author = {Joshua D. Griffin and Tamara G. Kolda and Robert Michael Lewis}, title = {Asynchronous Parallel Generating Set Search For Linearly-Constrained Optimization}, journal = {SIAM Journal on Scientific Computing}, volume = {30}, number = {4}, pages = {1892--1924}, month = {May}, year = {2008}, doi = {10.1137/060664161}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#FoReKeDe08
| |||||

BibTeX:
@article{FoReKeDe08, author = {K. R. Fowler and J. P. Reese and C. E. Kees and J. E. {Dennis, Jr.} and C. T. Kelley and C. T. Miller and C. Audet and A. J. Booker and G. Couture and R. W. Darwin and M. W. Farthing and D. E. Finkel and J. M. Gablonsky and G. Gray and T. G. Kolda}, title = {A Comparison of Derivative-Free Optimization Methods for Groundwater Supply and Hydraulic Capture Community Problems}, journal = {Advances in Water Resources}, volume = {31}, number = {5}, pages = {743--757}, month = {May}, year = {2008}, doi = {10.1016/j.advwatres.2008.01.010}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#BrAcKo08 older version}
| |||||

BibTeX:
@article{BrAcKo08, author = {Rasmus Bro and Evrim Acar and Tamara G. Kolda}, title = {Resolving the Sign Ambiguity in the Singular Value Decomposition}, journal = {Journal of Chemometrics}, volume = {22}, number = {2}, pages = {135--140}, month = {February}, year = {2008}, doi = {10.1002/cem.1122}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#BaKo07 older version}
© 2007 Society for Industrial and Applied Mathematics | |||||

BibTeX:
@article{BaKo07, author = {Brett W. Bader and Tamara G. Kolda}, title = {Efficient {MATLAB} Computations with Sparse and Factored Tensors}, journal = {SIAM Journal on Scientific Computing}, volume = {30}, number = {1}, pages = {205--231}, month = {December}, year = {2007}, doi = {10.1137/060676489}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SeKoKeGr07
| |||||

BibTeX:
@inproceedings{SeKoKeGr07, author = {Teresa M. Selee and Tamara G. Kolda and W. Philip Kegelmeyer and Joshua D. Griffin}, title = {Extracting Clusters from Large Datasets with Multiple Similarity Measures Using {IMSCAND}}, booktitle = {CSRI Summer Proceedings 2007}, editor = {Michael L. Parks and S. Scott Collis}, publisher = {Tech. Rep. SAND2007-7977, Sandia National Laboratories}, pages = {87--103}, month = {December}, year = {2007}, url = {http://www.cs.sandia.gov/CSRI/Proceedings/CSRI2007.pdf}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2007-6702 newer version}
| |||||

BibTeX:
@techreport{SAND2007-6702, author = {Tamara G. Kolda and Brett W. Bader}, title = {Tensor Decompositions and Applications}, number = {SAND2007-6702}, institution = {Sandia National Laboratories}, month = {November}, year = {2007}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#BaHaKo07 older version}
| |||||

BibTeX:
@inproceedings{BaHaKo07, author = {Brett W. Bader and Richard A. Harshman and Tamara G. Kolda}, title = {Temporal Analysis of Semantic Graphs using {ASALSAN}}, booktitle = {ICDM 2007: Proceedings of the 7th IEEE International Conference on Data Mining}, venue = {Omaha, NE}, eventdate = {2007-10-28/2007-10-31}, pages = {33-42}, year = {2007}, doi = {10.1109/ICDM.2007.54}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2007-6422 newer version}
| |||||

BibTeX:
@techreport{SAND2007-6422, author = {Rasmus Bro and Evrim Acar and Tamara G. Kolda}, title = {Resolving the Sign Ambiguity in the Singular Value Decomposition}, number = {SAND2007-6422}, institution = {Sandia National Laboratories}, month = {October}, year = {2007}, doi = {10.2172/920802}, url = {http://www.osti.gov/scitech/biblio/920802}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#ChBaKoAb07 older version}
We propose a novel application of PARAFAC2 (which is a variant of PARAFAC, a multi-way generalization of the singular value decomposition [SVD]) to overcome this problem. Instead of forming a single multilingual term-by-document matrix which, under LSA, is subjected to SVD, we form an irregular three-way array, each slice of which is a separate term-by-document matrix for a single language in the parallel corpus. The goal is to compute an SVD for each language such that V (the matrix of right singular vectors) is the same across all languages. Effectively, PARAFAC2 imposes the constraint, not present in standard LSA, that the 'concepts' in all documents in the parallel corpus are the same regardless of language. Intuitively, this constraint makes sense, since the whole purpose of using a parallel corpus is that exactly the same concepts are expressed in the translations. We tested this approach by comparing the performance of PARAFAC2 with standard LSA in solving a particular CLIR problem. From our results, we conclude that PARAFAC2 offers a very promising alternative to LSA not only for multilingual document clustering, but also for solving other problems in crosslanguage information retrieval.
| |||||

BibTeX:
@inproceedings{ChBaKoAb07, author = {Peter A. Chew and Brett W. Bader and Tamara G. Kolda and Ahmed Abdelali}, title = {Cross-language Information Retrieval using {PARAFAC2}}, booktitle = {KDD '07: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}, venue = {San Jose, CA}, eventdate = {2007-08-12/2007-08-15}, publisher = {ACM}, pages = {143-152}, year = {2007}, doi = {10.1145/1281192.1281211}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SIAM-News-BGCE | |||||

BibTeX:
@article{SIAM-News-BGCE, author = {Tamara G. Kolda and U. R\"ude}, title = {First {BGCE} Student Prize in CSE}, journal = {SIAM News}, volume = {40}, number = {5}, month = {June}, year = {2007}, url = {http://www.siam.org/news/news.php?id=1130}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#FaKoSu07
| |||||

BibTeX:
@inproceedings{FaKoSu07, author = {Christos Faloutsos and Tamara G. Kolda and Jimeng Sun}, title = {Mining Large Graphs and Streams using Matrix and Tensor Tools (extended abstract)}, booktitle = {SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Management of data}, venue = {Beijing, China}, eventdate = {2007-06-11/2007-06-14}, publisher = {ACM}, pages = {1174}, year = {2007}, doi = {10.1145/1247480.1247647}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2007-3257 newer version}
| |||||

BibTeX:
@techreport{SAND2007-3257, author = {Joshua D. Griffin and Tamara G. Kolda}, title = {Nonlinearly-constrained Optimization using Asynchronous Parallel Generating Set Search}, number = {SAND2007-3257}, institution = {Sandia National Laboratories}, month = {May}, year = {2007}, doi = {10.2172/909393}, url = {http://www.osti.gov/scitech/biblio/909393}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2007-2706 newer version}
| |||||

BibTeX:
@techreport{SAND2007-2706, author = {Peter A. Chew and Brett W. Bader and Tamara G. Kolda and Ahmed Abdelali}, title = {Cross-language Information Retrieval using {PARAFAC2}}, number = {SAND2007-2706}, institution = {Sandia National Laboratories}, month = {May}, year = {2007}, doi = {10.2172/908061}, url = {http://www.osti.gov/scitech/biblio/908061}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2006-7744 older version}
{newer version}
| |||||

BibTeX:
@techreport{SAND2006-7744, author = {Brett W. Bader and Richard Harshman and Tamara G. Kolda}, title = {Pattern Analysis of Directed Graphs Using {DEDICOM}: An Application to Enron Email}, number = {SAND2006-7744}, institution = {Sandia National Laboratories}, month = {December}, year = {2006}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2006-7592 newer version}
| |||||

BibTeX:
@techreport{SAND2006-7592, author = {Brett W. Bader and Tamara G. Kolda}, title = {Efficient {MATLAB} Computations with Sparse and Factored Tensors}, number = {SAND2006-7592}, institution = {Sandia National Laboratories}, month = {December}, year = {2006}, doi = {10.2172/897641}, url = {http://www.osti.gov/scitech/biblio/897641}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#BaKo06 older version}
| |||||

BibTeX:
@article{BaKo06, author = {Brett W. Bader and Tamara G. Kolda}, title = {Algorithm 862: {MATLAB} Tensor Classes for Fast Algorithm Prototyping}, journal = {ACM Transactions on Mathematical Software}, volume = {32}, number = {4}, pages = {635--653}, month = {December}, year = {2006}, doi = {10.1145/1186785.1186794}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#KoLeTo06 older version}
| |||||

BibTeX:
@article{KoLeTo06, author = {Tamara G. Kolda and Robert Michael Lewis and Virginia Torczon}, title = {Stationarity Results for Generating Set Search for Linearly Constrained Optimization}, journal = {SIAM Journal on Optimization}, volume = {17}, number = {4}, pages = {943--968}, month = {November}, year = {2006}, doi = {10.1137/S1052623403433638}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#GrKo06 older version}
| |||||

BibTeX:
@article{GrKo06, author = {Genetha A. Gray and Tamara G. Kolda}, title = {Algorithm 856: {APPSPACK} 4.0: Asynchronous Parallel Pattern Search for Derivative-Free Optimization}, journal = {ACM Transactions on Mathematical Software}, volume = {32}, number = {3}, pages = {485--507}, month = {September}, year = {2006}, doi = {10.1145/1163641.1163647}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2006-4055
This report serves as a reference manual for the commands specification for the DAKOTA software, providing input overviews, option descriptions, and example specifications. | |||||

BibTeX:
@techreport{SAND2006-4055, author = {Michael S. Eldred and Anthony A. Giunta and Shannon L. Brown and Brian M. Adams and Daniel M. Dunlavy and John P. Eddy and David M. Gay and Josh D. Griffin and William E. Hart and Patty D. Hough and Tammy G. Kolda and Monica L. Martinez-Canales and Laura P. Swiler and Jean-Paul Watson and Pamela J. Williams}, title = {{DAKOTA}, a Multilevel Parallel Object-oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 4.0 Reference Manual}, number = {SAND2006-4055}, institution = {Sandia National Laboratories}, month = {October}, year = {2006}, doi = {10.2172/895073}, url = {http://www.osti.gov/scitech/biblio/895073}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2006-5315
| |||||

BibTeX:
@techreport{SAND2006-5315, author = {Tamara G. Kolda and Robert Michael Lewis and V. Torczon}, title = {A Generating Set Direct Search Augmented {Lagrangian} Algorithm for Optimization with a Combination of General and Linear Constraints}, number = {SAND2006-5315}, institution = {Sandia National Laboratories}, month = {August}, year = {2006}, doi = {10.2172/893121}, url = {http://www.osti.gov/scitech/biblio/893121}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2006-4621 newer version}
| |||||

BibTeX:
@techreport{SAND2006-4621, author = {Joshua D. Griffin and Tamara G. Kolda and Robert Michael Lewis}, title = {Asynchronous Parallel Generating Set Search For Linearly-Constrained Optimization}, number = {SAND2006-4621}, institution = {Sandia National Laboratories}, month = {August}, year = {2006}, doi = {10.2172/891372}, url = {http://www.osti.gov/scitech/biblio/891372}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#ICMS2006
© Springer-Verlag Berlin Heidelberg 2006 | |||||

BibTeX:
@inproceedings{ICMS2006, author = {Joshua D. Griffin and Tamara G. Kolda}, title = {A Parallel, Asynchronous Method for Derivative-Free Nonlinear Programs (extended abstract)}, booktitle = {Mathematical Software - ICMS 2006}, eventtitle = {Second International Congress on Mathematical Software}, venue = {Castro Urdiales, Spain}, eventdate = {2006-09-01/2006-09-03}, series = {Lecture Notes in Computer Science}, volume = {4151}, publisher = {Springer Berlin Heidelberg}, pages = {260--262}, year = {2006}, doi = {10.1007/11832225_26}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2006-2161 newer version}
| |||||

BibTeX:
@techreport{SAND2006-2161, author = {Brett W. Bader and Richard Harshman and Tamara G. Kolda}, title = {Temporal Analysis of Social Networks using Three-way {DEDICOM}}, number = {SAND2006-2161}, institution = {Sandia National Laboratories}, month = {April}, year = {2006}, doi = {10.2172/887253}, url = {http://www.osti.gov/scitech/biblio/887253}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2006-2079 newer version}
| |||||

BibTeX:
@techreport{SAND2006-2079, author = {Daniel M. Dunlavy and Tamara G. Kolda and W. Philip Kegelmeyer}, title = {Multilinear Algebra for Analyzing Data with Multiple Linkages}, number = {SAND2006-2079}, institution = {Sandia National Laboratories}, month = {April}, year = {2006}, doi = {10.2172/883132}, url = {http://www.osti.gov/scitech/biblio/883132}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2006-2081
| |||||

BibTeX:
@techreport{SAND2006-2081, author = {Tamara G. Kolda}, title = {Multilinear Operators for Higher-order Decompositions}, number = {SAND2006-2081}, institution = {Sandia National Laboratories}, month = {April}, year = {2006}, doi = {10.2172/923081}, url = {http://www.osti.gov/scitech/biblio/923081}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#KoBa06
| |||||

BibTeX:
@inproceedings{KoBa06, author = {Tamara Kolda and Brett Bader}, title = {The {TOPHITS} Model for Higher-order Web Link Analysis}, booktitle = {Proceedings of Link Analysis, Counterterrorism and Security 2006}, eventtitle = {Sixth SIAM International Conference on Data Mining, SDM06}, venue = {Bethesda, MD}, eventdate = {2006-04-22}, year = {2006}, url = {http://www.siam.org/meetings/sdm06/workproceed/Link Analysis/21Tamara_Kolda_SIAMLACS.pdf}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#Ko05 older version}
| |||||

BibTeX:
@article{Ko05, author = {Tamara G. Kolda}, title = {Revisiting Asynchronous Parallel Pattern Search for Nonlinear Optimization}, journal = {SIAM Journal on Optimization}, volume = {16}, number = {2}, pages = {563--586}, month = {December}, year = {2005}, doi = {10.1137/040603589}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2005-6864
Broyden's method replaces the Jacobian with an approximation, allowing codes that cannot evaluate a Jacobian or have an inaccurate Jacobian to converge to a solution. Limited-memory methods, which have been successful in optimization, allow us to extend this approach to large-scale problems. We compare the robustness and efficiency of Newton's method, modified Newton's method, Jacobian-free Newton-Krylov method, and our limited-memory Broyden method. Comparisons are carried out for large-scale applications of fluid flow simulations and electronic circuit simulations. Results show that, in cases where the Jacobian was inaccurate or could not be computed, Broyden's method converged in some cases where Newton's method failed to converge. We identify conditions where Broyden's method can be more efficient than Newton's method. We also present modifications to a large-scale tensor method, originally proposed by Bouaricha, for greater efficiency, better robustness, and wider applicability. Tensor methods are an alternative to Newton-based methods and are based on computing a step based on a local quadratic model rather than a linear model. The advantage of Bouaricha's method is that it can use any existing linear solver, which makes it simple to write and easily portable. However, the method usually takes twice as long to solve as Newton-GMRES on general problems because it solves two linear systems at each iteration. In this paper, we discuss modifications to Bouaricha's method for a practical implementation, including a special globalization technique and other modifications for greater efficiency. We present numerical results showing computational advantages over Newton-GMRES on some realistic problems. We further discuss a new approach for dealing with singular (or ill-conditioned) matrices. In particular, we modify an algorithm for identifying a turning point so that an increasingly ill-conditioned Jacobian does not prevent convergence. | |||||

BibTeX:
@techreport{SAND2005-6864, author = {Brett W. Bader and Roger P. Pawlowski and Tamara G. Kolda}, title = {Robust Large-scale Parallel Nonlinear Solvers for Simulations}, number = {SAND2005-6864}, institution = {Sandia National Laboratories}, month = {November}, year = {2005}, doi = {10.2172/876345}, url = {http://www.osti.gov/scitech/biblio/876345}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#KoBaKe05 older version}
| |||||

BibTeX:
@inproceedings{KoBaKe05, author = {Tamara G. Kolda and Brett W. Bader and Joseph P. Kenny}, title = {Higher-Order Web Link Analysis Using Multilinear Algebra}, booktitle = {ICDM 2005: Proceedings of the 5th IEEE International Conference on Data Mining}, venue = {Houston, TX}, eventdate = {2005-11-27/2005-11-30}, pages = {242--249}, year = {2005}, doi = {10.1109/ICDM.2005.77}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#HeBaHoHo05 older version}
Trilinos uses a two-level software structure designed around collections of packages. A Trilinos package is an integral unit usually developed by a small team of experts in a particular algorithms area such as algebraic preconditioners, nonlinear solvers, etc. Packages exist underneath the Trilinos top level, which provides a common look-and-feel, including configuration, documentation, licensing, and bug-tracking. Here we present the overall Trilinos design, describing our use of abstract interfaces and default concrete implementations. We discuss the services that Trilinos provides to a prospective package and how these services are used by various packages. We also illustrate how packages can be combined to rapidly develop new algorithms. Finally, we discuss how Trilinos facilitates highquality software engineering practices that are increasingly required from simulation software. © 2005 ACM. | |||||

BibTeX:
@article{HeBaHoHo05, author = {Michael A. Heroux and Roscoe A. Bartlett and Vicki E. Howle and Robert J. Hoekstra and Jonathan J. Hu and Tamara G. Kolda and Richard B. Lehoucq and Kevin R. Long and Roger P. Pawlowski and Eric T. Phipps and Andrew G. Salinger and Heidi K. Thornquist and Ray S. Tuminaro and James M. Willenbring and Alan Williams and Kendall S. Stanley}, title = {An Overview of the {Trilinos} Project}, journal = {ACM Transactions on Mathematical Software}, volume = {31}, number = {3}, pages = {397--423}, month = {September}, year = {2005}, doi = {10.1145/1089014.1089021}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2005-4548 newer version}
| |||||

BibTeX:
@techreport{SAND2005-4548, author = {Tamara G. Kolda and Brett W. Bader and Joseph P. Kenny}, title = {Higher-Order Web Link Analysis Using Multilinear Algebra}, number = {SAND2005-4548}, institution = {Sandia National Laboratories}, month = {July}, year = {2005}, doi = {10.2172/974401}, url = {http://www.osti.gov/scitech/biblio/974401}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2005-6648
| |||||

BibTeX:
@techreport{SAND2005-6648, author = {T. Kolda and others}, title = {Data Sciences Technology for Homeland Security Information Management and Knowledge Discovery: DHS Workshop on Data Sciences}, venue = {Alexandria, VA}, eventdate = {2004-09-22/2004-09-23}, number = {SAND2005-6648}, institution = {Sandia National Laboratories}, month = {January}, year = {2005}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#Complexities-2005 | |||||

BibTeX:
@incollection{Complexities-2005, author = {Tamara G. Kolda}, title = {An Unexpected Turn}, booktitle = {Complexities: Women in Mathematics}, editor = {Bettye Anne Case and Anne M. Leggett}, publisher = {Princeton University Press}, pages = {388--390}, month = {January}, year = {2005}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2004-6391 newer version}
| |||||

BibTeX:
@techreport{SAND2004-6391, author = {Genetha A. Gray and Tamara G. Kolda}, title = {{APPSPACK 4.0}: Asynchronous Parallel Pattern Search for Derivative-free Optimization}, number = {SAND2004-6391}, institution = {Sandia National Laboratories}, month = {December}, year = {2004}, doi = {10.2172/974891}, url = {http://www.osti.gov/scitech/biblio/974891}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2004-5187 newer version}
| |||||

BibTeX:
@techreport{SAND2004-5187, author = {Brett W. Bader and Tamara G. Kolda}, title = {{MATLAB} Tensor Classes for Fast Algorithm Prototyping}, number = {SAND2004-5187}, institution = {Sandia National Laboratories}, month = {October}, year = {2004}, doi = {10.2172/974890}, url = {http://www.osti.gov/scitech/biblio/974890}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#GrKoSaYo04 older version}
| |||||

BibTeX:
@article{GrKoSaYo04, author = {Genetha Anne Gray and Tamara G. Kolda and Kenneth L. Sale and Malin M. Young}, title = {Optimizing an Empirical Scoring Function for Transmembrane Protein Structure Determination}, journal = {INFORMS Journal on Computing}, issuetitle = {Special Issue on Computational Molecular Biology/Bioinformatics}, volume = {16}, number = {4}, pages = {406--418}, year = {2004}, doi = {10.1287/ijoc.1040.0102}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2004-3487 newer version}
| |||||

BibTeX:
@techreport{SAND2004-3487, author = {Brett W. Bader and Tamara G. Kolda}, title = {A Preliminary Report on the Development of {MATLAB} Tensor Classes for Fast Algorithm Prototyping}, number = {SAND2004-3487}, institution = {Sandia National Laboratories}, month = {July}, year = {2004}, doi = {10.2172/974887}, url = {http://www.osti.gov/scitech/biblio/974887}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#ChJoPeKo04
Reprinted with permission from Michael L. Chiesa et al., Parallel Optimization of Forging Processes for Optimal Material Properties, in Conference Proceeding 712, pp. 2080--2084 (2004). Copyright 2004, American Institute of Physics. This article may be downloaded for personal use only. Any other use requires prior permission of the author and the American Institute of Physics. | |||||

BibTeX:
@inproceedings{ChJoPeKo04, author = {Michael L. Chiesa and Reese E. Jones and Kenneth J. Perano and Tamara G. Kolda}, title = {Parallel Optimization of Forging Processes for Optimal Material Properties}, booktitle = {NUMIFORM 2004: Proceedings of the 8th International Conference on Numerical Methods in Industrial Forming Processes}, venue = {Columbus, Ohio}, eventdate = {2004-06-13/2004-06-17}, series = {AIP Conference Proceedings}, volume = {712}, pages = {2080-2084}, year = {2004}, doi = {10.1063/1.1766841}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SIAM-News-June-2004 | |||||

BibTeX:
@article{SIAM-News-June-2004, author = {Tamara G. Kolda}, title = {On the Threshold of a New Era for Parallel Computing}, journal = {SIAM News}, volume = {37}, number = {5}, month = {June}, year = {2004}, url = {http://www.siam.org/siamnews/06-04/parallel.htm}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#KoTo04 older version}
© 2004 Society for Industrial and Applied Mathematics | |||||

BibTeX:
@article{KoTo04, author = {Tamara G. Kolda and Virginia Torczon}, title = {On the Convergence of Asynchronous Parallel Pattern Search}, journal = {SIAM Journal on Optimization}, volume = {14}, number = {4}, pages = {939--964}, month = {May}, year = {2004}, doi = {10.1137/S1052623401398107}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2004-8055 newer version}
| |||||

BibTeX:
@techreport{SAND2004-8055, author = {Tamara G. Kolda}, title = {Revisiting Asynchronous Parallel Pattern Search for Nonlinear Optimization}, number = {SAND2004-8055}, institution = {Sandia National Laboratories}, month = {February}, year = {2004}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2003-8550 newer version}
| |||||

BibTeX:
@techreport{SAND2003-8550, author = {Tamara G. Kolda and Robert Michael Lewis and Virginia Torczon}, title = {Stationarity Results for Generating Set Search for Linearly Constrained Optimization}, number = {SAND2003-8550}, institution = {Sandia National Laboratories}, month = {October}, year = {2003}, doi = {10.2172/918255}, url = {http://www.osti.gov/scitech/biblio/918255}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2003-8516 newer version}
| |||||

BibTeX:
@techreport{SAND2003-8516, author = {Genetha Anne Gray and Tamara G. Kolda and Kenneth L. Sale and Malin M. Young}, title = {Optimizing an Empirical Scoring Function for Transmembrane Protein Structure Determination}, number = {SAND2003-8516}, institution = {Sandia National Laboratories}, month = {September}, year = {2003}, doi = {10.2172/918349}, url = {http://www.osti.gov/scitech/biblio/918349}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#KoLeTo03
This review begins by briefly summarizing the history of direct search methods and considering the special properties of problems for which they are well suited. Our focus then turns to a broad class of methods for which we provide a unifying framework that lends itself to a variety of convergence results. The underlying principles allow generalization to handle bound constraints and linear constraints. We also discuss extensions to problems with nonlinear constraints.
© 2003 Society for Industrial and Applied Mathematics | |||||

BibTeX:
@article{KoLeTo03, author = {Tamara G. Kolda and Robert Michael Lewis and Virginia Torczon}, title = {Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods}, journal = {SIAM Review}, volume = {45}, number = {3}, pages = {385--482}, month = {August}, year = {2003}, doi = {10.1137/S003614450242889}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2003-2927 newer version}
| |||||

BibTeX:
@techreport{SAND2003-2927, author = {Michael Heroux and Roscoe Bartlett and Vicki Howle and Robert Hoekstra and Jonathan Hu and Tamara Kolda and Richard Lehoucq and Kevin Long and Roger Pawlowski and Eric Phipps and Andrew Salinger and Heidi Thornquist and Ray Tuminaro and James Willenbring and Alan Williams}, title = {An overview of {T}rilinos}, number = {SAND2003-2927}, institution = {Sandia National Laboratories}, month = {August}, year = {2003}, doi = {10.2172/918383}, url = {http://www.osti.gov/scitech/biblio/918383}, urldate = {2014-04-17}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#Ko03
© 2003 Society for Industrial and Applied Mathematics | |||||

BibTeX:
@article{Ko03, author = {Tamara G. Kolda}, title = {A Counterexample to the Possibility of an Extension of the {Eckart-Young} Low-rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition}, journal = {SIAM Journal on Matrix Analysis and Applications}, volume = {24}, number = {3}, pages = {762--767}, month = {January}, year = {2003}, doi = {10.1137/S0895479801394465}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#KoTo03 older version}
| |||||

BibTeX:
@incollection{KoTo03, author = {Tamara G. Kolda and Virginia Torczon}, title = {Understanding Asynchronous Parallel Pattern Search}, booktitle = {High Performance Algorithms and Software for Nonlinear Optimization}, editor = {G. Di Pillo and A. Murli}, series = {Appiled Optimization}, volume = {82}, publisher = {Springer US}, pages = {323-342}, year = {2003}, doi = {10.1007/978-1-4613-0241-4_15}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2001-8696 newer version}
| |||||

BibTeX:
@techreport{SAND2001-8696, author = {Tamara G. Kolda and Virginia Torczon}, title = {On the Convergence of Asynchronous Parallel Pattern Search}, number = {SAND2001-8696}, institution = {Sandia National Laboratories}, month = {February}, year = {2002}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#CoBeLeCh01
| |||||

BibTeX:
@inproceedings{CoBeLeCh01, author = {J. M. Conroy and R. L. Becker, Jr. and W. Lefkowitz and K. L. Christopher and R. B. Surana and T. O'Leary and D. P. O'Leary and T. G. Kolda}, title = {Hidden {Markov} Models for Chromosome Identification}, booktitle = {CBMS 2001: Proceedings of the 14th IEEE Symposium on Computer-Based Medical Systems}, venue = {Bethesda, MD}, eventdate = {2001-07-26/2001-07-27}, year = {2001}, doi = {10.1109/CBMS.2001.941764}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#Ko01
© 2001 Society for Industrial and Applied Mathematics | |||||

BibTeX:
@article{Ko01, author = {Tamara G. Kolda}, title = {Orthogonal Tensor Decompositions}, journal = {SIAM Journal on Matrix Analysis and Applications}, volume = {23}, number = {1}, pages = {243--255}, month = {July}, year = {2001}, doi = {10.1137/S0895479800368354}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#HoKoTo01 older version}
© 2001 Society for Industrial and Applied Mathematics | |||||

BibTeX:
@article{HoKoTo01, author = {Patricia D. Hough and Tamara G. Kolda and Virginia J. Torczon}, title = {Asynchronous Parallel Pattern Search for Nonlinear Optimization}, journal = {SIAM Journal on Scientific Computing}, volume = {23}, number = {1}, pages = {134--156}, month = {June}, year = {2001}, doi = {10.1137/S1064827599365823}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2001-8695 newer version}
| |||||

BibTeX:
@techreport{SAND2001-8695, author = {Tamara G. Kolda and Virginia Torczon}, title = {Understanding Asynchronous Parallel Pattern Search}, institution = {Sandia National Laboratories}, month = {February}, year = {2001}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#CoKoOlOl00
© 2000 The United States and Canadian Academy of Pathology, Inc. | |||||

BibTeX:
@article{CoKoOlOl00, author = {John M. Conroy and Tamara G. Kolda and Dianne P. O'Leary and Timothy J. O'Leary}, title = {Chromosome Identification Using Hidden {Markov} Models: Comparison with Neural Networks, Singular Value Decomposition, Principal Components Analysis, and {Fisher} Discriminant Analysis}, journal = {Laboratory Investigation}, volume = {80}, number = {11}, pages = {1629--1641}, month = {November}, year = {2000}, doi = {10.1038/labinvest.3780173}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#HeKo00
Copyright © Elsevier Science B.V. All rights reserved. | |||||

BibTeX:
@article{HeKo00, author = {Bruce Hendrickson and Tamara G. Kolda}, title = {Graph Partitioning Models for Parallel Computing}, journal = {Parallel Computing}, volume = {26}, number = {12}, pages = {1519--1534}, month = {November}, year = {2000}, doi = {10.1016/S0167-8191(00)00048-X}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#KoOl00 older version}
| |||||

BibTeX:
@article{KoOl00, author = {Tamara G. Kolda and Dianne P. O'Leary}, title = {Algorithm 805: Computation and Uses of the Semidiscrete Matrix Decomposition}, journal = {ACM Transactions on Mathematical Software}, volume = {26}, number = {3}, pages = {415--435}, month = {September}, year = {2000}, doi = {10.1145/358407.358424}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2000-8843
| |||||

BibTeX:
@techreport{SAND2000-8843, author = {P. D. Hough and T. G. Kolda and H. A. Patrick}, title = {Usage Manual for {APPSPACK} 2.0}, number = {SAND2000-8843}, institution = {Sandia National Laboratories}, year = {2000}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#HeKo00a older version}
© 2000 Society for Industrial and Applied Mathematics | |||||

BibTeX:
@article{HeKo00a, author = {Bruce Hendrickson and Tamara G. Kolda}, title = {Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing}, journal = {SIAM Journal on Scientific Computing}, volume = {21}, number = {6}, pages = {2048--2072}, month = {May}, year = {2000}, doi = {10.1137/S1064827598341475}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SAND2000-8213 newer version}
| |||||

BibTeX:
@techreport{SAND2000-8213, author = {Patricia D. Hough and Tamara G. Kolda and Virginia J. Torczon}, title = {Asynchronous Parallel Pattern Search for Nonlinear Optimization}, journal = {SIAM Journal on Optimization}, volume = {23}, number = {SAND2000-8213}, institution = {Sandia National Laboratories}, pages = {134--156}, month = {January}, year = {2000}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#ORNL-TM-13766 newer version}
| |||||

BibTeX:
@techreport{ORNL-TM-13766, author = {Tamara G. Kolda and Dianne P. O'Leary}, title = {Computation and Uses of the Semidiscrete Matrix Decomposition}, number = {ORNL-TM-13766}, institution = {Oak Ridge National Laboratory}, month = {April}, year = {1999}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#ORNL-TM-13756
| |||||

BibTeX:
@techreport{ORNL-TM-13756, author = {Erica Chisholm and Tamara G. Kolda}, title = {New Term Weighting Formulas for the Vector Space Method in Information Retrieval}, number = {ORNL-TM-13756}, institution = {Oak Ridge National Laboratory}, month = {March}, year = {1999}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#KoOl99 older version}
| |||||

BibTeX:
@incollection{KoOl99, author = {Tamara G. Kolda and Dianne P. O'Leary}, title = {Latent Semantic Indexing Via a Semi-discrete Matrix Decomposition}, booktitle = {The Mathematics of Information Coding, Extraction and Distribution}, editor = {G. Cybenko and Dianne P. O'Leary and Jorma Rissanen}, series = {IMA Volumes in Mathematics and Its Applications}, volume = {107}, publisher = {Springer New York}, pages = {73--80}, year = {1999}, doi = {10.1007/978-1-4612-1524-0_5}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#KoOlNa98 older version}
© 1998 Society for Industrial and Applied Mathematics | |||||

BibTeX:
@article{KoOlNa98, author = {Tamara G. Kolda and Dianne P. O'Leary and Larry Nazareth}, title = {{BFGS} with Update Skipping and Varying Memory}, journal = {SIAM Journal on Optimization}, volume = {8}, number = {4}, pages = {1060--1083}, month = {November}, year = {1998}, doi = {10.1137/S1052623496306450}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#KoOl98 older version}
© 1998 ACM. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Information Systems (TOIS), Volume 16, Issue 4 (October 1998), http://doi.acm.org/10.1145/291128.291131. | |||||

BibTeX:
@article{KoOl98, author = {Tamara G. Kolda and Dianne P. O'Leary}, title = {A Semidiscrete Matrix Decomposition for Latent Semantic Indexing Information Retrieval}, journal = {ACM Transactions on Information Systems}, volume = {16}, number = {4}, pages = {322--346}, month = {October}, year = {1998}, doi = {10.1145/291128.291131}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#ORNL-TM-13657 newer version}
| |||||

BibTeX:
@techreport{ORNL-TM-13657, author = {Bruce Hendrickson and Tamara G. Kolda}, title = {Graph Partitioning Models for Parallel Computing}, number = {ORNL-TM-13657}, institution = {Oak Ridge National Laboratory}, month = {September}, year = {1998}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#Ko98
| |||||

BibTeX:
@inproceedings{Ko98, author = {Tamara G. Kolda}, title = {Partitioning Sparse Rectangular Matrices for Parallel Processing}, booktitle = {Solving Irregularly Structured Problems in Parallel}, eventtitle = {5th International Symposium, IRREGULAR'98}, venue = {Berkeley, CA}, eventdate = {1998-08-09/1998-08-11}, editor = {A. Ferreira and others}, series = {Lecture Notes in Computer Science}, volume = {1457}, number = {1457}, publisher = {Springer Berlin Heidelberg}, pages = {68-79}, year = {1998}, doi = {10.1007/BFb0018528}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#HeKo98
| |||||

BibTeX:
@inproceedings{HeKo98, author = {Bruce Hendrickson and Tamara G. Kolda}, title = {Partitioning Sparse Rectangular Matrices for Parallel Computations of $Ax$ and $A^Tv$}, booktitle = {Applied Parallel Computing Large Scale Scientific and Industrial Problems}, eventtitle = {4th International Workshop, PARA'98}, venue = {Ume\r{a}, Sweden}, eventdate = {1998-06-14/1998-06-17}, editor = {B. K\r{a}gstr\"{o}m and others}, series = {Lecture Notes in Computer Science}, volume = {1541}, number = {1541}, publisher = {Springer Berlin Heidelberg}, pages = {239-247}, year = {1998}, doi = {10.1007/BFb0095342}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#UMCP-CS-TR-3806
We introduce a general algebraic form for the matrix update in limited-memory quasi-Newton methods. Many well-known methods such as limited-memory Broyden Family methods satisfy the general form. We are able to prove several results about methods which satisfy the general form. In particular, we show that the only limited-memory Broyden Family method (using exact line searches) that is guaranteed to terminate within n iterations on an n-dimensional strictly convex quadratic is the limited-memory BFGS method. Furthermore, we are able to introduce several new variations on the limited-memory BFGS method that retain the quadratic termination property. We also have a new result that shows that full-memory Broyden Family methods (using exact line searches) that skip p updates to the quasi-Newton matrix will terminate in no more than n+p steps on an n-dimensional strictly convex quadratic. We propose several new variations on the limited-memory BFGS method and test these on standard test problems. We also introduce and test a new method for a process known as Latent Semantic Indexing (LSI) for information retrieval. The new method replaces the singular value matrix decomposition (SVD) at the heart of LSI with a semi-discrete matrix decomposition (SDD). We show several convergence results for the SDD and compare some strategies for computing it on general matrices. We also compare the SVD-based LSI to the SDD-based LSI and show that the SDD-based method has a faster query computation time and requires significantly less storage. We also propose and test several SDD-updating strategies for adding new documents to the collection.
| |||||

BibTeX:
@phdthesis{UMCP-CS-TR-3806, author = {Tamara G. Kolda}, title = {Limited-Memory Matrix Methods with Applications}, school = {Applied Mathematics Program, University of Maryland, College Park}, year = {1997}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#UMCP-CS-TR-3724 newer version}
| |||||

BibTeX:
@techreport{UMCP-CS-TR-3724, author = {Tamara G. Kolda and Dianne P. O'Leary}, title = {A Semidiscrete Matrix Decomposition for Latent Semantic Indexing Information Retrieval}, number = {UMCP-CS-TR-3724}, institution = {University of Maryland Department of Computer Science, College Park, MD}, month = {December}, year = {1996}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#UMCP-CS-TR-3713 newer version}
| |||||

BibTeX:
@techreport{UMCP-CS-TR-3713, author = {Tamara G. Kolda and Dianne P. O'Leary}, title = {Latent Semantic Indexing via a Semi-discrete Matrix Decomposition}, number = {UMCP-CS-TR-3713}, institution = {University of Maryland Department of Computer Science, College Park, MD}, month = {November}, year = {1996}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#UMCP-CS-TR-3663 newer version}
| |||||

BibTeX:
@techreport{UMCP-CS-TR-3663, author = {Tamara G. Kolda and Dianne P. O'Leary and Larry Nazareth}, title = {{BFGS} with Update Skipping and Varying Memory}, number = {UMCP-CS-TR-3663}, institution = {University of Maryland Department of Computer Science, College Park, MD}, month = {July}, year = {1996}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#CRSC-TR96-7 | |||||

BibTeX:
@techreport{CRSC-TR96-7, author = {Tamara L. {Gibson (nee Kolda)} and Jennifer Hill and Christina Juergens and Sridar Pootheri and Laura Potter and Shirley Stolarski}, title = {Matching Permuted Variables in Two or More Data Sets}, number = {CRSC-TR96-7}, institution = {Center for Research in Scientific Computation, North Carolina State University}, year = {1996}, } |
|||||

http://www.sandia.gov/~tgkolda/ref#SRC-TR-94-192
| |||||

BibTeX:
@techreport{SRC-TR-94-192, author = {Tamara L. {Gibson (nee Kolda)}}, title = {The {NAS} Parallel Conjugate Gradient Benchmark on the {Cray} {T3D}}, number = {SRC-TR-94-192}, institution = {Supercomputing Research Center, Bowie, MD}, year = {1994}, } |

Created by JabRef on 22/04/2014.