Computing the Largest Entries in a Matrix Product via Sampling.
Abstract
Abstract not provided.
 Authors:
 Publication Date:
 Research Org.:
 Sandia National Lab. (SNLCA), Livermore, CA (United States)
 Sponsoring Org.:
 Defense Advanced Research Projects Agency (DARPA)
 OSTI Identifier:
 1238218
 Report Number(s):
 SAND20150782C
562643
 DOE Contract Number:
 AC0494AL85000
 Resource Type:
 Conference
 Resource Relation:
 Conference: Proposed for presentation at the Workshop on Optimization and Matrix Methods in Big Data held February 911, 2015 in Toronto, Canada.
 Country of Publication:
 United States
 Language:
 English
Citation Formats
Kolda, Tamara G., Ballard, Grey Malone, Pinar, Ali, and Comandur, Seshadhri. Computing the Largest Entries in a Matrix Product via Sampling.. United States: N. p., 2015.
Web.
Kolda, Tamara G., Ballard, Grey Malone, Pinar, Ali, & Comandur, Seshadhri. Computing the Largest Entries in a Matrix Product via Sampling.. United States.
Kolda, Tamara G., Ballard, Grey Malone, Pinar, Ali, and Comandur, Seshadhri. 2015.
"Computing the Largest Entries in a Matrix Product via Sampling.". United States.
doi:. https://www.osti.gov/servlets/purl/1238218.
@article{osti_1238218,
title = {Computing the Largest Entries in a Matrix Product via Sampling.},
author = {Kolda, Tamara G. and Ballard, Grey Malone and Pinar, Ali and Comandur, Seshadhri},
abstractNote = {Abstract not provided.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = 2015,
month = 2
}
Other availability
Please see Document Availability for additional information on obtaining the fulltext document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.

Highly parallel computing of linear equations on the matrixbroadcastmemory connected array processor system
The authors describe an efficient method for computing a set of n linear simultaneous equations in o(n) time, on the proposed array processor system. The proposed system is composed of a large number of microprocessors and its layout is p*q square. The microprocessors (hereafter called processing elements, or PEs) are connected to the row and columnwise broadcast memories. 2 references. 
A sparse matrix iterative method for efficiently computing multiple simultaneous solutions
The authors consider the solution of large sparse complex symmetric indefinite systems of equations where multiple solutions are required. This type of problem occurs in calculating monostatic radar cross sections in electromagnetic scattering using the finite element method. The Quasi Minimum Residual (QMR) method, ideally suited for these matrices, is generalized using the block Lanozos algorithm to solve blocks of solutions simultaneously. The algorithm is presented and a natural convergence criterion is proposed which is shown to be as effective as the usual equation residual in monitoring convergence. 
Computing the Smith normal form of a matrix. [Computer greatest common divisor of n polynomials]
The reduction of a matrix to a normal form enables one to study the matrix in its simplest and most convenient shape and to relate the theory of matrices to scientific applications more readily. This paper presents an algorithm for computing symbolically the Smith normal form of a matrix. Besides some introductory basic comments and the above algorithm, a method for computing the greatest common divisor of n polynomials in pairwise fashion is also set forth. (RWR) 
Applications and comparisons of methods of computing the S Matrix of 2ports
We report on the application of three different methods of computing the S Matrix for 2port microwave circuits. The four methods are modal expansions with field matching across boundaries, time domain integration of Maxwell`s equations as implemented in MAFIA, HFSS (high frequency structure simulator), and the KKY frequency domain method. Among the applications to be described are steps in rectangular waveguides and irises in waveguides.